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

About the Execution of ITS-Tools for ShieldIIPs-PT-040B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2601.911 3600000.00 4325933.00 8202.00 F?T?????T?F??T?T 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.r356-tall-171683760400140.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldIIPs-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760400140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 675K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716910528076

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 15:35:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 15:35:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:35:29] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2024-05-28 15:35:29] [INFO ] Transformed 2403 places.
[2024-05-28 15:35:29] [INFO ] Transformed 2363 transitions.
[2024-05-28 15:35:29] [INFO ] Found NUPN structural information;
[2024-05-28 15:35:29] [INFO ] Parsed PT model containing 2403 places and 2363 transitions and 7126 arcs in 381 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-040B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 2403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2403/2403 places, 2363/2363 transitions.
Discarding 270 places :
Symmetric choice reduction at 0 with 270 rule applications. Total rules 270 place count 2133 transition count 2093
Iterating global reduction 0 with 270 rules applied. Total rules applied 540 place count 2133 transition count 2093
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 541 place count 2132 transition count 2092
Iterating global reduction 0 with 1 rules applied. Total rules applied 542 place count 2132 transition count 2092
Applied a total of 542 rules in 788 ms. Remains 2132 /2403 variables (removed 271) and now considering 2092/2363 (removed 271) transitions.
// Phase 1: matrix 2092 rows 2132 cols
[2024-05-28 15:35:30] [INFO ] Computed 361 invariants in 32 ms
[2024-05-28 15:35:31] [INFO ] Implicit Places using invariants in 901 ms returned []
[2024-05-28 15:35:31] [INFO ] Invariant cache hit.
[2024-05-28 15:35:33] [INFO ] Implicit Places using invariants and state equation in 1975 ms returned []
Implicit Place search using SMT with State Equation took 2908 ms to find 0 implicit places.
Running 2091 sub problems to find dead transitions.
[2024-05-28 15:35:33] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2131/4224 variables, and 0 constraints, problems are : Problem set: 0 solved, 2091 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2132 constraints, PredecessorRefiner: 2091/2091 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2091 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 2131/4224 variables, and 0 constraints, problems are : Problem set: 0 solved, 2091 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2132 constraints, PredecessorRefiner: 0/2091 constraints, Known Traps: 0/0 constraints]
After SMT, in 60879ms problems are : Problem set: 0 solved, 2091 unsolved
Search for dead transitions found 0 dead transitions in 60944ms
Starting structural reductions in LTL mode, iteration 1 : 2132/2403 places, 2092/2363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64677 ms. Remains : 2132/2403 places, 2092/2363 transitions.
Support contains 50 out of 2132 places after structural reductions.
[2024-05-28 15:36:34] [INFO ] Flatten gal took : 183 ms
[2024-05-28 15:36:35] [INFO ] Flatten gal took : 109 ms
[2024-05-28 15:36:35] [INFO ] Input system was already deterministic with 2092 transitions.
Support contains 48 out of 2132 places (down from 50) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2754 ms. (14 steps per ms) remains 10/31 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
[2024-05-28 15:36:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1302/1323 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1323 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 809/2132 variables, 141/361 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2132 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2092/4224 variables, 2132/2493 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4224 variables, 0/2493 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/4224 variables, 0/2493 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4224/4224 variables, and 2493 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2987 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 2132/2132 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 1302/1323 variables, 220/220 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-28 15:36:40] [INFO ] Deduced a trap composed of 43 places in 282 ms of which 47 ms to minimize.
[2024-05-28 15:36:40] [INFO ] Deduced a trap composed of 36 places in 227 ms of which 16 ms to minimize.
[2024-05-28 15:36:40] [INFO ] Deduced a trap composed of 42 places in 307 ms of which 20 ms to minimize.
[2024-05-28 15:36:40] [INFO ] Deduced a trap composed of 44 places in 201 ms of which 3 ms to minimize.
[2024-05-28 15:36:41] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 3 ms to minimize.
[2024-05-28 15:36:41] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 3 ms to minimize.
[2024-05-28 15:36:41] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 4 ms to minimize.
[2024-05-28 15:36:41] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2024-05-28 15:36:41] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 2 ms to minimize.
[2024-05-28 15:36:41] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:36:41] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 3 ms to minimize.
[2024-05-28 15:36:41] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1323 variables, 12/232 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1323 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 809/2132 variables, 141/373 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-28 15:36:42] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:36:42] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:36:42] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:36:42] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2132 variables, 4/377 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2132 variables, 0/377 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2092/4224 variables, 2132/2509 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4224 variables, 9/2518 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-28 15:36:44] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 5 ms to minimize.
[2024-05-28 15:36:44] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 5 ms to minimize.
SMT process timed out in 8085ms, After SMT, problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 2132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 2132 transition count 1896
Reduce places removed 196 places and 0 transitions.
Iterating post reduction 1 with 196 rules applied. Total rules applied 392 place count 1936 transition count 1896
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 392 place count 1936 transition count 1695
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 794 place count 1735 transition count 1695
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 804 place count 1725 transition count 1685
Iterating global reduction 2 with 10 rules applied. Total rules applied 814 place count 1725 transition count 1685
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 814 place count 1725 transition count 1679
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 826 place count 1719 transition count 1679
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 8 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 2 with 1420 rules applied. Total rules applied 2246 place count 1009 transition count 969
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 272 times.
Drop transitions (Partial Free agglomeration) removed 272 transitions
Iterating global reduction 2 with 272 rules applied. Total rules applied 2518 place count 1009 transition count 969
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2519 place count 1008 transition count 968
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2520 place count 1007 transition count 968
Applied a total of 2520 rules in 703 ms. Remains 1007 /2132 variables (removed 1125) and now considering 968/2092 (removed 1124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 704 ms. Remains : 1007/2132 places, 968/2092 transitions.
RANDOM walk for 39015 steps (8 resets) in 786 ms. (49 steps per ms) remains 0/9 properties
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA ShieldIIPs-PT-040B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 489 stabilizing places and 489 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' '!(G((F((p0||G(p1)))&&X(G((p2&&X((p2 U (p3||G(p2))))))))))'
Support contains 4 out of 2132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2122 transition count 2082
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2122 transition count 2082
Applied a total of 20 rules in 131 ms. Remains 2122 /2132 variables (removed 10) and now considering 2082/2092 (removed 10) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2024-05-28 15:36:46] [INFO ] Computed 361 invariants in 17 ms
[2024-05-28 15:36:47] [INFO ] Implicit Places using invariants in 809 ms returned []
[2024-05-28 15:36:47] [INFO ] Invariant cache hit.
[2024-05-28 15:36:49] [INFO ] Implicit Places using invariants and state equation in 1990 ms returned []
Implicit Place search using SMT with State Equation took 2801 ms to find 0 implicit places.
Running 2081 sub problems to find dead transitions.
[2024-05-28 15:36:49] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2081/2081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2081 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 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2081 constraints, Known Traps: 0/0 constraints]
After SMT, in 60726ms problems are : Problem set: 0 solved, 2081 unsolved
Search for dead transitions found 0 dead transitions in 60745ms
Starting structural reductions in LTL mode, iteration 1 : 2122/2132 places, 2082/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63689 ms. Remains : 2122/2132 places, 2082/2092 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), true]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-00
Product exploration explored 100000 steps with 33316 reset in 468 ms.
Product exploration explored 100000 steps with 33149 reset in 461 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2122 stabilizing places and 479/2082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 155 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (8 resets) in 528 ms. (75 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 4/4 properties
[2024-05-28 15:37:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 767/771 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 15:37:52] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 3 ms to minimize.
[2024-05-28 15:37:52] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:37:52] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 3 ms to minimize.
[2024-05-28 15:37:52] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:37:52] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 3 ms to minimize.
[2024-05-28 15:37:52] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 2 ms to minimize.
[2024-05-28 15:37:52] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2024-05-28 15:37:52] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-28 15:37:52] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:37:53] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:37:53] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/771 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/771 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1351/2122 variables, 234/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 15:37:53] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 4 ms to minimize.
[2024-05-28 15:37:53] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 3 ms to minimize.
[2024-05-28 15:37:54] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 3 ms to minimize.
[2024-05-28 15:37:54] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 3 ms to minimize.
[2024-05-28 15:37:54] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 3 ms to minimize.
[2024-05-28 15:37:54] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 3 ms to minimize.
[2024-05-28 15:37:54] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 3 ms to minimize.
[2024-05-28 15:37:54] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 3 ms to minimize.
[2024-05-28 15:37:55] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2024-05-28 15:37:55] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 3 ms to minimize.
[2024-05-28 15:37:55] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 3 ms to minimize.
[2024-05-28 15:37:55] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:37:55] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 2 ms to minimize.
[2024-05-28 15:37:55] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 3 ms to minimize.
[2024-05-28 15:37:55] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-28 15:37:56] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 8 ms to minimize.
[2024-05-28 15:37:56] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-28 15:37:56] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2122 variables, 18/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2122 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 5023ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2122 transition count 1882
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1922 transition count 1882
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 400 place count 1922 transition count 1681
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 802 place count 1721 transition count 1681
Performed 717 Post agglomeration using F-continuation condition.Transition count delta: 717
Deduced a syphon composed of 717 places in 2 ms
Reduce places removed 717 places and 0 transitions.
Iterating global reduction 2 with 1434 rules applied. Total rules applied 2236 place count 1004 transition count 964
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 277 times.
Drop transitions (Partial Free agglomeration) removed 277 transitions
Iterating global reduction 2 with 277 rules applied. Total rules applied 2513 place count 1004 transition count 964
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2514 place count 1003 transition count 963
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2515 place count 1002 transition count 963
Applied a total of 2515 rules in 380 ms. Remains 1002 /2122 variables (removed 1120) and now considering 963/2082 (removed 1119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 1002/2122 places, 963/2082 transitions.
RANDOM walk for 40000 steps (8 resets) in 622 ms. (64 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
// Phase 1: matrix 963 rows 1002 cols
[2024-05-28 15:37:57] [INFO ] Computed 360 invariants in 43 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 351/355 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/380 variables, 9/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 367/747 variables, 380/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/747 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 16/763 variables, 6/522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 2/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/763 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 25/788 variables, 12/536 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/788 variables, 3/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/788 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/789 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/789 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/789 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/791 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/791 variables, 2/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/791 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 21/812 variables, 10/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/812 variables, 4/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 25/837 variables, 12/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/837 variables, 3/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/837 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/838 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/838 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/838 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 2/840 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/840 variables, 2/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/840 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 21/861 variables, 10/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/861 variables, 4/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/861 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 25/886 variables, 12/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/886 variables, 3/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/886 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 1/887 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/887 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/887 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 2/889 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/889 variables, 2/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/889 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 21/910 variables, 10/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/910 variables, 4/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/910 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 25/935 variables, 12/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/935 variables, 3/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/935 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 1/936 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/936 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/936 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 2/938 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/938 variables, 2/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/938 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 21/959 variables, 10/656 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/959 variables, 4/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/959 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 25/984 variables, 12/672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/984 variables, 3/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/984 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (OVERLAPS) 1/985 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/985 variables, 1/677 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/985 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (OVERLAPS) 2/987 variables, 1/678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/987 variables, 2/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/987 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 21/1008 variables, 10/690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1008 variables, 4/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1008 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (OVERLAPS) 25/1033 variables, 12/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1033 variables, 3/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1033 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (OVERLAPS) 1/1034 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1034 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1034 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (OVERLAPS) 2/1036 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1036 variables, 2/714 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1036 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 21/1057 variables, 10/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1057 variables, 4/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1057 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (OVERLAPS) 25/1082 variables, 12/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1082 variables, 3/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1082 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (OVERLAPS) 1/1083 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1083 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1083 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (OVERLAPS) 2/1085 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1085 variables, 2/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1085 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (OVERLAPS) 21/1106 variables, 10/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1106 variables, 4/762 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1106 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (OVERLAPS) 25/1131 variables, 12/774 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1131 variables, 3/777 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1131 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (OVERLAPS) 1/1132 variables, 1/778 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1132 variables, 1/779 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1132 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (OVERLAPS) 2/1134 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1134 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1134 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (OVERLAPS) 21/1155 variables, 10/792 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1155 variables, 4/796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1155 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (OVERLAPS) 25/1180 variables, 12/808 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1180 variables, 3/811 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1180 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (OVERLAPS) 1/1181 variables, 1/812 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1181 variables, 1/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1181 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (OVERLAPS) 2/1183 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1183 variables, 2/816 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1183 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (OVERLAPS) 21/1204 variables, 10/826 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1204 variables, 4/830 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1204 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (OVERLAPS) 25/1229 variables, 12/842 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1229 variables, 3/845 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1229 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (OVERLAPS) 1/1230 variables, 1/846 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1230 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1230 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (OVERLAPS) 2/1232 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1232 variables, 2/850 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1232 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (OVERLAPS) 21/1253 variables, 10/860 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1253 variables, 4/864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1253 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 130 (OVERLAPS) 25/1278 variables, 12/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1278 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1278 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 133 (OVERLAPS) 1/1279 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1279 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1279 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 136 (OVERLAPS) 2/1281 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1281 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1281 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 139 (OVERLAPS) 21/1302 variables, 10/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1302 variables, 4/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1302 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 142 (OVERLAPS) 25/1327 variables, 12/910 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1327 variables, 3/913 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1327 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 145 (OVERLAPS) 1/1328 variables, 1/914 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1328 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1328 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 148 (OVERLAPS) 2/1330 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1330 variables, 2/918 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1330 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 151 (OVERLAPS) 21/1351 variables, 10/928 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1351 variables, 4/932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1351 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 154 (OVERLAPS) 25/1376 variables, 12/944 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1376 variables, 3/947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1376 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 157 (OVERLAPS) 1/1377 variables, 1/948 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1377 variables, 1/949 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1377 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 160 (OVERLAPS) 2/1379 variables, 1/950 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1379 variables, 2/952 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1379 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 163 (OVERLAPS) 21/1400 variables, 10/962 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1400 variables, 4/966 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1400 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 166 (OVERLAPS) 25/1425 variables, 12/978 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1425 variables, 3/981 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1425 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 169 (OVERLAPS) 1/1426 variables, 1/982 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1426 variables, 1/983 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1426 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 172 (OVERLAPS) 2/1428 variables, 1/984 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1428 variables, 2/986 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1428 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 175 (OVERLAPS) 21/1449 variables, 10/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1449 variables, 4/1000 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/1449 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 178 (OVERLAPS) 25/1474 variables, 12/1012 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/1474 variables, 3/1015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1474 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 181 (OVERLAPS) 1/1475 variables, 1/1016 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/1475 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/1475 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 184 (OVERLAPS) 2/1477 variables, 1/1018 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1477 variables, 2/1020 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/1477 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 187 (OVERLAPS) 21/1498 variables, 10/1030 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/1498 variables, 4/1034 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/1498 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 190 (OVERLAPS) 25/1523 variables, 12/1046 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1523 variables, 3/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/1523 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 193 (OVERLAPS) 1/1524 variables, 1/1050 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/1524 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/1524 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 196 (OVERLAPS) 2/1526 variables, 1/1052 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1526 variables, 2/1054 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/1526 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 199 (OVERLAPS) 21/1547 variables, 10/1064 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/1547 variables, 4/1068 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/1547 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 202 (OVERLAPS) 25/1572 variables, 12/1080 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/1572 variables, 3/1083 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/1572 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 205 (OVERLAPS) 1/1573 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1573 variables, 1/1085 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 207 (INCLUDED_ONLY) 0/1573 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 208 (OVERLAPS) 2/1575 variables, 1/1086 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/1575 variables, 2/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/1575 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 211 (OVERLAPS) 21/1596 variables, 10/1098 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/1596 variables, 4/1102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/1596 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 214 (OVERLAPS) 25/1621 variables, 12/1114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 215 (INCLUDED_ONLY) 0/1621 variables, 3/1117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/1621 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 217 (OVERLAPS) 1/1622 variables, 1/1118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/1622 variables, 1/1119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 219 (INCLUDED_ONLY) 0/1622 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 220 (OVERLAPS) 2/1624 variables, 1/1120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/1624 variables, 2/1122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 222 (INCLUDED_ONLY) 0/1624 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 223 (OVERLAPS) 21/1645 variables, 10/1132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/1645 variables, 4/1136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/1645 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 226 (OVERLAPS) 25/1670 variables, 12/1148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 227 (INCLUDED_ONLY) 0/1670 variables, 3/1151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/1670 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 229 (OVERLAPS) 1/1671 variables, 1/1152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/1671 variables, 1/1153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 231 (INCLUDED_ONLY) 0/1671 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 232 (OVERLAPS) 2/1673 variables, 1/1154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/1673 variables, 2/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/1673 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 235 (OVERLAPS) 21/1694 variables, 10/1166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/1694 variables, 4/1170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/1694 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 238 (OVERLAPS) 25/1719 variables, 12/1182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 239 (INCLUDED_ONLY) 0/1719 variables, 3/1185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/1719 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 241 (OVERLAPS) 1/1720 variables, 1/1186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/1720 variables, 1/1187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 243 (INCLUDED_ONLY) 0/1720 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 244 (OVERLAPS) 2/1722 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/1722 variables, 2/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 246 (INCLUDED_ONLY) 0/1722 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 247 (OVERLAPS) 21/1743 variables, 10/1200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/1743 variables, 4/1204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/1743 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 250 (OVERLAPS) 25/1768 variables, 12/1216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 251 (INCLUDED_ONLY) 0/1768 variables, 3/1219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/1768 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 253 (OVERLAPS) 1/1769 variables, 1/1220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 254 (INCLUDED_ONLY) 0/1769 variables, 1/1221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 255 (INCLUDED_ONLY) 0/1769 variables, 0/1221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 256 (OVERLAPS) 2/1771 variables, 1/1222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/1771 variables, 2/1224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 258 (INCLUDED_ONLY) 0/1771 variables, 0/1224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 259 (OVERLAPS) 21/1792 variables, 10/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/1792 variables, 4/1238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 261 (INCLUDED_ONLY) 0/1792 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 262 (OVERLAPS) 25/1817 variables, 12/1250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 263 (INCLUDED_ONLY) 0/1817 variables, 3/1253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 264 (INCLUDED_ONLY) 0/1817 variables, 0/1253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 265 (OVERLAPS) 1/1818 variables, 1/1254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/1818 variables, 1/1255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 267 (INCLUDED_ONLY) 0/1818 variables, 0/1255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 268 (OVERLAPS) 2/1820 variables, 1/1256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/1820 variables, 2/1258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 270 (INCLUDED_ONLY) 0/1820 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 271 (OVERLAPS) 21/1841 variables, 10/1268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/1841 variables, 4/1272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 273 (INCLUDED_ONLY) 0/1841 variables, 0/1272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 274 (OVERLAPS) 25/1866 variables, 12/1284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 275 (INCLUDED_ONLY) 0/1866 variables, 3/1287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 276 (INCLUDED_ONLY) 0/1866 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 277 (OVERLAPS) 1/1867 variables, 1/1288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/1867 variables, 1/1289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 279 (INCLUDED_ONLY) 0/1867 variables, 0/1289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 280 (OVERLAPS) 2/1869 variables, 1/1290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/1869 variables, 2/1292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 282 (INCLUDED_ONLY) 0/1869 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 283 (OVERLAPS) 21/1890 variables, 10/1302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/1890 variables, 4/1306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 285 (INCLUDED_ONLY) 0/1890 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 286 (OVERLAPS) 25/1915 variables, 12/1318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 287 (INCLUDED_ONLY) 0/1915 variables, 3/1321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 288 (INCLUDED_ONLY) 0/1915 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 289 (OVERLAPS) 1/1916 variables, 1/1322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/1916 variables, 1/1323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 291 (INCLUDED_ONLY) 0/1916 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 292 (OVERLAPS) 2/1918 variables, 1/1324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/1918 variables, 2/1326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 294 (INCLUDED_ONLY) 0/1918 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 295 (OVERLAPS) 21/1939 variables, 10/1336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 296 (INCLUDED_ONLY) 0/1939 variables, 4/1340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 297 (INCLUDED_ONLY) 0/1939 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 298 (OVERLAPS) 18/1957 variables, 9/1349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 299 (INCLUDED_ONLY) 0/1957 variables, 2/1351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 300 (INCLUDED_ONLY) 0/1957 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 301 (OVERLAPS) 2/1959 variables, 1/1352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/1959 variables, 2/1354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 303 (INCLUDED_ONLY) 0/1959 variables, 0/1354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 304 (OVERLAPS) 1/1960 variables, 1/1355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/1960 variables, 1/1356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 306 (INCLUDED_ONLY) 0/1960 variables, 0/1356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 307 (OVERLAPS) 5/1965 variables, 4/1360 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 308 (INCLUDED_ONLY) 0/1965 variables, 2/1362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 309 (INCLUDED_ONLY) 0/1965 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 310 (OVERLAPS) 0/1965 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1965/1965 variables, and 1362 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4569 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1002/1002 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, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
After SMT solving in domain Int declared 355/1965 variables, and 127 constraints, problems are : Problem set: 2 solved, 0 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 127/359 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4687ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1)), (G (OR (NOT p2) p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 13 factoid took 377 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040B-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040B-LTLFireability-00 finished in 76481 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&&(!p0 U (X(p1)||G(!p0)))))))'
Support contains 3 out of 2132 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2131 transition count 1892
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1932 transition count 1892
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 398 place count 1932 transition count 1691
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 800 place count 1731 transition count 1691
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 810 place count 1721 transition count 1681
Iterating global reduction 2 with 10 rules applied. Total rules applied 820 place count 1721 transition count 1681
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 820 place count 1721 transition count 1674
Deduced a syphon composed of 7 places in 12 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 834 place count 1714 transition count 1674
Performed 708 Post agglomeration using F-continuation condition.Transition count delta: 708
Deduced a syphon composed of 708 places in 2 ms
Reduce places removed 708 places and 0 transitions.
Iterating global reduction 2 with 1416 rules applied. Total rules applied 2250 place count 1006 transition count 966
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2252 place count 1004 transition count 964
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2253 place count 1003 transition count 964
Applied a total of 2253 rules in 427 ms. Remains 1003 /2132 variables (removed 1129) and now considering 964/2092 (removed 1128) transitions.
// Phase 1: matrix 964 rows 1003 cols
[2024-05-28 15:38:03] [INFO ] Computed 360 invariants in 3 ms
[2024-05-28 15:38:03] [INFO ] Implicit Places using invariants in 500 ms returned []
[2024-05-28 15:38:03] [INFO ] Invariant cache hit.
[2024-05-28 15:38:04] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
[2024-05-28 15:38:04] [INFO ] Redundant transitions in 197 ms returned [963]
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 959 sub problems to find dead transitions.
// Phase 1: matrix 963 rows 1003 cols
[2024-05-28 15:38:04] [INFO ] Computed 360 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:38:19] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 3 ms to minimize.
[2024-05-28 15:38:19] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 4 ms to minimize.
[2024-05-28 15:38:19] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 3 ms to minimize.
[2024-05-28 15:38:19] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 3 ms to minimize.
[2024-05-28 15:38:20] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 6 ms to minimize.
[2024-05-28 15:38:20] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 4 ms to minimize.
[2024-05-28 15:38:20] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 3 ms to minimize.
[2024-05-28 15:38:20] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 3 ms to minimize.
[2024-05-28 15:38:20] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 7 ms to minimize.
[2024-05-28 15:38:21] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 3 ms to minimize.
[2024-05-28 15:38:21] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 2 ms to minimize.
[2024-05-28 15:38:21] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 3 ms to minimize.
[2024-05-28 15:38:21] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 3 ms to minimize.
[2024-05-28 15:38:21] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-05-28 15:38:21] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 3 ms to minimize.
[2024-05-28 15:38:22] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 3 ms to minimize.
[2024-05-28 15:38:22] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 6 ms to minimize.
[2024-05-28 15:38:22] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2024-05-28 15:38:22] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 2 ms to minimize.
[2024-05-28 15:38:22] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 20/370 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:38:22] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 3 ms to minimize.
[2024-05-28 15:38:22] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-05-28 15:38:23] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:38:23] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:38:23] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-05-28 15:38:23] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:38:23] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:38:23] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:38:23] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:38:23] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:38:23] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:38:24] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:38:24] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-28 15:38:24] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-05-28 15:38:24] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:38:24] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:38:24] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:38:24] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:38:24] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:38:24] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/390 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:38:24] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:38:24] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:38:24] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:38:24] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 15:38:25] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 15:38:25] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 15:38:25] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 15:38:25] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:38:25] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:38:25] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:38:25] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 15:38:26] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:38:26] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:38:26] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:38:26] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:38:26] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:38:26] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:38:27] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:38:27] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:38:27] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/410 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1966 variables, and 410 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 350/360 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 60/410 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:38:35] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 15:38:35] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 15:38:35] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 15:38:36] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:38:36] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:38:36] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:38:36] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:38:37] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:38:37] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-28 15:38:37] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:38:38] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-28 15:38:38] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2024-05-28 15:38:38] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-28 15:38:38] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-28 15:38:39] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-28 15:38:39] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-28 15:38:39] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-28 15:38:39] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-28 15:38:39] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-28 15:38:39] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/430 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:38:40] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 15:38:41] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:38:42] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:38:43] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:38:43] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 3 ms to minimize.
[2024-05-28 15:38:43] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-05-28 15:38:44] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
[2024-05-28 15:38:44] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:38:44] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-05-28 15:38:44] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:38:45] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 3 ms to minimize.
[2024-05-28 15:38:45] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 3 ms to minimize.
[2024-05-28 15:38:45] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 3 ms to minimize.
[2024-05-28 15:38:46] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:38:46] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 4 ms to minimize.
[2024-05-28 15:38:46] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 3 ms to minimize.
[2024-05-28 15:38:47] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 4 ms to minimize.
[2024-05-28 15:38:47] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 3 ms to minimize.
[2024-05-28 15:38:47] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
[2024-05-28 15:38:47] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/450 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:38:48] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:38:49] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-28 15:38:49] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:38:50] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-28 15:38:51] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
[2024-05-28 15:38:51] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:38:53] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 3 ms to minimize.
[2024-05-28 15:38:53] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 4 ms to minimize.
[2024-05-28 15:38:54] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 3 ms to minimize.
[2024-05-28 15:38:54] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 4 ms to minimize.
[2024-05-28 15:38:54] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 3 ms to minimize.
[2024-05-28 15:38:55] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 3 ms to minimize.
[2024-05-28 15:38:55] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 4 ms to minimize.
[2024-05-28 15:38:59] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:38:59] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:38:59] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 15:39:00] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 15:39:00] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 15:39:01] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:39:01] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/470 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:39:01] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:39:02] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 15:39:02] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:39:02] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:39:03] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1966 variables, and 475 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 350/360 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 125/125 constraints]
After SMT, in 60274ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60283ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/2132 places, 963/2092 transitions.
Applied a total of 0 rules in 31 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62327 ms. Remains : 1003/2132 places, 963/2092 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-01
Product exploration explored 100000 steps with 48 reset in 847 ms.
Product exploration explored 100000 steps with 48 reset in 1007 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 183 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 36 ms :[p0]
RANDOM walk for 694 steps (0 resets) in 9 ms. (69 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 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 29 ms :[p0]
Stuttering acceptance computed with spot in 44 ms :[p0]
Support contains 3 out of 1003 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 21 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2024-05-28 15:39:07] [INFO ] Invariant cache hit.
[2024-05-28 15:39:07] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-28 15:39:07] [INFO ] Invariant cache hit.
[2024-05-28 15:39:08] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
[2024-05-28 15:39:08] [INFO ] Redundant transitions in 90 ms returned []
Running 959 sub problems to find dead transitions.
[2024-05-28 15:39:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:39:23] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 4 ms to minimize.
[2024-05-28 15:39:23] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 3 ms to minimize.
[2024-05-28 15:39:23] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 3 ms to minimize.
[2024-05-28 15:39:23] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 4 ms to minimize.
[2024-05-28 15:39:24] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 3 ms to minimize.
[2024-05-28 15:39:24] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-05-28 15:39:24] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 4 ms to minimize.
[2024-05-28 15:39:24] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 3 ms to minimize.
[2024-05-28 15:39:24] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-05-28 15:39:24] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
[2024-05-28 15:39:25] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 2 ms to minimize.
[2024-05-28 15:39:25] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 2 ms to minimize.
[2024-05-28 15:39:25] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:39:25] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 3 ms to minimize.
[2024-05-28 15:39:25] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 3 ms to minimize.
[2024-05-28 15:39:25] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
[2024-05-28 15:39:26] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 3 ms to minimize.
[2024-05-28 15:39:26] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-05-28 15:39:26] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 3 ms to minimize.
[2024-05-28 15:39:26] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 20/370 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:39:26] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:39:26] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-28 15:39:26] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:39:27] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 2 ms to minimize.
[2024-05-28 15:39:27] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:39:27] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-28 15:39:27] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:39:27] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:39:27] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-28 15:39:27] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:39:27] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:39:27] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:39:27] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:39:28] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2024-05-28 15:39:28] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:39:28] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:39:28] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 2 ms to minimize.
[2024-05-28 15:39:28] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:39:28] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:39:28] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/390 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:39:28] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:39:28] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:39:28] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-28 15:39:28] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:39:28] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 15:39:28] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 15:39:29] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 15:39:29] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:39:29] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 15:39:29] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-28 15:39:29] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:39:30] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:39:30] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:39:30] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:39:30] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:39:30] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:39:30] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:39:31] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:39:31] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-28 15:39:31] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.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 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/410 constraints. Problems are: Problem set: 0 solved, 959 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/1966 variables, and 410 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 350/360 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 959/959 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 959 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 959 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1000 variables, 60/410 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:39:39] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 15:39:39] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 15:39:40] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:39:40] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 15:39:40] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:39:40] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-05-28 15:39:41] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:39:41] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:39:41] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-28 15:39:42] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-28 15:39:42] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:39:42] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:39:42] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:39:43] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-28 15:39:43] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:39:43] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-28 15:39:43] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 3 ms to minimize.
[2024-05-28 15:39:43] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-28 15:39:44] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:39:44] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1000 variables, 20/430 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:39:44] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 15:39:44] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 15:39:45] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 15:39:45] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 3 ms to minimize.
[2024-05-28 15:39:45] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:39:46] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-28 15:39:48] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:39:48] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-05-28 15:39:48] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 3 ms to minimize.
[2024-05-28 15:39:48] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-05-28 15:39:49] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 2 ms to minimize.
[2024-05-28 15:39:49] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2024-05-28 15:39:49] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-05-28 15:39:50] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 2 ms to minimize.
[2024-05-28 15:39:50] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:39:50] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 3 ms to minimize.
[2024-05-28 15:39:50] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 3 ms to minimize.
[2024-05-28 15:39:51] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-05-28 15:39:51] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 3 ms to minimize.
[2024-05-28 15:39:51] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 20/450 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:39:52] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 15:39:52] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 15:39:52] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:39:53] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:39:53] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:39:53] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:39:54] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-28 15:39:54] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-28 15:39:55] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:39:56] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
[2024-05-28 15:39:56] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 3 ms to minimize.
[2024-05-28 15:39:56] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 3 ms to minimize.
[2024-05-28 15:39:56] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 3 ms to minimize.
[2024-05-28 15:39:57] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 2 ms to minimize.
[2024-05-28 15:39:57] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:39:58] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-05-28 15:39:58] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 3 ms to minimize.
[2024-05-28 15:39:58] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 4 ms to minimize.
[2024-05-28 15:39:59] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 4 ms to minimize.
[2024-05-28 15:40:00] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 20/470 constraints. Problems are: Problem set: 0 solved, 959 unsolved
[2024-05-28 15:40:00] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 15:40:00] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 15:40:01] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:40:04] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 2 ms to minimize.
[2024-05-28 15:40:05] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 3 ms to minimize.
[2024-05-28 15:40:05] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/1966 variables, and 476 constraints, problems are : Problem set: 0 solved, 959 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 350/360 constraints, State Equation: 0/1003 constraints, PredecessorRefiner: 0/959 constraints, Known Traps: 126/126 constraints]
After SMT, in 60221ms problems are : Problem set: 0 solved, 959 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61721 ms. Remains : 1003/1003 places, 963/963 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 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 31 ms :[p0]
RANDOM walk for 572 steps (0 resets) in 11 ms. (47 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 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 29 ms :[p0]
Stuttering acceptance computed with spot in 26 ms :[p0]
Stuttering acceptance computed with spot in 47 ms :[p0]
Product exploration explored 100000 steps with 48 reset in 754 ms.
Product exploration explored 100000 steps with 48 reset in 963 ms.
Built C files in :
/tmp/ltsmin7271119353042736129
[2024-05-28 15:40:11] [INFO ] Computing symmetric may disable matrix : 963 transitions.
[2024-05-28 15:40:11] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:40:11] [INFO ] Computing symmetric may enable matrix : 963 transitions.
[2024-05-28 15:40:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:40:11] [INFO ] Computing Do-Not-Accords matrix : 963 transitions.
[2024-05-28 15:40:11] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:40:11] [INFO ] Built C files in 190ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7271119353042736129
Running compilation step : cd /tmp/ltsmin7271119353042736129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7271119353042736129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7271119353042736129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 3 out of 1003 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1001 transition count 961
Applied a total of 1 rules in 48 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-28 15:40:14] [INFO ] Computed 360 invariants in 5 ms
[2024-05-28 15:40:14] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-05-28 15:40:14] [INFO ] Invariant cache hit.
[2024-05-28 15:40:15] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1412 ms to find 0 implicit places.
[2024-05-28 15:40:15] [INFO ] Redundant transitions in 94 ms returned []
Running 958 sub problems to find dead transitions.
[2024-05-28 15:40:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 358/358 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:40:30] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 3 ms to minimize.
[2024-05-28 15:40:30] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 4 ms to minimize.
[2024-05-28 15:40:30] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 3 ms to minimize.
[2024-05-28 15:40:31] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 3 ms to minimize.
[2024-05-28 15:40:31] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 3 ms to minimize.
[2024-05-28 15:40:31] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 4 ms to minimize.
[2024-05-28 15:40:31] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 3 ms to minimize.
[2024-05-28 15:40:32] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 4 ms to minimize.
[2024-05-28 15:40:32] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 3 ms to minimize.
[2024-05-28 15:40:32] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-05-28 15:40:32] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-05-28 15:40:32] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 3 ms to minimize.
[2024-05-28 15:40:32] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 3 ms to minimize.
[2024-05-28 15:40:33] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-05-28 15:40:33] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 3 ms to minimize.
[2024-05-28 15:40:33] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-05-28 15:40:33] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-05-28 15:40:33] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:40:34] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 3 ms to minimize.
[2024-05-28 15:40:34] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 20/378 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:40:34] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 2 ms to minimize.
[2024-05-28 15:40:34] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:40:34] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2024-05-28 15:40:34] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:40:35] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-28 15:40:35] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 3 ms to minimize.
[2024-05-28 15:40:35] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 2 ms to minimize.
[2024-05-28 15:40:35] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:40:35] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
[2024-05-28 15:40:35] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-28 15:40:35] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:40:35] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-28 15:40:35] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:40:35] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:40:35] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:40:36] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:40:36] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:40:36] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:40:36] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:40:36] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/398 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:40:36] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:40:36] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-28 15:40:36] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:40:36] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:40:36] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 15:40:36] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 15:40:37] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 15:40:37] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:40:37] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:40:37] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-28 15:40:37] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:40:37] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:40:38] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:40:38] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-28 15:40:38] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:40:38] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:40:38] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:40:39] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:40:39] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-28 15:40:39] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 20/418 constraints. Problems are: Problem set: 0 solved, 958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1962 variables, and 418 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 358/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 358/358 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 60/418 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:40:46] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:40:47] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-28 15:40:48] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:40:48] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:40:48] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 5 ms to minimize.
[2024-05-28 15:40:49] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:40:49] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-05-28 15:40:49] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-05-28 15:40:49] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-05-28 15:40:50] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 3 ms to minimize.
[2024-05-28 15:40:50] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 2 ms to minimize.
[2024-05-28 15:40:50] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 2 ms to minimize.
[2024-05-28 15:40:51] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-05-28 15:40:51] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 2 ms to minimize.
[2024-05-28 15:40:51] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 2 ms to minimize.
[2024-05-28 15:40:52] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 3 ms to minimize.
[2024-05-28 15:40:52] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 3 ms to minimize.
[2024-05-28 15:40:52] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 3 ms to minimize.
[2024-05-28 15:40:52] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 3 ms to minimize.
[2024-05-28 15:40:53] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/438 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:40:53] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:40:53] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 15:40:53] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 15:40:53] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:40:54] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:40:55] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 2 ms to minimize.
[2024-05-28 15:40:56] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2024-05-28 15:40:56] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 3 ms to minimize.
[2024-05-28 15:40:57] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 3 ms to minimize.
[2024-05-28 15:40:58] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 3 ms to minimize.
[2024-05-28 15:40:58] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
[2024-05-28 15:40:58] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 3 ms to minimize.
[2024-05-28 15:40:59] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 3 ms to minimize.
[2024-05-28 15:40:59] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 3 ms to minimize.
[2024-05-28 15:40:59] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 4 ms to minimize.
[2024-05-28 15:41:00] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 4 ms to minimize.
[2024-05-28 15:41:00] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 3 ms to minimize.
[2024-05-28 15:41:00] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 3 ms to minimize.
[2024-05-28 15:41:01] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 3 ms to minimize.
[2024-05-28 15:41:01] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 20/458 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:41:02] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:41:03] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:41:04] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:41:04] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 2 ms to minimize.
[2024-05-28 15:41:05] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:41:06] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 3 ms to minimize.
[2024-05-28 15:41:06] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 3 ms to minimize.
[2024-05-28 15:41:07] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 4 ms to minimize.
[2024-05-28 15:41:08] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
[2024-05-28 15:41:08] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 4 ms to minimize.
[2024-05-28 15:41:08] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 4 ms to minimize.
[2024-05-28 15:41:09] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 4 ms to minimize.
[2024-05-28 15:41:13] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 15:41:13] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:41:13] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 15:41:13] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 15:41:14] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 15:41:14] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 15:41:14] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 15:41:15] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/999 variables, 20/478 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:41:15] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 15:41:15] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 15:41:15] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1962 variables, and 481 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 358/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 123/123 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60227ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/1003 places, 961/963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61786 ms. Remains : 1001/1003 places, 961/963 transitions.
Built C files in :
/tmp/ltsmin2319084916017128529
[2024-05-28 15:41:16] [INFO ] Computing symmetric may disable matrix : 961 transitions.
[2024-05-28 15:41:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:41:16] [INFO ] Computing symmetric may enable matrix : 961 transitions.
[2024-05-28 15:41:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:41:16] [INFO ] Computing Do-Not-Accords matrix : 961 transitions.
[2024-05-28 15:41:16] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:41:16] [INFO ] Built C files in 170ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2319084916017128529
Running compilation step : cd /tmp/ltsmin2319084916017128529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2319084916017128529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2319084916017128529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 15:41:19] [INFO ] Flatten gal took : 61 ms
[2024-05-28 15:41:19] [INFO ] Flatten gal took : 39 ms
[2024-05-28 15:41:19] [INFO ] Time to serialize gal into /tmp/LTL7901896854171507107.gal : 14 ms
[2024-05-28 15:41:19] [INFO ] Time to serialize properties into /tmp/LTL17972400290242425715.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7901896854171507107.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8095206442213037917.hoa' '-atoms' '/tmp/LTL17972400290242425715.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17972400290242425715.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8095206442213037917.hoa
Detected timeout of ITS tools.
[2024-05-28 15:41:34] [INFO ] Flatten gal took : 35 ms
[2024-05-28 15:41:34] [INFO ] Flatten gal took : 34 ms
[2024-05-28 15:41:34] [INFO ] Time to serialize gal into /tmp/LTL4263392637562382269.gal : 8 ms
[2024-05-28 15:41:34] [INFO ] Time to serialize properties into /tmp/LTL6005899966446241174.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4263392637562382269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6005899966446241174.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(((!("(((p2246==1)&&(p2257==1))&&(p2282==1))"))U((X("(p199!=1)"))||(G(!("(((p2246==1)&&(p2257==1))&&(p2282==1))")))))&&("(((p224...192
Formula 0 simplified : GF(!"(((p2246!=1)||(p2257!=1))||(p2282!=1))" | ("(((p2246==1)&&(p2257==1))&&(p2282==1))" M X!"(p199!=1)"))
Detected timeout of ITS tools.
[2024-05-28 15:41:49] [INFO ] Flatten gal took : 34 ms
[2024-05-28 15:41:49] [INFO ] Applying decomposition
[2024-05-28 15:41:49] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2932415440735261392.txt' '-o' '/tmp/graph2932415440735261392.bin' '-w' '/tmp/graph2932415440735261392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2932415440735261392.bin' '-l' '-1' '-v' '-w' '/tmp/graph2932415440735261392.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:41:49] [INFO ] Decomposing Gal with order
[2024-05-28 15:41:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:41:50] [INFO ] Removed a total of 642 redundant transitions.
[2024-05-28 15:41:50] [INFO ] Flatten gal took : 101 ms
[2024-05-28 15:41:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 592 labels/synchronizations in 24 ms.
[2024-05-28 15:41:50] [INFO ] Time to serialize gal into /tmp/LTL1725812897596951655.gal : 14 ms
[2024-05-28 15:41:50] [INFO ] Time to serialize properties into /tmp/LTL11392339858228358325.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1725812897596951655.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11392339858228358325.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(((!("(((i37.i1.u338.p2246==1)&&(i37.i1.u341.p2257==1))&&(i37.i1.u344.p2282==1))"))U((X("(i2.i0.u26.p199!=1)"))||(G(!("(((i37.i1...310
Formula 0 simplified : GF(!"(((i37.i1.u338.p2246!=1)||(i37.i1.u341.p2257!=1))||(i37.i1.u344.p2282!=1))" | ("(((i37.i1.u338.p2246==1)&&(i37.i1.u341.p2257==1...211
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-01 finished in 242693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (p1||G(!p0)))))'
Support contains 4 out of 2132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2123 transition count 2083
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2123 transition count 2083
Applied a total of 18 rules in 154 ms. Remains 2123 /2132 variables (removed 9) and now considering 2083/2092 (removed 9) transitions.
// Phase 1: matrix 2083 rows 2123 cols
[2024-05-28 15:42:05] [INFO ] Computed 361 invariants in 13 ms
[2024-05-28 15:42:06] [INFO ] Implicit Places using invariants in 693 ms returned []
[2024-05-28 15:42:06] [INFO ] Invariant cache hit.
[2024-05-28 15:42:08] [INFO ] Implicit Places using invariants and state equation in 2061 ms returned []
Implicit Place search using SMT with State Equation took 2757 ms to find 0 implicit places.
Running 2082 sub problems to find dead transitions.
[2024-05-28 15:42:08] [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 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.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)timeout

(s1033 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2122/4206 variables, and 0 constraints, problems are : Problem set: 0 solved, 2082 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2123 constraints, PredecessorRefiner: 2082/2082 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2082 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 2122/4206 variables, and 0 constraints, problems are : Problem set: 0 solved, 2082 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2123 constraints, PredecessorRefiner: 0/2082 constraints, Known Traps: 0/0 constraints]
After SMT, in 60573ms problems are : Problem set: 0 solved, 2082 unsolved
Search for dead transitions found 0 dead transitions in 60596ms
Starting structural reductions in LTL mode, iteration 1 : 2123/2132 places, 2083/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63512 ms. Remains : 2123/2132 places, 2083/2092 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 491 ms.
Product exploration explored 100000 steps with 50000 reset in 487 ms.
Computed a total of 480 stabilizing places and 480 stable transitions
Computed a total of 480 stabilizing places and 480 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040B-LTLFireability-02 finished in 64693 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||G(p1)))))'
Support contains 2 out of 2132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2131 transition count 1890
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1930 transition count 1890
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 402 place count 1930 transition count 1690
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 802 place count 1730 transition count 1690
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 810 place count 1722 transition count 1682
Iterating global reduction 2 with 8 rules applied. Total rules applied 818 place count 1722 transition count 1682
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 818 place count 1722 transition count 1676
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 830 place count 1716 transition count 1676
Performed 711 Post agglomeration using F-continuation condition.Transition count delta: 711
Deduced a syphon composed of 711 places in 2 ms
Reduce places removed 711 places and 0 transitions.
Iterating global reduction 2 with 1422 rules applied. Total rules applied 2252 place count 1005 transition count 965
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2254 place count 1003 transition count 963
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2255 place count 1002 transition count 963
Applied a total of 2255 rules in 272 ms. Remains 1002 /2132 variables (removed 1130) and now considering 963/2092 (removed 1129) transitions.
// Phase 1: matrix 963 rows 1002 cols
[2024-05-28 15:43:10] [INFO ] Computed 360 invariants in 5 ms
[2024-05-28 15:43:10] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-05-28 15:43:10] [INFO ] Invariant cache hit.
[2024-05-28 15:43:11] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1363 ms to find 0 implicit places.
[2024-05-28 15:43:11] [INFO ] Redundant transitions in 99 ms returned [962]
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 960 sub problems to find dead transitions.
// Phase 1: matrix 962 rows 1002 cols
[2024-05-28 15:43:11] [INFO ] Computed 360 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 353/353 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:43:26] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 4 ms to minimize.
[2024-05-28 15:43:26] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 3 ms to minimize.
[2024-05-28 15:43:26] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 4 ms to minimize.
[2024-05-28 15:43:26] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 3 ms to minimize.
[2024-05-28 15:43:26] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 4 ms to minimize.
[2024-05-28 15:43:27] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 3 ms to minimize.
[2024-05-28 15:43:27] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 3 ms to minimize.
[2024-05-28 15:43:27] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-05-28 15:43:27] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-05-28 15:43:27] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 3 ms to minimize.
[2024-05-28 15:43:28] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 3 ms to minimize.
[2024-05-28 15:43:28] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 3 ms to minimize.
[2024-05-28 15:43:28] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 3 ms to minimize.
[2024-05-28 15:43:28] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:43:28] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:43:29] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:43:29] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 2 ms to minimize.
[2024-05-28 15:43:29] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 2 ms to minimize.
[2024-05-28 15:43:29] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2024-05-28 15:43:29] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/373 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:43:29] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-05-28 15:43:30] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:43:30] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:43:30] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 3 ms to minimize.
[2024-05-28 15:43:30] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-28 15:43:30] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:43:30] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:43:30] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:43:30] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:43:30] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-28 15:43:31] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:43:31] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-28 15:43:31] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-28 15:43:31] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-28 15:43:31] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:43:31] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:43:31] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:43:31] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-28 15:43:31] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:43:31] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/393 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:43:32] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:43:32] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:43:32] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:43:32] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:43:32] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:43:32] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:43:32] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 15:43:32] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-28 15:43:32] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 15:43:32] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 15:43:32] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 15:43:32] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-28 15:43:33] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-28 15:43:33] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:43:33] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:43:33] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:43:33] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:43:33] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:43:33] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:43:34] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/413 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1964 variables, and 413 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 353/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 353/353 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/413 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:43:43] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:43:43] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-28 15:43:44] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:43:44] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:43:44] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-28 15:43:44] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-28 15:43:44] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:43:44] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:43:45] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:43:45] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-28 15:43:45] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:43:45] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:43:45] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:43:46] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:43:46] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-28 15:43:46] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:43:46] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-28 15:43:46] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-28 15:43:47] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-05-28 15:43:47] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/433 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:43:47] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 15:43:49] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
[2024-05-28 15:43:49] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 15:43:50] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:43:50] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:43:50] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-05-28 15:43:51] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-05-28 15:43:51] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 3 ms to minimize.
[2024-05-28 15:43:51] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2024-05-28 15:43:52] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 3 ms to minimize.
[2024-05-28 15:43:52] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 3 ms to minimize.
[2024-05-28 15:43:52] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 3 ms to minimize.
[2024-05-28 15:43:53] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 2 ms to minimize.
[2024-05-28 15:43:53] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 3 ms to minimize.
[2024-05-28 15:43:53] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 3 ms to minimize.
[2024-05-28 15:43:53] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:43:54] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-05-28 15:43:54] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-05-28 15:43:54] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 3 ms to minimize.
[2024-05-28 15:43:55] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/453 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:43:55] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-28 15:43:56] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:43:58] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 3 ms to minimize.
[2024-05-28 15:43:59] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 2 ms to minimize.
[2024-05-28 15:44:00] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 3 ms to minimize.
[2024-05-28 15:44:00] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 3 ms to minimize.
[2024-05-28 15:44:01] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 3 ms to minimize.
[2024-05-28 15:44:01] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 3 ms to minimize.
[2024-05-28 15:44:01] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 3 ms to minimize.
[2024-05-28 15:44:02] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 3 ms to minimize.
[2024-05-28 15:44:02] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 4 ms to minimize.
[2024-05-28 15:44:02] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 3 ms to minimize.
[2024-05-28 15:44:03] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 3 ms to minimize.
[2024-05-28 15:44:03] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 3 ms to minimize.
[2024-05-28 15:44:03] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 4 ms to minimize.
[2024-05-28 15:44:04] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 4 ms to minimize.
[2024-05-28 15:44:04] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 4 ms to minimize.
[2024-05-28 15:44:09] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:44:09] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:44:09] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/473 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:44:10] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1964 variables, and 474 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 353/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 121/121 constraints]
After SMT, in 60215ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1002/2132 places, 962/2092 transitions.
Applied a total of 0 rules in 21 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61987 ms. Remains : 1002/2132 places, 962/2092 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-03
Product exploration explored 100000 steps with 48 reset in 763 ms.
Product exploration explored 100000 steps with 48 reset in 916 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1002 stabilizing places and 2/962 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 237 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (16 resets) in 416 ms. (95 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 1/1 properties
[2024-05-28 15:44:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/24 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/59 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/117 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/119 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 63/182 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/188 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/188 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/188 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/190 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/190 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/190 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 67/257 variables, 32/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/257 variables, 9/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/257 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/261 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/261 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/261 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/265 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/265 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/265 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 65/330 variables, 28/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/330 variables, 9/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/330 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 5/335 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/335 variables, 5/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/335 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/337 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/337 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/337 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 67/404 variables, 32/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/404 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/404 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 4/408 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/408 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/408 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 4/412 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/412 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/412 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 65/477 variables, 28/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/477 variables, 9/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/477 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 5/482 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/482 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/482 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 2/484 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/484 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/484 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 67/551 variables, 32/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/551 variables, 9/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/551 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 4/555 variables, 3/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/555 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/555 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 4/559 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/559 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/559 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 65/624 variables, 28/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/624 variables, 9/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/624 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 5/629 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/629 variables, 5/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/629 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 2/631 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/631 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/631 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 67/698 variables, 32/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/698 variables, 9/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/698 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 4/702 variables, 3/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/702 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/702 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 4/706 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/706 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/706 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 65/771 variables, 28/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/771 variables, 9/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/771 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 5/776 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/776 variables, 5/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/776 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 2/778 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/778 variables, 2/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/778 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 49/827 variables, 28/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/827 variables, 8/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/827 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 2/829 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/829 variables, 2/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/829 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 4/833 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/833 variables, 4/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/833 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 26/859 variables, 12/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/859 variables, 5/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/859 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 2/861 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/861 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/861 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 23/884 variables, 12/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/884 variables, 3/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/884 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 1/885 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/885 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/885 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 2/887 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/887 variables, 2/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/887 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 21/908 variables, 8/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/908 variables, 3/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/908 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 2/910 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/910 variables, 2/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/910 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 23/933 variables, 12/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/933 variables, 3/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/933 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 1/934 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/934 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/934 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 2/936 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/936 variables, 2/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/936 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 21/957 variables, 8/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/957 variables, 3/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/957 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (OVERLAPS) 2/959 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/959 variables, 2/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/959 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 23/982 variables, 12/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/982 variables, 3/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/982 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (OVERLAPS) 1/983 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/983 variables, 1/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/983 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (OVERLAPS) 2/985 variables, 1/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/985 variables, 2/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/985 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (OVERLAPS) 21/1006 variables, 8/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1006 variables, 3/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1006 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (OVERLAPS) 2/1008 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1008 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1008 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (OVERLAPS) 23/1031 variables, 12/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1031 variables, 3/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1031 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (OVERLAPS) 1/1032 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1032 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1032 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (OVERLAPS) 2/1034 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1034 variables, 2/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1034 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (OVERLAPS) 21/1055 variables, 8/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1055 variables, 3/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1055 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (OVERLAPS) 2/1057 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1057 variables, 2/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1057 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (OVERLAPS) 23/1080 variables, 12/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1080 variables, 3/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1080 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (OVERLAPS) 1/1081 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1081 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1081 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (OVERLAPS) 2/1083 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1083 variables, 2/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/1083 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (OVERLAPS) 21/1104 variables, 8/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/1104 variables, 3/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1104 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (OVERLAPS) 2/1106 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/1106 variables, 2/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/1106 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (OVERLAPS) 23/1129 variables, 12/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1129 variables, 3/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/1129 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (OVERLAPS) 1/1130 variables, 1/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/1130 variables, 1/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/1130 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (OVERLAPS) 2/1132 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1132 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/1132 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (OVERLAPS) 21/1153 variables, 8/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/1153 variables, 3/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/1153 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (OVERLAPS) 2/1155 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1155 variables, 2/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/1155 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (OVERLAPS) 23/1178 variables, 12/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/1178 variables, 3/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/1178 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (OVERLAPS) 1/1179 variables, 1/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/1179 variables, 1/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/1179 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (OVERLAPS) 2/1181 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1181 variables, 2/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (INCLUDED_ONLY) 0/1181 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (OVERLAPS) 21/1202 variables, 8/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/1202 variables, 3/827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/1202 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (OVERLAPS) 2/1204 variables, 1/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/1204 variables, 2/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/1204 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 214 (OVERLAPS) 23/1227 variables, 12/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 215 (INCLUDED_ONLY) 0/1227 variables, 3/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/1227 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (OVERLAPS) 1/1228 variables, 1/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/1228 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 219 (INCLUDED_ONLY) 0/1228 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (OVERLAPS) 2/1230 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/1230 variables, 2/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (INCLUDED_ONLY) 0/1230 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 223 (OVERLAPS) 21/1251 variables, 8/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/1251 variables, 3/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/1251 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (OVERLAPS) 2/1253 variables, 1/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (INCLUDED_ONLY) 0/1253 variables, 2/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/1253 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 229 (OVERLAPS) 23/1276 variables, 12/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/1276 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (INCLUDED_ONLY) 0/1276 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (OVERLAPS) 1/1277 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/1277 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/1277 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (OVERLAPS) 2/1279 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/1279 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/1279 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (OVERLAPS) 21/1300 variables, 8/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (INCLUDED_ONLY) 0/1300 variables, 3/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/1300 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (OVERLAPS) 2/1302 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/1302 variables, 2/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 243 (INCLUDED_ONLY) 0/1302 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (OVERLAPS) 23/1325 variables, 12/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/1325 variables, 3/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (INCLUDED_ONLY) 0/1325 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (OVERLAPS) 1/1326 variables, 1/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/1326 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/1326 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (OVERLAPS) 2/1328 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 251 (INCLUDED_ONLY) 0/1328 variables, 2/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/1328 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 253 (OVERLAPS) 21/1349 variables, 8/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 254 (INCLUDED_ONLY) 0/1349 variables, 3/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 255 (INCLUDED_ONLY) 0/1349 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 256 (OVERLAPS) 2/1351 variables, 1/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/1351 variables, 2/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 258 (INCLUDED_ONLY) 0/1351 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 259 (OVERLAPS) 23/1374 variables, 12/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/1374 variables, 3/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 261 (INCLUDED_ONLY) 0/1374 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 262 (OVERLAPS) 1/1375 variables, 1/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 263 (INCLUDED_ONLY) 0/1375 variables, 1/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 264 (INCLUDED_ONLY) 0/1375 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 265 (OVERLAPS) 2/1377 variables, 1/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/1377 variables, 2/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 267 (INCLUDED_ONLY) 0/1377 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 268 (OVERLAPS) 21/1398 variables, 8/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/1398 variables, 3/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 270 (INCLUDED_ONLY) 0/1398 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 271 (OVERLAPS) 2/1400 variables, 1/964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/1400 variables, 2/966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 273 (INCLUDED_ONLY) 0/1400 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 274 (OVERLAPS) 23/1423 variables, 12/978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 275 (INCLUDED_ONLY) 0/1423 variables, 3/981 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 276 (INCLUDED_ONLY) 0/1423 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 277 (OVERLAPS) 1/1424 variables, 1/982 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/1424 variables, 1/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 279 (INCLUDED_ONLY) 0/1424 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 280 (OVERLAPS) 2/1426 variables, 1/984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/1426 variables, 2/986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 282 (INCLUDED_ONLY) 0/1426 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 283 (OVERLAPS) 21/1447 variables, 8/994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/1447 variables, 3/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 285 (INCLUDED_ONLY) 0/1447 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 286 (OVERLAPS) 2/1449 variables, 1/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 287 (INCLUDED_ONLY) 0/1449 variables, 2/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 288 (INCLUDED_ONLY) 0/1449 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 289 (OVERLAPS) 23/1472 variables, 12/1012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/1472 variables, 3/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 291 (INCLUDED_ONLY) 0/1472 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 292 (OVERLAPS) 1/1473 variables, 1/1016 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/1473 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 294 (INCLUDED_ONLY) 0/1473 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 295 (OVERLAPS) 2/1475 variables, 1/1018 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 296 (INCLUDED_ONLY) 0/1475 variables, 2/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 297 (INCLUDED_ONLY) 0/1475 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 298 (OVERLAPS) 21/1496 variables, 8/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 299 (INCLUDED_ONLY) 0/1496 variables, 3/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 300 (INCLUDED_ONLY) 0/1496 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 301 (OVERLAPS) 2/1498 variables, 1/1032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/1498 variables, 2/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 303 (INCLUDED_ONLY) 0/1498 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 304 (OVERLAPS) 23/1521 variables, 12/1046 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/1521 variables, 3/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 306 (INCLUDED_ONLY) 0/1521 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 307 (OVERLAPS) 1/1522 variables, 1/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 308 (INCLUDED_ONLY) 0/1522 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 309 (INCLUDED_ONLY) 0/1522 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 310 (OVERLAPS) 2/1524 variables, 1/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 311 (INCLUDED_ONLY) 0/1524 variables, 2/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 312 (INCLUDED_ONLY) 0/1524 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 313 (OVERLAPS) 21/1545 variables, 8/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 314 (INCLUDED_ONLY) 0/1545 variables, 3/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 315 (INCLUDED_ONLY) 0/1545 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 316 (OVERLAPS) 2/1547 variables, 1/1066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 317 (INCLUDED_ONLY) 0/1547 variables, 2/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 318 (INCLUDED_ONLY) 0/1547 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 319 (OVERLAPS) 23/1570 variables, 12/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 320 (INCLUDED_ONLY) 0/1570 variables, 3/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 321 (INCLUDED_ONLY) 0/1570 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 322 (OVERLAPS) 1/1571 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 323 (INCLUDED_ONLY) 0/1571 variables, 1/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 324 (INCLUDED_ONLY) 0/1571 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 325 (OVERLAPS) 2/1573 variables, 1/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 326 (INCLUDED_ONLY) 0/1573 variables, 2/1088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 327 (INCLUDED_ONLY) 0/1573 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 328 (OVERLAPS) 21/1594 variables, 8/1096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 329 (INCLUDED_ONLY) 0/1594 variables, 3/1099 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 330 (INCLUDED_ONLY) 0/1594 variables, 0/1099 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 331 (OVERLAPS) 2/1596 variables, 1/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 332 (INCLUDED_ONLY) 0/1596 variables, 2/1102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 333 (INCLUDED_ONLY) 0/1596 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 334 (OVERLAPS) 23/1619 variables, 12/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 335 (INCLUDED_ONLY) 0/1619 variables, 3/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 336 (INCLUDED_ONLY) 0/1619 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 337 (OVERLAPS) 1/1620 variables, 1/1118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 338 (INCLUDED_ONLY) 0/1620 variables, 1/1119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 339 (INCLUDED_ONLY) 0/1620 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 340 (OVERLAPS) 2/1622 variables, 1/1120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 341 (INCLUDED_ONLY) 0/1622 variables, 2/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 342 (INCLUDED_ONLY) 0/1622 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 343 (OVERLAPS) 21/1643 variables, 8/1130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 344 (INCLUDED_ONLY) 0/1643 variables, 3/1133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 345 (INCLUDED_ONLY) 0/1643 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 346 (OVERLAPS) 2/1645 variables, 1/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 347 (INCLUDED_ONLY) 0/1645 variables, 2/1136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 348 (INCLUDED_ONLY) 0/1645 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 349 (OVERLAPS) 23/1668 variables, 12/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 350 (INCLUDED_ONLY) 0/1668 variables, 3/1151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 351 (INCLUDED_ONLY) 0/1668 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 352 (OVERLAPS) 1/1669 variables, 1/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 353 (INCLUDED_ONLY) 0/1669 variables, 1/1153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 354 (INCLUDED_ONLY) 0/1669 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 355 (OVERLAPS) 2/1671 variables, 1/1154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 356 (INCLUDED_ONLY) 0/1671 variables, 2/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 357 (INCLUDED_ONLY) 0/1671 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 358 (OVERLAPS) 21/1692 variables, 8/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 359 (INCLUDED_ONLY) 0/1692 variables, 3/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 360 (INCLUDED_ONLY) 0/1692 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 361 (OVERLAPS) 2/1694 variables, 1/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 362 (INCLUDED_ONLY) 0/1694 variables, 2/1170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 363 (INCLUDED_ONLY) 0/1694 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 364 (OVERLAPS) 23/1717 variables, 12/1182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 365 (INCLUDED_ONLY) 0/1717 variables, 3/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 366 (INCLUDED_ONLY) 0/1717 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 367 (OVERLAPS) 1/1718 variables, 1/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 368 (INCLUDED_ONLY) 0/1718 variables, 1/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 369 (INCLUDED_ONLY) 0/1718 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 370 (OVERLAPS) 2/1720 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 371 (INCLUDED_ONLY) 0/1720 variables, 2/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 372 (INCLUDED_ONLY) 0/1720 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 373 (OVERLAPS) 21/1741 variables, 8/1198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 374 (INCLUDED_ONLY) 0/1741 variables, 3/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 375 (INCLUDED_ONLY) 0/1741 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 376 (OVERLAPS) 2/1743 variables, 1/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 377 (INCLUDED_ONLY) 0/1743 variables, 2/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 378 (INCLUDED_ONLY) 0/1743 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 379 (OVERLAPS) 23/1766 variables, 12/1216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 380 (INCLUDED_ONLY) 0/1766 variables, 3/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 381 (INCLUDED_ONLY) 0/1766 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 382 (OVERLAPS) 1/1767 variables, 1/1220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 383 (INCLUDED_ONLY) 0/1767 variables, 1/1221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 384 (INCLUDED_ONLY) 0/1767 variables, 0/1221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 385 (OVERLAPS) 2/1769 variables, 1/1222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 386 (INCLUDED_ONLY) 0/1769 variables, 2/1224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 387 (INCLUDED_ONLY) 0/1769 variables, 0/1224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 388 (OVERLAPS) 21/1790 variables, 8/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 389 (INCLUDED_ONLY) 0/1790 variables, 3/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 390 (INCLUDED_ONLY) 0/1790 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 391 (OVERLAPS) 2/1792 variables, 1/1236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 392 (INCLUDED_ONLY) 0/1792 variables, 2/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 393 (INCLUDED_ONLY) 0/1792 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 394 (OVERLAPS) 23/1815 variables, 12/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 395 (INCLUDED_ONLY) 0/1815 variables, 3/1253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 396 (INCLUDED_ONLY) 0/1815 variables, 0/1253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 397 (OVERLAPS) 1/1816 variables, 1/1254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 398 (INCLUDED_ONLY) 0/1816 variables, 1/1255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 399 (INCLUDED_ONLY) 0/1816 variables, 0/1255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 400 (OVERLAPS) 2/1818 variables, 1/1256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 401 (INCLUDED_ONLY) 0/1818 variables, 2/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 402 (INCLUDED_ONLY) 0/1818 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 403 (OVERLAPS) 21/1839 variables, 8/1266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 404 (INCLUDED_ONLY) 0/1839 variables, 3/1269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 405 (INCLUDED_ONLY) 0/1839 variables, 0/1269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 406 (OVERLAPS) 2/1841 variables, 1/1270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 407 (INCLUDED_ONLY) 0/1841 variables, 2/1272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 408 (INCLUDED_ONLY) 0/1841 variables, 0/1272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 409 (OVERLAPS) 23/1864 variables, 12/1284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 410 (INCLUDED_ONLY) 0/1864 variables, 3/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 411 (INCLUDED_ONLY) 0/1864 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 412 (OVERLAPS) 1/1865 variables, 1/1288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 413 (INCLUDED_ONLY) 0/1865 variables, 1/1289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 414 (INCLUDED_ONLY) 0/1865 variables, 0/1289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 415 (OVERLAPS) 2/1867 variables, 1/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 416 (INCLUDED_ONLY) 0/1867 variables, 2/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 417 (INCLUDED_ONLY) 0/1867 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 418 (OVERLAPS) 21/1888 variables, 8/1300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 419 (INCLUDED_ONLY) 0/1888 variables, 3/1303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 420 (INCLUDED_ONLY) 0/1888 variables, 0/1303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 421 (OVERLAPS) 2/1890 variables, 1/1304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 422 (INCLUDED_ONLY) 0/1890 variables, 2/1306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 423 (INCLUDED_ONLY) 0/1890 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 424 (OVERLAPS) 23/1913 variables, 12/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 425 (INCLUDED_ONLY) 0/1913 variables, 3/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 426 (INCLUDED_ONLY) 0/1913 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 427 (OVERLAPS) 1/1914 variables, 1/1322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 428 (INCLUDED_ONLY) 0/1914 variables, 1/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 429 (INCLUDED_ONLY) 0/1914 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 430 (OVERLAPS) 2/1916 variables, 1/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 431 (INCLUDED_ONLY) 0/1916 variables, 2/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 432 (INCLUDED_ONLY) 0/1916 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 433 (OVERLAPS) 20/1936 variables, 8/1334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 434 (INCLUDED_ONLY) 0/1936 variables, 3/1337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 435 (INCLUDED_ONLY) 0/1936 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 436 (OVERLAPS) 2/1938 variables, 1/1338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 437 (INCLUDED_ONLY) 0/1938 variables, 2/1340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 438 (INCLUDED_ONLY) 0/1938 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 439 (OVERLAPS) 18/1956 variables, 9/1349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 440 (INCLUDED_ONLY) 0/1956 variables, 2/1351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 441 (INCLUDED_ONLY) 0/1956 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 442 (OVERLAPS) 1/1957 variables, 1/1352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 443 (INCLUDED_ONLY) 0/1957 variables, 1/1353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 444 (INCLUDED_ONLY) 0/1957 variables, 0/1353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 445 (OVERLAPS) 2/1959 variables, 1/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 446 (INCLUDED_ONLY) 0/1959 variables, 2/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 447 (INCLUDED_ONLY) 0/1959 variables, 0/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 448 (OVERLAPS) 5/1964 variables, 4/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 449 (INCLUDED_ONLY) 0/1964 variables, 2/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 450 (INCLUDED_ONLY) 0/1964 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 451 (OVERLAPS) 0/1964 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1964/1964 variables, and 1362 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2924 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1002/1002 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/24 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:44:17] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 35/59 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/117 variables, 28/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/117 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/119 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/119 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 63/182 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/182 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/188 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/188 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/188 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/190 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/190 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/190 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 67/257 variables, 32/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/257 variables, 9/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/257 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/261 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/261 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/261 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 4/265 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/265 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/265 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 65/330 variables, 28/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/330 variables, 9/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/330 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 5/335 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/335 variables, 5/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/335 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 2/337 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/337 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/337 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 67/404 variables, 32/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/404 variables, 9/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/404 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 4/408 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/408 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/408 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 4/412 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/412 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/412 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 65/477 variables, 28/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/477 variables, 9/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/477 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 5/482 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/482 variables, 5/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/482 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 2/484 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/484 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/484 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 67/551 variables, 32/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/551 variables, 9/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/551 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 4/555 variables, 3/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/555 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/555 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 4/559 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/559 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/559 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 65/624 variables, 28/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/624 variables, 9/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/624 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 5/629 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/629 variables, 5/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/629 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 2/631 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/631 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/631 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 67/698 variables, 32/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/698 variables, 9/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/698 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 4/702 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/702 variables, 4/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/702 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 4/706 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/706 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/706 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 65/771 variables, 28/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/771 variables, 9/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/771 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 5/776 variables, 3/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/776 variables, 5/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/776 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 2/778 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/778 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/778 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 49/827 variables, 28/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/827 variables, 8/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/827 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 2/829 variables, 2/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/829 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/829 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 4/833 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/833 variables, 4/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/833 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 26/859 variables, 12/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/859 variables, 5/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/859 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 2/861 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/861 variables, 2/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/861 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 23/884 variables, 12/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/884 variables, 3/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/884 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 1/885 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/885 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/885 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 2/887 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/887 variables, 2/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/887 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 21/908 variables, 8/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/908 variables, 3/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/908 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 2/910 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/910 variables, 2/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/910 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 23/933 variables, 12/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/933 variables, 3/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/933 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (OVERLAPS) 1/934 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/934 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/934 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (OVERLAPS) 2/936 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/936 variables, 2/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/936 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 21/957 variables, 8/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/957 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/957 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (OVERLAPS) 2/959 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/959 variables, 2/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/959 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (OVERLAPS) 23/982 variables, 12/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/982 variables, 3/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/982 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (OVERLAPS) 1/983 variables, 1/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/983 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/983 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (OVERLAPS) 2/985 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/985 variables, 2/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/985 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (OVERLAPS) 21/1006 variables, 8/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1006 variables, 3/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1006 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (OVERLAPS) 2/1008 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1008 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1008 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (OVERLAPS) 23/1031 variables, 12/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1031 variables, 3/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1031 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (OVERLAPS) 1/1032 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1032 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1032 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (OVERLAPS) 2/1034 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1034 variables, 2/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1034 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (OVERLAPS) 21/1055 variables, 8/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1055 variables, 3/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1055 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (OVERLAPS) 2/1057 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1057 variables, 2/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1057 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (OVERLAPS) 23/1080 variables, 12/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1080 variables, 3/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1080 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (OVERLAPS) 1/1081 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/1081 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1081 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (OVERLAPS) 2/1083 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/1083 variables, 2/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/1083 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (OVERLAPS) 21/1104 variables, 8/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/1104 variables, 3/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/1104 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (OVERLAPS) 2/1106 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/1106 variables, 2/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1106 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (OVERLAPS) 23/1129 variables, 12/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/1129 variables, 3/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/1129 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (OVERLAPS) 1/1130 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/1130 variables, 1/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1130 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (OVERLAPS) 2/1132 variables, 1/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/1132 variables, 2/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/1132 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (OVERLAPS) 21/1153 variables, 8/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/1153 variables, 3/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1153 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (OVERLAPS) 2/1155 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/1155 variables, 2/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/1155 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (OVERLAPS) 23/1178 variables, 12/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/1178 variables, 3/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/1178 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (OVERLAPS) 1/1179 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/1179 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1179 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (OVERLAPS) 2/1181 variables, 1/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/1181 variables, 2/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/1181 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (OVERLAPS) 21/1202 variables, 8/826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (INCLUDED_ONLY) 0/1202 variables, 3/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/1202 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (OVERLAPS) 2/1204 variables, 1/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 214 (INCLUDED_ONLY) 0/1204 variables, 2/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 215 (INCLUDED_ONLY) 0/1204 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 216 (OVERLAPS) 23/1227 variables, 12/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/1227 variables, 3/847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/1227 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 219 (OVERLAPS) 1/1228 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/1228 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/1228 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (OVERLAPS) 2/1230 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 223 (INCLUDED_ONLY) 0/1230 variables, 2/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/1230 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 225 (OVERLAPS) 21/1251 variables, 8/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/1251 variables, 3/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (INCLUDED_ONLY) 0/1251 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (OVERLAPS) 2/1253 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/1253 variables, 2/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/1253 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (OVERLAPS) 23/1276 variables, 12/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/1276 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/1276 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (OVERLAPS) 1/1277 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (INCLUDED_ONLY) 0/1277 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/1277 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (OVERLAPS) 2/1279 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (INCLUDED_ONLY) 0/1279 variables, 2/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (INCLUDED_ONLY) 0/1279 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (OVERLAPS) 21/1300 variables, 8/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (INCLUDED_ONLY) 0/1300 variables, 3/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/1300 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 243 (OVERLAPS) 2/1302 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/1302 variables, 2/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/1302 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (OVERLAPS) 23/1325 variables, 12/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (INCLUDED_ONLY) 0/1325 variables, 3/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/1325 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (OVERLAPS) 1/1326 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (INCLUDED_ONLY) 0/1326 variables, 1/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 251 (INCLUDED_ONLY) 0/1326 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 252 (OVERLAPS) 2/1328 variables, 1/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 253 (INCLUDED_ONLY) 0/1328 variables, 2/920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 254 (INCLUDED_ONLY) 0/1328 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 255 (OVERLAPS) 21/1349 variables, 8/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 256 (INCLUDED_ONLY) 0/1349 variables, 3/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/1349 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 258 (OVERLAPS) 2/1351 variables, 1/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 259 (INCLUDED_ONLY) 0/1351 variables, 2/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/1351 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 261 (OVERLAPS) 23/1374 variables, 12/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 262 (INCLUDED_ONLY) 0/1374 variables, 3/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 263 (INCLUDED_ONLY) 0/1374 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 264 (OVERLAPS) 1/1375 variables, 1/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 265 (INCLUDED_ONLY) 0/1375 variables, 1/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/1375 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 267 (OVERLAPS) 2/1377 variables, 1/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 268 (INCLUDED_ONLY) 0/1377 variables, 2/954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/1377 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 270 (OVERLAPS) 21/1398 variables, 8/962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 271 (INCLUDED_ONLY) 0/1398 variables, 3/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/1398 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 273 (OVERLAPS) 2/1400 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 274 (INCLUDED_ONLY) 0/1400 variables, 2/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 275 (INCLUDED_ONLY) 0/1400 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 276 (OVERLAPS) 23/1423 variables, 12/980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 277 (INCLUDED_ONLY) 0/1423 variables, 3/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/1423 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 279 (OVERLAPS) 1/1424 variables, 1/984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 280 (INCLUDED_ONLY) 0/1424 variables, 1/985 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/1424 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 282 (OVERLAPS) 2/1426 variables, 1/986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 283 (INCLUDED_ONLY) 0/1426 variables, 2/988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/1426 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 285 (OVERLAPS) 21/1447 variables, 8/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 286 (INCLUDED_ONLY) 0/1447 variables, 3/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 287 (INCLUDED_ONLY) 0/1447 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 288 (OVERLAPS) 2/1449 variables, 1/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 289 (INCLUDED_ONLY) 0/1449 variables, 2/1002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/1449 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 291 (OVERLAPS) 23/1472 variables, 12/1014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 292 (INCLUDED_ONLY) 0/1472 variables, 3/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/1472 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 294 (OVERLAPS) 1/1473 variables, 1/1018 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 295 (INCLUDED_ONLY) 0/1473 variables, 1/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 296 (INCLUDED_ONLY) 0/1473 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 297 (OVERLAPS) 2/1475 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 298 (INCLUDED_ONLY) 0/1475 variables, 2/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 299 (INCLUDED_ONLY) 0/1475 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 300 (OVERLAPS) 21/1496 variables, 8/1030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 301 (INCLUDED_ONLY) 0/1496 variables, 3/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/1496 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 303 (OVERLAPS) 2/1498 variables, 1/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 304 (INCLUDED_ONLY) 0/1498 variables, 2/1036 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/1498 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 306 (OVERLAPS) 23/1521 variables, 12/1048 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 307 (INCLUDED_ONLY) 0/1521 variables, 3/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 308 (INCLUDED_ONLY) 0/1521 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 309 (OVERLAPS) 1/1522 variables, 1/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 310 (INCLUDED_ONLY) 0/1522 variables, 1/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 311 (INCLUDED_ONLY) 0/1522 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 312 (OVERLAPS) 2/1524 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 313 (INCLUDED_ONLY) 0/1524 variables, 2/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 314 (INCLUDED_ONLY) 0/1524 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 315 (OVERLAPS) 21/1545 variables, 8/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 316 (INCLUDED_ONLY) 0/1545 variables, 3/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 317 (INCLUDED_ONLY) 0/1545 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 318 (OVERLAPS) 2/1547 variables, 1/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 319 (INCLUDED_ONLY) 0/1547 variables, 2/1070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 320 (INCLUDED_ONLY) 0/1547 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 321 (OVERLAPS) 23/1570 variables, 12/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 322 (INCLUDED_ONLY) 0/1570 variables, 3/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 323 (INCLUDED_ONLY) 0/1570 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 324 (OVERLAPS) 1/1571 variables, 1/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 325 (INCLUDED_ONLY) 0/1571 variables, 1/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 326 (INCLUDED_ONLY) 0/1571 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 327 (OVERLAPS) 2/1573 variables, 1/1088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 328 (INCLUDED_ONLY) 0/1573 variables, 2/1090 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 329 (INCLUDED_ONLY) 0/1573 variables, 0/1090 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 330 (OVERLAPS) 21/1594 variables, 8/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 331 (INCLUDED_ONLY) 0/1594 variables, 3/1101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 332 (INCLUDED_ONLY) 0/1594 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 333 (OVERLAPS) 2/1596 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 334 (INCLUDED_ONLY) 0/1596 variables, 2/1104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 335 (INCLUDED_ONLY) 0/1596 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 336 (OVERLAPS) 23/1619 variables, 12/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 337 (INCLUDED_ONLY) 0/1619 variables, 3/1119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 338 (INCLUDED_ONLY) 0/1619 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 339 (OVERLAPS) 1/1620 variables, 1/1120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 340 (INCLUDED_ONLY) 0/1620 variables, 1/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 341 (INCLUDED_ONLY) 0/1620 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 342 (OVERLAPS) 2/1622 variables, 1/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 343 (INCLUDED_ONLY) 0/1622 variables, 2/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 344 (INCLUDED_ONLY) 0/1622 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 345 (OVERLAPS) 21/1643 variables, 8/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 346 (INCLUDED_ONLY) 0/1643 variables, 3/1135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 347 (INCLUDED_ONLY) 0/1643 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 348 (OVERLAPS) 2/1645 variables, 1/1136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 349 (INCLUDED_ONLY) 0/1645 variables, 2/1138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 350 (INCLUDED_ONLY) 0/1645 variables, 0/1138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 351 (OVERLAPS) 23/1668 variables, 12/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 352 (INCLUDED_ONLY) 0/1668 variables, 3/1153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 353 (INCLUDED_ONLY) 0/1668 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 354 (OVERLAPS) 1/1669 variables, 1/1154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 355 (INCLUDED_ONLY) 0/1669 variables, 1/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 356 (INCLUDED_ONLY) 0/1669 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 357 (OVERLAPS) 2/1671 variables, 1/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 358 (INCLUDED_ONLY) 0/1671 variables, 2/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 359 (INCLUDED_ONLY) 0/1671 variables, 0/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 360 (OVERLAPS) 21/1692 variables, 8/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 361 (INCLUDED_ONLY) 0/1692 variables, 3/1169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:44:19] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
At refinement iteration 362 (INCLUDED_ONLY) 0/1692 variables, 1/1170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 363 (INCLUDED_ONLY) 0/1692 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 364 (OVERLAPS) 2/1694 variables, 1/1171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 365 (INCLUDED_ONLY) 0/1694 variables, 2/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 366 (INCLUDED_ONLY) 0/1694 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 367 (OVERLAPS) 23/1717 variables, 12/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 368 (INCLUDED_ONLY) 0/1717 variables, 3/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 369 (INCLUDED_ONLY) 0/1717 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 370 (OVERLAPS) 1/1718 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 371 (INCLUDED_ONLY) 0/1718 variables, 1/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 372 (INCLUDED_ONLY) 0/1718 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 373 (OVERLAPS) 2/1720 variables, 1/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 374 (INCLUDED_ONLY) 0/1720 variables, 2/1193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 375 (INCLUDED_ONLY) 0/1720 variables, 0/1193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 376 (OVERLAPS) 21/1741 variables, 8/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 377 (INCLUDED_ONLY) 0/1741 variables, 3/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 378 (INCLUDED_ONLY) 0/1741 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 379 (OVERLAPS) 2/1743 variables, 1/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 380 (INCLUDED_ONLY) 0/1743 variables, 2/1207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 381 (INCLUDED_ONLY) 0/1743 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 382 (OVERLAPS) 23/1766 variables, 12/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 383 (INCLUDED_ONLY) 0/1766 variables, 3/1222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 384 (INCLUDED_ONLY) 0/1766 variables, 0/1222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 385 (OVERLAPS) 1/1767 variables, 1/1223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 386 (INCLUDED_ONLY) 0/1767 variables, 1/1224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 387 (INCLUDED_ONLY) 0/1767 variables, 0/1224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 388 (OVERLAPS) 2/1769 variables, 1/1225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 389 (INCLUDED_ONLY) 0/1769 variables, 2/1227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 390 (INCLUDED_ONLY) 0/1769 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 391 (OVERLAPS) 21/1790 variables, 8/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 392 (INCLUDED_ONLY) 0/1790 variables, 3/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 393 (INCLUDED_ONLY) 0/1790 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 394 (OVERLAPS) 2/1792 variables, 1/1239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 395 (INCLUDED_ONLY) 0/1792 variables, 2/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 396 (INCLUDED_ONLY) 0/1792 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 397 (OVERLAPS) 23/1815 variables, 12/1253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 398 (INCLUDED_ONLY) 0/1815 variables, 3/1256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 399 (INCLUDED_ONLY) 0/1815 variables, 0/1256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 400 (OVERLAPS) 1/1816 variables, 1/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 401 (INCLUDED_ONLY) 0/1816 variables, 1/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 402 (INCLUDED_ONLY) 0/1816 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 403 (OVERLAPS) 2/1818 variables, 1/1259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 404 (INCLUDED_ONLY) 0/1818 variables, 2/1261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 405 (INCLUDED_ONLY) 0/1818 variables, 0/1261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 406 (OVERLAPS) 21/1839 variables, 8/1269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 407 (INCLUDED_ONLY) 0/1839 variables, 3/1272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 408 (INCLUDED_ONLY) 0/1839 variables, 0/1272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 409 (OVERLAPS) 2/1841 variables, 1/1273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 410 (INCLUDED_ONLY) 0/1841 variables, 2/1275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 411 (INCLUDED_ONLY) 0/1841 variables, 0/1275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 412 (OVERLAPS) 23/1864 variables, 12/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 413 (INCLUDED_ONLY) 0/1864 variables, 3/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 414 (INCLUDED_ONLY) 0/1864 variables, 0/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 415 (OVERLAPS) 1/1865 variables, 1/1291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 416 (INCLUDED_ONLY) 0/1865 variables, 1/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 417 (INCLUDED_ONLY) 0/1865 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 418 (OVERLAPS) 2/1867 variables, 1/1293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 419 (INCLUDED_ONLY) 0/1867 variables, 2/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 420 (INCLUDED_ONLY) 0/1867 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 421 (OVERLAPS) 21/1888 variables, 8/1303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 422 (INCLUDED_ONLY) 0/1888 variables, 3/1306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 423 (INCLUDED_ONLY) 0/1888 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 424 (OVERLAPS) 2/1890 variables, 1/1307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 425 (INCLUDED_ONLY) 0/1890 variables, 2/1309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 426 (INCLUDED_ONLY) 0/1890 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 427 (OVERLAPS) 23/1913 variables, 12/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 428 (INCLUDED_ONLY) 0/1913 variables, 3/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 429 (INCLUDED_ONLY) 0/1913 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 430 (OVERLAPS) 1/1914 variables, 1/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 431 (INCLUDED_ONLY) 0/1914 variables, 1/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 432 (INCLUDED_ONLY) 0/1914 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 433 (OVERLAPS) 2/1916 variables, 1/1327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 434 (INCLUDED_ONLY) 0/1916 variables, 2/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 435 (INCLUDED_ONLY) 0/1916 variables, 0/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 436 (OVERLAPS) 20/1936 variables, 8/1337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 437 (INCLUDED_ONLY) 0/1936 variables, 3/1340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 438 (INCLUDED_ONLY) 0/1936 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 439 (OVERLAPS) 2/1938 variables, 1/1341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 440 (INCLUDED_ONLY) 0/1938 variables, 2/1343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 441 (INCLUDED_ONLY) 0/1938 variables, 0/1343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 442 (OVERLAPS) 18/1956 variables, 9/1352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 443 (INCLUDED_ONLY) 0/1956 variables, 2/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 444 (INCLUDED_ONLY) 0/1956 variables, 0/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 445 (OVERLAPS) 1/1957 variables, 1/1355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 446 (INCLUDED_ONLY) 0/1957 variables, 1/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 447 (INCLUDED_ONLY) 0/1957 variables, 0/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 448 (OVERLAPS) 2/1959 variables, 1/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 449 (INCLUDED_ONLY) 0/1959 variables, 2/1359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 450 (INCLUDED_ONLY) 0/1959 variables, 0/1359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 451 (OVERLAPS) 5/1964 variables, 4/1363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 452 (INCLUDED_ONLY) 0/1964 variables, 2/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:44:20] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 453 (INCLUDED_ONLY) 0/1964 variables, 1/1366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 454 (INCLUDED_ONLY) 0/1964 variables, 0/1366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 455 (OVERLAPS) 0/1964 variables, 0/1366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1964/1964 variables, and 1366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3883 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1002/1002 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 6814ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 759 ms.
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Partial Free-agglomeration rule applied 239 times.
Drop transitions (Partial Free agglomeration) removed 239 transitions
Iterating global reduction 0 with 239 rules applied. Total rules applied 239 place count 1002 transition count 962
Applied a total of 239 rules in 43 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1002/1002 places, 962/962 transitions.
RANDOM walk for 40000 steps (8 resets) in 749 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4508 steps, run visited all 1 properties in 61 ms. (steps per millisecond=73 )
Probabilistic random walk after 4508 steps, saw 4364 distinct states, run finished after 65 ms. (steps per millisecond=69 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 414 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 24 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2024-05-28 15:44:22] [INFO ] Invariant cache hit.
[2024-05-28 15:44:23] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-28 15:44:23] [INFO ] Invariant cache hit.
[2024-05-28 15:44:24] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1344 ms to find 0 implicit places.
[2024-05-28 15:44:24] [INFO ] Redundant transitions in 90 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-28 15:44:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 353/353 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:44:38] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 4 ms to minimize.
[2024-05-28 15:44:38] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 3 ms to minimize.
[2024-05-28 15:44:38] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 4 ms to minimize.
[2024-05-28 15:44:39] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 3 ms to minimize.
[2024-05-28 15:44:39] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 3 ms to minimize.
[2024-05-28 15:44:39] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 4 ms to minimize.
[2024-05-28 15:44:39] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 4 ms to minimize.
[2024-05-28 15:44:39] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 3 ms to minimize.
[2024-05-28 15:44:40] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 3 ms to minimize.
[2024-05-28 15:44:40] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 3 ms to minimize.
[2024-05-28 15:44:40] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-05-28 15:44:40] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-05-28 15:44:40] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:44:41] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 3 ms to minimize.
[2024-05-28 15:44:41] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-05-28 15:44:41] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:44:41] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 3 ms to minimize.
[2024-05-28 15:44:41] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 3 ms to minimize.
[2024-05-28 15:44:41] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-05-28 15:44:41] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/373 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:44:42] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-28 15:44:42] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 3 ms to minimize.
[2024-05-28 15:44:42] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 3 ms to minimize.
[2024-05-28 15:44:42] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-28 15:44:42] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-05-28 15:44:42] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-28 15:44:42] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-05-28 15:44:43] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:44:43] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-28 15:44:43] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:44:43] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:44:43] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-28 15:44:43] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-28 15:44:43] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-28 15:44:43] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:44:43] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-28 15:44:43] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:44:43] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:44:44] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:44:44] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/393 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:44:44] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:44:44] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 2 ms to minimize.
[2024-05-28 15:44:44] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:44:44] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:44:44] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:44:44] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:44:44] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:44:44] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-28 15:44:44] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-28 15:44:44] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 15:44:44] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:44:45] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 15:44:45] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:44:45] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 15:44:45] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 15:44:45] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:44:45] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 15:44:45] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 15:44:45] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 15:44:46] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/413 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1964 variables, and 413 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 353/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 353/353 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/413 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:44:55] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:44:55] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-28 15:44:55] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:44:55] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:44:55] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:44:56] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 15:44:56] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:44:56] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:44:56] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:44:56] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:44:56] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:44:57] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:44:57] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:44:57] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-28 15:44:57] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:44:58] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:44:58] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-05-28 15:44:58] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-28 15:44:58] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2024-05-28 15:44:58] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/433 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:45:00] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:45:00] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:45:01] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-28 15:45:01] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-28 15:45:01] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-28 15:45:01] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 1 ms to minimize.
[2024-05-28 15:45:01] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:45:02] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 3 ms to minimize.
[2024-05-28 15:45:02] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-28 15:45:02] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-05-28 15:45:02] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:45:03] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-05-28 15:45:03] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-05-28 15:45:03] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 3 ms to minimize.
[2024-05-28 15:45:03] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2024-05-28 15:45:04] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 3 ms to minimize.
[2024-05-28 15:45:04] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 3 ms to minimize.
[2024-05-28 15:45:04] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 3 ms to minimize.
[2024-05-28 15:45:04] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-05-28 15:45:05] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/453 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:45:06] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:45:06] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:45:06] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:45:06] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 15:45:06] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 15:45:08] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-28 15:45:08] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:45:09] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 3 ms to minimize.
[2024-05-28 15:45:09] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:45:09] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:45:10] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 2 ms to minimize.
[2024-05-28 15:45:10] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 3 ms to minimize.
[2024-05-28 15:45:10] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-05-28 15:45:11] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 6 ms to minimize.
[2024-05-28 15:45:11] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 3 ms to minimize.
[2024-05-28 15:45:11] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 3 ms to minimize.
[2024-05-28 15:45:12] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
[2024-05-28 15:45:12] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 4 ms to minimize.
[2024-05-28 15:45:12] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 3 ms to minimize.
[2024-05-28 15:45:13] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/473 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:45:14] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-28 15:45:14] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 15:45:15] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:45:15] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:45:15] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:45:15] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 15:45:16] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-28 15:45:17] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 3 ms to minimize.
[2024-05-28 15:45:17] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 3 ms to minimize.
[2024-05-28 15:45:17] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:45:20] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 4 ms to minimize.
[2024-05-28 15:45:20] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 4 ms to minimize.
[2024-05-28 15:45:20] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 4 ms to minimize.
[2024-05-28 15:45:21] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1964 variables, and 487 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 353/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 134/134 constraints]
After SMT, in 60221ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61693 ms. Remains : 1002/1002 places, 962/962 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1002 stabilizing places and 2/962 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 243 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (16 resets) in 399 ms. (100 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 220 ms. (181 steps per ms) remains 1/1 properties
[2024-05-28 15:45:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/24 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/59 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/117 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/119 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 63/182 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/188 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/188 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/188 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/190 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/190 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/190 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 67/257 variables, 32/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/257 variables, 9/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/257 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/261 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/261 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/261 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/265 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/265 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/265 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 65/330 variables, 28/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/330 variables, 9/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/330 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 5/335 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/335 variables, 5/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/335 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/337 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/337 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/337 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 67/404 variables, 32/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/404 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/404 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 4/408 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/408 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/408 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 4/412 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/412 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/412 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 65/477 variables, 28/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/477 variables, 9/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/477 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 5/482 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/482 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/482 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 2/484 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/484 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/484 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 67/551 variables, 32/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/551 variables, 9/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/551 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 4/555 variables, 3/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/555 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/555 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 4/559 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/559 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/559 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 65/624 variables, 28/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/624 variables, 9/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/624 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 5/629 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/629 variables, 5/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/629 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 2/631 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/631 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/631 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 67/698 variables, 32/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/698 variables, 9/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/698 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 4/702 variables, 3/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/702 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/702 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 4/706 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/706 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/706 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 65/771 variables, 28/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/771 variables, 9/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/771 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 5/776 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/776 variables, 5/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/776 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 2/778 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/778 variables, 2/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/778 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 49/827 variables, 28/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/827 variables, 8/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/827 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 2/829 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/829 variables, 2/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/829 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 4/833 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/833 variables, 4/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/833 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 26/859 variables, 12/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/859 variables, 5/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/859 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 2/861 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/861 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/861 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 23/884 variables, 12/604 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/884 variables, 3/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/884 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 1/885 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/885 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/885 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 2/887 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/887 variables, 2/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/887 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 21/908 variables, 8/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/908 variables, 3/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/908 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 2/910 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/910 variables, 2/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/910 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 23/933 variables, 12/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/933 variables, 3/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/933 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 1/934 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/934 variables, 1/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/934 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 2/936 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/936 variables, 2/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/936 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 21/957 variables, 8/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/957 variables, 3/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/957 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (OVERLAPS) 2/959 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/959 variables, 2/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/959 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 23/982 variables, 12/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/982 variables, 3/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/982 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (OVERLAPS) 1/983 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/983 variables, 1/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/983 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (OVERLAPS) 2/985 variables, 1/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/985 variables, 2/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/985 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (OVERLAPS) 21/1006 variables, 8/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1006 variables, 3/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1006 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (OVERLAPS) 2/1008 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1008 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1008 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (OVERLAPS) 23/1031 variables, 12/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1031 variables, 3/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1031 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (OVERLAPS) 1/1032 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1032 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1032 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (OVERLAPS) 2/1034 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1034 variables, 2/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1034 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (OVERLAPS) 21/1055 variables, 8/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1055 variables, 3/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1055 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (OVERLAPS) 2/1057 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1057 variables, 2/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1057 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (OVERLAPS) 23/1080 variables, 12/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1080 variables, 3/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1080 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (OVERLAPS) 1/1081 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1081 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1081 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (OVERLAPS) 2/1083 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1083 variables, 2/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/1083 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (OVERLAPS) 21/1104 variables, 8/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/1104 variables, 3/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1104 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (OVERLAPS) 2/1106 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/1106 variables, 2/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/1106 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (OVERLAPS) 23/1129 variables, 12/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1129 variables, 3/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/1129 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (OVERLAPS) 1/1130 variables, 1/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/1130 variables, 1/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/1130 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (OVERLAPS) 2/1132 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1132 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/1132 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (OVERLAPS) 21/1153 variables, 8/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/1153 variables, 3/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/1153 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (OVERLAPS) 2/1155 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1155 variables, 2/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/1155 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (OVERLAPS) 23/1178 variables, 12/808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/1178 variables, 3/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/1178 variables, 0/811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (OVERLAPS) 1/1179 variables, 1/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/1179 variables, 1/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/1179 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (OVERLAPS) 2/1181 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1181 variables, 2/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (INCLUDED_ONLY) 0/1181 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (OVERLAPS) 21/1202 variables, 8/824 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/1202 variables, 3/827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (INCLUDED_ONLY) 0/1202 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (OVERLAPS) 2/1204 variables, 1/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/1204 variables, 2/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (INCLUDED_ONLY) 0/1204 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 214 (OVERLAPS) 23/1227 variables, 12/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 215 (INCLUDED_ONLY) 0/1227 variables, 3/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 216 (INCLUDED_ONLY) 0/1227 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (OVERLAPS) 1/1228 variables, 1/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/1228 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 219 (INCLUDED_ONLY) 0/1228 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (OVERLAPS) 2/1230 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/1230 variables, 2/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (INCLUDED_ONLY) 0/1230 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 223 (OVERLAPS) 21/1251 variables, 8/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/1251 variables, 3/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 225 (INCLUDED_ONLY) 0/1251 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (OVERLAPS) 2/1253 variables, 1/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (INCLUDED_ONLY) 0/1253 variables, 2/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (INCLUDED_ONLY) 0/1253 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 229 (OVERLAPS) 23/1276 variables, 12/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/1276 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (INCLUDED_ONLY) 0/1276 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (OVERLAPS) 1/1277 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/1277 variables, 1/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (INCLUDED_ONLY) 0/1277 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (OVERLAPS) 2/1279 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/1279 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (INCLUDED_ONLY) 0/1279 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (OVERLAPS) 21/1300 variables, 8/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (INCLUDED_ONLY) 0/1300 variables, 3/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (INCLUDED_ONLY) 0/1300 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (OVERLAPS) 2/1302 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/1302 variables, 2/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 243 (INCLUDED_ONLY) 0/1302 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (OVERLAPS) 23/1325 variables, 12/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/1325 variables, 3/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (INCLUDED_ONLY) 0/1325 variables, 0/913 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (OVERLAPS) 1/1326 variables, 1/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/1326 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (INCLUDED_ONLY) 0/1326 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (OVERLAPS) 2/1328 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 251 (INCLUDED_ONLY) 0/1328 variables, 2/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 252 (INCLUDED_ONLY) 0/1328 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 253 (OVERLAPS) 21/1349 variables, 8/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 254 (INCLUDED_ONLY) 0/1349 variables, 3/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 255 (INCLUDED_ONLY) 0/1349 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 256 (OVERLAPS) 2/1351 variables, 1/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/1351 variables, 2/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 258 (INCLUDED_ONLY) 0/1351 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 259 (OVERLAPS) 23/1374 variables, 12/944 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/1374 variables, 3/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 261 (INCLUDED_ONLY) 0/1374 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 262 (OVERLAPS) 1/1375 variables, 1/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 263 (INCLUDED_ONLY) 0/1375 variables, 1/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 264 (INCLUDED_ONLY) 0/1375 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 265 (OVERLAPS) 2/1377 variables, 1/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/1377 variables, 2/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 267 (INCLUDED_ONLY) 0/1377 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 268 (OVERLAPS) 21/1398 variables, 8/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/1398 variables, 3/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 270 (INCLUDED_ONLY) 0/1398 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 271 (OVERLAPS) 2/1400 variables, 1/964 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/1400 variables, 2/966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 273 (INCLUDED_ONLY) 0/1400 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 274 (OVERLAPS) 23/1423 variables, 12/978 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 275 (INCLUDED_ONLY) 0/1423 variables, 3/981 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 276 (INCLUDED_ONLY) 0/1423 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 277 (OVERLAPS) 1/1424 variables, 1/982 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/1424 variables, 1/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 279 (INCLUDED_ONLY) 0/1424 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 280 (OVERLAPS) 2/1426 variables, 1/984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/1426 variables, 2/986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 282 (INCLUDED_ONLY) 0/1426 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 283 (OVERLAPS) 21/1447 variables, 8/994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/1447 variables, 3/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 285 (INCLUDED_ONLY) 0/1447 variables, 0/997 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 286 (OVERLAPS) 2/1449 variables, 1/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 287 (INCLUDED_ONLY) 0/1449 variables, 2/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 288 (INCLUDED_ONLY) 0/1449 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 289 (OVERLAPS) 23/1472 variables, 12/1012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/1472 variables, 3/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 291 (INCLUDED_ONLY) 0/1472 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 292 (OVERLAPS) 1/1473 variables, 1/1016 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/1473 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 294 (INCLUDED_ONLY) 0/1473 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 295 (OVERLAPS) 2/1475 variables, 1/1018 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 296 (INCLUDED_ONLY) 0/1475 variables, 2/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 297 (INCLUDED_ONLY) 0/1475 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 298 (OVERLAPS) 21/1496 variables, 8/1028 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 299 (INCLUDED_ONLY) 0/1496 variables, 3/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 300 (INCLUDED_ONLY) 0/1496 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 301 (OVERLAPS) 2/1498 variables, 1/1032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/1498 variables, 2/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 303 (INCLUDED_ONLY) 0/1498 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 304 (OVERLAPS) 23/1521 variables, 12/1046 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/1521 variables, 3/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 306 (INCLUDED_ONLY) 0/1521 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 307 (OVERLAPS) 1/1522 variables, 1/1050 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 308 (INCLUDED_ONLY) 0/1522 variables, 1/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 309 (INCLUDED_ONLY) 0/1522 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 310 (OVERLAPS) 2/1524 variables, 1/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 311 (INCLUDED_ONLY) 0/1524 variables, 2/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 312 (INCLUDED_ONLY) 0/1524 variables, 0/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 313 (OVERLAPS) 21/1545 variables, 8/1062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 314 (INCLUDED_ONLY) 0/1545 variables, 3/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 315 (INCLUDED_ONLY) 0/1545 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 316 (OVERLAPS) 2/1547 variables, 1/1066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 317 (INCLUDED_ONLY) 0/1547 variables, 2/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 318 (INCLUDED_ONLY) 0/1547 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 319 (OVERLAPS) 23/1570 variables, 12/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 320 (INCLUDED_ONLY) 0/1570 variables, 3/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 321 (INCLUDED_ONLY) 0/1570 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 322 (OVERLAPS) 1/1571 variables, 1/1084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 323 (INCLUDED_ONLY) 0/1571 variables, 1/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 324 (INCLUDED_ONLY) 0/1571 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 325 (OVERLAPS) 2/1573 variables, 1/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 326 (INCLUDED_ONLY) 0/1573 variables, 2/1088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 327 (INCLUDED_ONLY) 0/1573 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 328 (OVERLAPS) 21/1594 variables, 8/1096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 329 (INCLUDED_ONLY) 0/1594 variables, 3/1099 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 330 (INCLUDED_ONLY) 0/1594 variables, 0/1099 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 331 (OVERLAPS) 2/1596 variables, 1/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 332 (INCLUDED_ONLY) 0/1596 variables, 2/1102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 333 (INCLUDED_ONLY) 0/1596 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 334 (OVERLAPS) 23/1619 variables, 12/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 335 (INCLUDED_ONLY) 0/1619 variables, 3/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 336 (INCLUDED_ONLY) 0/1619 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 337 (OVERLAPS) 1/1620 variables, 1/1118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 338 (INCLUDED_ONLY) 0/1620 variables, 1/1119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 339 (INCLUDED_ONLY) 0/1620 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 340 (OVERLAPS) 2/1622 variables, 1/1120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 341 (INCLUDED_ONLY) 0/1622 variables, 2/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 342 (INCLUDED_ONLY) 0/1622 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 343 (OVERLAPS) 21/1643 variables, 8/1130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 344 (INCLUDED_ONLY) 0/1643 variables, 3/1133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 345 (INCLUDED_ONLY) 0/1643 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 346 (OVERLAPS) 2/1645 variables, 1/1134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 347 (INCLUDED_ONLY) 0/1645 variables, 2/1136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 348 (INCLUDED_ONLY) 0/1645 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 349 (OVERLAPS) 23/1668 variables, 12/1148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 350 (INCLUDED_ONLY) 0/1668 variables, 3/1151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 351 (INCLUDED_ONLY) 0/1668 variables, 0/1151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 352 (OVERLAPS) 1/1669 variables, 1/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 353 (INCLUDED_ONLY) 0/1669 variables, 1/1153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 354 (INCLUDED_ONLY) 0/1669 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 355 (OVERLAPS) 2/1671 variables, 1/1154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 356 (INCLUDED_ONLY) 0/1671 variables, 2/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 357 (INCLUDED_ONLY) 0/1671 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 358 (OVERLAPS) 21/1692 variables, 8/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 359 (INCLUDED_ONLY) 0/1692 variables, 3/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 360 (INCLUDED_ONLY) 0/1692 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 361 (OVERLAPS) 2/1694 variables, 1/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 362 (INCLUDED_ONLY) 0/1694 variables, 2/1170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 363 (INCLUDED_ONLY) 0/1694 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 364 (OVERLAPS) 23/1717 variables, 12/1182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 365 (INCLUDED_ONLY) 0/1717 variables, 3/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 366 (INCLUDED_ONLY) 0/1717 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 367 (OVERLAPS) 1/1718 variables, 1/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 368 (INCLUDED_ONLY) 0/1718 variables, 1/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 369 (INCLUDED_ONLY) 0/1718 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 370 (OVERLAPS) 2/1720 variables, 1/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 371 (INCLUDED_ONLY) 0/1720 variables, 2/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 372 (INCLUDED_ONLY) 0/1720 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 373 (OVERLAPS) 21/1741 variables, 8/1198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 374 (INCLUDED_ONLY) 0/1741 variables, 3/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 375 (INCLUDED_ONLY) 0/1741 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 376 (OVERLAPS) 2/1743 variables, 1/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 377 (INCLUDED_ONLY) 0/1743 variables, 2/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 378 (INCLUDED_ONLY) 0/1743 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 379 (OVERLAPS) 23/1766 variables, 12/1216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 380 (INCLUDED_ONLY) 0/1766 variables, 3/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 381 (INCLUDED_ONLY) 0/1766 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 382 (OVERLAPS) 1/1767 variables, 1/1220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 383 (INCLUDED_ONLY) 0/1767 variables, 1/1221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 384 (INCLUDED_ONLY) 0/1767 variables, 0/1221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 385 (OVERLAPS) 2/1769 variables, 1/1222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 386 (INCLUDED_ONLY) 0/1769 variables, 2/1224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 387 (INCLUDED_ONLY) 0/1769 variables, 0/1224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 388 (OVERLAPS) 21/1790 variables, 8/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 389 (INCLUDED_ONLY) 0/1790 variables, 3/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 390 (INCLUDED_ONLY) 0/1790 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 391 (OVERLAPS) 2/1792 variables, 1/1236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 392 (INCLUDED_ONLY) 0/1792 variables, 2/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 393 (INCLUDED_ONLY) 0/1792 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 394 (OVERLAPS) 23/1815 variables, 12/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 395 (INCLUDED_ONLY) 0/1815 variables, 3/1253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 396 (INCLUDED_ONLY) 0/1815 variables, 0/1253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 397 (OVERLAPS) 1/1816 variables, 1/1254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 398 (INCLUDED_ONLY) 0/1816 variables, 1/1255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 399 (INCLUDED_ONLY) 0/1816 variables, 0/1255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 400 (OVERLAPS) 2/1818 variables, 1/1256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 401 (INCLUDED_ONLY) 0/1818 variables, 2/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 402 (INCLUDED_ONLY) 0/1818 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 403 (OVERLAPS) 21/1839 variables, 8/1266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 404 (INCLUDED_ONLY) 0/1839 variables, 3/1269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 405 (INCLUDED_ONLY) 0/1839 variables, 0/1269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 406 (OVERLAPS) 2/1841 variables, 1/1270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 407 (INCLUDED_ONLY) 0/1841 variables, 2/1272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 408 (INCLUDED_ONLY) 0/1841 variables, 0/1272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 409 (OVERLAPS) 23/1864 variables, 12/1284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 410 (INCLUDED_ONLY) 0/1864 variables, 3/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 411 (INCLUDED_ONLY) 0/1864 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 412 (OVERLAPS) 1/1865 variables, 1/1288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 413 (INCLUDED_ONLY) 0/1865 variables, 1/1289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 414 (INCLUDED_ONLY) 0/1865 variables, 0/1289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 415 (OVERLAPS) 2/1867 variables, 1/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 416 (INCLUDED_ONLY) 0/1867 variables, 2/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 417 (INCLUDED_ONLY) 0/1867 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 418 (OVERLAPS) 21/1888 variables, 8/1300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 419 (INCLUDED_ONLY) 0/1888 variables, 3/1303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 420 (INCLUDED_ONLY) 0/1888 variables, 0/1303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 421 (OVERLAPS) 2/1890 variables, 1/1304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 422 (INCLUDED_ONLY) 0/1890 variables, 2/1306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 423 (INCLUDED_ONLY) 0/1890 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 424 (OVERLAPS) 23/1913 variables, 12/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 425 (INCLUDED_ONLY) 0/1913 variables, 3/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 426 (INCLUDED_ONLY) 0/1913 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 427 (OVERLAPS) 1/1914 variables, 1/1322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 428 (INCLUDED_ONLY) 0/1914 variables, 1/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 429 (INCLUDED_ONLY) 0/1914 variables, 0/1323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 430 (OVERLAPS) 2/1916 variables, 1/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 431 (INCLUDED_ONLY) 0/1916 variables, 2/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 432 (INCLUDED_ONLY) 0/1916 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 433 (OVERLAPS) 20/1936 variables, 8/1334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 434 (INCLUDED_ONLY) 0/1936 variables, 3/1337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 435 (INCLUDED_ONLY) 0/1936 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 436 (OVERLAPS) 2/1938 variables, 1/1338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 437 (INCLUDED_ONLY) 0/1938 variables, 2/1340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 438 (INCLUDED_ONLY) 0/1938 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 439 (OVERLAPS) 18/1956 variables, 9/1349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 440 (INCLUDED_ONLY) 0/1956 variables, 2/1351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 441 (INCLUDED_ONLY) 0/1956 variables, 0/1351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 442 (OVERLAPS) 1/1957 variables, 1/1352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 443 (INCLUDED_ONLY) 0/1957 variables, 1/1353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 444 (INCLUDED_ONLY) 0/1957 variables, 0/1353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 445 (OVERLAPS) 2/1959 variables, 1/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 446 (INCLUDED_ONLY) 0/1959 variables, 2/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 447 (INCLUDED_ONLY) 0/1959 variables, 0/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 448 (OVERLAPS) 5/1964 variables, 4/1360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 449 (INCLUDED_ONLY) 0/1964 variables, 2/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 450 (INCLUDED_ONLY) 0/1964 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 451 (OVERLAPS) 0/1964 variables, 0/1362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1964/1964 variables, and 1362 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2980 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1002/1002 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/24 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:45:28] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 35/59 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 58/117 variables, 28/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/117 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/119 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/119 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 63/182 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/182 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/182 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/188 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/188 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/188 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/190 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/190 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/190 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 67/257 variables, 32/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/257 variables, 9/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/257 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/261 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/261 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/261 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 4/265 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/265 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/265 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 65/330 variables, 28/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/330 variables, 9/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/330 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 5/335 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/335 variables, 5/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/335 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 2/337 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/337 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/337 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 67/404 variables, 32/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/404 variables, 9/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/404 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 4/408 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/408 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/408 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 4/412 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/412 variables, 4/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/412 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 65/477 variables, 28/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/477 variables, 9/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/477 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 5/482 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/482 variables, 5/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/482 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 2/484 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/484 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/484 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 67/551 variables, 32/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/551 variables, 9/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/551 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 4/555 variables, 3/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/555 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/555 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 4/559 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/559 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/559 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 65/624 variables, 28/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/624 variables, 9/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/624 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 5/629 variables, 3/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/629 variables, 5/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/629 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 2/631 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/631 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/631 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 67/698 variables, 32/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/698 variables, 9/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/698 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 4/702 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/702 variables, 4/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/702 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 4/706 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/706 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/706 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 65/771 variables, 28/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/771 variables, 9/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/771 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 5/776 variables, 3/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/776 variables, 5/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/776 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 2/778 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/778 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/778 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 49/827 variables, 28/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/827 variables, 8/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/827 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 2/829 variables, 2/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/829 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/829 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 4/833 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/833 variables, 4/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/833 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 26/859 variables, 12/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/859 variables, 5/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/859 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 2/861 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/861 variables, 2/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/861 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 23/884 variables, 12/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/884 variables, 3/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/884 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 1/885 variables, 1/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/885 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/885 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 2/887 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/887 variables, 2/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/887 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 21/908 variables, 8/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/908 variables, 3/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/908 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 2/910 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/910 variables, 2/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/910 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 23/933 variables, 12/640 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/933 variables, 3/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/933 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (OVERLAPS) 1/934 variables, 1/644 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/934 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/934 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (OVERLAPS) 2/936 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/936 variables, 2/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/936 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 21/957 variables, 8/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/957 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/957 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (OVERLAPS) 2/959 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/959 variables, 2/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/959 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (OVERLAPS) 23/982 variables, 12/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/982 variables, 3/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/982 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (OVERLAPS) 1/983 variables, 1/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/983 variables, 1/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/983 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (OVERLAPS) 2/985 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/985 variables, 2/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/985 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (OVERLAPS) 21/1006 variables, 8/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1006 variables, 3/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1006 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (OVERLAPS) 2/1008 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1008 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1008 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (OVERLAPS) 23/1031 variables, 12/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1031 variables, 3/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1031 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (OVERLAPS) 1/1032 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1032 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1032 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (OVERLAPS) 2/1034 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1034 variables, 2/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1034 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (OVERLAPS) 21/1055 variables, 8/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1055 variables, 3/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1055 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (OVERLAPS) 2/1057 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1057 variables, 2/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1057 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (OVERLAPS) 23/1080 variables, 12/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1080 variables, 3/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1080 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (OVERLAPS) 1/1081 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/1081 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1081 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (OVERLAPS) 2/1083 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/1083 variables, 2/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/1083 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (OVERLAPS) 21/1104 variables, 8/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/1104 variables, 3/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/1104 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (OVERLAPS) 2/1106 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/1106 variables, 2/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1106 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (OVERLAPS) 23/1129 variables, 12/776 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/1129 variables, 3/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/1129 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (OVERLAPS) 1/1130 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/1130 variables, 1/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1130 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (OVERLAPS) 2/1132 variables, 1/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/1132 variables, 2/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/1132 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (OVERLAPS) 21/1153 variables, 8/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/1153 variables, 3/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1153 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (OVERLAPS) 2/1155 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/1155 variables, 2/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/1155 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (OVERLAPS) 23/1178 variables, 12/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/1178 variables, 3/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/1178 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (OVERLAPS) 1/1179 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/1179 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1179 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (OVERLAPS) 2/1181 variables, 1/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/1181 variables, 2/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/1181 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 210 (OVERLAPS) 21/1202 variables, 8/826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 211 (INCLUDED_ONLY) 0/1202 variables, 3/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/1202 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 213 (OVERLAPS) 2/1204 variables, 1/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 214 (INCLUDED_ONLY) 0/1204 variables, 2/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 215 (INCLUDED_ONLY) 0/1204 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 216 (OVERLAPS) 23/1227 variables, 12/844 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 217 (INCLUDED_ONLY) 0/1227 variables, 3/847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 218 (INCLUDED_ONLY) 0/1227 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 219 (OVERLAPS) 1/1228 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 220 (INCLUDED_ONLY) 0/1228 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 221 (INCLUDED_ONLY) 0/1228 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 222 (OVERLAPS) 2/1230 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 223 (INCLUDED_ONLY) 0/1230 variables, 2/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 224 (INCLUDED_ONLY) 0/1230 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 225 (OVERLAPS) 21/1251 variables, 8/860 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 226 (INCLUDED_ONLY) 0/1251 variables, 3/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 227 (INCLUDED_ONLY) 0/1251 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 228 (OVERLAPS) 2/1253 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 229 (INCLUDED_ONLY) 0/1253 variables, 2/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 230 (INCLUDED_ONLY) 0/1253 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 231 (OVERLAPS) 23/1276 variables, 12/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 232 (INCLUDED_ONLY) 0/1276 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 233 (INCLUDED_ONLY) 0/1276 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 234 (OVERLAPS) 1/1277 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 235 (INCLUDED_ONLY) 0/1277 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 236 (INCLUDED_ONLY) 0/1277 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 237 (OVERLAPS) 2/1279 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 238 (INCLUDED_ONLY) 0/1279 variables, 2/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 239 (INCLUDED_ONLY) 0/1279 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 240 (OVERLAPS) 21/1300 variables, 8/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 241 (INCLUDED_ONLY) 0/1300 variables, 3/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 242 (INCLUDED_ONLY) 0/1300 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 243 (OVERLAPS) 2/1302 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 244 (INCLUDED_ONLY) 0/1302 variables, 2/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 245 (INCLUDED_ONLY) 0/1302 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 246 (OVERLAPS) 23/1325 variables, 12/912 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 247 (INCLUDED_ONLY) 0/1325 variables, 3/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 248 (INCLUDED_ONLY) 0/1325 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 249 (OVERLAPS) 1/1326 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 250 (INCLUDED_ONLY) 0/1326 variables, 1/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 251 (INCLUDED_ONLY) 0/1326 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 252 (OVERLAPS) 2/1328 variables, 1/918 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 253 (INCLUDED_ONLY) 0/1328 variables, 2/920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 254 (INCLUDED_ONLY) 0/1328 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 255 (OVERLAPS) 21/1349 variables, 8/928 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 256 (INCLUDED_ONLY) 0/1349 variables, 3/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 257 (INCLUDED_ONLY) 0/1349 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 258 (OVERLAPS) 2/1351 variables, 1/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 259 (INCLUDED_ONLY) 0/1351 variables, 2/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 260 (INCLUDED_ONLY) 0/1351 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 261 (OVERLAPS) 23/1374 variables, 12/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 262 (INCLUDED_ONLY) 0/1374 variables, 3/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 263 (INCLUDED_ONLY) 0/1374 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 264 (OVERLAPS) 1/1375 variables, 1/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 265 (INCLUDED_ONLY) 0/1375 variables, 1/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 266 (INCLUDED_ONLY) 0/1375 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 267 (OVERLAPS) 2/1377 variables, 1/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 268 (INCLUDED_ONLY) 0/1377 variables, 2/954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 269 (INCLUDED_ONLY) 0/1377 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 270 (OVERLAPS) 21/1398 variables, 8/962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 271 (INCLUDED_ONLY) 0/1398 variables, 3/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 272 (INCLUDED_ONLY) 0/1398 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 273 (OVERLAPS) 2/1400 variables, 1/966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 274 (INCLUDED_ONLY) 0/1400 variables, 2/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 275 (INCLUDED_ONLY) 0/1400 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 276 (OVERLAPS) 23/1423 variables, 12/980 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 277 (INCLUDED_ONLY) 0/1423 variables, 3/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 278 (INCLUDED_ONLY) 0/1423 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 279 (OVERLAPS) 1/1424 variables, 1/984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 280 (INCLUDED_ONLY) 0/1424 variables, 1/985 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 281 (INCLUDED_ONLY) 0/1424 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 282 (OVERLAPS) 2/1426 variables, 1/986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 283 (INCLUDED_ONLY) 0/1426 variables, 2/988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 284 (INCLUDED_ONLY) 0/1426 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 285 (OVERLAPS) 21/1447 variables, 8/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 286 (INCLUDED_ONLY) 0/1447 variables, 3/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 287 (INCLUDED_ONLY) 0/1447 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 288 (OVERLAPS) 2/1449 variables, 1/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 289 (INCLUDED_ONLY) 0/1449 variables, 2/1002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 290 (INCLUDED_ONLY) 0/1449 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 291 (OVERLAPS) 23/1472 variables, 12/1014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 292 (INCLUDED_ONLY) 0/1472 variables, 3/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 293 (INCLUDED_ONLY) 0/1472 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 294 (OVERLAPS) 1/1473 variables, 1/1018 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 295 (INCLUDED_ONLY) 0/1473 variables, 1/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 296 (INCLUDED_ONLY) 0/1473 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 297 (OVERLAPS) 2/1475 variables, 1/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 298 (INCLUDED_ONLY) 0/1475 variables, 2/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 299 (INCLUDED_ONLY) 0/1475 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 300 (OVERLAPS) 21/1496 variables, 8/1030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 301 (INCLUDED_ONLY) 0/1496 variables, 3/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 302 (INCLUDED_ONLY) 0/1496 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 303 (OVERLAPS) 2/1498 variables, 1/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 304 (INCLUDED_ONLY) 0/1498 variables, 2/1036 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 305 (INCLUDED_ONLY) 0/1498 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 306 (OVERLAPS) 23/1521 variables, 12/1048 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 307 (INCLUDED_ONLY) 0/1521 variables, 3/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 308 (INCLUDED_ONLY) 0/1521 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 309 (OVERLAPS) 1/1522 variables, 1/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 310 (INCLUDED_ONLY) 0/1522 variables, 1/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 311 (INCLUDED_ONLY) 0/1522 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 312 (OVERLAPS) 2/1524 variables, 1/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 313 (INCLUDED_ONLY) 0/1524 variables, 2/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 314 (INCLUDED_ONLY) 0/1524 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 315 (OVERLAPS) 21/1545 variables, 8/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 316 (INCLUDED_ONLY) 0/1545 variables, 3/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 317 (INCLUDED_ONLY) 0/1545 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 318 (OVERLAPS) 2/1547 variables, 1/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 319 (INCLUDED_ONLY) 0/1547 variables, 2/1070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 320 (INCLUDED_ONLY) 0/1547 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 321 (OVERLAPS) 23/1570 variables, 12/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 322 (INCLUDED_ONLY) 0/1570 variables, 3/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 323 (INCLUDED_ONLY) 0/1570 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 324 (OVERLAPS) 1/1571 variables, 1/1086 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 325 (INCLUDED_ONLY) 0/1571 variables, 1/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 326 (INCLUDED_ONLY) 0/1571 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 327 (OVERLAPS) 2/1573 variables, 1/1088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 328 (INCLUDED_ONLY) 0/1573 variables, 2/1090 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 329 (INCLUDED_ONLY) 0/1573 variables, 0/1090 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 330 (OVERLAPS) 21/1594 variables, 8/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 331 (INCLUDED_ONLY) 0/1594 variables, 3/1101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 332 (INCLUDED_ONLY) 0/1594 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 333 (OVERLAPS) 2/1596 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 334 (INCLUDED_ONLY) 0/1596 variables, 2/1104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 335 (INCLUDED_ONLY) 0/1596 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 336 (OVERLAPS) 23/1619 variables, 12/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 337 (INCLUDED_ONLY) 0/1619 variables, 3/1119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 338 (INCLUDED_ONLY) 0/1619 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 339 (OVERLAPS) 1/1620 variables, 1/1120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 340 (INCLUDED_ONLY) 0/1620 variables, 1/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 341 (INCLUDED_ONLY) 0/1620 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 342 (OVERLAPS) 2/1622 variables, 1/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 343 (INCLUDED_ONLY) 0/1622 variables, 2/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 344 (INCLUDED_ONLY) 0/1622 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 345 (OVERLAPS) 21/1643 variables, 8/1132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 346 (INCLUDED_ONLY) 0/1643 variables, 3/1135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 347 (INCLUDED_ONLY) 0/1643 variables, 0/1135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 348 (OVERLAPS) 2/1645 variables, 1/1136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 349 (INCLUDED_ONLY) 0/1645 variables, 2/1138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 350 (INCLUDED_ONLY) 0/1645 variables, 0/1138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 351 (OVERLAPS) 23/1668 variables, 12/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 352 (INCLUDED_ONLY) 0/1668 variables, 3/1153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 353 (INCLUDED_ONLY) 0/1668 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 354 (OVERLAPS) 1/1669 variables, 1/1154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 355 (INCLUDED_ONLY) 0/1669 variables, 1/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 356 (INCLUDED_ONLY) 0/1669 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 357 (OVERLAPS) 2/1671 variables, 1/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 358 (INCLUDED_ONLY) 0/1671 variables, 2/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 359 (INCLUDED_ONLY) 0/1671 variables, 0/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 360 (OVERLAPS) 21/1692 variables, 8/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 361 (INCLUDED_ONLY) 0/1692 variables, 3/1169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:45:30] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 362 (INCLUDED_ONLY) 0/1692 variables, 1/1170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 363 (INCLUDED_ONLY) 0/1692 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 364 (OVERLAPS) 2/1694 variables, 1/1171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 365 (INCLUDED_ONLY) 0/1694 variables, 2/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 366 (INCLUDED_ONLY) 0/1694 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 367 (OVERLAPS) 23/1717 variables, 12/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 368 (INCLUDED_ONLY) 0/1717 variables, 3/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 369 (INCLUDED_ONLY) 0/1717 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 370 (OVERLAPS) 1/1718 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 371 (INCLUDED_ONLY) 0/1718 variables, 1/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 372 (INCLUDED_ONLY) 0/1718 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 373 (OVERLAPS) 2/1720 variables, 1/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 374 (INCLUDED_ONLY) 0/1720 variables, 2/1193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 375 (INCLUDED_ONLY) 0/1720 variables, 0/1193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 376 (OVERLAPS) 21/1741 variables, 8/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 377 (INCLUDED_ONLY) 0/1741 variables, 3/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 378 (INCLUDED_ONLY) 0/1741 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 379 (OVERLAPS) 2/1743 variables, 1/1205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 380 (INCLUDED_ONLY) 0/1743 variables, 2/1207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 381 (INCLUDED_ONLY) 0/1743 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 382 (OVERLAPS) 23/1766 variables, 12/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 383 (INCLUDED_ONLY) 0/1766 variables, 3/1222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 384 (INCLUDED_ONLY) 0/1766 variables, 0/1222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 385 (OVERLAPS) 1/1767 variables, 1/1223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 386 (INCLUDED_ONLY) 0/1767 variables, 1/1224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 387 (INCLUDED_ONLY) 0/1767 variables, 0/1224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 388 (OVERLAPS) 2/1769 variables, 1/1225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 389 (INCLUDED_ONLY) 0/1769 variables, 2/1227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 390 (INCLUDED_ONLY) 0/1769 variables, 0/1227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 391 (OVERLAPS) 21/1790 variables, 8/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 392 (INCLUDED_ONLY) 0/1790 variables, 3/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 393 (INCLUDED_ONLY) 0/1790 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 394 (OVERLAPS) 2/1792 variables, 1/1239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 395 (INCLUDED_ONLY) 0/1792 variables, 2/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 396 (INCLUDED_ONLY) 0/1792 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 397 (OVERLAPS) 23/1815 variables, 12/1253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 398 (INCLUDED_ONLY) 0/1815 variables, 3/1256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 399 (INCLUDED_ONLY) 0/1815 variables, 0/1256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 400 (OVERLAPS) 1/1816 variables, 1/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 401 (INCLUDED_ONLY) 0/1816 variables, 1/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 402 (INCLUDED_ONLY) 0/1816 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 403 (OVERLAPS) 2/1818 variables, 1/1259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 404 (INCLUDED_ONLY) 0/1818 variables, 2/1261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 405 (INCLUDED_ONLY) 0/1818 variables, 0/1261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 406 (OVERLAPS) 21/1839 variables, 8/1269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 407 (INCLUDED_ONLY) 0/1839 variables, 3/1272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 408 (INCLUDED_ONLY) 0/1839 variables, 0/1272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 409 (OVERLAPS) 2/1841 variables, 1/1273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 410 (INCLUDED_ONLY) 0/1841 variables, 2/1275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 411 (INCLUDED_ONLY) 0/1841 variables, 0/1275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 412 (OVERLAPS) 23/1864 variables, 12/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 413 (INCLUDED_ONLY) 0/1864 variables, 3/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 414 (INCLUDED_ONLY) 0/1864 variables, 0/1290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 415 (OVERLAPS) 1/1865 variables, 1/1291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 416 (INCLUDED_ONLY) 0/1865 variables, 1/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 417 (INCLUDED_ONLY) 0/1865 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 418 (OVERLAPS) 2/1867 variables, 1/1293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 419 (INCLUDED_ONLY) 0/1867 variables, 2/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 420 (INCLUDED_ONLY) 0/1867 variables, 0/1295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 421 (OVERLAPS) 21/1888 variables, 8/1303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 422 (INCLUDED_ONLY) 0/1888 variables, 3/1306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 423 (INCLUDED_ONLY) 0/1888 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 424 (OVERLAPS) 2/1890 variables, 1/1307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 425 (INCLUDED_ONLY) 0/1890 variables, 2/1309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 426 (INCLUDED_ONLY) 0/1890 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 427 (OVERLAPS) 23/1913 variables, 12/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 428 (INCLUDED_ONLY) 0/1913 variables, 3/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 429 (INCLUDED_ONLY) 0/1913 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 430 (OVERLAPS) 1/1914 variables, 1/1325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 431 (INCLUDED_ONLY) 0/1914 variables, 1/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 432 (INCLUDED_ONLY) 0/1914 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 433 (OVERLAPS) 2/1916 variables, 1/1327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 434 (INCLUDED_ONLY) 0/1916 variables, 2/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 435 (INCLUDED_ONLY) 0/1916 variables, 0/1329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 436 (OVERLAPS) 20/1936 variables, 8/1337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 437 (INCLUDED_ONLY) 0/1936 variables, 3/1340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 438 (INCLUDED_ONLY) 0/1936 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 439 (OVERLAPS) 2/1938 variables, 1/1341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 440 (INCLUDED_ONLY) 0/1938 variables, 2/1343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 441 (INCLUDED_ONLY) 0/1938 variables, 0/1343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 442 (OVERLAPS) 18/1956 variables, 9/1352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 443 (INCLUDED_ONLY) 0/1956 variables, 2/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 444 (INCLUDED_ONLY) 0/1956 variables, 0/1354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 445 (OVERLAPS) 1/1957 variables, 1/1355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 446 (INCLUDED_ONLY) 0/1957 variables, 1/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 447 (INCLUDED_ONLY) 0/1957 variables, 0/1356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 448 (OVERLAPS) 2/1959 variables, 1/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 449 (INCLUDED_ONLY) 0/1959 variables, 2/1359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 450 (INCLUDED_ONLY) 0/1959 variables, 0/1359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 451 (OVERLAPS) 5/1964 variables, 4/1363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 452 (INCLUDED_ONLY) 0/1964 variables, 2/1365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:45:31] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
At refinement iteration 453 (INCLUDED_ONLY) 0/1964 variables, 1/1366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 454 (INCLUDED_ONLY) 0/1964 variables, 0/1366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 455 (OVERLAPS) 0/1964 variables, 0/1366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1964/1964 variables, and 1366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3821 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1002/1002 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 6812ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 730 ms.
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Partial Free-agglomeration rule applied 239 times.
Drop transitions (Partial Free agglomeration) removed 239 transitions
Iterating global reduction 0 with 239 rules applied. Total rules applied 239 place count 1002 transition count 962
Applied a total of 239 rules in 42 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1002/1002 places, 962/962 transitions.
RANDOM walk for 40000 steps (8 resets) in 681 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 263 ms. (151 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4508 steps, run visited all 1 properties in 49 ms. (steps per millisecond=92 )
Probabilistic random walk after 4508 steps, saw 4364 distinct states, run finished after 50 ms. (steps per millisecond=90 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 381 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 48 reset in 770 ms.
Product exploration explored 100000 steps with 48 reset in 916 ms.
Built C files in :
/tmp/ltsmin17749964886411244176
[2024-05-28 15:45:35] [INFO ] Computing symmetric may disable matrix : 962 transitions.
[2024-05-28 15:45:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:45:35] [INFO ] Computing symmetric may enable matrix : 962 transitions.
[2024-05-28 15:45:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:45:35] [INFO ] Computing Do-Not-Accords matrix : 962 transitions.
[2024-05-28 15:45:35] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:45:35] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17749964886411244176
Running compilation step : cd /tmp/ltsmin17749964886411244176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17749964886411244176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17749964886411244176;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 19 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2024-05-28 15:45:38] [INFO ] Invariant cache hit.
[2024-05-28 15:45:38] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-28 15:45:38] [INFO ] Invariant cache hit.
[2024-05-28 15:45:39] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
[2024-05-28 15:45:39] [INFO ] Redundant transitions in 91 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-28 15:45:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 353/353 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:45:54] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 5 ms to minimize.
[2024-05-28 15:45:54] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 4 ms to minimize.
[2024-05-28 15:45:54] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 3 ms to minimize.
[2024-05-28 15:45:54] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 4 ms to minimize.
[2024-05-28 15:45:54] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 4 ms to minimize.
[2024-05-28 15:45:55] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 4 ms to minimize.
[2024-05-28 15:45:55] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 3 ms to minimize.
[2024-05-28 15:45:55] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 3 ms to minimize.
[2024-05-28 15:45:55] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 3 ms to minimize.
[2024-05-28 15:45:55] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 4 ms to minimize.
[2024-05-28 15:45:56] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-05-28 15:45:56] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 3 ms to minimize.
[2024-05-28 15:45:56] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 3 ms to minimize.
[2024-05-28 15:45:56] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-05-28 15:45:56] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-05-28 15:45:56] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-05-28 15:45:57] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:45:57] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2024-05-28 15:45:57] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-05-28 15:45:57] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/373 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:45:57] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-05-28 15:45:57] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-05-28 15:45:58] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-28 15:45:58] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 3 ms to minimize.
[2024-05-28 15:45:58] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-28 15:45:58] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:45:58] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-28 15:45:58] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 15:45:58] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:45:58] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-28 15:45:59] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-28 15:45:59] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:45:59] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:45:59] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:45:59] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:45:59] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-28 15:45:59] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:45:59] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:45:59] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:45:59] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/393 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:45:59] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:46:00] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:46:00] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:46:00] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:46:00] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:46:00] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:46:00] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:46:00] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:46:00] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-28 15:46:00] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-28 15:46:00] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 15:46:00] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 15:46:00] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 15:46:00] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 15:46:01] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:46:01] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 15:46:01] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 15:46:01] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 15:46:01] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:46:01] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/413 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1964 variables, and 413 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 353/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 353/353 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/413 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:46:11] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 15:46:12] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-28 15:46:12] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:46:12] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:46:12] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:46:12] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:46:13] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:46:13] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:46:13] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:46:13] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:46:13] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-28 15:46:14] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-28 15:46:14] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-28 15:46:14] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/433 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:46:15] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:46:16] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:46:16] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-28 15:46:16] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-28 15:46:17] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:46:17] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-28 15:46:17] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-28 15:46:17] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2024-05-28 15:46:17] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 3 ms to minimize.
[2024-05-28 15:46:18] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-05-28 15:46:18] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:46:18] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:46:18] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 2 ms to minimize.
[2024-05-28 15:46:19] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:46:19] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-05-28 15:46:19] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 2 ms to minimize.
[2024-05-28 15:46:20] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 3 ms to minimize.
[2024-05-28 15:46:20] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 3 ms to minimize.
[2024-05-28 15:46:20] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 3 ms to minimize.
[2024-05-28 15:46:20] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/453 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:46:22] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:46:22] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:46:22] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:46:22] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:46:22] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 15:46:23] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-28 15:46:23] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:46:25] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 3 ms to minimize.
[2024-05-28 15:46:25] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 2 ms to minimize.
[2024-05-28 15:46:25] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-05-28 15:46:26] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 3 ms to minimize.
[2024-05-28 15:46:26] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-05-28 15:46:26] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 3 ms to minimize.
[2024-05-28 15:46:26] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 3 ms to minimize.
[2024-05-28 15:46:27] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 3 ms to minimize.
[2024-05-28 15:46:27] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 3 ms to minimize.
[2024-05-28 15:46:27] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 3 ms to minimize.
[2024-05-28 15:46:28] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 3 ms to minimize.
[2024-05-28 15:46:28] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 4 ms to minimize.
[2024-05-28 15:46:29] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/473 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:46:30] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:46:30] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 15:46:30] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:46:31] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-28 15:46:31] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:46:31] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:46:31] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2024-05-28 15:46:32] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 3 ms to minimize.
[2024-05-28 15:46:33] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 2 ms to minimize.
[2024-05-28 15:46:33] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 2 ms to minimize.
[2024-05-28 15:46:35] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
[2024-05-28 15:46:36] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 3 ms to minimize.
[2024-05-28 15:46:36] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 3 ms to minimize.
[2024-05-28 15:46:37] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 4 ms to minimize.
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 1001/1964 variables, and 487 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 353/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 134/134 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61728 ms. Remains : 1002/1002 places, 962/962 transitions.
Built C files in :
/tmp/ltsmin11912395665600137509
[2024-05-28 15:46:40] [INFO ] Computing symmetric may disable matrix : 962 transitions.
[2024-05-28 15:46:40] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:46:40] [INFO ] Computing symmetric may enable matrix : 962 transitions.
[2024-05-28 15:46:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:46:40] [INFO ] Computing Do-Not-Accords matrix : 962 transitions.
[2024-05-28 15:46:40] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:46:40] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11912395665600137509
Running compilation step : cd /tmp/ltsmin11912395665600137509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11912395665600137509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11912395665600137509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 15:46:43] [INFO ] Flatten gal took : 33 ms
[2024-05-28 15:46:43] [INFO ] Flatten gal took : 35 ms
[2024-05-28 15:46:43] [INFO ] Time to serialize gal into /tmp/LTL13196668862836550738.gal : 6 ms
[2024-05-28 15:46:43] [INFO ] Time to serialize properties into /tmp/LTL13386175452329956164.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13196668862836550738.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13861208711897871567.hoa' '-atoms' '/tmp/LTL13386175452329956164.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13386175452329956164.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13861208711897871567.hoa
Detected timeout of ITS tools.
[2024-05-28 15:46:58] [INFO ] Flatten gal took : 30 ms
[2024-05-28 15:46:58] [INFO ] Flatten gal took : 29 ms
[2024-05-28 15:46:58] [INFO ] Time to serialize gal into /tmp/LTL10012600127097255452.gal : 6 ms
[2024-05-28 15:46:58] [INFO ] Time to serialize properties into /tmp/LTL18064043716441125656.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10012600127097255452.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18064043716441125656.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p741==0)")||(G("(p77==0)"))))))
Formula 0 simplified : G(F!"(p77==0)" & FG!"(p741==0)")
Detected timeout of ITS tools.
[2024-05-28 15:47:13] [INFO ] Flatten gal took : 31 ms
[2024-05-28 15:47:13] [INFO ] Applying decomposition
[2024-05-28 15:47:13] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7771320038795421574.txt' '-o' '/tmp/graph7771320038795421574.bin' '-w' '/tmp/graph7771320038795421574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7771320038795421574.bin' '-l' '-1' '-v' '-w' '/tmp/graph7771320038795421574.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:47:13] [INFO ] Decomposing Gal with order
[2024-05-28 15:47:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:47:14] [INFO ] Removed a total of 638 redundant transitions.
[2024-05-28 15:47:14] [INFO ] Flatten gal took : 68 ms
[2024-05-28 15:47:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 614 labels/synchronizations in 14 ms.
[2024-05-28 15:47:14] [INFO ] Time to serialize gal into /tmp/LTL1801757964859161086.gal : 9 ms
[2024-05-28 15:47:14] [INFO ] Time to serialize properties into /tmp/LTL15929198206214534919.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1801757964859161086.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15929198206214534919.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i11.i2.u108.p741==0)")||(G("(i0.u7.p77==0)"))))))
Formula 0 simplified : G(F!"(i0.u7.p77==0)" & FG!"(i11.i2.u108.p741==0)")
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-03 finished in 259152 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 2132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2131 transition count 1891
Reduce places removed 200 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 201 rules applied. Total rules applied 401 place count 1931 transition count 1890
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 402 place count 1930 transition count 1890
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 402 place count 1930 transition count 1689
Deduced a syphon composed of 201 places in 4 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 804 place count 1729 transition count 1689
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 814 place count 1719 transition count 1679
Iterating global reduction 3 with 10 rules applied. Total rules applied 824 place count 1719 transition count 1679
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 824 place count 1719 transition count 1672
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 838 place count 1712 transition count 1672
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 2 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 3 with 1420 rules applied. Total rules applied 2258 place count 1002 transition count 962
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2260 place count 1000 transition count 960
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2261 place count 999 transition count 960
Applied a total of 2261 rules in 286 ms. Remains 999 /2132 variables (removed 1133) and now considering 960/2092 (removed 1132) transitions.
// Phase 1: matrix 960 rows 999 cols
[2024-05-28 15:47:29] [INFO ] Computed 360 invariants in 5 ms
[2024-05-28 15:47:29] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-28 15:47:29] [INFO ] Invariant cache hit.
[2024-05-28 15:47:30] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2024-05-28 15:47:30] [INFO ] Redundant transitions in 95 ms returned [959]
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 958 sub problems to find dead transitions.
// Phase 1: matrix 959 rows 999 cols
[2024-05-28 15:47:30] [INFO ] Computed 360 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:47:45] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 4 ms to minimize.
[2024-05-28 15:47:45] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 4 ms to minimize.
[2024-05-28 15:47:45] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 4 ms to minimize.
[2024-05-28 15:47:45] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 3 ms to minimize.
[2024-05-28 15:47:45] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 4 ms to minimize.
[2024-05-28 15:47:46] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 4 ms to minimize.
[2024-05-28 15:47:46] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 3 ms to minimize.
[2024-05-28 15:47:46] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 4 ms to minimize.
[2024-05-28 15:47:46] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-05-28 15:47:46] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 4 ms to minimize.
[2024-05-28 15:47:47] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 3 ms to minimize.
[2024-05-28 15:47:47] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 4 ms to minimize.
[2024-05-28 15:47:47] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 3 ms to minimize.
[2024-05-28 15:47:47] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 3 ms to minimize.
[2024-05-28 15:47:47] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-05-28 15:47:48] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-05-28 15:47:48] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-05-28 15:47:48] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:47:48] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
[2024-05-28 15:47:48] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:47:49] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
[2024-05-28 15:47:49] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 2 ms to minimize.
[2024-05-28 15:47:49] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-05-28 15:47:49] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-05-28 15:47:49] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2024-05-28 15:47:49] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:47:49] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-28 15:47:49] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-28 15:47:50] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:47:50] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-28 15:47:50] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 2 ms to minimize.
[2024-05-28 15:47:50] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-28 15:47:50] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-28 15:47:50] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:47:50] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:47:50] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:47:50] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:47:50] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:47:50] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
[2024-05-28 15:47:51] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:47:51] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:47:51] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:47:51] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:47:51] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:47:51] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 15:47:51] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:47:51] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 15:47:51] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 15:47:51] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:47:51] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:47:52] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:47:52] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:47:52] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:47:52] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:47:52] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:47:52] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:47:53] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:47:53] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:47:53] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:47:53] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 1.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 1.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 1.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 1.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 1.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 1.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 1.0)
(s519 1.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 0.0)
(s527 1.0)
(s528 0.0)
(s529 0.0)
(s530 1.0)
(s531 0.0)
(s532 1.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 1.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 1.0)
(s550 0.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s555 1.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 1.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 1.0)
(s569 1.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 1.0)
(s575 0.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 1.0)
(s581 0.0)
(s582 1.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 1.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 1.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 1.0)
(s600 0.0)
(s601 0.0)
(s602 1.0)
(s603 0.0)
(s604 0.0)
(s605 1.0)
(s606 0.0)
(s607 1.0)
(s608 0.0)
(s609 1.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 1.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 1.0)
(s619 1.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 1.0)
(s628 0.0)
(s629 0.0)
(s630 1.0)
(s631 0.0)
(s632 1.0)
(s633 0.0)
(s634 1.0)
(s635 0.0)
(s636 1.0)
(s637 0.0)
(s638 1.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 1.0)
(s644 1.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 0.0)
(s652 1.0)
(s653 0.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 1.0)
(s658 0.0)
(s659 1.0)
(s660 0.0)
(s661 1.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 1.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 1.0)
(s678 0.0)
(s679 0.0)
(s680 1.0)
(s681 0.0)
(s682 1.0)
(s683 0.0)
(s684 1.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 1.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 1.0)
(s694 1.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 1.0)
(s700 0.0)
(s701 0.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 1.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 1.0)
(s719 1.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 0.0)
(s726 0.0)
(s727 1.0)
(s728 0.0)
(s729 0.0)
(s730 1.0)
(s731 0.0)
(s732 1.0)
(s733 0.0)
(s734 1.0)
(s735 0.0)
(s736 1.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 1.0)
(s744 1.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 1.0)
(s750 0.0)
(s751 0.0)
(s752 1.0)
(s753 0.0)
(s754 0.0)
(s755 1.0)
(s756 0.0)
(s757 1.0)
(s758 0.0)
(s759 1.0)
(s760 0.0)
(s761 1.0)
(s762 0.0)
(s763 1.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 1.0)
(s769 1.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 1.0)
(s775 0.0)
(s776 0.0)
(s777 1.0)
(s778 0.0)
(s779 0.0)
(s780 1.0)
(s781 0.0)
(s782 1.0)
(s783 0.0)
(s784 1.0)
(s785 0.0)
(s786 1.0)
(s787 0.0)
(s788 1.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 1.0)
(s794 1.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 1.0)
(s800 0.0)
(s801 0.0)
(s802 1.0)
(s803 0.0)
(s804 0.0)
(s805 1.0)
(s806 0.0)
(s807 1.0)
(s808 0.0)
(s809 1.0)
(s810 0.0)
(s811 1.0)
(s812 0.0)
(s813 1.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 1.0)
(s819 1.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 1.0)
(s825 0.0)
(s826 0.0)
(s827 1.0)
(s828 0.0)
(s829 0.0)
(s830 1.0)
(s831 0.0)
(s832 1.0)
(s833 0.0)
(s834 1.0)
(s835 0.0)
(s836 1.0)
(s837 0.0)
(s838 1.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 1.0)
(s844 1.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 1.0)
(s850 0.0)
(s851 0.0)
(s852 1.0)
(s853 0.0)
(s854 0.0)
(s855 1.0)
(s856 0.0)
(s857 1.0)
(s858 0.0)
(s859 1.0)
(s860 0.0)
(s861 1.0)
(s862 0.0)
(s863 1.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 1.0)
(s869 1.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 1.0)
(s875 0.0)
(s876 0.0)
(s877 1.0)
(s878 0.0)
(s879 0.0)
(s880 1.0)
(s881 0.0)
(s882 1.0)
(s883 0.0)
(s884 1.0)
(s885 0.0)
(s886 1.0)
(s887 0.0)
(s888 1.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 1.0)
(s894 1.0)
(s895 0.0)
(s896 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1958 variables, and 420 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:48:01] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 15:48:01] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-28 15:48:02] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:48:02] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:48:02] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:48:03] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:48:03] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:48:03] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:48:03] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:48:03] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:48:04] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 5 ms to minimize.
[2024-05-28 15:48:04] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-28 15:48:04] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-28 15:48:04] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:48:04] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-28 15:48:05] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:48:05] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-05-28 15:48:05] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-28 15:48:05] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-05-28 15:48:05] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:48:06] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 15:48:07] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-28 15:48:08] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-28 15:48:08] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2024-05-28 15:48:08] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:48:09] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:48:09] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-05-28 15:48:09] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 3 ms to minimize.
[2024-05-28 15:48:09] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-28 15:48:10] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2024-05-28 15:48:10] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 3 ms to minimize.
[2024-05-28 15:48:10] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
[2024-05-28 15:48:11] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 2 ms to minimize.
[2024-05-28 15:48:11] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 3 ms to minimize.
[2024-05-28 15:48:11] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 3 ms to minimize.
[2024-05-28 15:48:12] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 3 ms to minimize.
[2024-05-28 15:48:12] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
[2024-05-28 15:48:12] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 3 ms to minimize.
[2024-05-28 15:48:13] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
[2024-05-28 15:48:13] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:48:14] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:48:15] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-28 15:48:17] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 3 ms to minimize.
[2024-05-28 15:48:18] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 3 ms to minimize.
[2024-05-28 15:48:18] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 3 ms to minimize.
[2024-05-28 15:48:19] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 4 ms to minimize.
[2024-05-28 15:48:19] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 3 ms to minimize.
[2024-05-28 15:48:20] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 3 ms to minimize.
[2024-05-28 15:48:20] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 4 ms to minimize.
[2024-05-28 15:48:20] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 3 ms to minimize.
[2024-05-28 15:48:21] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 4 ms to minimize.
[2024-05-28 15:48:21] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 4 ms to minimize.
[2024-05-28 15:48:22] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 4 ms to minimize.
[2024-05-28 15:48:25] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 15:48:26] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:48:26] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 15:48:26] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:48:26] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 15:48:27] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:48:27] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/999 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:48:28] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-28 15:48:30] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1958 variables, and 482 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 122/122 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Starting structural reductions in SI_LTL mode, iteration 1 : 999/2132 places, 959/2092 transitions.
Applied a total of 0 rules in 22 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61970 ms. Remains : 999/2132 places, 959/2092 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-04
Product exploration explored 100000 steps with 75 reset in 736 ms.
Product exploration explored 100000 steps with 73 reset in 922 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 81 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)]
RANDOM walk for 5730 steps (0 resets) in 62 ms. (90 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 157 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 959/959 transitions.
Applied a total of 0 rules in 18 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
[2024-05-28 15:48:33] [INFO ] Invariant cache hit.
[2024-05-28 15:48:33] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-28 15:48:33] [INFO ] Invariant cache hit.
[2024-05-28 15:48:34] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1300 ms to find 0 implicit places.
[2024-05-28 15:48:34] [INFO ] Redundant transitions in 108 ms returned []
Running 958 sub problems to find dead transitions.
[2024-05-28 15:48:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:48:49] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 4 ms to minimize.
[2024-05-28 15:48:49] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 4 ms to minimize.
[2024-05-28 15:48:49] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 3 ms to minimize.
[2024-05-28 15:48:49] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 3 ms to minimize.
[2024-05-28 15:48:50] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 4 ms to minimize.
[2024-05-28 15:48:50] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 3 ms to minimize.
[2024-05-28 15:48:50] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 3 ms to minimize.
[2024-05-28 15:48:50] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 3 ms to minimize.
[2024-05-28 15:48:50] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 3 ms to minimize.
[2024-05-28 15:48:51] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 3 ms to minimize.
[2024-05-28 15:48:51] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-05-28 15:48:51] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 3 ms to minimize.
[2024-05-28 15:48:51] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 3 ms to minimize.
[2024-05-28 15:48:51] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 3 ms to minimize.
[2024-05-28 15:48:52] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 3 ms to minimize.
[2024-05-28 15:48:52] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-05-28 15:48:52] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-05-28 15:48:52] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 3 ms to minimize.
[2024-05-28 15:48:52] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-05-28 15:48:52] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:48:53] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 3 ms to minimize.
[2024-05-28 15:48:53] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 3 ms to minimize.
[2024-05-28 15:48:53] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-05-28 15:48:53] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2024-05-28 15:48:53] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-28 15:48:53] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-28 15:48:54] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-28 15:48:54] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:48:54] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:48:54] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-28 15:48:54] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-28 15:48:54] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-28 15:48:54] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:48:54] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:48:54] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-05-28 15:48:54] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-28 15:48:54] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-28 15:48:55] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-28 15:48:55] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-28 15:48:55] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:48:55] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:48:55] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:48:55] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:48:55] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:48:55] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 15:48:55] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-28 15:48:55] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 15:48:55] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 15:48:55] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:48:56] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 15:48:56] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:48:56] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-28 15:48:56] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 15:48:56] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-28 15:48:56] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:48:57] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:48:57] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:48:57] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:48:57] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:48:57] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1958 variables, and 420 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:49:05] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 15:49:05] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 15:49:06] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:49:06] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:49:06] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:49:07] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-28 15:49:07] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:49:07] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-28 15:49:07] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:49:07] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:49:07] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-28 15:49:08] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-28 15:49:08] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-28 15:49:08] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:49:08] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:49:09] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:49:09] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-28 15:49:09] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-05-28 15:49:09] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 2 ms to minimize.
[2024-05-28 15:49:09] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:49:10] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 15:49:10] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 15:49:10] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-28 15:49:11] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 15:49:11] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-28 15:49:12] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:49:12] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:49:13] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:49:13] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-05-28 15:49:13] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-05-28 15:49:14] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 3 ms to minimize.
[2024-05-28 15:49:14] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 3 ms to minimize.
[2024-05-28 15:49:14] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:49:15] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 3 ms to minimize.
[2024-05-28 15:49:15] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 3 ms to minimize.
[2024-05-28 15:49:15] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 2 ms to minimize.
[2024-05-28 15:49:15] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 3 ms to minimize.
[2024-05-28 15:49:16] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 3 ms to minimize.
[2024-05-28 15:49:16] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 3 ms to minimize.
[2024-05-28 15:49:16] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:49:18] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-28 15:49:19] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:49:20] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-05-28 15:49:20] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 2 ms to minimize.
[2024-05-28 15:49:20] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 3 ms to minimize.
[2024-05-28 15:49:20] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 2 ms to minimize.
[2024-05-28 15:49:20] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 3 ms to minimize.
[2024-05-28 15:49:21] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 2 ms to minimize.
[2024-05-28 15:49:22] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 3 ms to minimize.
[2024-05-28 15:49:22] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 4 ms to minimize.
[2024-05-28 15:49:23] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 3 ms to minimize.
[2024-05-28 15:49:23] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 3 ms to minimize.
[2024-05-28 15:49:23] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 4 ms to minimize.
[2024-05-28 15:49:24] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 4 ms to minimize.
[2024-05-28 15:49:24] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 3 ms to minimize.
[2024-05-28 15:49:24] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 3 ms to minimize.
[2024-05-28 15:49:24] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 3 ms to minimize.
[2024-05-28 15:49:25] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 4 ms to minimize.
[2024-05-28 15:49:25] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 4 ms to minimize.
[2024-05-28 15:49:26] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/999 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:49:27] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:49:29] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 3 ms to minimize.
[2024-05-28 15:49:30] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 3 ms to minimize.
[2024-05-28 15:49:32] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 4 ms to minimize.
[2024-05-28 15:49:32] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 4 ms to minimize.
[2024-05-28 15:49:33] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 4 ms to minimize.
[2024-05-28 15:49:33] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1958 variables, and 487 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 127/127 constraints]
After SMT, in 60208ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61661 ms. Remains : 999/999 places, 959/959 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 69 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 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5385 steps (0 resets) in 52 ms. (101 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 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 74 reset in 733 ms.
Product exploration explored 100000 steps with 75 reset in 915 ms.
Built C files in :
/tmp/ltsmin7078590794263820645
[2024-05-28 15:49:37] [INFO ] Computing symmetric may disable matrix : 959 transitions.
[2024-05-28 15:49:37] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:49:37] [INFO ] Computing symmetric may enable matrix : 959 transitions.
[2024-05-28 15:49:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:49:37] [INFO ] Computing Do-Not-Accords matrix : 959 transitions.
[2024-05-28 15:49:37] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:49:37] [INFO ] Built C files in 163ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7078590794263820645
Running compilation step : cd /tmp/ltsmin7078590794263820645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7078590794263820645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7078590794263820645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 999 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 999/999 places, 959/959 transitions.
Applied a total of 0 rules in 23 ms. Remains 999 /999 variables (removed 0) and now considering 959/959 (removed 0) transitions.
[2024-05-28 15:49:40] [INFO ] Invariant cache hit.
[2024-05-28 15:49:40] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-28 15:49:40] [INFO ] Invariant cache hit.
[2024-05-28 15:49:41] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1326 ms to find 0 implicit places.
[2024-05-28 15:49:41] [INFO ] Redundant transitions in 92 ms returned []
Running 958 sub problems to find dead transitions.
[2024-05-28 15:49:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:49:56] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 4 ms to minimize.
[2024-05-28 15:49:56] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 3 ms to minimize.
[2024-05-28 15:49:56] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 4 ms to minimize.
[2024-05-28 15:49:56] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 3 ms to minimize.
[2024-05-28 15:49:56] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 4 ms to minimize.
[2024-05-28 15:49:57] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 3 ms to minimize.
[2024-05-28 15:49:57] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 3 ms to minimize.
[2024-05-28 15:49:57] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-05-28 15:49:57] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 3 ms to minimize.
[2024-05-28 15:49:57] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 3 ms to minimize.
[2024-05-28 15:49:58] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 4 ms to minimize.
[2024-05-28 15:49:58] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 3 ms to minimize.
[2024-05-28 15:49:58] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-05-28 15:49:58] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 3 ms to minimize.
[2024-05-28 15:49:58] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 3 ms to minimize.
[2024-05-28 15:49:58] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 2 ms to minimize.
[2024-05-28 15:49:59] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 3 ms to minimize.
[2024-05-28 15:49:59] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-05-28 15:49:59] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-05-28 15:49:59] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:49:59] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 3 ms to minimize.
[2024-05-28 15:50:00] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-05-28 15:50:00] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 3 ms to minimize.
[2024-05-28 15:50:00] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-28 15:50:00] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-28 15:50:00] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-28 15:50:00] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-28 15:50:00] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:50:00] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-28 15:50:01] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-28 15:50:01] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-28 15:50:01] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-28 15:50:01] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-28 15:50:01] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-28 15:50:01] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-05-28 15:50:01] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:50:01] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-28 15:50:01] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:50:01] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:50:01] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:50:02] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:50:02] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:50:02] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:50:02] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 15:50:02] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:50:02] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:50:02] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 15:50:02] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 15:50:02] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 15:50:02] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 15:50:02] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:50:03] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 15:50:03] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:50:03] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:50:03] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:50:03] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:50:03] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:50:04] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:50:04] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:50:04] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1958 variables, and 420 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:50:12] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 15:50:12] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-28 15:50:13] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-28 15:50:13] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 15:50:14] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:50:14] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 15:50:14] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:50:14] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:50:14] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-05-28 15:50:14] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-28 15:50:14] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-28 15:50:15] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:50:15] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-28 15:50:15] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-05-28 15:50:15] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:50:16] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-28 15:50:16] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:50:16] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-05-28 15:50:16] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2024-05-28 15:50:16] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:50:17] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 15:50:17] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 15:50:17] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:50:18] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:50:19] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:50:19] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-28 15:50:19] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:50:20] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-05-28 15:50:20] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-05-28 15:50:21] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 3 ms to minimize.
[2024-05-28 15:50:21] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 3 ms to minimize.
[2024-05-28 15:50:21] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 3 ms to minimize.
[2024-05-28 15:50:21] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 2 ms to minimize.
[2024-05-28 15:50:22] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 2 ms to minimize.
[2024-05-28 15:50:22] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 3 ms to minimize.
[2024-05-28 15:50:22] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 2 ms to minimize.
[2024-05-28 15:50:22] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 3 ms to minimize.
[2024-05-28 15:50:23] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 3 ms to minimize.
[2024-05-28 15:50:23] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-05-28 15:50:23] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:50:25] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-28 15:50:26] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-05-28 15:50:27] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:50:27] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 3 ms to minimize.
[2024-05-28 15:50:27] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 3 ms to minimize.
[2024-05-28 15:50:27] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 3 ms to minimize.
[2024-05-28 15:50:27] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-05-28 15:50:28] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 2 ms to minimize.
[2024-05-28 15:50:29] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 2 ms to minimize.
[2024-05-28 15:50:29] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 3 ms to minimize.
[2024-05-28 15:50:30] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-05-28 15:50:30] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 3 ms to minimize.
[2024-05-28 15:50:30] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 4 ms to minimize.
[2024-05-28 15:50:31] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 4 ms to minimize.
[2024-05-28 15:50:31] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 4 ms to minimize.
[2024-05-28 15:50:31] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 4 ms to minimize.
[2024-05-28 15:50:31] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 3 ms to minimize.
[2024-05-28 15:50:32] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 3 ms to minimize.
[2024-05-28 15:50:32] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 4 ms to minimize.
[2024-05-28 15:50:32] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/999 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 15:50:34] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-28 15:50:36] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:50:37] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 3 ms to minimize.
[2024-05-28 15:50:39] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 4 ms to minimize.
[2024-05-28 15:50:39] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 4 ms to minimize.
[2024-05-28 15:50:39] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 4 ms to minimize.
[2024-05-28 15:50:40] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1958 variables, and 487 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 127/127 constraints]
After SMT, in 60222ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61678 ms. Remains : 999/999 places, 959/959 transitions.
Built C files in :
/tmp/ltsmin4372520357834150432
[2024-05-28 15:50:42] [INFO ] Computing symmetric may disable matrix : 959 transitions.
[2024-05-28 15:50:42] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:50:42] [INFO ] Computing symmetric may enable matrix : 959 transitions.
[2024-05-28 15:50:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:50:42] [INFO ] Computing Do-Not-Accords matrix : 959 transitions.
[2024-05-28 15:50:42] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:50:42] [INFO ] Built C files in 169ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4372520357834150432
Running compilation step : cd /tmp/ltsmin4372520357834150432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4372520357834150432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4372520357834150432;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 15:50:45] [INFO ] Flatten gal took : 29 ms
[2024-05-28 15:50:45] [INFO ] Flatten gal took : 28 ms
[2024-05-28 15:50:45] [INFO ] Time to serialize gal into /tmp/LTL12077700629048856058.gal : 5 ms
[2024-05-28 15:50:45] [INFO ] Time to serialize properties into /tmp/LTL6013918116509943000.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12077700629048856058.gal' '-t' 'CGAL' '-hoa' '/tmp/aut972266713480242871.hoa' '-atoms' '/tmp/LTL6013918116509943000.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6013918116509943000.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut972266713480242871.hoa
Detected timeout of ITS tools.
[2024-05-28 15:51:00] [INFO ] Flatten gal took : 29 ms
[2024-05-28 15:51:00] [INFO ] Flatten gal took : 33 ms
[2024-05-28 15:51:00] [INFO ] Time to serialize gal into /tmp/LTL5969062470238885529.gal : 5 ms
[2024-05-28 15:51:00] [INFO ] Time to serialize properties into /tmp/LTL9076276441734471882.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5969062470238885529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9076276441734471882.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((p766==0)||(p768==0))"))))
Formula 0 simplified : FG!"((p766==0)||(p768==0))"
Detected timeout of ITS tools.
[2024-05-28 15:51:15] [INFO ] Flatten gal took : 27 ms
[2024-05-28 15:51:15] [INFO ] Applying decomposition
[2024-05-28 15:51:15] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph816936074117567815.txt' '-o' '/tmp/graph816936074117567815.bin' '-w' '/tmp/graph816936074117567815.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph816936074117567815.bin' '-l' '-1' '-v' '-w' '/tmp/graph816936074117567815.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:51:15] [INFO ] Decomposing Gal with order
[2024-05-28 15:51:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:51:15] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-28 15:51:15] [INFO ] Flatten gal took : 53 ms
[2024-05-28 15:51:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 608 labels/synchronizations in 20 ms.
[2024-05-28 15:51:15] [INFO ] Time to serialize gal into /tmp/LTL3825061853804860961.gal : 16 ms
[2024-05-28 15:51:15] [INFO ] Time to serialize properties into /tmp/LTL355193636934066803.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3825061853804860961.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL355193636934066803.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(F("((i12.i0.u110.p766==0)||(i12.i2.u111.p768==0))"))))
Formula 0 simplified : FG!"((i12.i0.u110.p766==0)||(i12.i2.u111.p768==0))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-04 finished in 241719 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 1 out of 2132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2131 transition count 1890
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1930 transition count 1890
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 402 place count 1930 transition count 1690
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 802 place count 1730 transition count 1690
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 812 place count 1720 transition count 1680
Iterating global reduction 2 with 10 rules applied. Total rules applied 822 place count 1720 transition count 1680
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 822 place count 1720 transition count 1673
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 836 place count 1713 transition count 1673
Performed 709 Post agglomeration using F-continuation condition.Transition count delta: 709
Deduced a syphon composed of 709 places in 2 ms
Reduce places removed 709 places and 0 transitions.
Iterating global reduction 2 with 1418 rules applied. Total rules applied 2254 place count 1004 transition count 964
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2256 place count 1002 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2257 place count 1001 transition count 962
Applied a total of 2257 rules in 263 ms. Remains 1001 /2132 variables (removed 1131) and now considering 962/2092 (removed 1130) transitions.
// Phase 1: matrix 962 rows 1001 cols
[2024-05-28 15:51:31] [INFO ] Computed 360 invariants in 5 ms
[2024-05-28 15:51:31] [INFO ] Implicit Places using invariants in 433 ms returned []
[2024-05-28 15:51:31] [INFO ] Invariant cache hit.
[2024-05-28 15:51:32] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
[2024-05-28 15:51:32] [INFO ] Redundant transitions in 106 ms returned [961]
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 960 sub problems to find dead transitions.
// Phase 1: matrix 961 rows 1001 cols
[2024-05-28 15:51:32] [INFO ] Computed 360 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:51:46] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 4 ms to minimize.
[2024-05-28 15:51:46] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 4 ms to minimize.
[2024-05-28 15:51:47] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 3 ms to minimize.
[2024-05-28 15:51:47] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 3 ms to minimize.
[2024-05-28 15:51:47] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 3 ms to minimize.
[2024-05-28 15:51:47] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 4 ms to minimize.
[2024-05-28 15:51:47] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 4 ms to minimize.
[2024-05-28 15:51:48] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 3 ms to minimize.
[2024-05-28 15:51:48] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 3 ms to minimize.
[2024-05-28 15:51:48] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 4 ms to minimize.
[2024-05-28 15:51:48] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 3 ms to minimize.
[2024-05-28 15:51:48] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2024-05-28 15:51:49] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 3 ms to minimize.
[2024-05-28 15:51:49] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
[2024-05-28 15:51:49] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 3 ms to minimize.
[2024-05-28 15:51:49] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 3 ms to minimize.
[2024-05-28 15:51:49] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
[2024-05-28 15:51:49] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-05-28 15:51:49] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-05-28 15:51:50] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:51:50] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-05-28 15:51:50] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 2 ms to minimize.
[2024-05-28 15:51:50] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-28 15:51:50] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-28 15:51:50] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-28 15:51:51] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:51:51] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-28 15:51:51] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 15:51:51] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-28 15:51:51] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:51:51] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-28 15:51:51] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-28 15:51:51] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-28 15:51:51] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-28 15:51:51] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-28 15:51:52] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:51:52] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-28 15:51:52] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:51:52] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:51:52] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:51:52] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:51:52] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-28 15:51:52] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-05-28 15:51:52] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:51:52] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 15:51:52] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 15:51:52] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 15:51:52] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-28 15:51:52] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 15:51:53] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 15:51:53] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:51:53] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:51:53] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-28 15:51:53] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:51:53] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:51:53] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-28 15:51:54] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:51:54] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:51:54] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:51:54] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1962 variables, and 420 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:52:03] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 15:52:03] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:52:04] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-28 15:52:04] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:52:04] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-05-28 15:52:05] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 15:52:05] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-28 15:52:05] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:52:05] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:52:05] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-28 15:52:05] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:52:06] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:52:06] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-28 15:52:06] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-28 15:52:06] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2024-05-28 15:52:06] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:52:07] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-28 15:52:07] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:52:07] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-28 15:52:07] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:52:09] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:52:09] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-28 15:52:09] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-28 15:52:11] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 2 ms to minimize.
[2024-05-28 15:52:11] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 2 ms to minimize.
[2024-05-28 15:52:11] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 2 ms to minimize.
[2024-05-28 15:52:11] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2024-05-28 15:52:12] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2024-05-28 15:52:12] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 2 ms to minimize.
[2024-05-28 15:52:12] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-05-28 15:52:13] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 3 ms to minimize.
[2024-05-28 15:52:13] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 3 ms to minimize.
[2024-05-28 15:52:13] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 3 ms to minimize.
[2024-05-28 15:52:14] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 3 ms to minimize.
[2024-05-28 15:52:14] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 4 ms to minimize.
[2024-05-28 15:52:14] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 4 ms to minimize.
[2024-05-28 15:52:15] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 3 ms to minimize.
[2024-05-28 15:52:15] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 4 ms to minimize.
[2024-05-28 15:52:15] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 3 ms to minimize.
[2024-05-28 15:52:16] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:52:17] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 15:52:18] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-28 15:52:19] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:52:19] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:52:20] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 3 ms to minimize.
[2024-05-28 15:52:20] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 3 ms to minimize.
[2024-05-28 15:52:20] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 3 ms to minimize.
[2024-05-28 15:52:22] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 3 ms to minimize.
[2024-05-28 15:52:22] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 3 ms to minimize.
[2024-05-28 15:52:22] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 4 ms to minimize.
[2024-05-28 15:52:23] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 4 ms to minimize.
[2024-05-28 15:52:23] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 4 ms to minimize.
[2024-05-28 15:52:24] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 4 ms to minimize.
[2024-05-28 15:52:24] [INFO ] Deduced a trap composed of 16 places in 227 ms of which 4 ms to minimize.
[2024-05-28 15:52:24] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 4 ms to minimize.
[2024-05-28 15:52:25] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 4 ms to minimize.
[2024-05-28 15:52:29] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 15:52:29] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 15:52:29] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 15:52:29] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:52:32] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
SMT process timed out in 60255ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2132 places, 961/2092 transitions.
Applied a total of 0 rules in 28 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62033 ms. Remains : 1001/2132 places, 961/2092 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-05
Product exploration explored 100000 steps with 49 reset in 782 ms.
Product exploration explored 100000 steps with 48 reset in 924 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 82 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 34 ms :[(NOT p0)]
RANDOM walk for 3430 steps (0 resets) in 41 ms. (81 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 93 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 24 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-28 15:52:35] [INFO ] Invariant cache hit.
[2024-05-28 15:52:35] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-28 15:52:35] [INFO ] Invariant cache hit.
[2024-05-28 15:52:36] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
[2024-05-28 15:52:36] [INFO ] Redundant transitions in 81 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-28 15:52:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:52:50] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 4 ms to minimize.
[2024-05-28 15:52:50] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 4 ms to minimize.
[2024-05-28 15:52:50] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 4 ms to minimize.
[2024-05-28 15:52:50] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 4 ms to minimize.
[2024-05-28 15:52:51] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 4 ms to minimize.
[2024-05-28 15:52:51] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 4 ms to minimize.
[2024-05-28 15:52:51] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 3 ms to minimize.
[2024-05-28 15:52:51] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 3 ms to minimize.
[2024-05-28 15:52:51] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 3 ms to minimize.
[2024-05-28 15:52:52] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 4 ms to minimize.
[2024-05-28 15:52:52] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 3 ms to minimize.
[2024-05-28 15:52:52] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-05-28 15:52:52] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-05-28 15:52:52] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 3 ms to minimize.
[2024-05-28 15:52:52] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 3 ms to minimize.
[2024-05-28 15:52:53] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2024-05-28 15:52:53] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-05-28 15:52:53] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 3 ms to minimize.
[2024-05-28 15:52:53] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:52:53] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:52:53] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-28 15:52:54] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:52:54] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:52:54] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:52:54] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:52:54] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:52:54] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-28 15:52:54] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-28 15:52:54] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:52:54] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-28 15:52:54] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:52:54] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:52:55] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:52:55] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:52:55] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:52:55] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:52:55] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:52:55] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:52:55] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:52:55] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:52:55] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 15:52:55] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:52:55] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 15:52:55] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 15:52:55] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 15:52:56] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:52:56] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 15:52:56] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 15:52:56] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-28 15:52:56] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 15:52:56] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-28 15:52:56] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 15:52:56] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 15:52:56] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-28 15:52:56] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 15:52:56] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:52:57] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:52:57] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:52:57] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:52:57] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1962 variables, and 420 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:53:07] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 15:53:07] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 15:53:07] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 15:53:07] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 15:53:07] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 15:53:07] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 15:53:08] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-28 15:53:08] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 15:53:08] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:53:08] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 15:53:08] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-28 15:53:08] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:53:08] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 15:53:09] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:53:09] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-28 15:53:09] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:53:09] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:53:09] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:53:09] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-28 15:53:10] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:53:10] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 15:53:10] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 15:53:11] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:53:11] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:53:12] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-28 15:53:12] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-28 15:53:12] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-28 15:53:12] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-28 15:53:13] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2024-05-28 15:53:13] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-28 15:53:13] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 3 ms to minimize.
[2024-05-28 15:53:13] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-05-28 15:53:14] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-05-28 15:53:14] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-05-28 15:53:14] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 3 ms to minimize.
[2024-05-28 15:53:14] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 3 ms to minimize.
[2024-05-28 15:53:14] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:53:15] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-05-28 15:53:15] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 3 ms to minimize.
[2024-05-28 15:53:15] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:53:17] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:53:17] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-28 15:53:19] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 3 ms to minimize.
[2024-05-28 15:53:19] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 2 ms to minimize.
[2024-05-28 15:53:19] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 3 ms to minimize.
[2024-05-28 15:53:20] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 3 ms to minimize.
[2024-05-28 15:53:20] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 3 ms to minimize.
[2024-05-28 15:53:20] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 3 ms to minimize.
[2024-05-28 15:53:20] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 3 ms to minimize.
[2024-05-28 15:53:21] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 3 ms to minimize.
[2024-05-28 15:53:21] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 3 ms to minimize.
[2024-05-28 15:53:21] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 3 ms to minimize.
[2024-05-28 15:53:21] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 3 ms to minimize.
[2024-05-28 15:53:22] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
[2024-05-28 15:53:22] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 4 ms to minimize.
[2024-05-28 15:53:23] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 4 ms to minimize.
[2024-05-28 15:53:23] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 4 ms to minimize.
[2024-05-28 15:53:23] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 3 ms to minimize.
[2024-05-28 15:53:24] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 4 ms to minimize.
[2024-05-28 15:53:24] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:53:28] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 3 ms to minimize.
[2024-05-28 15:53:29] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 3 ms to minimize.
[2024-05-28 15:53:29] [INFO ] Deduced a trap composed of 27 places in 184 ms of which 4 ms to minimize.
[2024-05-28 15:53:29] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-28 15:53:30] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 15:53:30] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 15:53:30] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 3 ms to minimize.
[2024-05-28 15:53:30] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 4 ms to minimize.
[2024-05-28 15:53:31] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 4 ms to minimize.
[2024-05-28 15:53:32] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 4 ms to minimize.
[2024-05-28 15:53:32] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 3 ms to minimize.
[2024-05-28 15:53:32] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 1)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 1)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 1)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 1)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1962 variables, and 492 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 132/132 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60210ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61641 ms. Remains : 1001/1001 places, 961/961 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 67 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 3570 steps (0 resets) in 43 ms. (81 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 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 48 reset in 769 ms.
Product exploration explored 100000 steps with 48 reset in 944 ms.
Built C files in :
/tmp/ltsmin14084327273108518530
[2024-05-28 15:53:38] [INFO ] Computing symmetric may disable matrix : 961 transitions.
[2024-05-28 15:53:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:53:38] [INFO ] Computing symmetric may enable matrix : 961 transitions.
[2024-05-28 15:53:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:53:38] [INFO ] Computing Do-Not-Accords matrix : 961 transitions.
[2024-05-28 15:53:38] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:53:38] [INFO ] Built C files in 160ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14084327273108518530
Running compilation step : cd /tmp/ltsmin14084327273108518530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14084327273108518530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14084327273108518530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 1001 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1001/1001 places, 961/961 transitions.
Applied a total of 0 rules in 19 ms. Remains 1001 /1001 variables (removed 0) and now considering 961/961 (removed 0) transitions.
[2024-05-28 15:53:41] [INFO ] Invariant cache hit.
[2024-05-28 15:53:42] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-28 15:53:42] [INFO ] Invariant cache hit.
[2024-05-28 15:53:43] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
[2024-05-28 15:53:43] [INFO ] Redundant transitions in 80 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-28 15:53:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:53:57] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 4 ms to minimize.
[2024-05-28 15:53:57] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 3 ms to minimize.
[2024-05-28 15:53:57] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 5 ms to minimize.
[2024-05-28 15:53:57] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 3 ms to minimize.
[2024-05-28 15:53:58] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 3 ms to minimize.
[2024-05-28 15:53:58] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 4 ms to minimize.
[2024-05-28 15:53:58] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 3 ms to minimize.
[2024-05-28 15:53:58] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 3 ms to minimize.
[2024-05-28 15:53:58] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 3 ms to minimize.
[2024-05-28 15:53:59] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 3 ms to minimize.
[2024-05-28 15:53:59] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 2 ms to minimize.
[2024-05-28 15:53:59] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 3 ms to minimize.
[2024-05-28 15:53:59] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-05-28 15:53:59] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 3 ms to minimize.
[2024-05-28 15:53:59] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 3 ms to minimize.
[2024-05-28 15:54:00] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 3 ms to minimize.
[2024-05-28 15:54:00] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 3 ms to minimize.
[2024-05-28 15:54:00] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
[2024-05-28 15:54:00] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 3 ms to minimize.
[2024-05-28 15:54:00] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 20/380 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:54:00] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2024-05-28 15:54:01] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-05-28 15:54:01] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-28 15:54:01] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:54:01] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:54:01] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:54:01] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-28 15:54:01] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-28 15:54:01] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-28 15:54:01] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-28 15:54:02] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-28 15:54:02] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:54:02] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:54:02] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
[2024-05-28 15:54:02] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 15:54:02] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-28 15:54:02] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-28 15:54:02] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-28 15:54:02] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 15:54:02] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/400 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:54:02] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:54:02] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 15:54:03] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:54:03] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 15:54:03] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-28 15:54:03] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:54:03] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:54:03] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 15:54:03] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-28 15:54:03] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 15:54:03] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-28 15:54:03] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:54:03] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 15:54:03] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:54:04] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:54:04] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 15:54:04] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2024-05-28 15:54:04] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:54:04] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-28 15:54:04] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1001/1962 variables, and 420 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 360/360 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 60/420 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:54:14] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 15:54:14] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 15:54:14] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 15:54:14] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:54:14] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-28 15:54:14] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 15:54:14] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 15:54:15] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 15:54:15] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:54:15] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 15:54:15] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:54:15] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:54:16] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 15:54:16] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:54:16] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-28 15:54:16] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 15:54:16] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 15:54:16] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:54:16] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-28 15:54:17] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1001 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:54:17] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 15:54:17] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 15:54:18] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:54:18] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:54:19] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-28 15:54:19] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-28 15:54:19] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:54:19] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:54:20] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:54:20] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-28 15:54:20] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 3 ms to minimize.
[2024-05-28 15:54:21] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-28 15:54:21] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-05-28 15:54:21] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
[2024-05-28 15:54:21] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
[2024-05-28 15:54:21] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-05-28 15:54:22] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 3 ms to minimize.
[2024-05-28 15:54:22] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:54:22] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 3 ms to minimize.
[2024-05-28 15:54:22] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1001 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:54:24] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2024-05-28 15:54:24] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-05-28 15:54:26] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 3 ms to minimize.
[2024-05-28 15:54:26] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 3 ms to minimize.
[2024-05-28 15:54:27] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 3 ms to minimize.
[2024-05-28 15:54:27] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 3 ms to minimize.
[2024-05-28 15:54:27] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 3 ms to minimize.
[2024-05-28 15:54:27] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 2 ms to minimize.
[2024-05-28 15:54:28] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 3 ms to minimize.
[2024-05-28 15:54:28] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 2 ms to minimize.
[2024-05-28 15:54:28] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 3 ms to minimize.
[2024-05-28 15:54:28] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 3 ms to minimize.
[2024-05-28 15:54:29] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 3 ms to minimize.
[2024-05-28 15:54:29] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 3 ms to minimize.
[2024-05-28 15:54:29] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 3 ms to minimize.
[2024-05-28 15:54:30] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 3 ms to minimize.
[2024-05-28 15:54:30] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 3 ms to minimize.
[2024-05-28 15:54:31] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 3 ms to minimize.
[2024-05-28 15:54:31] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 4 ms to minimize.
[2024-05-28 15:54:31] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1001 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-28 15:54:35] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-28 15:54:36] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 4 ms to minimize.
[2024-05-28 15:54:37] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 6 ms to minimize.
[2024-05-28 15:54:37] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 15:54:37] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 15:54:37] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 15:54:37] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 3 ms to minimize.
[2024-05-28 15:54:38] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 3 ms to minimize.
[2024-05-28 15:54:39] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 4 ms to minimize.
[2024-05-28 15:54:39] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 4 ms to minimize.
[2024-05-28 15:54:39] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 4 ms to minimize.
[2024-05-28 15:54:40] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 1)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1001/1962 variables, and 492 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 132/132 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60219ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61607 ms. Remains : 1001/1001 places, 961/961 transitions.
Built C files in :
/tmp/ltsmin10346136915379053456
[2024-05-28 15:54:43] [INFO ] Computing symmetric may disable matrix : 961 transitions.
[2024-05-28 15:54:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:54:43] [INFO ] Computing symmetric may enable matrix : 961 transitions.
[2024-05-28 15:54:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:54:43] [INFO ] Computing Do-Not-Accords matrix : 961 transitions.
[2024-05-28 15:54:43] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 15:54:43] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10346136915379053456
Running compilation step : cd /tmp/ltsmin10346136915379053456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10346136915379053456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10346136915379053456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 15:54:46] [INFO ] Flatten gal took : 28 ms
[2024-05-28 15:54:46] [INFO ] Flatten gal took : 28 ms
[2024-05-28 15:54:46] [INFO ] Time to serialize gal into /tmp/LTL3141618825087957576.gal : 4 ms
[2024-05-28 15:54:46] [INFO ] Time to serialize properties into /tmp/LTL12893163701449093623.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3141618825087957576.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6906057582721710455.hoa' '-atoms' '/tmp/LTL12893163701449093623.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12893163701449093623.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6906057582721710455.hoa
Detected timeout of ITS tools.
[2024-05-28 15:55:01] [INFO ] Flatten gal took : 26 ms
[2024-05-28 15:55:01] [INFO ] Flatten gal took : 28 ms
[2024-05-28 15:55:01] [INFO ] Time to serialize gal into /tmp/LTL16818197708508086933.gal : 4 ms
[2024-05-28 15:55:01] [INFO ] Time to serialize properties into /tmp/LTL7730651347786953652.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16818197708508086933.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7730651347786953652.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(p1215==0)"))))
Formula 0 simplified : GF!"(p1215==0)"
Detected timeout of ITS tools.
[2024-05-28 15:55:16] [INFO ] Flatten gal took : 29 ms
[2024-05-28 15:55:16] [INFO ] Applying decomposition
[2024-05-28 15:55:17] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17925533635978831162.txt' '-o' '/tmp/graph17925533635978831162.bin' '-w' '/tmp/graph17925533635978831162.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17925533635978831162.bin' '-l' '-1' '-v' '-w' '/tmp/graph17925533635978831162.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:55:17] [INFO ] Decomposing Gal with order
[2024-05-28 15:55:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:55:17] [INFO ] Removed a total of 635 redundant transitions.
[2024-05-28 15:55:17] [INFO ] Flatten gal took : 43 ms
[2024-05-28 15:55:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 624 labels/synchronizations in 7 ms.
[2024-05-28 15:55:17] [INFO ] Time to serialize gal into /tmp/LTL15690266059497453762.gal : 7 ms
[2024-05-28 15:55:17] [INFO ] Time to serialize properties into /tmp/LTL18283196254405303412.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15690266059497453762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18283196254405303412.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("(i19.i1.u180.p1215==0)"))))
Formula 0 simplified : GF!"(i19.i1.u180.p1215==0)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-05 finished in 241402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 2132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2122 transition count 2082
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2122 transition count 2082
Applied a total of 20 rules in 151 ms. Remains 2122 /2132 variables (removed 10) and now considering 2082/2092 (removed 10) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2024-05-28 15:55:32] [INFO ] Computed 361 invariants in 10 ms
[2024-05-28 15:55:33] [INFO ] Implicit Places using invariants in 629 ms returned []
[2024-05-28 15:55:33] [INFO ] Invariant cache hit.
[2024-05-28 15:55:34] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 2539 ms to find 0 implicit places.
Running 2081 sub problems to find dead transitions.
[2024-05-28 15:55:34] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2081/2081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2081 constraints, Known Traps: 0/0 constraints]
After SMT, in 60542ms problems are : Problem set: 0 solved, 2081 unsolved
Search for dead transitions found 0 dead transitions in 60558ms
Starting structural reductions in LTL mode, iteration 1 : 2122/2132 places, 2082/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63252 ms. Remains : 2122/2132 places, 2082/2092 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-06
Product exploration explored 100000 steps with 93 reset in 575 ms.
Product exploration explored 100000 steps with 94 reset in 654 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2122 stabilizing places and 479/2082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4141 steps (0 resets) in 35 ms. (115 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 15:56:37] [INFO ] Invariant cache hit.
[2024-05-28 15:56:38] [INFO ] [Real]Absence check using 361 positive place invariants in 459 ms returned sat
[2024-05-28 15:56:51] [INFO ] [Real]Absence check using state equation in 12131 ms returned sat
[2024-05-28 15:56:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:56:52] [INFO ] [Nat]Absence check using 361 positive place invariants in 473 ms returned sat
[2024-05-28 15:57:05] [INFO ] [Nat]Absence check using state equation in 13159 ms returned sat
[2024-05-28 15:57:05] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:57:06] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 371 ms
Could not prove EG (NOT p0)
Support contains 1 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Applied a total of 0 rules in 71 ms. Remains 2122 /2122 variables (removed 0) and now considering 2082/2082 (removed 0) transitions.
[2024-05-28 15:57:06] [INFO ] Invariant cache hit.
[2024-05-28 15:57:06] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-05-28 15:57:06] [INFO ] Invariant cache hit.
[2024-05-28 15:57:08] [INFO ] Implicit Places using invariants and state equation in 1993 ms returned []
Implicit Place search using SMT with State Equation took 2642 ms to find 0 implicit places.
Running 2081 sub problems to find dead transitions.
[2024-05-28 15:57:08] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2081/2081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2081 constraints, Known Traps: 0/0 constraints]
After SMT, in 60549ms problems are : Problem set: 0 solved, 2081 unsolved
Search for dead transitions found 0 dead transitions in 60566ms
Finished structural reductions in LTL mode , in 1 iterations and 63287 ms. Remains : 2122/2122 places, 2082/2082 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2122 stabilizing places and 479/2082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4390 steps (0 resets) in 37 ms. (115 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 15:58:10] [INFO ] Invariant cache hit.
[2024-05-28 15:58:11] [INFO ] [Real]Absence check using 361 positive place invariants in 448 ms returned sat
[2024-05-28 15:58:23] [INFO ] [Real]Absence check using state equation in 12345 ms returned sat
[2024-05-28 15:58:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 15:58:25] [INFO ] [Nat]Absence check using 361 positive place invariants in 456 ms returned sat
[2024-05-28 15:58:38] [INFO ] [Nat]Absence check using state equation in 13064 ms returned sat
[2024-05-28 15:58:38] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-28 15:58:38] [INFO ] Deduced a trap composed of 49 places in 38 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 15:58:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 96 reset in 571 ms.
Product exploration explored 100000 steps with 93 reset in 647 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 2122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 2122 transition count 2082
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 200 place count 2122 transition count 2084
Deduced a syphon composed of 281 places in 4 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 281 place count 2122 transition count 2084
Performed 838 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1119 places in 1 ms
Iterating global reduction 1 with 838 rules applied. Total rules applied 1119 place count 2122 transition count 2084
Renaming transitions due to excessive name length > 1024 char.
Discarding 281 places :
Symmetric choice reduction at 1 with 281 rule applications. Total rules 1400 place count 1841 transition count 1803
Deduced a syphon composed of 838 places in 2 ms
Iterating global reduction 1 with 281 rules applied. Total rules applied 1681 place count 1841 transition count 1803
Deduced a syphon composed of 838 places in 2 ms
Applied a total of 1681 rules in 779 ms. Remains 1841 /2122 variables (removed 281) and now considering 1803/2082 (removed 279) transitions.
[2024-05-28 15:58:41] [INFO ] Redundant transitions in 160 ms returned [1802]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1801 sub problems to find dead transitions.
// Phase 1: matrix 1802 rows 1841 cols
[2024-05-28 15:58:41] [INFO ] Computed 361 invariants in 15 ms
[2024-05-28 15:58:41] [INFO ] State equation strengthened by 3 read => feed constraints.
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.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1840/3643 variables, and 0 constraints, problems are : Problem set: 0 solved, 1801 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/1841 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1801/1801 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1801 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 1840/3643 variables, and 0 constraints, problems are : Problem set: 0 solved, 1801 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/1841 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/1801 constraints, Known Traps: 0/0 constraints]
After SMT, in 61977ms problems are : Problem set: 0 solved, 1801 unsolved
Search for dead transitions found 0 dead transitions in 61993ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1841/2122 places, 1802/2082 transitions.
Deduced a syphon composed of 838 places in 2 ms
Applied a total of 0 rules in 63 ms. Remains 1841 /1841 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63004 ms. Remains : 1841/2122 places, 1802/2082 transitions.
Built C files in :
/tmp/ltsmin17188081388181670527
[2024-05-28 15:59:43] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17188081388181670527
Running compilation step : cd /tmp/ltsmin17188081388181670527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17188081388181670527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17188081388181670527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Applied a total of 0 rules in 86 ms. Remains 2122 /2122 variables (removed 0) and now considering 2082/2082 (removed 0) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2024-05-28 15:59:46] [INFO ] Computed 361 invariants in 14 ms
[2024-05-28 15:59:47] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-28 15:59:47] [INFO ] Invariant cache hit.
[2024-05-28 15:59:49] [INFO ] Implicit Places using invariants and state equation in 1972 ms returned []
Implicit Place search using SMT with State Equation took 2592 ms to find 0 implicit places.
Running 2081 sub problems to find dead transitions.
[2024-05-28 15:59:49] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2081/2081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2081 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 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2081 constraints, Known Traps: 0/0 constraints]
After SMT, in 60575ms problems are : Problem set: 0 solved, 2081 unsolved
Search for dead transitions found 0 dead transitions in 60592ms
Finished structural reductions in LTL mode , in 1 iterations and 63274 ms. Remains : 2122/2122 places, 2082/2082 transitions.
Built C files in :
/tmp/ltsmin9651729309603435010
[2024-05-28 16:00:50] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9651729309603435010
Running compilation step : cd /tmp/ltsmin9651729309603435010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9651729309603435010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9651729309603435010;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 16:00:53] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:00:53] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:00:53] [INFO ] Time to serialize gal into /tmp/LTL8035310267436139613.gal : 8 ms
[2024-05-28 16:00:53] [INFO ] Time to serialize properties into /tmp/LTL17607131333958081735.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8035310267436139613.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7908441449602107887.hoa' '-atoms' '/tmp/LTL17607131333958081735.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17607131333958081735.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7908441449602107887.hoa
Detected timeout of ITS tools.
[2024-05-28 16:01:08] [INFO ] Flatten gal took : 44 ms
[2024-05-28 16:01:08] [INFO ] Flatten gal took : 56 ms
[2024-05-28 16:01:08] [INFO ] Time to serialize gal into /tmp/LTL1795261199784480814.gal : 7 ms
[2024-05-28 16:01:08] [INFO ] Time to serialize properties into /tmp/LTL17068978929639326930.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1795261199784480814.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17068978929639326930.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(p581==1)"))))))
Formula 0 simplified : XXXG!"(p581==1)"
Detected timeout of ITS tools.
[2024-05-28 16:01:23] [INFO ] Flatten gal took : 48 ms
[2024-05-28 16:01:23] [INFO ] Applying decomposition
[2024-05-28 16:01:23] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10880156912780529760.txt' '-o' '/tmp/graph10880156912780529760.bin' '-w' '/tmp/graph10880156912780529760.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10880156912780529760.bin' '-l' '-1' '-v' '-w' '/tmp/graph10880156912780529760.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:01:23] [INFO ] Decomposing Gal with order
[2024-05-28 16:01:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:01:23] [INFO ] Removed a total of 920 redundant transitions.
[2024-05-28 16:01:23] [INFO ] Flatten gal took : 80 ms
[2024-05-28 16:01:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-28 16:01:23] [INFO ] Time to serialize gal into /tmp/LTL13828404377846886127.gal : 20 ms
[2024-05-28 16:01:23] [INFO ] Time to serialize properties into /tmp/LTL13317030633933161328.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13828404377846886127.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13317030633933161328.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(i10.i2.u200.p581==1)"))))))
Formula 0 simplified : XXXG!"(i10.i2.u200.p581==1)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-06 finished in 366701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 6 out of 2132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2131 transition count 1892
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1932 transition count 1892
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 398 place count 1932 transition count 1691
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 800 place count 1731 transition count 1691
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 810 place count 1721 transition count 1681
Iterating global reduction 2 with 10 rules applied. Total rules applied 820 place count 1721 transition count 1681
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 820 place count 1721 transition count 1675
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 832 place count 1715 transition count 1675
Performed 710 Post agglomeration using F-continuation condition.Transition count delta: 710
Deduced a syphon composed of 710 places in 2 ms
Reduce places removed 710 places and 0 transitions.
Iterating global reduction 2 with 1420 rules applied. Total rules applied 2252 place count 1005 transition count 965
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2254 place count 1003 transition count 963
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2255 place count 1002 transition count 963
Applied a total of 2255 rules in 265 ms. Remains 1002 /2132 variables (removed 1130) and now considering 963/2092 (removed 1129) transitions.
// Phase 1: matrix 963 rows 1002 cols
[2024-05-28 16:01:39] [INFO ] Computed 360 invariants in 5 ms
[2024-05-28 16:01:39] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-28 16:01:39] [INFO ] Invariant cache hit.
[2024-05-28 16:01:40] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2024-05-28 16:01:40] [INFO ] Redundant transitions in 96 ms returned [962]
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 958 sub problems to find dead transitions.
// Phase 1: matrix 962 rows 1002 cols
[2024-05-28 16:01:40] [INFO ] Computed 360 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 357/357 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:01:54] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 4 ms to minimize.
[2024-05-28 16:01:54] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 3 ms to minimize.
[2024-05-28 16:01:55] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 3 ms to minimize.
[2024-05-28 16:01:55] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 3 ms to minimize.
[2024-05-28 16:01:55] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:01:55] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 3 ms to minimize.
[2024-05-28 16:01:55] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 4 ms to minimize.
[2024-05-28 16:01:56] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:01:56] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:01:56] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 4 ms to minimize.
[2024-05-28 16:01:56] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:01:56] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:01:56] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:01:57] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 2 ms to minimize.
[2024-05-28 16:01:57] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:01:57] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:01:57] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:01:57] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-05-28 16:01:57] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:01:58] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 20/377 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:01:58] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:01:58] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 3 ms to minimize.
[2024-05-28 16:01:58] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:01:58] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 3 ms to minimize.
[2024-05-28 16:01:58] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:01:59] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:01:59] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:01:59] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:01:59] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:01:59] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:01:59] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:01:59] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:01:59] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:01:59] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:01:59] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:01:59] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:02:00] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:02:00] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-28 16:02:00] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:02:00] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/397 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:02:00] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:02:00] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:02:00] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:02:00] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:02:00] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:02:00] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:02:00] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:02:00] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:02:01] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:02:01] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:02:01] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:02:01] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:02:01] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:02:01] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:02:02] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:02:02] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:02:02] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:02:02] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:02:02] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:02:03] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 timeout
1.0)
(s305 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 20/417 constraints. Problems are: Problem set: 0 solved, 958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1964 variables, and 417 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 357/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 357/357 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 60/417 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:02:11] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:02:12] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:02:12] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:02:12] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-28 16:02:13] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-28 16:02:13] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:02:13] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:02:13] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:02:14] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:02:14] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:02:14] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:02:14] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:02:14] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2024-05-28 16:02:15] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:02:15] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:02:15] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:02:15] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:02:15] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:02:16] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:02:16] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:02:16] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 16:02:16] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-28 16:02:17] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-28 16:02:18] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:02:18] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-28 16:02:19] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:02:20] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 3 ms to minimize.
[2024-05-28 16:02:20] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:02:21] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:02:21] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 2 ms to minimize.
[2024-05-28 16:02:21] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:02:21] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:02:22] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 3 ms to minimize.
[2024-05-28 16:02:22] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:02:22] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 3 ms to minimize.
[2024-05-28 16:02:22] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:02:23] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:02:23] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:02:23] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:02:24] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:02:24] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:02:25] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:02:25] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2024-05-28 16:02:26] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2024-05-28 16:02:28] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:02:29] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:02:29] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:02:29] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:02:30] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:02:30] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:02:30] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:02:31] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:02:31] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:02:31] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 4 ms to minimize.
[2024-05-28 16:02:32] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:02:32] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 3 ms to minimize.
[2024-05-28 16:02:32] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 3 ms to minimize.
[2024-05-28 16:02:36] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 16:02:36] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:02:36] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/999 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:02:38] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:02:39] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:02:40] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:02:40] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1964 variables, and 481 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 357/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 124/124 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1002/2132 places, 962/2092 transitions.
Applied a total of 0 rules in 17 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61944 ms. Remains : 1002/2132 places, 962/2092 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-07
Product exploration explored 100000 steps with 48 reset in 773 ms.
Product exploration explored 100000 steps with 48 reset in 918 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) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 35570 steps (15 resets) in 312 ms. (113 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 190 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 22 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2024-05-28 16:02:43] [INFO ] Invariant cache hit.
[2024-05-28 16:02:43] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-28 16:02:43] [INFO ] Invariant cache hit.
[2024-05-28 16:02:44] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2024-05-28 16:02:44] [INFO ] Redundant transitions in 94 ms returned []
Running 958 sub problems to find dead transitions.
[2024-05-28 16:02:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 357/357 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:02:58] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 4 ms to minimize.
[2024-05-28 16:02:59] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 3 ms to minimize.
[2024-05-28 16:02:59] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 4 ms to minimize.
[2024-05-28 16:02:59] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:02:59] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:03:00] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 3 ms to minimize.
[2024-05-28 16:03:00] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 4 ms to minimize.
[2024-05-28 16:03:00] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:03:00] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:03:00] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:03:00] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:03:01] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-05-28 16:03:01] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:03:01] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:03:01] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:03:01] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-05-28 16:03:01] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:03:02] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:03:02] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:03:02] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 20/377 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:03:02] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 3 ms to minimize.
[2024-05-28 16:03:02] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:03:02] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:03:03] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:03:03] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:03:03] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:03:03] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:03:03] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:03:03] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:03:03] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:03:03] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:03:03] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:03:03] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-05-28 16:03:04] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:03:04] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:03:04] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:03:04] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2024-05-28 16:03:04] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:03:04] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:03:04] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/397 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:03:04] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:03:04] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:03:04] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:03:04] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:03:04] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 16:03:05] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:03:05] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:03:05] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:03:05] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:03:05] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:03:05] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:03:06] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-28 16:03:06] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:03:06] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:03:06] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:03:06] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:03:07] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:03:07] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:03:07] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:03:07] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 20/417 constraints. Problems are: Problem set: 0 solved, 958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1964 variables, and 417 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 357/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 357/357 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 60/417 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:03:15] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:03:15] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 16:03:16] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:03:16] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:03:17] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:03:17] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:03:18] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:03:18] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:03:18] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:03:18] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:03:18] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:03:19] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-28 16:03:19] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:03:19] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:03:19] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:03:20] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 3 ms to minimize.
[2024-05-28 16:03:20] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:03:20] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 3 ms to minimize.
[2024-05-28 16:03:20] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2024-05-28 16:03:21] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:03:21] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:03:24] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:03:24] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:03:25] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:03:25] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:03:25] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:03:26] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:03:26] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:03:26] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 3 ms to minimize.
[2024-05-28 16:03:27] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:03:27] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 2 ms to minimize.
[2024-05-28 16:03:27] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:03:27] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:03:28] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:03:28] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:03:28] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:03:29] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:03:29] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:03:29] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 3 ms to minimize.
[2024-05-28 16:03:29] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:03:30] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:03:30] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 16:03:30] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:03:32] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:03:32] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:03:33] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:03:34] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:03:34] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 3 ms to minimize.
[2024-05-28 16:03:36] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 3 ms to minimize.
[2024-05-28 16:03:36] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 3 ms to minimize.
[2024-05-28 16:03:40] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:03:40] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:03:40] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:03:41] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:03:41] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:03:42] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:03:42] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:03:43] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 16:03:43] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:03:43] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/999 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:03:43] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:03:44] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1964 variables, and 479 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 357/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 122/122 constraints]
After SMT, in 60226ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60235ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61690 ms. Remains : 1002/1002 places, 962/962 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 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 35761 steps (14 resets) in 381 ms. (93 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 48 reset in 758 ms.
Product exploration explored 100000 steps with 48 reset in 916 ms.
Built C files in :
/tmp/ltsmin6331089935394589342
[2024-05-28 16:03:47] [INFO ] Computing symmetric may disable matrix : 962 transitions.
[2024-05-28 16:03:47] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:03:47] [INFO ] Computing symmetric may enable matrix : 962 transitions.
[2024-05-28 16:03:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:03:47] [INFO ] Computing Do-Not-Accords matrix : 962 transitions.
[2024-05-28 16:03:47] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:03:47] [INFO ] Built C files in 171ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6331089935394589342
Running compilation step : cd /tmp/ltsmin6331089935394589342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6331089935394589342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6331089935394589342;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 6 out of 1002 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 18 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2024-05-28 16:03:50] [INFO ] Invariant cache hit.
[2024-05-28 16:03:51] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-05-28 16:03:51] [INFO ] Invariant cache hit.
[2024-05-28 16:03:52] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
[2024-05-28 16:03:52] [INFO ] Redundant transitions in 100 ms returned []
Running 958 sub problems to find dead transitions.
[2024-05-28 16:03:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 357/357 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:04:06] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 4 ms to minimize.
[2024-05-28 16:04:06] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 4 ms to minimize.
[2024-05-28 16:04:06] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 4 ms to minimize.
[2024-05-28 16:04:06] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 3 ms to minimize.
[2024-05-28 16:04:07] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 4 ms to minimize.
[2024-05-28 16:04:07] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 3 ms to minimize.
[2024-05-28 16:04:07] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:04:07] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:04:07] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-05-28 16:04:08] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 4 ms to minimize.
[2024-05-28 16:04:08] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 2 ms to minimize.
[2024-05-28 16:04:08] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:04:08] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:04:08] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:04:08] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:04:09] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:04:09] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:04:09] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:04:09] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:04:09] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 20/377 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:04:10] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 3 ms to minimize.
[2024-05-28 16:04:10] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 3 ms to minimize.
[2024-05-28 16:04:10] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:04:10] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:04:10] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:04:10] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:04:10] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:04:10] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:04:10] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:04:11] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:04:11] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:04:11] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:04:11] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:04:11] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:04:11] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:04:11] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:04:11] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:04:11] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-05-28 16:04:11] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:04:11] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/397 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:04:12] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:04:12] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:04:12] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:04:12] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:04:12] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 16:04:12] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:04:12] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:04:12] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:04:12] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:04:13] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:04:13] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:04:13] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:04:13] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-28 16:04:13] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:04:14] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:04:14] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:04:14] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:04:14] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:04:14] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:04:15] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 20/417 constraints. Problems are: Problem set: 0 solved, 958 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 999/1964 variables, and 417 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 357/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 958/958 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 958 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/999 variables, 357/357 constraints. Problems are: Problem set: 0 solved, 958 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/999 variables, 60/417 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:04:23] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:04:23] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:04:23] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:04:24] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:04:24] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:04:25] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:04:25] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:04:25] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:04:25] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:04:25] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:04:26] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:04:26] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:04:26] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:04:26] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:04:27] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:04:27] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:04:27] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:04:27] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:04:27] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:04:28] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/999 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:04:28] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:04:31] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 2 ms to minimize.
[2024-05-28 16:04:32] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-05-28 16:04:32] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:04:32] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 3 ms to minimize.
[2024-05-28 16:04:33] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:04:33] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:04:33] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:04:34] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:04:34] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:04:34] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 2 ms to minimize.
[2024-05-28 16:04:34] [INFO ] Deduced a trap composed of 14 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:04:35] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:04:35] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:04:35] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:04:35] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 4 ms to minimize.
[2024-05-28 16:04:36] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 3 ms to minimize.
[2024-05-28 16:04:36] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 3 ms to minimize.
[2024-05-28 16:04:36] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 4 ms to minimize.
[2024-05-28 16:04:37] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/999 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:04:37] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:04:37] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 16:04:38] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:04:39] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-28 16:04:40] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:04:40] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 3 ms to minimize.
[2024-05-28 16:04:41] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 3 ms to minimize.
[2024-05-28 16:04:42] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:04:43] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 4 ms to minimize.
[2024-05-28 16:04:44] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 4 ms to minimize.
[2024-05-28 16:04:47] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:04:47] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:04:48] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 16:04:48] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:04:48] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:04:49] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:04:49] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:04:50] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:04:50] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:04:50] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/999 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 958 unsolved
[2024-05-28 16:04:50] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:04:51] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/1964 variables, and 479 constraints, problems are : Problem set: 0 solved, 958 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 357/360 constraints, State Equation: 0/1002 constraints, PredecessorRefiner: 0/958 constraints, Known Traps: 122/122 constraints]
After SMT, in 60232ms problems are : Problem set: 0 solved, 958 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61729 ms. Remains : 1002/1002 places, 962/962 transitions.
Built C files in :
/tmp/ltsmin3055148215481260621
[2024-05-28 16:04:52] [INFO ] Computing symmetric may disable matrix : 962 transitions.
[2024-05-28 16:04:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:04:52] [INFO ] Computing symmetric may enable matrix : 962 transitions.
[2024-05-28 16:04:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:04:52] [INFO ] Computing Do-Not-Accords matrix : 962 transitions.
[2024-05-28 16:04:52] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:04:52] [INFO ] Built C files in 150ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3055148215481260621
Running compilation step : cd /tmp/ltsmin3055148215481260621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3055148215481260621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3055148215481260621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 16:04:55] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:04:55] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:04:55] [INFO ] Time to serialize gal into /tmp/LTL3521456512320411157.gal : 5 ms
[2024-05-28 16:04:55] [INFO ] Time to serialize properties into /tmp/LTL2261702026631331671.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3521456512320411157.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14032681239433436507.hoa' '-atoms' '/tmp/LTL2261702026631331671.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2261702026631331671.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14032681239433436507.hoa
Detected timeout of ITS tools.
[2024-05-28 16:05:10] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:05:10] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:05:10] [INFO ] Time to serialize gal into /tmp/LTL15996477955753984345.gal : 7 ms
[2024-05-28 16:05:10] [INFO ] Time to serialize properties into /tmp/LTL9442507832789739244.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15996477955753984345.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9442507832789739244.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p243==0)||(p265==0))")||(("(p276==0)")||(G("(((p712==0)||(p720==0))||(p748==0))")))))))
Formula 0 simplified : G(F!"(((p712==0)||(p720==0))||(p748==0))" & FG(!"((p243==0)||(p265==0))" & !"(p276==0)"))
Detected timeout of ITS tools.
[2024-05-28 16:05:25] [INFO ] Flatten gal took : 31 ms
[2024-05-28 16:05:25] [INFO ] Applying decomposition
[2024-05-28 16:05:25] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13495421524752065199.txt' '-o' '/tmp/graph13495421524752065199.bin' '-w' '/tmp/graph13495421524752065199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13495421524752065199.bin' '-l' '-1' '-v' '-w' '/tmp/graph13495421524752065199.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:05:26] [INFO ] Decomposing Gal with order
[2024-05-28 16:05:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:05:26] [INFO ] Removed a total of 643 redundant transitions.
[2024-05-28 16:05:26] [INFO ] Flatten gal took : 41 ms
[2024-05-28 16:05:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 602 labels/synchronizations in 8 ms.
[2024-05-28 16:05:26] [INFO ] Time to serialize gal into /tmp/LTL7257998455214095418.gal : 7 ms
[2024-05-28 16:05:26] [INFO ] Time to serialize properties into /tmp/LTL16178086178987539073.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7257998455214095418.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16178086178987539073.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i3.i2.u32.p243==0)||(i3.i2.u36.p265==0))")||(("(i3.i1.u38.p276==0)")||(G("(((i11.i0.u105.p712==0)||(i11.i0.u107.p720==0))||...185
Formula 0 simplified : G(F!"(((i11.i0.u105.p712==0)||(i11.i0.u107.p720==0))||(i11.i2.u111.p748==0))" & FG(!"((i3.i2.u32.p243==0)||(i3.i2.u36.p265==0))" & !...178
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-07 finished in 242242 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 1 out of 2132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2122 transition count 2082
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2122 transition count 2082
Applied a total of 20 rules in 163 ms. Remains 2122 /2132 variables (removed 10) and now considering 2082/2092 (removed 10) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2024-05-28 16:05:41] [INFO ] Computed 361 invariants in 14 ms
[2024-05-28 16:05:41] [INFO ] Implicit Places using invariants in 615 ms returned []
[2024-05-28 16:05:41] [INFO ] Invariant cache hit.
[2024-05-28 16:05:43] [INFO ] Implicit Places using invariants and state equation in 2011 ms returned []
Implicit Place search using SMT with State Equation took 2626 ms to find 0 implicit places.
Running 2081 sub problems to find dead transitions.
[2024-05-28 16:05:44] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2081/2081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2081 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 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2081 constraints, Known Traps: 0/0 constraints]
After SMT, in 60563ms problems are : Problem set: 0 solved, 2081 unsolved
Search for dead transitions found 0 dead transitions in 60581ms
Starting structural reductions in LTL mode, iteration 1 : 2122/2132 places, 2082/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63383 ms. Remains : 2122/2132 places, 2082/2092 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 456 ms.
Product exploration explored 100000 steps with 50000 reset in 465 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 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 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-040B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-040B-LTLFireability-08 finished in 64452 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(((F(p0) U G(p1))&&(p0||F(G(p2))))))'
Support contains 4 out of 2132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 2131 transition count 1890
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1930 transition count 1890
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 402 place count 1930 transition count 1689
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 804 place count 1729 transition count 1689
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 813 place count 1720 transition count 1680
Iterating global reduction 2 with 9 rules applied. Total rules applied 822 place count 1720 transition count 1680
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 822 place count 1720 transition count 1674
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 834 place count 1714 transition count 1674
Performed 707 Post agglomeration using F-continuation condition.Transition count delta: 707
Deduced a syphon composed of 707 places in 2 ms
Reduce places removed 707 places and 0 transitions.
Iterating global reduction 2 with 1414 rules applied. Total rules applied 2248 place count 1007 transition count 967
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2250 place count 1005 transition count 965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2251 place count 1004 transition count 965
Applied a total of 2251 rules in 301 ms. Remains 1004 /2132 variables (removed 1128) and now considering 965/2092 (removed 1127) transitions.
// Phase 1: matrix 965 rows 1004 cols
[2024-05-28 16:06:45] [INFO ] Computed 360 invariants in 4 ms
[2024-05-28 16:06:46] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-28 16:06:46] [INFO ] Invariant cache hit.
[2024-05-28 16:06:47] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
[2024-05-28 16:06:47] [INFO ] Redundant transitions in 90 ms returned [964]
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 962 sub problems to find dead transitions.
// Phase 1: matrix 964 rows 1004 cols
[2024-05-28 16:06:47] [INFO ] Computed 360 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1003 variables, 355/355 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:07:01] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 4 ms to minimize.
[2024-05-28 16:07:01] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 3 ms to minimize.
[2024-05-28 16:07:01] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 3 ms to minimize.
[2024-05-28 16:07:01] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 3 ms to minimize.
[2024-05-28 16:07:01] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 4 ms to minimize.
[2024-05-28 16:07:02] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:07:02] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 4 ms to minimize.
[2024-05-28 16:07:02] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:07:02] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 4 ms to minimize.
[2024-05-28 16:07:02] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 3 ms to minimize.
[2024-05-28 16:07:03] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:07:03] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:07:03] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
[2024-05-28 16:07:03] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 3 ms to minimize.
[2024-05-28 16:07:03] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 3 ms to minimize.
[2024-05-28 16:07:04] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 3 ms to minimize.
[2024-05-28 16:07:04] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:07:04] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:07:04] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:07:04] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1003 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:07:04] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:07:05] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 3 ms to minimize.
[2024-05-28 16:07:05] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:07:05] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:07:05] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:07:05] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:07:05] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 3 ms to minimize.
[2024-05-28 16:07:05] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:07:06] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:07:06] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:07:06] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:07:06] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:07:06] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:07:06] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:07:06] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:07:06] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-28 16:07:06] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:07:06] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1003 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:07:07] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:07:08] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:07:08] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-28 16:07:08] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:07:08] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-28 16:07:08] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:07:08] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:07:09] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:07:09] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:07:09] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:07:09] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:07:09] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 20/415 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1968 variables, and 415 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 355/360 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1003 variables, 355/355 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1003 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:07:18] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:07:19] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:07:19] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:07:19] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:07:19] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:07:20] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:07:20] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:07:20] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:07:20] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:07:20] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:07:21] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:07:21] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:07:21] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:07:21] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:07:22] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:07:22] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:07:22] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:07:22] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:07:23] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:07:23] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1003 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:07:23] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:07:24] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:07:25] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-28 16:07:25] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:07:26] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:07:26] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:07:26] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:07:27] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:07:27] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:07:27] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:07:28] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 2 ms to minimize.
[2024-05-28 16:07:28] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:07:28] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 3 ms to minimize.
[2024-05-28 16:07:28] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 3 ms to minimize.
[2024-05-28 16:07:29] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:07:29] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:07:29] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:07:30] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:07:30] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 4 ms to minimize.
[2024-05-28 16:07:31] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 20/455 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:07:34] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 3 ms to minimize.
[2024-05-28 16:07:35] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:07:35] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:07:36] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 3 ms to minimize.
[2024-05-28 16:07:36] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 3 ms to minimize.
[2024-05-28 16:07:37] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 4 ms to minimize.
[2024-05-28 16:07:37] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-28 16:07:38] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-28 16:07:38] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-28 16:07:38] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-28 16:07:39] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:07:43] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:07:43] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:07:43] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 16:07:43] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:07:44] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:07:44] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:07:44] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:07:44] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:07:45] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/475 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:07:45] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 16:07:47] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1968 variables, and 477 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 355/360 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 122/122 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1004/2132 places, 964/2092 transitions.
Applied a total of 0 rules in 18 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62027 ms. Remains : 1004/2132 places, 964/2092 transitions.
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-09
Product exploration explored 100000 steps with 1437 reset in 741 ms.
Product exploration explored 100000 steps with 1385 reset in 895 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 : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 141 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter insensitive) to 10 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 406 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), false, false, false]
RANDOM walk for 40000 steps (16 resets) in 431 ms. (92 steps per ms) remains 3/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 3/3 properties
[2024-05-28 16:07:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/26 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 45/71 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 104/175 variables, 44/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 11/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 6/181 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/185 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 136/321 variables, 66/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 19/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/321 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 7/328 variables, 5/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/328 variables, 7/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/328 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 6/334 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/334 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/334 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 142/476 variables, 70/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/476 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:07:50] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/476 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/476 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 9/485 variables, 6/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/485 variables, 9/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/485 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 6/491 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/491 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/491 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 134/625 variables, 66/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/625 variables, 18/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/625 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 9/634 variables, 7/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/634 variables, 9/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/634 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 4/638 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/638 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 130/768 variables, 66/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/768 variables, 18/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/768 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 9/777 variables, 7/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/777 variables, 9/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/777 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 4/781 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/781 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 111/892 variables, 56/574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/892 variables, 15/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:07:51] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:07:51] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:07:51] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:07:51] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 52 (INCLUDED_ONLY) 0/892 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/892 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 9/901 variables, 7/600 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/901 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/901 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 4/905 variables, 2/611 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/905 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/905 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 97/1002 variables, 48/661 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1002 variables, 14/675 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:07:51] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 62 (INCLUDED_ONLY) 0/1002 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 63 (INCLUDED_ONLY) 0/1002 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 6/1008 variables, 4/680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1008 variables, 6/686 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1008 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 4/1012 variables, 2/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1012 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 85/1097 variables, 44/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1097 variables, 12/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1097 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 6/1103 variables, 5/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1103 variables, 6/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1103 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 2/1105 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1105 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (OVERLAPS) 89/1194 variables, 42/798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1194 variables, 11/809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1194 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (OVERLAPS) 6/1200 variables, 4/813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1200 variables, 6/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1200 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (OVERLAPS) 4/1204 variables, 2/821 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1204 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (OVERLAPS) 74/1278 variables, 41/862 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1278 variables, 12/874 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1278 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (OVERLAPS) 4/1282 variables, 4/878 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1282 variables, 4/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1282 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 2/1284 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1284 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (OVERLAPS) 72/1356 variables, 34/917 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1356 variables, 9/926 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1356 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (OVERLAPS) 5/1361 variables, 3/929 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1361 variables, 5/934 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1361 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (OVERLAPS) 2/1363 variables, 1/935 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1363 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (OVERLAPS) 62/1425 variables, 32/967 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1425 variables, 9/976 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1425 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (OVERLAPS) 4/1429 variables, 4/980 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1429 variables, 4/984 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1429 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (OVERLAPS) 2/1431 variables, 1/985 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1431 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (OVERLAPS) 72/1503 variables, 34/1019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1503 variables, 9/1028 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1503 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (OVERLAPS) 5/1508 variables, 3/1031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1508 variables, 5/1036 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1508 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (OVERLAPS) 2/1510 variables, 1/1037 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1510 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (OVERLAPS) 62/1572 variables, 32/1069 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1572 variables, 9/1078 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1572 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (OVERLAPS) 4/1576 variables, 4/1082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1576 variables, 4/1086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1576 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (OVERLAPS) 2/1578 variables, 1/1087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1578 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (OVERLAPS) 72/1650 variables, 34/1121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1650 variables, 9/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1650 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (OVERLAPS) 5/1655 variables, 3/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1655 variables, 5/1138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1655 variables, 0/1138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (OVERLAPS) 2/1657 variables, 1/1139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1657 variables, 0/1139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (OVERLAPS) 62/1719 variables, 32/1171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1719 variables, 9/1180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1719 variables, 0/1180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (OVERLAPS) 4/1723 variables, 4/1184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1723 variables, 4/1188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1723 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (OVERLAPS) 2/1725 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1725 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (OVERLAPS) 72/1797 variables, 34/1223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1797 variables, 9/1232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1797 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (OVERLAPS) 5/1802 variables, 3/1235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1802 variables, 5/1240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1802 variables, 0/1240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (OVERLAPS) 2/1804 variables, 1/1241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1804 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 149 (OVERLAPS) 62/1866 variables, 32/1273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1866 variables, 9/1282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1866 variables, 0/1282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 152 (OVERLAPS) 4/1870 variables, 4/1286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1870 variables, 4/1290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1870 variables, 0/1290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 155 (OVERLAPS) 2/1872 variables, 1/1291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1872 variables, 0/1291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 157 (OVERLAPS) 63/1935 variables, 34/1325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1935 variables, 10/1335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1935 variables, 0/1335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 160 (OVERLAPS) 3/1938 variables, 2/1337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1938 variables, 3/1340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1938 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 163 (OVERLAPS) 2/1940 variables, 1/1341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1940 variables, 0/1341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 165 (OVERLAPS) 25/1965 variables, 18/1359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1965 variables, 5/1364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1965 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 168 (OVERLAPS) 1/1966 variables, 2/1366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1966 variables, 1/1367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1966 variables, 0/1367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 171 (OVERLAPS) 2/1968 variables, 2/1369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1968 variables, 1/1370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1968 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 174 (OVERLAPS) 0/1968 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1968/1968 variables, and 1370 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4229 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1004/1004 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/26 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 45/71 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 104/175 variables, 44/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 11/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/181 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/181 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 4/185 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 136/321 variables, 66/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/321 variables, 19/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/321 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 7/328 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/328 variables, 7/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/328 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 6/334 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/334 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/334 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 142/476 variables, 70/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/476 variables, 20/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/476 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/476 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 9/485 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/485 variables, 9/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/485 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 6/491 variables, 3/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/491 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:07:55] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/491 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/491 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 134/625 variables, 66/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/625 variables, 18/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:07:55] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:07:55] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/625 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/625 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 9/634 variables, 7/411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/634 variables, 9/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/634 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 4/638 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/638 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 130/768 variables, 66/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/768 variables, 18/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/768 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 9/777 variables, 7/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/777 variables, 9/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:07:55] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/777 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/777 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 4/781 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/781 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 111/892 variables, 56/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/892 variables, 15/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/892 variables, 4/600 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/892 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 9/901 variables, 7/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/901 variables, 9/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/901 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 4/905 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/905 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/905 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 97/1002 variables, 48/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1002 variables, 14/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1002 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:07:56] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:07:56] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/1002 variables, 2/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1002 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 6/1008 variables, 4/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1008 variables, 6/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1008 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 4/1012 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1012 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (OVERLAPS) 85/1097 variables, 44/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1097 variables, 12/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:07:56] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 76 (INCLUDED_ONLY) 0/1097 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1097 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (OVERLAPS) 6/1103 variables, 5/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1103 variables, 6/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1103 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (OVERLAPS) 2/1105 variables, 1/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1105 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (OVERLAPS) 89/1194 variables, 42/808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1194 variables, 11/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1194 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (OVERLAPS) 6/1200 variables, 4/823 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1200 variables, 6/829 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1200 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (OVERLAPS) 4/1204 variables, 2/831 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1204 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 74/1278 variables, 41/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1278 variables, 12/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1278 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (OVERLAPS) 4/1282 variables, 4/888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1282 variables, 4/892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1282 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 2/1284 variables, 1/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1284 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (OVERLAPS) 72/1356 variables, 34/927 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1356 variables, 9/936 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1356 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (OVERLAPS) 5/1361 variables, 3/939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1361 variables, 5/944 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1361 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 2/1363 variables, 1/945 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1363 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (OVERLAPS) 62/1425 variables, 32/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1425 variables, 9/986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1425 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (OVERLAPS) 4/1429 variables, 4/990 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1429 variables, 4/994 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1429 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (OVERLAPS) 2/1431 variables, 1/995 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1431 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (OVERLAPS) 72/1503 variables, 34/1029 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1503 variables, 9/1038 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1503 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (OVERLAPS) 5/1508 variables, 3/1041 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1508 variables, 5/1046 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1508 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (OVERLAPS) 2/1510 variables, 1/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1510 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (OVERLAPS) 62/1572 variables, 32/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1572 variables, 9/1088 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1572 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (OVERLAPS) 4/1576 variables, 4/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1576 variables, 4/1096 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1576 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (OVERLAPS) 2/1578 variables, 1/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1578 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (OVERLAPS) 72/1650 variables, 34/1131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1650 variables, 9/1140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1650 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (OVERLAPS) 5/1655 variables, 3/1143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1655 variables, 5/1148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1655 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (OVERLAPS) 2/1657 variables, 1/1149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1657 variables, 0/1149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (OVERLAPS) 62/1719 variables, 32/1181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1719 variables, 9/1190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1719 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (OVERLAPS) 4/1723 variables, 4/1194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1723 variables, 4/1198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1723 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (OVERLAPS) 2/1725 variables, 1/1199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1725 variables, 0/1199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (OVERLAPS) 72/1797 variables, 34/1233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1797 variables, 9/1242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:07:58] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
At refinement iteration 149 (INCLUDED_ONLY) 0/1797 variables, 1/1243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1797 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 151 (OVERLAPS) 5/1802 variables, 3/1246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1802 variables, 5/1251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1802 variables, 0/1251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 154 (OVERLAPS) 2/1804 variables, 1/1252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1804 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 156 (OVERLAPS) 62/1866 variables, 32/1284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1866 variables, 9/1293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1866 variables, 0/1293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 159 (OVERLAPS) 4/1870 variables, 4/1297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1870 variables, 4/1301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1870 variables, 0/1301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 162 (OVERLAPS) 2/1872 variables, 1/1302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1872 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 164 (OVERLAPS) 63/1935 variables, 34/1336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1935 variables, 10/1346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:07:59] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:07:59] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
At refinement iteration 166 (INCLUDED_ONLY) 0/1935 variables, 2/1348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1935 variables, 0/1348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 168 (OVERLAPS) 3/1938 variables, 2/1350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1938 variables, 3/1353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:07:59] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
SMT process timed out in 9262ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Partial Free-agglomeration rule applied 237 times.
Drop transitions (Partial Free agglomeration) removed 237 transitions
Iterating global reduction 0 with 237 rules applied. Total rules applied 237 place count 1004 transition count 964
Applied a total of 237 rules in 42 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1004/1004 places, 964/964 transitions.
RANDOM walk for 35539 steps (7 resets) in 873 ms. (40 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F p0), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p0) p1)))), (F p2), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 18 factoid took 801 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter insensitive) to 10 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 436 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 451 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), false, false, false]
[2024-05-28 16:08:01] [INFO ] Invariant cache hit.
[2024-05-28 16:08:02] [INFO ] [Real]Absence check using 360 positive place invariants in 152 ms returned sat
[2024-05-28 16:08:04] [INFO ] [Real]Absence check using state equation in 1964 ms returned sat
[2024-05-28 16:08:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:08:05] [INFO ] [Nat]Absence check using 360 positive place invariants in 144 ms returned sat
[2024-05-28 16:08:07] [INFO ] [Nat]Absence check using state equation in 1827 ms returned sat
[2024-05-28 16:08:07] [INFO ] Computed and/alt/rep : 961/2398/961 causal constraints (skipped 1 transitions) in 48 ms.
[2024-05-28 16:08:19] [INFO ] Added : 650 causal constraints over 130 iterations in 12450 ms. Result :unknown
Could not prove EG (NOT p1)
[2024-05-28 16:08:19] [INFO ] Invariant cache hit.
[2024-05-28 16:08:20] [INFO ] [Real]Absence check using 360 positive place invariants in 155 ms returned sat
[2024-05-28 16:08:22] [INFO ] [Real]Absence check using state equation in 1885 ms returned sat
[2024-05-28 16:08:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:08:23] [INFO ] [Nat]Absence check using 360 positive place invariants in 152 ms returned sat
[2024-05-28 16:08:25] [INFO ] [Nat]Absence check using state equation in 2050 ms returned sat
[2024-05-28 16:08:25] [INFO ] Computed and/alt/rep : 961/2398/961 causal constraints (skipped 1 transitions) in 53 ms.
[2024-05-28 16:08:34] [INFO ] Added : 521 causal constraints over 106 iterations in 9534 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 21 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2024-05-28 16:08:34] [INFO ] Invariant cache hit.
[2024-05-28 16:08:35] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-28 16:08:35] [INFO ] Invariant cache hit.
[2024-05-28 16:08:35] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
[2024-05-28 16:08:36] [INFO ] Redundant transitions in 98 ms returned []
Running 962 sub problems to find dead transitions.
[2024-05-28 16:08:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1003 variables, 355/355 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:08:50] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 4 ms to minimize.
[2024-05-28 16:08:50] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 4 ms to minimize.
[2024-05-28 16:08:50] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 3 ms to minimize.
[2024-05-28 16:08:50] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 3 ms to minimize.
[2024-05-28 16:08:50] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 3 ms to minimize.
[2024-05-28 16:08:51] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:08:51] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-05-28 16:08:51] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 3 ms to minimize.
[2024-05-28 16:08:51] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:08:51] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:08:52] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:08:52] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-05-28 16:08:52] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:08:52] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:08:52] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:08:52] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:08:53] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-05-28 16:08:53] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-05-28 16:08:53] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:08:53] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1003 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:08:53] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:08:53] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-05-28 16:08:54] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 3 ms to minimize.
[2024-05-28 16:08:54] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:08:54] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:08:54] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 3 ms to minimize.
[2024-05-28 16:08:54] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 3 ms to minimize.
[2024-05-28 16:08:54] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:08:54] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:08:54] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:08:55] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:08:55] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:08:55] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:08:55] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:08:55] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:08:55] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:08:55] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:08:55] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:08:55] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:08:55] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1003 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:08:55] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:08:55] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:08:56] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:08:56] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:08:56] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:08:56] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:08:56] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:08:56] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:08:56] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:08:57] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:08:57] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:08:57] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:08:57] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:08:57] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:08:57] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:08:57] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:08:58] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:08:58] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:08:58] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:08:58] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 20/415 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1968 variables, and 415 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 355/360 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1003 variables, 355/355 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1003 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:09:07] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:09:07] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:09:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:09:08] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:09:08] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:09:08] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-28 16:09:08] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:09:09] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:09:09] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:09:09] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:09:09] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:09:09] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:09:10] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:09:10] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-05-28 16:09:10] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:09:10] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:09:10] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:09:11] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:09:11] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:09:11] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1003 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:09:12] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-28 16:09:12] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:09:13] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-05-28 16:09:14] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-05-28 16:09:14] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:09:15] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:09:15] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:09:15] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:09:15] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 2 ms to minimize.
[2024-05-28 16:09:16] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:09:16] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:09:16] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:09:16] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 2 ms to minimize.
[2024-05-28 16:09:17] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:09:17] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:09:17] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 3 ms to minimize.
[2024-05-28 16:09:17] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:09:18] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:09:18] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:09:18] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 20/455 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:09:19] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:09:21] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:09:21] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 3 ms to minimize.
[2024-05-28 16:09:22] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:09:23] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 3 ms to minimize.
[2024-05-28 16:09:24] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:09:24] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 3 ms to minimize.
[2024-05-28 16:09:24] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 3 ms to minimize.
[2024-05-28 16:09:25] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 3 ms to minimize.
[2024-05-28 16:09:25] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-28 16:09:25] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:09:26] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:09:26] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:09:26] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-05-28 16:09:26] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:09:30] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:09:30] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:09:30] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:09:30] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:09:31] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/475 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:09:31] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:09:31] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:09:32] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:09:33] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2024-05-28 16:09:34] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:09:34] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 3 ms to minimize.
[2024-05-28 16:09:35] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 3 ms to minimize.
[2024-05-28 16:09:35] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1003/1968 variables, and 483 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 355/360 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 128/128 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61621 ms. Remains : 1004/1004 places, 964/964 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 : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 155 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter insensitive) to 10 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 435 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), false, false, false]
RANDOM walk for 40000 steps (16 resets) in 2161 ms. (18 steps per ms) remains 3/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 447 ms. (89 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 278 ms. (143 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 3/3 properties
[2024-05-28 16:09:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/26 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 45/71 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 104/175 variables, 44/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 11/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 6/181 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 6/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/185 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 136/321 variables, 66/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 19/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/321 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 7/328 variables, 5/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/328 variables, 7/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/328 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 6/334 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/334 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/334 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 142/476 variables, 70/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/476 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:09:38] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/476 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/476 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 9/485 variables, 6/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/485 variables, 9/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/485 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 6/491 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/491 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/491 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 134/625 variables, 66/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/625 variables, 18/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/625 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 9/634 variables, 7/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/634 variables, 9/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/634 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 4/638 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/638 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 130/768 variables, 66/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/768 variables, 18/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/768 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 9/777 variables, 7/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/777 variables, 9/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/777 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 4/781 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/781 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 111/892 variables, 56/574 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/892 variables, 15/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:09:38] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2024-05-28 16:09:38] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:09:38] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:09:38] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
At refinement iteration 52 (INCLUDED_ONLY) 0/892 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/892 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 9/901 variables, 7/600 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/901 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/901 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 4/905 variables, 2/611 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/905 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/905 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 97/1002 variables, 48/661 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1002 variables, 14/675 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:09:39] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 62 (INCLUDED_ONLY) 0/1002 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 63 (INCLUDED_ONLY) 0/1002 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 6/1008 variables, 4/680 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1008 variables, 6/686 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1008 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 4/1012 variables, 2/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1012 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 85/1097 variables, 44/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1097 variables, 12/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1097 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 6/1103 variables, 5/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1103 variables, 6/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1103 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 2/1105 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1105 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (OVERLAPS) 89/1194 variables, 42/798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1194 variables, 11/809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1194 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (OVERLAPS) 6/1200 variables, 4/813 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1200 variables, 6/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1200 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (OVERLAPS) 4/1204 variables, 2/821 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1204 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (OVERLAPS) 74/1278 variables, 41/862 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1278 variables, 12/874 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1278 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (OVERLAPS) 4/1282 variables, 4/878 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1282 variables, 4/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1282 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 2/1284 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1284 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (OVERLAPS) 72/1356 variables, 34/917 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1356 variables, 9/926 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1356 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (OVERLAPS) 5/1361 variables, 3/929 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1361 variables, 5/934 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1361 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (OVERLAPS) 2/1363 variables, 1/935 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1363 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (OVERLAPS) 62/1425 variables, 32/967 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1425 variables, 9/976 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1425 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (OVERLAPS) 4/1429 variables, 4/980 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1429 variables, 4/984 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1429 variables, 0/984 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (OVERLAPS) 2/1431 variables, 1/985 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1431 variables, 0/985 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (OVERLAPS) 72/1503 variables, 34/1019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1503 variables, 9/1028 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1503 variables, 0/1028 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (OVERLAPS) 5/1508 variables, 3/1031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1508 variables, 5/1036 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1508 variables, 0/1036 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (OVERLAPS) 2/1510 variables, 1/1037 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1510 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (OVERLAPS) 62/1572 variables, 32/1069 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1572 variables, 9/1078 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1572 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (OVERLAPS) 4/1576 variables, 4/1082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1576 variables, 4/1086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1576 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (OVERLAPS) 2/1578 variables, 1/1087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1578 variables, 0/1087 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (OVERLAPS) 72/1650 variables, 34/1121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1650 variables, 9/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1650 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (OVERLAPS) 5/1655 variables, 3/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1655 variables, 5/1138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1655 variables, 0/1138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (OVERLAPS) 2/1657 variables, 1/1139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1657 variables, 0/1139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (OVERLAPS) 62/1719 variables, 32/1171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1719 variables, 9/1180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1719 variables, 0/1180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (OVERLAPS) 4/1723 variables, 4/1184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1723 variables, 4/1188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1723 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (OVERLAPS) 2/1725 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1725 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (OVERLAPS) 72/1797 variables, 34/1223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1797 variables, 9/1232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1797 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (OVERLAPS) 5/1802 variables, 3/1235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1802 variables, 5/1240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1802 variables, 0/1240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (OVERLAPS) 2/1804 variables, 1/1241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1804 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 149 (OVERLAPS) 62/1866 variables, 32/1273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1866 variables, 9/1282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1866 variables, 0/1282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 152 (OVERLAPS) 4/1870 variables, 4/1286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1870 variables, 4/1290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1870 variables, 0/1290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 155 (OVERLAPS) 2/1872 variables, 1/1291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1872 variables, 0/1291 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 157 (OVERLAPS) 63/1935 variables, 34/1325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1935 variables, 10/1335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1935 variables, 0/1335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 160 (OVERLAPS) 3/1938 variables, 2/1337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1938 variables, 3/1340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1938 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 163 (OVERLAPS) 2/1940 variables, 1/1341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1940 variables, 0/1341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 165 (OVERLAPS) 25/1965 variables, 18/1359 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1965 variables, 5/1364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1965 variables, 0/1364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 168 (OVERLAPS) 1/1966 variables, 2/1366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1966 variables, 1/1367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1966 variables, 0/1367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 171 (OVERLAPS) 2/1968 variables, 2/1369 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1968 variables, 1/1370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1968 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 174 (OVERLAPS) 0/1968 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1968/1968 variables, and 1370 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4174 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1004/1004 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/26 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 45/71 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 104/175 variables, 44/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 11/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/181 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/181 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/181 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 4/185 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 136/321 variables, 66/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/321 variables, 19/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/321 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 7/328 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/328 variables, 7/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/328 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 6/334 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/334 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/334 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 142/476 variables, 70/276 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/476 variables, 20/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/476 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/476 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 9/485 variables, 6/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/485 variables, 9/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/485 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 6/491 variables, 3/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/491 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:09:42] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/491 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/491 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 134/625 variables, 66/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/625 variables, 18/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:09:42] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:09:42] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/625 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/625 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 9/634 variables, 7/411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/634 variables, 9/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/634 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 4/638 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/638 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 130/768 variables, 66/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/768 variables, 18/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/768 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 9/777 variables, 7/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/777 variables, 9/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:09:42] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/777 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/777 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 4/781 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/781 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 111/892 variables, 56/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/892 variables, 15/596 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/892 variables, 4/600 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/892 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 9/901 variables, 7/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/901 variables, 9/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/901 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 4/905 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/905 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/905 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 97/1002 variables, 48/668 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1002 variables, 14/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1002 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:09:43] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:09:43] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/1002 variables, 2/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1002 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 6/1008 variables, 4/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1008 variables, 6/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1008 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 4/1012 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1012 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (OVERLAPS) 85/1097 variables, 44/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1097 variables, 12/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:09:43] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 76 (INCLUDED_ONLY) 0/1097 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1097 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (OVERLAPS) 6/1103 variables, 5/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1103 variables, 6/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1103 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (OVERLAPS) 2/1105 variables, 1/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1105 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (OVERLAPS) 89/1194 variables, 42/808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1194 variables, 11/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1194 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (OVERLAPS) 6/1200 variables, 4/823 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1200 variables, 6/829 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1200 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (OVERLAPS) 4/1204 variables, 2/831 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1204 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 74/1278 variables, 41/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1278 variables, 12/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1278 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (OVERLAPS) 4/1282 variables, 4/888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1282 variables, 4/892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1282 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 2/1284 variables, 1/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1284 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (OVERLAPS) 72/1356 variables, 34/927 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1356 variables, 9/936 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1356 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (OVERLAPS) 5/1361 variables, 3/939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1361 variables, 5/944 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1361 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 2/1363 variables, 1/945 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1363 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (OVERLAPS) 62/1425 variables, 32/977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1425 variables, 9/986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1425 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (OVERLAPS) 4/1429 variables, 4/990 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1429 variables, 4/994 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1429 variables, 0/994 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (OVERLAPS) 2/1431 variables, 1/995 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1431 variables, 0/995 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (OVERLAPS) 72/1503 variables, 34/1029 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1503 variables, 9/1038 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1503 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (OVERLAPS) 5/1508 variables, 3/1041 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1508 variables, 5/1046 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1508 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (OVERLAPS) 2/1510 variables, 1/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1510 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 123 (OVERLAPS) 62/1572 variables, 32/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1572 variables, 9/1088 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1572 variables, 0/1088 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 126 (OVERLAPS) 4/1576 variables, 4/1092 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1576 variables, 4/1096 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1576 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 129 (OVERLAPS) 2/1578 variables, 1/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1578 variables, 0/1097 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 131 (OVERLAPS) 72/1650 variables, 34/1131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1650 variables, 9/1140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1650 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 134 (OVERLAPS) 5/1655 variables, 3/1143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1655 variables, 5/1148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1655 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 137 (OVERLAPS) 2/1657 variables, 1/1149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1657 variables, 0/1149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 139 (OVERLAPS) 62/1719 variables, 32/1181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1719 variables, 9/1190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1719 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 142 (OVERLAPS) 4/1723 variables, 4/1194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1723 variables, 4/1198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1723 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 145 (OVERLAPS) 2/1725 variables, 1/1199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1725 variables, 0/1199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 147 (OVERLAPS) 72/1797 variables, 34/1233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1797 variables, 9/1242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:09:45] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
At refinement iteration 149 (INCLUDED_ONLY) 0/1797 variables, 1/1243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1797 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 151 (OVERLAPS) 5/1802 variables, 3/1246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1802 variables, 5/1251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1802 variables, 0/1251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 154 (OVERLAPS) 2/1804 variables, 1/1252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1804 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 156 (OVERLAPS) 62/1866 variables, 32/1284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1866 variables, 9/1293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1866 variables, 0/1293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 159 (OVERLAPS) 4/1870 variables, 4/1297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1870 variables, 4/1301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1870 variables, 0/1301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 162 (OVERLAPS) 2/1872 variables, 1/1302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1872 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 164 (OVERLAPS) 63/1935 variables, 34/1336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1935 variables, 10/1346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:09:46] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:09:46] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 166 (INCLUDED_ONLY) 0/1935 variables, 2/1348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1935 variables, 0/1348 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 168 (OVERLAPS) 3/1938 variables, 2/1350 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1938 variables, 3/1353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:09:46] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 170 (INCLUDED_ONLY) 0/1938 variables, 1/1354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1938/1968 variables, and 1354 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 351/360 constraints, State Equation: 983/1004 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 17/17 constraints]
After SMT, in 9189ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Partial Free-agglomeration rule applied 237 times.
Drop transitions (Partial Free agglomeration) removed 237 transitions
Iterating global reduction 0 with 237 rules applied. Total rules applied 237 place count 1004 transition count 964
Applied a total of 237 rules in 35 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1004/1004 places, 964/964 transitions.
RANDOM walk for 40000 steps (8 resets) in 885 ms. (45 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
// Phase 1: matrix 964 rows 1004 cols
[2024-05-28 16:09:47] [INFO ] Computed 360 invariants in 15 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/26 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 51/77 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 106/183 variables, 48/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/185 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/189 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 144/333 variables, 70/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/333 variables, 21/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/333 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/336 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/336 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/336 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/342 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/342 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/342 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 146/488 variables, 76/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/488 variables, 23/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/488 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 3/491 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/491 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/491 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 6/497 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/497 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/497 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 140/637 variables, 72/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/637 variables, 21/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/637 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 3/640 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/640 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/640 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 4/644 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/644 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 136/780 variables, 72/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/780 variables, 21/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/780 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 3/783 variables, 4/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/783 variables, 3/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/783 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 4/787 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/787 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 115/902 variables, 62/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/902 variables, 18/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:09:47] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:09:47] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:09:48] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:09:48] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:09:48] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/902 variables, 5/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/902 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 3/905 variables, 4/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/905 variables, 3/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/905 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 4/909 variables, 2/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/909 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/909 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 101/1010 variables, 52/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1010 variables, 16/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:09:48] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
At refinement iteration 61 (INCLUDED_ONLY) 0/1010 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1010 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 2/1012 variables, 2/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1012 variables, 2/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1012 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 4/1016 variables, 2/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1016 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 89/1105 variables, 48/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1105 variables, 14/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1105 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 2/1107 variables, 3/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1107 variables, 2/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1107 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 2/1109 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1109 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 91/1200 variables, 46/802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1200 variables, 13/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1200 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 2/1202 variables, 2/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1202 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1202 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 4/1206 variables, 2/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1206 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 78/1284 variables, 43/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1284 variables, 13/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1284 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 2/1286 variables, 3/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1286 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1286 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 2/1288 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1288 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 74/1362 variables, 38/921 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1362 variables, 11/932 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:09:48] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:09:49] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:09:49] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
At refinement iteration 94 (INCLUDED_ONLY) 0/1362 variables, 3/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1362 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 1/1363 variables, 1/936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1363 variables, 1/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1363 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 2/1365 variables, 1/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1365 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 66/1431 variables, 34/972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1431 variables, 10/982 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:09:49] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
At refinement iteration 103 (INCLUDED_ONLY) 0/1431 variables, 1/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1431 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 2/1433 variables, 3/986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1433 variables, 2/988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1433 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 2/1435 variables, 1/989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1435 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 74/1509 variables, 38/1027 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1509 variables, 11/1038 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1509 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 1/1510 variables, 1/1039 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1510 variables, 1/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1510 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 2/1512 variables, 1/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1512 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 66/1578 variables, 34/1075 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1578 variables, 10/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1578 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 2/1580 variables, 3/1088 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1580 variables, 2/1090 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1580 variables, 0/1090 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (OVERLAPS) 2/1582 variables, 1/1091 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1582 variables, 0/1091 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 74/1656 variables, 38/1129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1656 variables, 11/1140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:09:50] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 3 ms to minimize.
[2024-05-28 16:09:50] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:09:50] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 3 ms to minimize.
[2024-05-28 16:09:50] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
At refinement iteration 128 (INCLUDED_ONLY) 0/1656 variables, 4/1144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1656 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 1/1657 variables, 1/1145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1657 variables, 1/1146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1657 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (OVERLAPS) 2/1659 variables, 1/1147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1659 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 66/1725 variables, 34/1181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1725 variables, 10/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1725 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (OVERLAPS) 2/1727 variables, 3/1194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1727 variables, 2/1196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1727 variables, 0/1196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (OVERLAPS) 2/1729 variables, 1/1197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1729 variables, 0/1197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (OVERLAPS) 74/1803 variables, 38/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1803 variables, 11/1246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1803 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (OVERLAPS) 1/1804 variables, 1/1247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1804 variables, 1/1248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1804 variables, 0/1248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (OVERLAPS) 2/1806 variables, 1/1249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1806 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (OVERLAPS) 64/1870 variables, 34/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1870 variables, 10/1293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1870 variables, 0/1293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (OVERLAPS) 2/1872 variables, 3/1296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1872 variables, 2/1298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1872 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (OVERLAPS) 2/1874 variables, 1/1299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1874 variables, 0/1299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (OVERLAPS) 63/1937 variables, 36/1335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1937 variables, 11/1346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1937 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (OVERLAPS) 1/1938 variables, 1/1347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1938 variables, 1/1348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1938 variables, 0/1348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (OVERLAPS) 2/1940 variables, 1/1349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1940 variables, 0/1349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (OVERLAPS) 25/1965 variables, 18/1367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1965 variables, 5/1372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1965 variables, 0/1372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (OVERLAPS) 1/1966 variables, 2/1374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1966 variables, 1/1375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1966 variables, 0/1375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (OVERLAPS) 2/1968 variables, 2/1377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 174 (INCLUDED_ONLY) 0/1968 variables, 1/1378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/1968 variables, 0/1378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (OVERLAPS) 0/1968 variables, 0/1378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1968/1968 variables, and 1378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4169 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1004/1004 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/26 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 51/77 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 106/183 variables, 48/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 13/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/185 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/189 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/189 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 144/333 variables, 70/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/333 variables, 21/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:09:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:09:51] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/333 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/333 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/336 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/336 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/336 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/342 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/342 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 146/488 variables, 76/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/488 variables, 23/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/488 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 3/491 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/491 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/491 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 6/497 variables, 3/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/497 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/497 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 140/637 variables, 72/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/637 variables, 21/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/637 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/637 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 3/640 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/640 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/640 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 4/644 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/644 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 136/780 variables, 72/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/780 variables, 21/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:09:51] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:09:52] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:09:52] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:09:52] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/780 variables, 4/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/780 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 3/783 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/783 variables, 3/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/783 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 4/787 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/787 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 115/902 variables, 62/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/902 variables, 18/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/902 variables, 1/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:09:52] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:09:52] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
At refinement iteration 56 (INCLUDED_ONLY) 0/902 variables, 2/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/902 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 3/905 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/905 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/905 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 4/909 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/909 variables, 2/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/909 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 101/1010 variables, 52/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1010 variables, 16/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1010 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:09:52] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-28 16:09:52] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-28 16:09:52] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 67 (INCLUDED_ONLY) 0/1010 variables, 3/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1010 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 2/1012 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1012 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1012 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 4/1016 variables, 2/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1016 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 89/1105 variables, 48/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1105 variables, 14/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:09:52] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
At refinement iteration 76 (INCLUDED_ONLY) 0/1105 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1105 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 2/1107 variables, 3/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1107 variables, 2/768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:09:52] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 80 (INCLUDED_ONLY) 0/1107 variables, 1/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1107 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 2/1109 variables, 1/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1109 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 91/1200 variables, 46/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1200 variables, 13/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1200 variables, 0/829 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 2/1202 variables, 2/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1202 variables, 2/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1202 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 4/1206 variables, 2/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1206 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 78/1284 variables, 43/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1284 variables, 13/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:09:53] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:09:53] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-05-28 16:09:53] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
At refinement iteration 94 (INCLUDED_ONLY) 0/1284 variables, 3/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1284 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 2/1286 variables, 3/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1286 variables, 2/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1286 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 2/1288 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1288 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 74/1362 variables, 38/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1362 variables, 11/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1362 variables, 3/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1362 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 1/1363 variables, 1/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1363 variables, 1/954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1363 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 2/1365 variables, 1/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1365 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 66/1431 variables, 34/989 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1431 variables, 10/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1431 variables, 1/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:09:53] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
At refinement iteration 113 (INCLUDED_ONLY) 0/1431 variables, 1/1001 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1431 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 2/1433 variables, 3/1004 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1433 variables, 2/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1433 variables, 1/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:09:53] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
At refinement iteration 118 (INCLUDED_ONLY) 0/1433 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1433 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 2/1435 variables, 1/1009 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1435 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 74/1509 variables, 38/1047 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1509 variables, 11/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1509 variables, 3/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:09:53] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:09:53] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
At refinement iteration 125 (INCLUDED_ONLY) 0/1509 variables, 2/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1509 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 1/1510 variables, 1/1064 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1510 variables, 1/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1510 variables, 0/1065 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (OVERLAPS) 2/1512 variables, 1/1066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1512 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (OVERLAPS) 66/1578 variables, 34/1100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1578 variables, 10/1110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1578 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 2/1580 variables, 3/1113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1580 variables, 2/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:09:54] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
At refinement iteration 137 (INCLUDED_ONLY) 0/1580 variables, 1/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1580 variables, 0/1116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 2/1582 variables, 1/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1582 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (OVERLAPS) 74/1656 variables, 38/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1656 variables, 11/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1656 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (OVERLAPS) 1/1657 variables, 1/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1657 variables, 1/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1657 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (OVERLAPS) 2/1659 variables, 1/1169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1659 variables, 0/1169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (OVERLAPS) 66/1725 variables, 34/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1725 variables, 10/1213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1725 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (OVERLAPS) 2/1727 variables, 3/1216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1727 variables, 2/1218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1727 variables, 0/1218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (OVERLAPS) 2/1729 variables, 1/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1729 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (OVERLAPS) 74/1803 variables, 38/1257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1803 variables, 11/1268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1803 variables, 0/1268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (OVERLAPS) 1/1804 variables, 1/1269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1804 variables, 1/1270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1804 variables, 0/1270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (OVERLAPS) 2/1806 variables, 1/1271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1806 variables, 0/1271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (OVERLAPS) 64/1870 variables, 34/1305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1870 variables, 10/1315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1870 variables, 0/1315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (OVERLAPS) 2/1872 variables, 3/1318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1872 variables, 2/1320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1872 variables, 0/1320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (OVERLAPS) 2/1874 variables, 1/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1874 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (OVERLAPS) 63/1937 variables, 36/1357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1937 variables, 11/1368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/1937 variables, 0/1368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (OVERLAPS) 1/1938 variables, 1/1369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/1938 variables, 1/1370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/1938 variables, 0/1370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (OVERLAPS) 2/1940 variables, 1/1371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1940 variables, 0/1371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (OVERLAPS) 25/1965 variables, 18/1389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/1965 variables, 5/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/1965 variables, 0/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (OVERLAPS) 1/1966 variables, 2/1396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1966 variables, 1/1397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/1966 variables, 0/1397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (OVERLAPS) 2/1968 variables, 2/1399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/1968 variables, 1/1400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/1968 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (OVERLAPS) 0/1968 variables, 0/1400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1968/1968 variables, and 1400 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3402 ms.
Refiners :[Positive P Invariants (semi-flows): 360/360 constraints, State Equation: 1004/1004 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 35/35 constraints]
After SMT, in 7594ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 486 ms.
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 19 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 1004/1004 places, 964/964 transitions.
RANDOM walk for 35841 steps (7 resets) in 482 ms. (74 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F p0), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p0) p1)))), (F p2), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 30 factoid took 749 ms. Reduced automaton from 10 states, 29 edges and 3 AP (stutter insensitive) to 10 states, 29 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 465 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 463 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), false, false, false]
// Phase 1: matrix 964 rows 1004 cols
[2024-05-28 16:09:57] [INFO ] Computed 360 invariants in 5 ms
[2024-05-28 16:09:58] [INFO ] [Real]Absence check using 360 positive place invariants in 154 ms returned sat
[2024-05-28 16:09:59] [INFO ] [Real]Absence check using state equation in 1929 ms returned sat
[2024-05-28 16:10:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:10:00] [INFO ] [Nat]Absence check using 360 positive place invariants in 149 ms returned sat
[2024-05-28 16:10:02] [INFO ] [Nat]Absence check using state equation in 1710 ms returned sat
[2024-05-28 16:10:02] [INFO ] Computed and/alt/rep : 961/2398/961 causal constraints (skipped 1 transitions) in 52 ms.
[2024-05-28 16:10:15] [INFO ] Added : 655 causal constraints over 131 iterations in 12557 ms. Result :unknown
Could not prove EG (NOT p1)
[2024-05-28 16:10:15] [INFO ] Invariant cache hit.
[2024-05-28 16:10:15] [INFO ] [Real]Absence check using 360 positive place invariants in 169 ms returned sat
[2024-05-28 16:10:17] [INFO ] [Real]Absence check using state equation in 1974 ms returned sat
[2024-05-28 16:10:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:10:18] [INFO ] [Nat]Absence check using 360 positive place invariants in 147 ms returned sat
[2024-05-28 16:10:20] [INFO ] [Nat]Absence check using state equation in 2092 ms returned sat
[2024-05-28 16:10:20] [INFO ] Computed and/alt/rep : 961/2398/961 causal constraints (skipped 1 transitions) in 48 ms.
[2024-05-28 16:10:30] [INFO ] Added : 521 causal constraints over 106 iterations in 9947 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 428 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 1469 reset in 699 ms.
Product exploration explored 100000 steps with 1444 reset in 857 ms.
Built C files in :
/tmp/ltsmin16328395771855331433
[2024-05-28 16:10:32] [INFO ] Computing symmetric may disable matrix : 964 transitions.
[2024-05-28 16:10:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:10:32] [INFO ] Computing symmetric may enable matrix : 964 transitions.
[2024-05-28 16:10:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:10:32] [INFO ] Computing Do-Not-Accords matrix : 964 transitions.
[2024-05-28 16:10:32] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:10:32] [INFO ] Built C files in 152ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16328395771855331433
Running compilation step : cd /tmp/ltsmin16328395771855331433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16328395771855331433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16328395771855331433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 964/964 transitions.
Applied a total of 0 rules in 22 ms. Remains 1004 /1004 variables (removed 0) and now considering 964/964 (removed 0) transitions.
[2024-05-28 16:10:35] [INFO ] Invariant cache hit.
[2024-05-28 16:10:36] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-28 16:10:36] [INFO ] Invariant cache hit.
[2024-05-28 16:10:37] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
[2024-05-28 16:10:37] [INFO ] Redundant transitions in 97 ms returned []
Running 962 sub problems to find dead transitions.
[2024-05-28 16:10:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1003 variables, 355/355 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:10:51] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 3 ms to minimize.
[2024-05-28 16:10:51] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 3 ms to minimize.
[2024-05-28 16:10:52] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 3 ms to minimize.
[2024-05-28 16:10:52] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 4 ms to minimize.
[2024-05-28 16:10:52] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:10:52] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 4 ms to minimize.
[2024-05-28 16:10:52] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:10:53] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 4 ms to minimize.
[2024-05-28 16:10:53] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 4 ms to minimize.
[2024-05-28 16:10:53] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:10:53] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 3 ms to minimize.
[2024-05-28 16:10:53] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:10:53] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:10:54] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:10:54] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:10:54] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 2 ms to minimize.
[2024-05-28 16:10:54] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:10:54] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-05-28 16:10:54] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-05-28 16:10:55] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/1003 variables, 20/375 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:10:55] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 3 ms to minimize.
[2024-05-28 16:10:55] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:10:55] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2024-05-28 16:10:55] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2024-05-28 16:10:55] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 3 ms to minimize.
[2024-05-28 16:10:56] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 3 ms to minimize.
[2024-05-28 16:10:56] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:10:56] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:10:56] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:10:56] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:10:56] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:10:56] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:10:56] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:10:56] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:10:56] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:10:57] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:10:57] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:10:57] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:10:57] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:10:57] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1003 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:10:57] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:10:57] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 16:10:57] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:10:57] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:10:57] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:10:57] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:10:58] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:10:58] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:10:58] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:10:58] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:10:58] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:10:58] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:10:58] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:10:59] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:10:59] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:10:59] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-28 16:10:59] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:10:59] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-28 16:10:59] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:11:00] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 20/415 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1003/1968 variables, and 415 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 355/360 constraints, State Equation: 0/1004 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1003 variables, 355/355 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1003 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:11:08] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:11:08] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:11:08] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:11:09] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:11:09] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:11:09] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-28 16:11:09] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:11:10] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:11:10] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:11:10] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:11:10] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:11:10] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-05-28 16:11:11] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:11:11] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:11:11] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-05-28 16:11:11] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-05-28 16:11:11] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:11:12] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:11:12] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 3 ms to minimize.
[2024-05-28 16:11:12] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1003 variables, 20/435 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:11:13] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-28 16:11:13] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:11:14] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:11:15] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2024-05-28 16:11:15] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 2 ms to minimize.
[2024-05-28 16:11:15] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 3 ms to minimize.
[2024-05-28 16:11:16] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 2 ms to minimize.
[2024-05-28 16:11:16] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:11:16] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:11:16] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:11:17] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2024-05-28 16:11:17] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 2 ms to minimize.
[2024-05-28 16:11:17] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:11:17] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:11:18] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:11:18] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 3 ms to minimize.
[2024-05-28 16:11:18] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 3 ms to minimize.
[2024-05-28 16:11:18] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 3 ms to minimize.
[2024-05-28 16:11:19] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:11:19] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1003 variables, 20/455 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:11:19] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:11:22] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:11:22] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:11:23] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-05-28 16:11:24] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
[2024-05-28 16:11:24] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:11:25] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 4 ms to minimize.
[2024-05-28 16:11:25] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 4 ms to minimize.
[2024-05-28 16:11:25] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:11:26] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:11:26] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:11:26] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:11:26] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:11:26] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-28 16:11:27] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:11:31] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 16:11:31] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:11:31] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 16:11:31] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 16:11:31] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1003 variables, 20/475 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-28 16:11:31] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 16:11:32] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:11:33] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:11:33] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:11:34] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 3 ms to minimize.
[2024-05-28 16:11:34] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:11:35] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 3 ms to minimize.
[2024-05-28 16:11:36] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:11:37] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:11:37] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 3 ms to minimize.
SMT process timed out in 60318ms, After SMT, problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60327ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61770 ms. Remains : 1004/1004 places, 964/964 transitions.
Built C files in :
/tmp/ltsmin224922868887690405
[2024-05-28 16:11:37] [INFO ] Computing symmetric may disable matrix : 964 transitions.
[2024-05-28 16:11:37] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:11:37] [INFO ] Computing symmetric may enable matrix : 964 transitions.
[2024-05-28 16:11:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:11:37] [INFO ] Computing Do-Not-Accords matrix : 964 transitions.
[2024-05-28 16:11:37] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:11:37] [INFO ] Built C files in 161ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin224922868887690405
Running compilation step : cd /tmp/ltsmin224922868887690405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin224922868887690405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin224922868887690405;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 16:11:40] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:11:40] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:11:40] [INFO ] Time to serialize gal into /tmp/LTL5529562122532735795.gal : 5 ms
[2024-05-28 16:11:40] [INFO ] Time to serialize properties into /tmp/LTL6124764041310147166.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5529562122532735795.gal' '-t' 'CGAL' '-hoa' '/tmp/aut256346427763441624.hoa' '-atoms' '/tmp/LTL6124764041310147166.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL6124764041310147166.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut256346427763441624.hoa
Detected timeout of ITS tools.
[2024-05-28 16:11:55] [INFO ] Flatten gal took : 27 ms
[2024-05-28 16:11:56] [INFO ] Flatten gal took : 35 ms
[2024-05-28 16:11:56] [INFO ] Time to serialize gal into /tmp/LTL3520207070880873117.gal : 8 ms
[2024-05-28 16:11:56] [INFO ] Time to serialize properties into /tmp/LTL16650921201691584819.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3520207070880873117.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16650921201691584819.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((F("((p2070==1)&&(p2148==1))"))U(G("(p1720==1)")))&&((F(G("(p593==1)")))||("((p2070==1)&&(p2148==1))")))))
Formula 0 simplified : G((G!"((p2070==1)&&(p2148==1))" R F!"(p1720==1)") | (!"((p2070==1)&&(p2148==1))" & GF!"(p593==1)"))
Detected timeout of ITS tools.
[2024-05-28 16:12:11] [INFO ] Flatten gal took : 28 ms
[2024-05-28 16:12:11] [INFO ] Applying decomposition
[2024-05-28 16:12:11] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1715993209117199399.txt' '-o' '/tmp/graph1715993209117199399.bin' '-w' '/tmp/graph1715993209117199399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1715993209117199399.bin' '-l' '-1' '-v' '-w' '/tmp/graph1715993209117199399.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:12:11] [INFO ] Decomposing Gal with order
[2024-05-28 16:12:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:12:11] [INFO ] Removed a total of 637 redundant transitions.
[2024-05-28 16:12:11] [INFO ] Flatten gal took : 41 ms
[2024-05-28 16:12:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 606 labels/synchronizations in 8 ms.
[2024-05-28 16:12:11] [INFO ] Time to serialize gal into /tmp/LTL7862308737885777714.gal : 8 ms
[2024-05-28 16:12:11] [INFO ] Time to serialize properties into /tmp/LTL16149898627651514829.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7862308737885777714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16149898627651514829.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(((F("((i34.u312.p2070==1)&&(i35.i2.u324.p2148==1))"))U(G("(i28.i2.u259.p1720==1)")))&&((F(G("(i9.i0.u85.p593==1)")))||("((i34.u31...197
Formula 0 simplified : G((G!"((i34.u312.p2070==1)&&(i35.i2.u324.p2148==1))" R F!"(i28.i2.u259.p1720==1)") | (!"((i34.u312.p2070==1)&&(i35.i2.u324.p2148==1)...186
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-040B-LTLFireability-09 finished in 340734 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||F(((!p1&&X(X(F(p2))))||G(F(p2)))))))'
Support contains 8 out of 2132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2132/2132 places, 2092/2092 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2122 transition count 2082
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2122 transition count 2082
Applied a total of 20 rules in 139 ms. Remains 2122 /2132 variables (removed 10) and now considering 2082/2092 (removed 10) transitions.
// Phase 1: matrix 2082 rows 2122 cols
[2024-05-28 16:12:26] [INFO ] Computed 361 invariants in 16 ms
[2024-05-28 16:12:27] [INFO ] Implicit Places using invariants in 639 ms returned []
[2024-05-28 16:12:27] [INFO ] Invariant cache hit.
[2024-05-28 16:12:29] [INFO ] Implicit Places using invariants and state equation in 2143 ms returned []
Implicit Place search using SMT with State Equation took 2783 ms to find 0 implicit places.
Running 2081 sub problems to find dead transitions.
[2024-05-28 16:12:29] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2081/2081 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2081 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4204 variables, and 0 constraints, problems are : Problem set: 0 solved, 2081 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2081 constraints, Known Traps: 0/0 constraints]
After SMT, in 60559ms problems are : Problem set: 0 solved, 2081 unsolved
Search for dead transitions found 0 dead transitions in 60575ms
Starting structural reductions in LTL mode, iteration 1 : 2122/2132 places, 2082/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63502 ms. Remains : 2122/2132 places, 2082/2092 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Running random walk in product with property : ShieldIIPs-PT-040B-LTLFireability-11
Product exploration explored 100000 steps with 25022 reset in 321 ms.
Product exploration explored 100000 steps with 25023 reset in 330 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (OR p0 p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (OR p0 p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 130 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (8 resets) in 4080 ms. (9 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 270 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
[2024-05-28 16:13:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 109/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2005/2122 variables, 352/361 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 16:13:33] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 4 ms to minimize.
[2024-05-28 16:13:33] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 4 ms to minimize.
[2024-05-28 16:13:33] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 4 ms to minimize.
[2024-05-28 16:13:34] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 5 ms to minimize.
[2024-05-28 16:13:34] [INFO ] Deduced a trap composed of 34 places in 220 ms of which 4 ms to minimize.
[2024-05-28 16:13:34] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 5 ms to minimize.
[2024-05-28 16:13:34] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 4 ms to minimize.
[2024-05-28 16:13:35] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 4 ms to minimize.
[2024-05-28 16:13:35] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 3 ms to minimize.
[2024-05-28 16:13:35] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 3 ms to minimize.
[2024-05-28 16:13:35] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 4 ms to minimize.
[2024-05-28 16:13:35] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:13:35] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:13:36] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2024-05-28 16:13:36] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:13:36] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:13:36] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:13:36] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:13:36] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:13:36] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2122 variables, 20/381 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 16:13:36] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:13:37] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:13:37] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:13:37] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2122 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2122/4204 variables, and 385 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 109/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2005/2122 variables, 352/361 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2122 variables, 24/385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 16:13:38] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:13:38] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 3 ms to minimize.
[2024-05-28 16:13:38] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
[2024-05-28 16:13:38] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-05-28 16:13:38] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:13:38] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-05-28 16:13:38] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:13:39] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:13:39] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:13:39] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:13:39] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:13:39] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:13:39] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:13:39] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:13:39] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:13:39] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2122 variables, 16/401 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2122 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2082/4204 variables, 2122/2523 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4204 variables, 6/2529 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 16:13:41] [INFO ] Deduced a trap composed of 23 places in 330 ms of which 6 ms to minimize.
[2024-05-28 16:13:41] [INFO ] Deduced a trap composed of 22 places in 332 ms of which 6 ms to minimize.
[2024-05-28 16:13:41] [INFO ] Deduced a trap composed of 20 places in 352 ms of which 6 ms to minimize.
[2024-05-28 16:13:42] [INFO ] Deduced a trap composed of 43 places in 306 ms of which 6 ms to minimize.
[2024-05-28 16:13:42] [INFO ] Deduced a trap composed of 30 places in 320 ms of which 5 ms to minimize.
SMT process timed out in 10195ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 2122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2122/2122 places, 2082/2082 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 2122 transition count 1883
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1923 transition count 1883
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 398 place count 1923 transition count 1683
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 798 place count 1723 transition count 1683
Performed 717 Post agglomeration using F-continuation condition.Transition count delta: 717
Deduced a syphon composed of 717 places in 2 ms
Reduce places removed 717 places and 0 transitions.
Iterating global reduction 2 with 1434 rules applied. Total rules applied 2232 place count 1006 transition count 966
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 274 times.
Drop transitions (Partial Free agglomeration) removed 274 transitions
Iterating global reduction 2 with 274 rules applied. Total rules applied 2506 place count 1006 transition count 966
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2507 place count 1005 transition count 965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2508 place count 1004 transition count 965
Applied a total of 2508 rules in 326 ms. Remains 1004 /2122 variables (removed 1118) and now considering 965/2082 (removed 1117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 1004/2122 places, 965/2082 transitions.
RANDOM walk for 40000 steps (8 resets) in 2336 ms. (17 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 2/2 properties
// Phase 1: matrix 965 rows 1004 cols
[2024-05-28 16:13:43] [INFO ] Computed 360 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 60/94 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 130/224 variables, 56/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 18/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/226 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/230 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 171/401 variables, 80/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/401 variables, 25/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/401 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/404 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/404 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/404 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 4/408 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/408 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 176/584 variables, 93/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/584 variables, 25/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/584 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 3/587 variables, 5/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/587 variables, 3/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/587 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 2/589 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/589 variables, 2/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/589 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 2/591 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/591 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/591 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 1/592 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/592 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/592 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 123/715 variables, 66/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/715 variables, 21/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:13:44] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/715 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/715 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 4/719 variables, 6/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/719 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/719 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 4/723 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/723 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 97/820 variables, 54/529 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/820 variables, 16/545 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:13:44] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/820 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/820 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (OVERLAPS) 2/822 variables, 3/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/822 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/822 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 2/824 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/824 variables, 2/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/824 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 93/917 variables, 44/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/917 variables, 14/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/917 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 2/919 variables, 2/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/919 variables, 2/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/919 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 4/923 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/923 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (OVERLAPS) 93/1016 variables, 50/668 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1016 variables, 14/682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:13:45] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/1016 variables, 1/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1016 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 2/1018 variables, 3/686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1018 variables, 2/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1018 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (OVERLAPS) 2/1020 variables, 1/689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1020 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1020 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (OVERLAPS) 93/1113 variables, 44/735 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1113 variables, 14/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1113 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (OVERLAPS) 2/1115 variables, 2/751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1115 variables, 2/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1115 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (OVERLAPS) 4/1119 variables, 2/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1119 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (OVERLAPS) 77/1196 variables, 46/801 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1196 variables, 13/814 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:13:45] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:13:45] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-28 16:13:45] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
At refinement iteration 84 (INCLUDED_ONLY) 0/1196 variables, 3/817 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1196 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (OVERLAPS) 2/1198 variables, 3/820 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1198 variables, 2/822 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1198 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (OVERLAPS) 2/1200 variables, 1/823 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1200 variables, 2/825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:13:46] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
At refinement iteration 91 (INCLUDED_ONLY) 0/1200 variables, 1/826 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1200 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (OVERLAPS) 55/1255 variables, 28/854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1255 variables, 9/863 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:13:46] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
At refinement iteration 95 (INCLUDED_ONLY) 0/1255 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1255 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (OVERLAPS) 1/1256 variables, 1/865 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1256 variables, 1/866 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1256 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (OVERLAPS) 2/1258 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1258 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (OVERLAPS) 44/1302 variables, 24/891 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1302 variables, 7/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1302 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (OVERLAPS) 1/1303 variables, 2/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1303 variables, 1/901 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1303 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (OVERLAPS) 50/1353 variables, 24/925 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1353 variables, 7/932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1353 variables, 0/932 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (OVERLAPS) 1/1354 variables, 1/933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1354 variables, 1/934 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1354 variables, 0/934 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (OVERLAPS) 2/1356 variables, 1/935 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1356 variables, 0/935 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (OVERLAPS) 44/1400 variables, 24/959 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1400 variables, 7/966 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1400 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (OVERLAPS) 1/1401 variables, 2/968 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1401 variables, 1/969 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1401 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (OVERLAPS) 50/1451 variables, 24/993 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1451 variables, 7/1000 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1451 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (OVERLAPS) 1/1452 variables, 1/1001 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1452 variables, 1/1002 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1452 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (OVERLAPS) 2/1454 variables, 1/1003 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1454 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 130 (OVERLAPS) 44/1498 variables, 24/1027 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1498 variables, 7/1034 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1498 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 133 (OVERLAPS) 1/1499 variables, 2/1036 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1499 variables, 1/1037 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1499 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 136 (OVERLAPS) 50/1549 variables, 24/1061 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1549 variables, 7/1068 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1549 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 139 (OVERLAPS) 1/1550 variables, 1/1069 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1550 variables, 1/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1550 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 142 (OVERLAPS) 2/1552 variables, 1/1071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1552 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 144 (OVERLAPS) 44/1596 variables, 24/1095 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1596 variables, 7/1102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1596 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 147 (OVERLAPS) 1/1597 variables, 2/1104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1597 variables, 1/1105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1597 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 150 (OVERLAPS) 50/1647 variables, 24/1129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1647 variables, 7/1136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1647 variables, 0/1136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 153 (OVERLAPS) 1/1648 variables, 1/1137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1648 variables, 1/1138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1648 variables, 0/1138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 156 (OVERLAPS) 2/1650 variables, 1/1139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1650 variables, 0/1139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 158 (OVERLAPS) 44/1694 variables, 24/1163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1694 variables, 7/1170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1694 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 161 (OVERLAPS) 1/1695 variables, 2/1172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1695 variables, 1/1173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1695 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 164 (OVERLAPS) 50/1745 variables, 24/1197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1745 variables, 7/1204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1745 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 167 (OVERLAPS) 1/1746 variables, 1/1205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1746 variables, 1/1206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1746 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 170 (OVERLAPS) 2/1748 variables, 1/1207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1748 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 172 (OVERLAPS) 44/1792 variables, 24/1231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1792 variables, 7/1238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/1792 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 175 (OVERLAPS) 1/1793 variables, 2/1240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/1793 variables, 1/1241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/1793 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 178 (OVERLAPS) 50/1843 variables, 24/1265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/1843 variables, 7/1272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1843 variables, 0/1272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 181 (OVERLAPS) 1/1844 variables, 1/1273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/1844 variables, 1/1274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/1844 variables, 0/1274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 184 (OVERLAPS) 2/1846 variables, 1/1275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/1846 variables, 0/1275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 186 (OVERLAPS) 44/1890 variables, 24/1299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/1890 variables, 7/1306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/1890 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 189 (OVERLAPS) 1/1891 variables, 2/1308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/1891 variables, 1/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1891 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 192 (OVERLAPS) 47/1938 variables, 24/1333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/1938 variables, 7/1340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/1938 variables, 0/1340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 195 (OVERLAPS) 1/1939 variables, 1/1341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/1939 variables, 1/1342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1939 variables, 0/1342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 198 (OVERLAPS) 2/1941 variables, 1/1343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/1941 variables, 0/1343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 200 (OVERLAPS) 25/1966 variables, 18/1361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/1966 variables, 5/1366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/1966 variables, 0/1366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 203 (OVERLAPS) 1/1967 variables, 2/1368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/1967 variables, 1/1369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/1967 variables, 0/1369 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 206 (OVERLAPS) 2/1969 variables, 2/1371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 207 (INCLUDED_ONLY) 0/1969 variables, 1/1372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/1969 variables, 0/1372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 209 (OVERLAPS) 0/1969 variables, 0/1372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1969/1969 variables, and 1372 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6490 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1004/1004 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 60/94 variables, 34/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 130/224 variables, 56/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 18/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:13:50] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/226 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/230 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 171/401 variables, 80/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/401 variables, 25/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/401 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 3/404 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/404 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/404 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/408 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/408 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 176/584 variables, 93/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/584 variables, 25/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/584 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/584 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 3/587 variables, 5/368 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/587 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/587 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 2/589 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/589 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/589 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 2/591 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/591 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/591 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 1/592 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/592 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/592 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 123/715 variables, 66/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/715 variables, 21/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/715 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 4/719 variables, 6/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/719 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/719 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 4/723 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/723 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 97/820 variables, 54/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/820 variables, 16/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/820 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:13:51] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/820 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/820 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 2/822 variables, 3/553 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/822 variables, 2/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/822 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (OVERLAPS) 2/824 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/824 variables, 2/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/824 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (OVERLAPS) 93/917 variables, 44/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/917 variables, 14/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/917 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (OVERLAPS) 2/919 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/919 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/919 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (OVERLAPS) 4/923 variables, 2/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:13:51] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/923 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/923 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (OVERLAPS) 93/1016 variables, 50/673 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1016 variables, 14/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1016 variables, 1/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1016 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 2/1018 variables, 3/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1018 variables, 2/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1018 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 2/1020 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1020 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1020 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (OVERLAPS) 93/1113 variables, 44/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1113 variables, 14/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1113 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (OVERLAPS) 2/1115 variables, 2/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1115 variables, 2/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1115 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (OVERLAPS) 4/1119 variables, 2/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1119 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (OVERLAPS) 77/1196 variables, 46/806 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1196 variables, 13/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1196 variables, 4/823 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1196 variables, 0/823 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (OVERLAPS) 2/1198 variables, 3/826 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1198 variables, 2/828 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1198 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (OVERLAPS) 2/1200 variables, 1/829 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1200 variables, 2/831 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1200 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (OVERLAPS) 55/1255 variables, 28/859 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1255 variables, 9/868 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1255 variables, 1/869 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1255 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (OVERLAPS) 1/1256 variables, 1/870 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1256 variables, 1/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1256 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (OVERLAPS) 2/1258 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1258 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (OVERLAPS) 44/1302 variables, 24/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1302 variables, 7/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1302 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (OVERLAPS) 1/1303 variables, 2/905 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1303 variables, 1/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1303 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (OVERLAPS) 50/1353 variables, 24/930 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1353 variables, 7/937 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1353 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (OVERLAPS) 1/1354 variables, 1/938 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1354 variables, 1/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1354 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (OVERLAPS) 2/1356 variables, 1/940 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1356 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (OVERLAPS) 44/1400 variables, 24/964 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1400 variables, 7/971 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1400 variables, 0/971 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (OVERLAPS) 1/1401 variables, 2/973 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1401 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1401 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (OVERLAPS) 50/1451 variables, 24/998 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1451 variables, 7/1005 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 16:13:52] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
At refinement iteration 127 (INCLUDED_ONLY) 0/1451 variables, 1/1006 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1451 variables, 0/1006 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 129 (OVERLAPS) 1/1452 variables, 1/1007 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1452 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1452 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 132 (OVERLAPS) 2/1454 variables, 1/1009 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1454 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 134 (OVERLAPS) 44/1498 variables, 24/1033 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1498 variables, 7/1040 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1498 variables, 0/1040 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 137 (OVERLAPS) 1/1499 variables, 2/1042 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1499 variables, 1/1043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1499 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 140 (OVERLAPS) 50/1549 variables, 24/1067 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1549 variables, 7/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1549 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 143 (OVERLAPS) 1/1550 variables, 1/1075 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1550 variables, 1/1076 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1550 variables, 0/1076 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 146 (OVERLAPS) 2/1552 variables, 1/1077 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1552 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 148 (OVERLAPS) 44/1596 variables, 24/1101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1596 variables, 7/1108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1596 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 151 (OVERLAPS) 1/1597 variables, 2/1110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1597 variables, 1/1111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1597 variables, 0/1111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 154 (OVERLAPS) 50/1647 variables, 24/1135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1647 variables, 7/1142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1647 variables, 0/1142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 157 (OVERLAPS) 1/1648 variables, 1/1143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1648 variables, 1/1144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1648 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 160 (OVERLAPS) 2/1650 variables, 1/1145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1650 variables, 0/1145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 162 (OVERLAPS) 44/1694 variables, 24/1169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1694 variables, 7/1176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1694 variables, 0/1176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 165 (OVERLAPS) 1/1695 variables, 2/1178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1695 variables, 1/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1695 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 168 (OVERLAPS) 50/1745 variables, 24/1203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1745 variables, 7/1210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1745 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 171 (OVERLAPS) 1/1746 variables, 1/1211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1746 variables, 1/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1746 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 174 (OVERLAPS) 2/1748 variables, 1/1213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/1748 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 176 (OVERLAPS) 44/1792 variables, 24/1237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/1792 variables, 7/1244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/1792 variables, 0/1244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 179 (OVERLAPS) 1/1793 variables, 2/1246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/1793 variables, 1/1247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/1793 variables, 0/1247 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 182 (OVERLAPS) 50/1843 variables, 24/1271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/1843 variables, 7/1278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/1843 variables, 0/1278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 185 (OVERLAPS) 1/1844 variables, 1/1279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/1844 variables, 1/1280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/1844 variables, 0/1280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 188 (OVERLAPS) 2/1846 variables, 1/1281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/1846 variables, 0/1281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 190 (OVERLAPS) 44/1890 variables, 24/1305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/1890 variables, 7/1312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/1890 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 193 (OVERLAPS) 1/1891 variables, 2/1314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/1891 variables, 1/1315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/1891 variables, 0/1315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 196 (OVERLAPS) 47/1938 variables, 24/1339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/1938 variables, 7/1346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/1938 variables, 0/1346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 199 (OVERLAPS) 1/1939 variables, 1/1347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/1939 variables, 1/1348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/1939 variables, 0/1348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 202 (OVERLAPS) 2/1941 variables, 1/1349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/1941 variables, 0/1349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 204 (OVERLAPS) 25/1966 variables, 18/1367 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/1966 variables, 5/1372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/1966 variables, 0/1372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 207 (OVERLAPS) 1/1967 variables, 2/1374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 208 (INCLUDED_ONLY) 0/1967 variables, 1/1375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 209 (INCLUDED_ONLY) 0/1967 variables, 0/1375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 210 (OVERLAPS) 2/1969 variables, 2/1377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 211 (INCLUDED_ONLY) 0/1969 variables, 1/1378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 212 (INCLUDED_ONLY) 0/1969 variables, 0/1378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 213 (OVERLAPS) 0/1969 variables, 0/1378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1969/1969 variables, and 1378 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4704 ms.
Refiners :[Positive P Invariants (semi-flows): 359/359 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1004/1004 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints]
After SMT, in 11205ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 510 ms.
Support contains 8 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 965/965 transitions.
Applied a total of 0 rules in 17 ms. Remains 1004 /1004 variables (removed 0) and now considering 965/965 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 1004/1004 places, 965/965 transitions.
RANDOM walk for 40000 steps (10 resets) in 1052 ms. (37 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 319 ms. (125 steps per ms) remains 1/1 properties
[2024-05-28 16:13:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/63 variables, 23/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 93/156 variables, 40/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 13/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/157 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/159 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/159 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 121/280 variables, 56/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/280 variables, 18/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/280 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/282 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/282 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/282 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/284 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/284 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 139/423 variables, 69/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/423 variables, 18/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/423 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/425 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/425 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/425 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/427 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/427 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/427 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/429 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/429 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/429 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 1/430 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/430 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/430 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 110/540 variables, 58/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/540 variables, 19/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/540 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 3/543 variables, 5/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/543 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/543 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 2/545 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/545 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 99/644 variables, 52/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/644 variables, 15/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:13:56] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:13:56] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/644 variables, 2/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/644 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 2/646 variables, 3/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/646 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/646 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 2/648 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/648 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/648 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 90/738 variables, 44/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/738 variables, 14/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:13:56] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
At refinement iteration 57 (INCLUDED_ONLY) 0/738 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/738 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 2/740 variables, 3/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/740 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/740 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 2/742 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/742 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 98/840 variables, 49/544 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/840 variables, 12/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:13:56] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:13:56] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/840 variables, 2/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/840 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 4/844 variables, 5/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/844 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/844 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 2/846 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/846 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/846 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 91/937 variables, 44/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/937 variables, 14/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:13:57] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:13:57] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
At refinement iteration 76 (INCLUDED_ONLY) 0/937 variables, 2/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/937 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 2/939 variables, 3/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/939 variables, 2/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/939 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 2/941 variables, 1/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/941 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 81/1022 variables, 46/682 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1022 variables, 13/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1022 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 2/1024 variables, 3/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1024 variables, 2/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1024 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 2/1026 variables, 1/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1026 variables, 2/703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:13:57] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
At refinement iteration 91 (INCLUDED_ONLY) 0/1026 variables, 1/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1026 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 53/1079 variables, 28/732 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1079 variables, 9/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:13:57] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:13:57] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:13:57] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-28 16:13:57] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:13:58] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
At refinement iteration 95 (INCLUDED_ONLY) 0/1079 variables, 5/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1079 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (OVERLAPS) 1/1080 variables, 2/748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1080 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1080 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (OVERLAPS) 48/1128 variables, 24/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1128 variables, 7/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1128 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 1/1129 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1129 variables, 1/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1129 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (OVERLAPS) 48/1177 variables, 24/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1177 variables, 7/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1177 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (OVERLAPS) 1/1178 variables, 2/816 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1178 variables, 1/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1178 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (OVERLAPS) 48/1226 variables, 24/841 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1226 variables, 7/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1226 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 1/1227 variables, 2/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1227 variables, 1/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1227 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (OVERLAPS) 48/1275 variables, 24/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1275 variables, 7/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1275 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (OVERLAPS) 1/1276 variables, 2/884 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1276 variables, 1/885 constraints. Problems are: Problem set: 0 solved, 1 unsolved

========== file over 1MB has been truncated ======
retrieve it from the run archives if needed

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-040B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683760400140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-040B.tgz
mv ShieldIIPs-PT-040B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;