Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683762401051.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldRVt-PT-100B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762401051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 1.3M 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 ShieldRVt-PT-100B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-100B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717278977247

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:56:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 21:56:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:56:18] [INFO ] Load time of PNML (sax parser for PT used): 221 ms
[2024-06-01 21:56:18] [INFO ] Transformed 5003 places.
[2024-06-01 21:56:18] [INFO ] Transformed 5003 transitions.
[2024-06-01 21:56:18] [INFO ] Found NUPN structural information;
[2024-06-01 21:56:18] [INFO ] Parsed PT model containing 5003 places and 5003 transitions and 11806 arcs in 476 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-100B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 5003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Discarding 1085 places :
Symmetric choice reduction at 0 with 1085 rule applications. Total rules 1085 place count 3918 transition count 3918
Iterating global reduction 0 with 1085 rules applied. Total rules applied 2170 place count 3918 transition count 3918
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2171 place count 3917 transition count 3917
Iterating global reduction 0 with 1 rules applied. Total rules applied 2172 place count 3917 transition count 3917
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2173 place count 3916 transition count 3916
Iterating global reduction 0 with 1 rules applied. Total rules applied 2174 place count 3916 transition count 3916
Applied a total of 2174 rules in 1906 ms. Remains 3916 /5003 variables (removed 1087) and now considering 3916/5003 (removed 1087) transitions.
// Phase 1: matrix 3916 rows 3916 cols
[2024-06-01 21:56:21] [INFO ] Computed 401 invariants in 34 ms
[2024-06-01 21:56:22] [INFO ] Implicit Places using invariants in 1208 ms returned []
[2024-06-01 21:56:22] [INFO ] Invariant cache hit.
[2024-06-01 21:56:27] [INFO ] Implicit Places using invariants and state equation in 4662 ms returned []
Implicit Place search using SMT with State Equation took 5897 ms to find 0 implicit places.
Running 3915 sub problems to find dead transitions.
[2024-06-01 21:56:27] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3915/7832 variables, and 0 constraints, problems are : Problem set: 0 solved, 3915 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3916 constraints, PredecessorRefiner: 3915/3915 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3915 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 3915/7832 variables, and 0 constraints, problems are : Problem set: 0 solved, 3915 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3916 constraints, PredecessorRefiner: 0/3915 constraints, Known Traps: 0/0 constraints]
After SMT, in 61822ms problems are : Problem set: 0 solved, 3915 unsolved
Search for dead transitions found 0 dead transitions in 61876ms
Starting structural reductions in LTL mode, iteration 1 : 3916/5003 places, 3916/5003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69725 ms. Remains : 3916/5003 places, 3916/5003 transitions.
Support contains 34 out of 3916 places after structural reductions.
[2024-06-01 21:57:29] [INFO ] Flatten gal took : 214 ms
[2024-06-01 21:57:29] [INFO ] Flatten gal took : 133 ms
[2024-06-01 21:57:29] [INFO ] Input system was already deterministic with 3916 transitions.
RANDOM walk for 40000 steps (8 resets) in 1694 ms. (23 steps per ms) remains 15/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
[2024-06-01 21:57:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 341/363 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3553/3916 variables, 379/401 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3916 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 3916/7832 variables, 3916/4317 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7832 variables, 0/4317 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/7832 variables, 0/4317 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7832/7832 variables, and 4317 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 3916/3916 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 341/363 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 21:57:35] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 12 ms to minimize.
[2024-06-01 21:57:35] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3553/3916 variables, 379/403 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-01 21:57:37] [INFO ] Deduced a trap composed of 37 places in 347 ms of which 8 ms to minimize.
[2024-06-01 21:57:37] [INFO ] Deduced a trap composed of 31 places in 379 ms of which 7 ms to minimize.
[2024-06-01 21:57:38] [INFO ] Deduced a trap composed of 17 places in 353 ms of which 6 ms to minimize.
[2024-06-01 21:57:38] [INFO ] Deduced a trap composed of 37 places in 326 ms of which 10 ms to minimize.
[2024-06-01 21:57:38] [INFO ] Deduced a trap composed of 37 places in 316 ms of which 6 ms to minimize.
[2024-06-01 21:57:39] [INFO ] Deduced a trap composed of 52 places in 312 ms of which 6 ms to minimize.
[2024-06-01 21:57:39] [INFO ] Deduced a trap composed of 36 places in 303 ms of which 6 ms to minimize.
[2024-06-01 21:57:39] [INFO ] Deduced a trap composed of 57 places in 301 ms of which 6 ms to minimize.
[2024-06-01 21:57:40] [INFO ] Deduced a trap composed of 38 places in 296 ms of which 5 ms to minimize.
[2024-06-01 21:57:40] [INFO ] Deduced a trap composed of 61 places in 290 ms of which 5 ms to minimize.
[2024-06-01 21:57:40] [INFO ] Deduced a trap composed of 66 places in 282 ms of which 5 ms to minimize.
SMT process timed out in 10357ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 3916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3916/3916 places, 3916/3916 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1085 transitions
Trivial Post-agglo rules discarded 1085 transitions
Performed 1085 trivial Post agglomeration. Transition count delta: 1085
Iterating post reduction 0 with 1085 rules applied. Total rules applied 1085 place count 3916 transition count 2831
Reduce places removed 1085 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1089 rules applied. Total rules applied 2174 place count 2831 transition count 2827
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2178 place count 2827 transition count 2827
Performed 789 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 789 Pre rules applied. Total rules applied 2178 place count 2827 transition count 2038
Deduced a syphon composed of 789 places in 5 ms
Reduce places removed 789 places and 0 transitions.
Iterating global reduction 3 with 1578 rules applied. Total rules applied 3756 place count 2038 transition count 2038
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 3758 place count 2036 transition count 2036
Iterating global reduction 3 with 2 rules applied. Total rules applied 3760 place count 2036 transition count 2036
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 3760 place count 2036 transition count 2034
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 3764 place count 2034 transition count 2034
Performed 904 Post agglomeration using F-continuation condition.Transition count delta: 904
Deduced a syphon composed of 904 places in 1 ms
Reduce places removed 904 places and 0 transitions.
Iterating global reduction 3 with 1808 rules applied. Total rules applied 5572 place count 1130 transition count 1130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5573 place count 1130 transition count 1129
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5575 place count 1129 transition count 1128
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5777 place count 1028 transition count 1224
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5979 place count 927 transition count 1321
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 4 with 186 rules applied. Total rules applied 6165 place count 834 transition count 1414
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6166 place count 834 transition count 1413
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 6168 place count 834 transition count 1411
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 6170 place count 832 transition count 1411
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 6171 place count 832 transition count 1410
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 6172 place count 831 transition count 1409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 6173 place count 830 transition count 1409
Applied a total of 6173 rules in 946 ms. Remains 830 /3916 variables (removed 3086) and now considering 1409/3916 (removed 2507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 947 ms. Remains : 830/3916 places, 1409/3916 transitions.
RANDOM walk for 40000 steps (12 resets) in 807 ms. (49 steps per ms) remains 14/15 properties
BEST_FIRST walk for 40004 steps (9 resets) in 472 ms. (84 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (9 resets) in 322 ms. (123 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (9 resets) in 216 ms. (184 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (10 resets) in 207 ms. (192 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 253 ms. (157 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (9 resets) in 232 ms. (171 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 106475 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 14
Probabilistic random walk after 106475 steps, saw 68388 distinct states, run finished after 3004 ms. (steps per millisecond=35 ) properties seen :0
// Phase 1: matrix 1409 rows 830 cols
[2024-06-01 21:57:46] [INFO ] Computed 400 invariants in 5 ms
[2024-06-01 21:57:46] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 47/67 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 6/73 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 176/249 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 463/712 variables, 162/263 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 80/343 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/712 variables, 15/358 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/712 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 2/714 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/714 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 415/1129 variables, 164/523 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1129 variables, 81/604 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1129 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 265/1394 variables, 102/706 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1394 variables, 51/757 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1394 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 191/1585 variables, 78/835 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1585 variables, 39/874 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1585 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 23 (OVERLAPS) 117/1702 variables, 46/920 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1702 variables, 23/943 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1702 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (OVERLAPS) 99/1801 variables, 39/982 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1801 variables, 19/1001 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1801 variables, 0/1001 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 29 (OVERLAPS) 52/1853 variables, 22/1023 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1853 variables, 11/1034 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1853 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 32 (OVERLAPS) 44/1897 variables, 16/1050 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1897 variables, 8/1058 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1897 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 35 (OVERLAPS) 44/1941 variables, 16/1074 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1941 variables, 8/1082 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1941 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 38 (OVERLAPS) 44/1985 variables, 16/1098 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1985 variables, 8/1106 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1985 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 41 (OVERLAPS) 44/2029 variables, 16/1122 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2029 variables, 8/1130 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2029 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 44 (OVERLAPS) 44/2073 variables, 16/1146 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2073 variables, 8/1154 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2073 variables, 0/1154 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 47 (OVERLAPS) 44/2117 variables, 16/1170 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2117 variables, 8/1178 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2117 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 50 (OVERLAPS) 44/2161 variables, 16/1194 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2161 variables, 8/1202 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2161 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 53 (OVERLAPS) 44/2205 variables, 16/1218 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2205 variables, 8/1226 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2205 variables, 0/1226 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 56 (OVERLAPS) 31/2236 variables, 14/1240 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2236 variables, 7/1247 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2236 variables, 0/1247 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 59 (OVERLAPS) 3/2239 variables, 2/1249 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2239 variables, 1/1250 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2239 variables, 0/1250 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 62 (OVERLAPS) 0/2239 variables, 0/1250 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2239/2239 variables, and 1250 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5728 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 830/830 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 47/67 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 6/73 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 176/249 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 463/712 variables, 162/267 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/712 variables, 80/347 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/712 variables, 15/362 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/712 variables, 10/372 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 21:57:52] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-06-01 21:57:52] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/712 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 21:57:52] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/712 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/712 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (OVERLAPS) 2/714 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/714 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 415/1129 variables, 164/540 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1129 variables, 81/621 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1129 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (OVERLAPS) 265/1394 variables, 102/723 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1394 variables, 51/774 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1394 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 24 (OVERLAPS) 191/1585 variables, 78/852 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1585 variables, 39/891 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1585 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (OVERLAPS) 117/1702 variables, 46/937 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1702 variables, 23/960 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1702 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 30 (OVERLAPS) 99/1801 variables, 39/999 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1801 variables, 19/1018 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1801 variables, 0/1018 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 33 (OVERLAPS) 52/1853 variables, 22/1040 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1853 variables, 11/1051 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1853 variables, 0/1051 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 36 (OVERLAPS) 44/1897 variables, 16/1067 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1897 variables, 8/1075 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1897 variables, 0/1075 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 39 (OVERLAPS) 44/1941 variables, 16/1091 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1941 variables, 8/1099 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1941 variables, 0/1099 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 42 (OVERLAPS) 44/1985 variables, 16/1115 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1985 variables, 8/1123 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1985 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 45 (OVERLAPS) 44/2029 variables, 16/1139 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2029 variables, 8/1147 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2029 variables, 0/1147 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 48 (OVERLAPS) 44/2073 variables, 16/1163 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2073 variables, 8/1171 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2073 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 51 (OVERLAPS) 44/2117 variables, 16/1187 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2117 variables, 8/1195 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2117 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 54 (OVERLAPS) 44/2161 variables, 16/1211 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2161 variables, 8/1219 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2161 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 57 (OVERLAPS) 44/2205 variables, 16/1235 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2205 variables, 8/1243 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2205 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 60 (OVERLAPS) 31/2236 variables, 14/1257 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2236 variables, 7/1264 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2236 variables, 0/1264 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 63 (OVERLAPS) 3/2239 variables, 2/1266 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2239 variables, 1/1267 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2239 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 66 (OVERLAPS) 0/2239 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2239/2239 variables, and 1267 constraints, problems are : Problem set: 0 solved, 14 unsolved in 8024 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 830/830 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 3/3 constraints]
After SMT, in 13784ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3221 ms.
Support contains 20 out of 830 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 830/830 places, 1409/1409 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 830 transition count 1408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 829 transition count 1408
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 829 transition count 1407
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 828 transition count 1407
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 827 transition count 1406
Applied a total of 5 rules in 74 ms. Remains 827 /830 variables (removed 3) and now considering 1406/1409 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 827/830 places, 1406/1409 transitions.
RANDOM walk for 40000 steps (10 resets) in 617 ms. (64 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (9 resets) in 210 ms. (189 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (9 resets) in 234 ms. (170 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (10 resets) in 207 ms. (192 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (9 resets) in 208 ms. (191 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 204 ms. (195 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 103326 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 14
Probabilistic random walk after 103326 steps, saw 66708 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
// Phase 1: matrix 1406 rows 827 cols
[2024-06-01 21:58:07] [INFO ] Computed 400 invariants in 8 ms
[2024-06-01 21:58:07] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 47/67 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 6/73 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 176/249 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 462/711 variables, 162/263 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/711 variables, 81/344 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/711 variables, 13/357 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/711 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 414/1125 variables, 162/519 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1125 variables, 81/600 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1125 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 265/1390 variables, 102/702 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1390 variables, 51/753 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1390 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 191/1581 variables, 78/831 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1581 variables, 39/870 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1581 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (OVERLAPS) 117/1698 variables, 46/916 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1698 variables, 23/939 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1698 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 24 (OVERLAPS) 96/1794 variables, 38/977 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1794 variables, 19/996 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1794 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (OVERLAPS) 53/1847 variables, 22/1018 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1847 variables, 11/1029 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1847 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 30 (OVERLAPS) 44/1891 variables, 16/1045 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1891 variables, 8/1053 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1891 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 33 (OVERLAPS) 44/1935 variables, 16/1069 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1935 variables, 8/1077 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1935 variables, 0/1077 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 36 (OVERLAPS) 44/1979 variables, 16/1093 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1979 variables, 8/1101 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1979 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 39 (OVERLAPS) 44/2023 variables, 16/1117 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2023 variables, 8/1125 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2023 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 42 (OVERLAPS) 44/2067 variables, 16/1141 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2067 variables, 8/1149 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2067 variables, 0/1149 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 45 (OVERLAPS) 44/2111 variables, 16/1165 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2111 variables, 8/1173 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2111 variables, 0/1173 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 48 (OVERLAPS) 44/2155 variables, 16/1189 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2155 variables, 8/1197 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2155 variables, 0/1197 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 51 (OVERLAPS) 44/2199 variables, 16/1213 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2199 variables, 8/1221 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2199 variables, 0/1221 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 54 (OVERLAPS) 31/2230 variables, 14/1235 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2230 variables, 7/1242 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2230 variables, 0/1242 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 57 (OVERLAPS) 3/2233 variables, 2/1244 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2233 variables, 1/1245 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2233 variables, 0/1245 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 60 (OVERLAPS) 0/2233 variables, 0/1245 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2233/2233 variables, and 1245 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5603 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 827/827 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 47/67 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 6/73 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 176/249 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 462/711 variables, 162/267 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/711 variables, 81/348 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/711 variables, 13/361 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/711 variables, 10/371 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/711 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 414/1125 variables, 162/533 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1125 variables, 81/614 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1125 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 265/1390 variables, 102/716 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1390 variables, 51/767 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1390 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 191/1581 variables, 78/845 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1581 variables, 39/884 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1581 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 23 (OVERLAPS) 117/1698 variables, 46/930 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1698 variables, 23/953 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1698 variables, 0/953 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (OVERLAPS) 96/1794 variables, 38/991 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1794 variables, 19/1010 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1794 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 29 (OVERLAPS) 53/1847 variables, 22/1032 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1847 variables, 11/1043 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1847 variables, 0/1043 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 32 (OVERLAPS) 44/1891 variables, 16/1059 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1891 variables, 8/1067 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1891 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 35 (OVERLAPS) 44/1935 variables, 16/1083 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1935 variables, 8/1091 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1935 variables, 0/1091 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 38 (OVERLAPS) 44/1979 variables, 16/1107 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1979 variables, 8/1115 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1979 variables, 0/1115 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 41 (OVERLAPS) 44/2023 variables, 16/1131 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2023 variables, 8/1139 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2023 variables, 0/1139 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 44 (OVERLAPS) 44/2067 variables, 16/1155 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2067 variables, 8/1163 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2067 variables, 0/1163 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 47 (OVERLAPS) 44/2111 variables, 16/1179 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2111 variables, 8/1187 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2111 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 50 (OVERLAPS) 44/2155 variables, 16/1203 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2155 variables, 8/1211 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2155 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 53 (OVERLAPS) 44/2199 variables, 16/1227 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/2199 variables, 8/1235 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2199 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 56 (OVERLAPS) 31/2230 variables, 14/1249 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2230 variables, 7/1256 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2230 variables, 0/1256 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 59 (OVERLAPS) 3/2233 variables, 2/1258 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2233 variables, 1/1259 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2233 variables, 0/1259 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 62 (OVERLAPS) 0/2233 variables, 0/1259 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2233/2233 variables, and 1259 constraints, problems are : Problem set: 0 solved, 14 unsolved in 7551 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 827/827 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 13180ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 3469 ms.
Support contains 20 out of 827 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 827/827 places, 1406/1406 transitions.
Applied a total of 0 rules in 41 ms. Remains 827 /827 variables (removed 0) and now considering 1406/1406 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 827/827 places, 1406/1406 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 827/827 places, 1406/1406 transitions.
Applied a total of 0 rules in 29 ms. Remains 827 /827 variables (removed 0) and now considering 1406/1406 (removed 0) transitions.
[2024-06-01 21:58:24] [INFO ] Invariant cache hit.
[2024-06-01 21:58:24] [INFO ] Implicit Places using invariants in 422 ms returned []
[2024-06-01 21:58:24] [INFO ] Invariant cache hit.
[2024-06-01 21:58:24] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-06-01 21:58:25] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
[2024-06-01 21:58:25] [INFO ] Redundant transitions in 77 ms returned []
Running 1398 sub problems to find dead transitions.
[2024-06-01 21:58:25] [INFO ] Invariant cache hit.
[2024-06-01 21:58:25] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/822 variables, 392/392 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
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 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 1.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 1.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 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 1.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 1.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 1.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 1.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 1.0)
(s352 1.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 1.0)
(s368 1.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 1.0)
(s376 1.0)
(s377 0.0)
(s378 1.0)
(s379 0.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 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 1.0)
(s394 1.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 1.0)
(s403 1.0)
(s404 0.0)
(s405 1.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 1.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 1.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 1.0)
(s427 1.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 1.0)
(s443 1.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 1.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 1.0)
(s478 1.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 1.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 0.0)
(s493 1.0)
(s494 1.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 1.0)
(s500 0.0)
(s501 1.0)
(s502 1.0)
(s503 0.0)
(s504 1.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 1.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 1.0)
(s516 0.0)
(s517 1.0)
(s518 1.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 1.0)
(s524 0.0)
(s525 1.0)
(s526 1.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 1.0)
(s535 1.0)
(s536 1.0)
(s537 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 822/2233 variables, and 392 constraints, problems are : Problem set: 0 solved, 1398 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 392/400 constraints, State Equation: 0/827 constraints, ReadFeed: 0/18 constraints, PredecessorRefiner: 1398/1398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/822 variables, 392/392 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/822 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
At refinement iteration 2 (OVERLAPS) 5/827 variables, 8/400 constraints. Problems are: Problem set: 0 solved, 1398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 827/2233 variables, and 400 constraints, problems are : Problem set: 0 solved, 1398 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/827 constraints, ReadFeed: 0/18 constraints, PredecessorRefiner: 0/1398 constraints, Known Traps: 0/0 constraints]
After SMT, in 60562ms problems are : Problem set: 0 solved, 1398 unsolved
Search for dead transitions found 0 dead transitions in 60575ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62241 ms. Remains : 827/827 places, 1406/1406 transitions.
Computed a total of 1201 stabilizing places and 1201 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 4 out of 3916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3916/3916 places, 3916/3916 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3902 transition count 3902
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3902 transition count 3902
Applied a total of 28 rules in 847 ms. Remains 3902 /3916 variables (removed 14) and now considering 3902/3916 (removed 14) transitions.
// Phase 1: matrix 3902 rows 3902 cols
[2024-06-01 21:59:27] [INFO ] Computed 401 invariants in 35 ms
[2024-06-01 21:59:28] [INFO ] Implicit Places using invariants in 958 ms returned []
[2024-06-01 21:59:28] [INFO ] Invariant cache hit.
[2024-06-01 21:59:31] [INFO ] Implicit Places using invariants and state equation in 3484 ms returned []
Implicit Place search using SMT with State Equation took 4445 ms to find 0 implicit places.
Running 3901 sub problems to find dead transitions.
[2024-06-01 21:59:31] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 3901/3901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3901/7804 variables, and 0 constraints, problems are : Problem set: 0 solved, 3901 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3902 constraints, PredecessorRefiner: 0/3901 constraints, Known Traps: 0/0 constraints]
After SMT, in 61500ms problems are : Problem set: 0 solved, 3901 unsolved
Search for dead transitions found 0 dead transitions in 61533ms
Starting structural reductions in LTL mode, iteration 1 : 3902/3916 places, 3902/3916 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66845 ms. Remains : 3902/3916 places, 3902/3916 transitions.
Stuttering acceptance computed with spot in 379 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-00
Product exploration explored 100000 steps with 6 reset in 814 ms.
Product exploration explored 100000 steps with 3 reset in 985 ms.
Computed a total of 1198 stabilizing places and 1198 stable transitions
Computed a total of 1198 stabilizing places and 1198 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 289 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 220311 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 1
Probabilistic random walk after 220311 steps, saw 188735 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2024-06-01 22:00:38] [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) 95/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3805/3902 variables, 399/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3902 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3902/7804 variables, 3902/4303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7804 variables, 0/4303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/7804 variables, 0/4303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7804/7804 variables, and 4303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1585 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 3902/3902 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) 95/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3805/3902 variables, 399/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:00:42] [INFO ] Deduced a trap composed of 29 places in 1016 ms of which 14 ms to minimize.
[2024-06-01 22:00:43] [INFO ] Deduced a trap composed of 41 places in 968 ms of which 13 ms to minimize.
[2024-06-01 22:00:44] [INFO ] Deduced a trap composed of 26 places in 970 ms of which 13 ms to minimize.
[2024-06-01 22:00:45] [INFO ] Deduced a trap composed of 35 places in 948 ms of which 13 ms to minimize.
[2024-06-01 22:00:46] [INFO ] Deduced a trap composed of 42 places in 933 ms of which 13 ms to minimize.
SMT process timed out in 7200ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3902/3902 places, 3902/3902 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1098 transitions
Trivial Post-agglo rules discarded 1098 transitions
Performed 1098 trivial Post agglomeration. Transition count delta: 1098
Iterating post reduction 0 with 1098 rules applied. Total rules applied 1098 place count 3902 transition count 2804
Reduce places removed 1098 places and 0 transitions.
Iterating post reduction 1 with 1098 rules applied. Total rules applied 2196 place count 2804 transition count 2804
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2196 place count 2804 transition count 2005
Deduced a syphon composed of 799 places in 4 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3794 place count 2005 transition count 2005
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 0 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 2 with 1802 rules applied. Total rules applied 5596 place count 1104 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5597 place count 1104 transition count 1103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5599 place count 1103 transition count 1102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5801 place count 1002 transition count 1202
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 6003 place count 901 transition count 1303
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6197 place count 804 transition count 1400
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6198 place count 804 transition count 1399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6199 place count 803 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6200 place count 802 transition count 1398
Applied a total of 6200 rules in 532 ms. Remains 802 /3902 variables (removed 3100) and now considering 1398/3902 (removed 2504) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 533 ms. Remains : 802/3902 places, 1398/3902 transitions.
RANDOM walk for 40000 steps (14 resets) in 487 ms. (81 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 204901 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 204901 steps, saw 128082 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
// Phase 1: matrix 1398 rows 802 cols
[2024-06-01 22:00:49] [INFO ] Computed 400 invariants in 9 ms
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) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/22 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/95 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 93/188 variables, 34/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 83/271 variables, 32/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 16/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 51/322 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 10/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/322 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 44/366 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/366 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 44/410 variables, 16/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/410 variables, 8/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/410 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 44/454 variables, 16/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/454 variables, 8/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/454 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 44/498 variables, 16/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/498 variables, 8/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/498 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 44/542 variables, 16/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/542 variables, 8/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/542 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 44/586 variables, 16/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/586 variables, 8/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/586 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 44/630 variables, 16/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/630 variables, 8/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/630 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 44/674 variables, 16/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/674 variables, 8/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/674 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 44/718 variables, 16/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/718 variables, 8/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/718 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 44/762 variables, 16/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/762 variables, 8/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/762 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 44/806 variables, 16/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/806 variables, 8/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/806 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 44/850 variables, 16/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/850 variables, 8/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/850 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 44/894 variables, 16/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/894 variables, 8/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/894 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 44/938 variables, 16/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/938 variables, 8/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/938 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 44/982 variables, 16/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/982 variables, 8/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/982 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 44/1026 variables, 16/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1026 variables, 8/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1026 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 44/1070 variables, 16/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1070 variables, 8/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1070 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 44/1114 variables, 16/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1114 variables, 8/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1114 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 44/1158 variables, 16/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1158 variables, 8/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1158 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 44/1202 variables, 16/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1202 variables, 8/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1202 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 44/1246 variables, 16/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1246 variables, 8/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1246 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 44/1290 variables, 16/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1290 variables, 8/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1290 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 44/1334 variables, 16/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1334 variables, 8/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1334 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 37/1371 variables, 16/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1371 variables, 8/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1371 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 22/1393 variables, 8/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1393 variables, 4/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1393 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 22/1415 variables, 8/766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1415 variables, 4/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1415 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 22/1437 variables, 8/778 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1437 variables, 4/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1437 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 22/1459 variables, 8/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1459 variables, 4/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1459 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 22/1481 variables, 8/802 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1481 variables, 4/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1481 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 22/1503 variables, 8/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1503 variables, 4/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1503 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 22/1525 variables, 8/826 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1525 variables, 4/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1525 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 22/1547 variables, 8/838 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1547 variables, 4/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1547 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 22/1569 variables, 8/850 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1569 variables, 4/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1569 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 22/1591 variables, 8/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1591 variables, 4/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1591 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 22/1613 variables, 8/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/1613 variables, 4/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1613 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 22/1635 variables, 8/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (INCLUDED_ONLY) 0/1635 variables, 4/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1635 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (OVERLAPS) 22/1657 variables, 8/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/1657 variables, 4/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1657 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (OVERLAPS) 22/1679 variables, 8/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/1679 variables, 4/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1679 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (OVERLAPS) 22/1701 variables, 8/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/1701 variables, 4/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1701 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (OVERLAPS) 22/1723 variables, 8/934 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (INCLUDED_ONLY) 0/1723 variables, 4/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1723 variables, 0/938 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (OVERLAPS) 22/1745 variables, 8/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/1745 variables, 4/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1745 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (OVERLAPS) 22/1767 variables, 8/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/1767 variables, 4/962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1767 variables, 0/962 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (OVERLAPS) 22/1789 variables, 8/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/1789 variables, 4/974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1789 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (OVERLAPS) 22/1811 variables, 8/982 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (INCLUDED_ONLY) 0/1811 variables, 4/986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1811 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (OVERLAPS) 22/1833 variables, 8/994 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/1833 variables, 4/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1833 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (OVERLAPS) 22/1855 variables, 8/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/1855 variables, 4/1010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1855 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (OVERLAPS) 22/1877 variables, 8/1018 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (INCLUDED_ONLY) 0/1877 variables, 4/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1877 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (OVERLAPS) 22/1899 variables, 8/1030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (INCLUDED_ONLY) 0/1899 variables, 4/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1899 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (OVERLAPS) 22/1921 variables, 8/1042 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (INCLUDED_ONLY) 0/1921 variables, 4/1046 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1921 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (OVERLAPS) 22/1943 variables, 8/1054 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (INCLUDED_ONLY) 0/1943 variables, 4/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1943 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (OVERLAPS) 22/1965 variables, 8/1066 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (INCLUDED_ONLY) 0/1965 variables, 4/1070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1965 variables, 0/1070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (OVERLAPS) 22/1987 variables, 8/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (INCLUDED_ONLY) 0/1987 variables, 4/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1987 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (OVERLAPS) 22/2009 variables, 8/1090 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (INCLUDED_ONLY) 0/2009 variables, 4/1094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/2009 variables, 0/1094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (OVERLAPS) 22/2031 variables, 8/1102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (INCLUDED_ONLY) 0/2031 variables, 4/1106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/2031 variables, 0/1106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (OVERLAPS) 22/2053 variables, 8/1114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (INCLUDED_ONLY) 0/2053 variables, 4/1118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/2053 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (OVERLAPS) 22/2075 variables, 8/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (INCLUDED_ONLY) 0/2075 variables, 4/1130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/2075 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (OVERLAPS) 22/2097 variables, 8/1138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (INCLUDED_ONLY) 0/2097 variables, 4/1142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/2097 variables, 0/1142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (OVERLAPS) 22/2119 variables, 8/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (INCLUDED_ONLY) 0/2119 variables, 4/1154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/2119 variables, 0/1154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (OVERLAPS) 22/2141 variables, 8/1162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (INCLUDED_ONLY) 0/2141 variables, 4/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/2141 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (OVERLAPS) 22/2163 variables, 8/1174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (INCLUDED_ONLY) 0/2163 variables, 4/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/2163 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (OVERLAPS) 20/2183 variables, 8/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (INCLUDED_ONLY) 0/2183 variables, 4/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/2183 variables, 0/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (OVERLAPS) 14/2197 variables, 6/1196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (INCLUDED_ONLY) 0/2197 variables, 3/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/2197 variables, 0/1199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (OVERLAPS) 3/2200 variables, 2/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (INCLUDED_ONLY) 0/2200 variables, 1/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/2200 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (OVERLAPS) 0/2200 variables, 0/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2200/2200 variables, and 1202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1377 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 802/802 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) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/22 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/95 variables, 22/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 93/188 variables, 34/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 83/271 variables, 32/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 16/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 51/322 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/322 variables, 10/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/322 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 44/366 variables, 16/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/366 variables, 8/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/366 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 44/410 variables, 16/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/410 variables, 8/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/410 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 44/454 variables, 16/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/454 variables, 8/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/454 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 44/498 variables, 16/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/498 variables, 8/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/498 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 44/542 variables, 16/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/542 variables, 8/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/542 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 44/586 variables, 16/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/586 variables, 8/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/586 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 44/630 variables, 16/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/630 variables, 8/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/630 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 44/674 variables, 16/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/674 variables, 8/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/674 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 44/718 variables, 16/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/718 variables, 8/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/718 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 44/762 variables, 16/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/762 variables, 8/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/762 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 44/806 variables, 16/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/806 variables, 8/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/806 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 44/850 variables, 16/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/850 variables, 8/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/850 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 44/894 variables, 16/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/894 variables, 8/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/894 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 44/938 variables, 16/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/938 variables, 8/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/938 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 44/982 variables, 16/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/982 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/982 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 44/1026 variables, 16/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1026 variables, 8/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1026 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 44/1070 variables, 16/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1070 variables, 8/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1070 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 44/1114 variables, 16/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1114 variables, 8/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1114 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 44/1158 variables, 16/619 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1158 variables, 8/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1158 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 44/1202 variables, 16/643 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1202 variables, 8/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1202 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 44/1246 variables, 16/667 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1246 variables, 8/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1246 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 44/1290 variables, 16/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1290 variables, 8/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1290 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 44/1334 variables, 16/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1334 variables, 8/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1334 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 37/1371 variables, 16/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1371 variables, 8/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1371 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 22/1393 variables, 8/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1393 variables, 4/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1393 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 22/1415 variables, 8/767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1415 variables, 4/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1415 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 22/1437 variables, 8/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1437 variables, 4/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1437 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 22/1459 variables, 8/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1459 variables, 4/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1459 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 22/1481 variables, 8/803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1481 variables, 4/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1481 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 22/1503 variables, 8/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1503 variables, 4/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1503 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 22/1525 variables, 8/827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1525 variables, 4/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1525 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 22/1547 variables, 8/839 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1547 variables, 4/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1547 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 22/1569 variables, 8/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1569 variables, 4/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1569 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 22/1591 variables, 8/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1591 variables, 4/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1591 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 22/1613 variables, 8/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1613 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1613 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 22/1635 variables, 8/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1635 variables, 4/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1635 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (OVERLAPS) 22/1657 variables, 8/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1657 variables, 4/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1657 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (OVERLAPS) 22/1679 variables, 8/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1679 variables, 4/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1679 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (OVERLAPS) 22/1701 variables, 8/923 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/1701 variables, 4/927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/1701 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 22/1723 variables, 8/935 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/1723 variables, 4/939 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/1723 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (OVERLAPS) 22/1745 variables, 8/947 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (INCLUDED_ONLY) 0/1745 variables, 4/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/1745 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (OVERLAPS) 22/1767 variables, 8/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/1767 variables, 4/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (INCLUDED_ONLY) 0/1767 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (OVERLAPS) 22/1789 variables, 8/971 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/1789 variables, 4/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/1789 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (OVERLAPS) 22/1811 variables, 8/983 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/1811 variables, 4/987 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/1811 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (OVERLAPS) 22/1833 variables, 8/995 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (INCLUDED_ONLY) 0/1833 variables, 4/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/1833 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (OVERLAPS) 22/1855 variables, 8/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/1855 variables, 4/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (INCLUDED_ONLY) 0/1855 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 156 (OVERLAPS) 22/1877 variables, 8/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 157 (INCLUDED_ONLY) 0/1877 variables, 4/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 158 (INCLUDED_ONLY) 0/1877 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 159 (OVERLAPS) 22/1899 variables, 8/1031 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 160 (INCLUDED_ONLY) 0/1899 variables, 4/1035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 161 (INCLUDED_ONLY) 0/1899 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 162 (OVERLAPS) 22/1921 variables, 8/1043 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 163 (INCLUDED_ONLY) 0/1921 variables, 4/1047 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 164 (INCLUDED_ONLY) 0/1921 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 165 (OVERLAPS) 22/1943 variables, 8/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 166 (INCLUDED_ONLY) 0/1943 variables, 4/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 167 (INCLUDED_ONLY) 0/1943 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 168 (OVERLAPS) 22/1965 variables, 8/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 169 (INCLUDED_ONLY) 0/1965 variables, 4/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 170 (INCLUDED_ONLY) 0/1965 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 171 (OVERLAPS) 22/1987 variables, 8/1079 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 172 (INCLUDED_ONLY) 0/1987 variables, 4/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 173 (INCLUDED_ONLY) 0/1987 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 174 (OVERLAPS) 22/2009 variables, 8/1091 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 175 (INCLUDED_ONLY) 0/2009 variables, 4/1095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 176 (INCLUDED_ONLY) 0/2009 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 177 (OVERLAPS) 22/2031 variables, 8/1103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 178 (INCLUDED_ONLY) 0/2031 variables, 4/1107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 179 (INCLUDED_ONLY) 0/2031 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 180 (OVERLAPS) 22/2053 variables, 8/1115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 181 (INCLUDED_ONLY) 0/2053 variables, 4/1119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 182 (INCLUDED_ONLY) 0/2053 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 183 (OVERLAPS) 22/2075 variables, 8/1127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 184 (INCLUDED_ONLY) 0/2075 variables, 4/1131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 185 (INCLUDED_ONLY) 0/2075 variables, 0/1131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 186 (OVERLAPS) 22/2097 variables, 8/1139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 187 (INCLUDED_ONLY) 0/2097 variables, 4/1143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 188 (INCLUDED_ONLY) 0/2097 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 189 (OVERLAPS) 22/2119 variables, 8/1151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 190 (INCLUDED_ONLY) 0/2119 variables, 4/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 191 (INCLUDED_ONLY) 0/2119 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 192 (OVERLAPS) 22/2141 variables, 8/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 193 (INCLUDED_ONLY) 0/2141 variables, 4/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 194 (INCLUDED_ONLY) 0/2141 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 195 (OVERLAPS) 22/2163 variables, 8/1175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 196 (INCLUDED_ONLY) 0/2163 variables, 4/1179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 197 (INCLUDED_ONLY) 0/2163 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 198 (OVERLAPS) 20/2183 variables, 8/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 199 (INCLUDED_ONLY) 0/2183 variables, 4/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 200 (INCLUDED_ONLY) 0/2183 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 201 (OVERLAPS) 14/2197 variables, 6/1197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 202 (INCLUDED_ONLY) 0/2197 variables, 3/1200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 203 (INCLUDED_ONLY) 0/2197 variables, 0/1200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 204 (OVERLAPS) 3/2200 variables, 2/1202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 205 (INCLUDED_ONLY) 0/2200 variables, 1/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 206 (INCLUDED_ONLY) 0/2200 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 207 (OVERLAPS) 0/2200 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2200/2200 variables, and 1203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1538 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 802/802 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2935ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1398/1398 transitions.
Applied a total of 0 rules in 26 ms. Remains 802 /802 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 802/802 places, 1398/1398 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1398/1398 transitions.
Applied a total of 0 rules in 26 ms. Remains 802 /802 variables (removed 0) and now considering 1398/1398 (removed 0) transitions.
[2024-06-01 22:00:52] [INFO ] Invariant cache hit.
[2024-06-01 22:00:53] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-06-01 22:00:53] [INFO ] Invariant cache hit.
[2024-06-01 22:00:54] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1354 ms to find 0 implicit places.
[2024-06-01 22:00:54] [INFO ] Redundant transitions in 61 ms returned []
Running 1395 sub problems to find dead transitions.
[2024-06-01 22:00:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/802 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 802/2200 variables, and 400 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/802 constraints, PredecessorRefiner: 1395/1395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/802 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/802 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 2 (OVERLAPS) 1398/2200 variables, 802/1202 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2200 variables, 1395/2597 constraints. Problems are: Problem set: 0 solved, 1395 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 2200/2200 variables, and 2597 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 802/802 constraints, PredecessorRefiner: 1395/1395 constraints, Known Traps: 0/0 constraints]
After SMT, in 60496ms problems are : Problem set: 0 solved, 1395 unsolved
Search for dead transitions found 0 dead transitions in 60507ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61955 ms. Remains : 802/802 places, 1398/1398 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 399 edges and 802 vertex of which 4 / 802 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2781 edges and 800 vertex of which 798 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 396 edges and 796 vertex of which 4 / 796 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 794 transition count 1389
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 395 edges and 792 vertex of which 6 / 792 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 789 transition count 1380
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 393 edges and 786 vertex of which 8 / 786 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 782 transition count 1369
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 389 edges and 778 vertex of which 8 / 778 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 774 transition count 1355
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 385 edges and 770 vertex of which 8 / 770 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 766 transition count 1341
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 381 edges and 762 vertex of which 8 / 762 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 758 transition count 1327
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 377 edges and 754 vertex of which 8 / 754 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 750 transition count 1313
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 373 edges and 746 vertex of which 8 / 746 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 742 transition count 1299
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 369 edges and 738 vertex of which 8 / 738 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 734 transition count 1285
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 365 edges and 730 vertex of which 8 / 730 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 726 transition count 1271
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 361 edges and 722 vertex of which 8 / 722 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 718 transition count 1257
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 357 edges and 714 vertex of which 8 / 714 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 710 transition count 1243
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 353 edges and 706 vertex of which 8 / 706 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 702 transition count 1229
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 349 edges and 698 vertex of which 8 / 698 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 694 transition count 1215
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 345 edges and 690 vertex of which 8 / 690 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 686 transition count 1201
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 341 edges and 682 vertex of which 8 / 682 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 678 transition count 1187
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 337 edges and 674 vertex of which 8 / 674 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 670 transition count 1173
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 333 edges and 666 vertex of which 8 / 666 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 662 transition count 1159
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 329 edges and 658 vertex of which 8 / 658 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 654 transition count 1145
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 325 edges and 650 vertex of which 8 / 650 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 646 transition count 1131
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 321 edges and 642 vertex of which 8 / 642 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 638 transition count 1117
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 317 edges and 634 vertex of which 8 / 634 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 630 transition count 1103
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 313 edges and 626 vertex of which 8 / 626 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 622 transition count 1089
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 309 edges and 618 vertex of which 8 / 618 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 614 transition count 1075
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 305 edges and 610 vertex of which 8 / 610 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 606 transition count 1061
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 301 edges and 602 vertex of which 8 / 602 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 598 transition count 1047
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 297 edges and 594 vertex of which 8 / 594 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 590 transition count 1033
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 293 edges and 586 vertex of which 8 / 586 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 582 transition count 1019
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 289 edges and 578 vertex of which 8 / 578 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 574 transition count 1005
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 285 edges and 570 vertex of which 8 / 570 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 566 transition count 991
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 281 edges and 562 vertex of which 8 / 562 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 558 transition count 977
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 277 edges and 554 vertex of which 8 / 554 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 586 place count 550 transition count 963
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 273 edges and 546 vertex of which 8 / 546 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 605 place count 542 transition count 949
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 269 edges and 538 vertex of which 8 / 538 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 624 place count 534 transition count 935
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 265 edges and 530 vertex of which 8 / 530 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 643 place count 526 transition count 921
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 261 edges and 522 vertex of which 8 / 522 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 662 place count 518 transition count 907
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 257 edges and 514 vertex of which 8 / 514 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 681 place count 510 transition count 893
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 253 edges and 506 vertex of which 8 / 506 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 700 place count 502 transition count 879
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 249 edges and 498 vertex of which 8 / 498 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 719 place count 494 transition count 865
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 245 edges and 490 vertex of which 8 / 490 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 738 place count 486 transition count 851
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 241 edges and 482 vertex of which 8 / 482 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 757 place count 478 transition count 837
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 237 edges and 474 vertex of which 8 / 474 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 776 place count 470 transition count 823
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 233 edges and 466 vertex of which 8 / 466 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 795 place count 462 transition count 809
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 229 edges and 458 vertex of which 8 / 458 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 19 rules applied. Total rules applied 814 place count 454 transition count 795
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 225 edges and 450 vertex of which 8 / 450 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 44 with 19 rules applied. Total rules applied 833 place count 446 transition count 781
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 221 edges and 442 vertex of which 8 / 442 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 45 with 19 rules applied. Total rules applied 852 place count 438 transition count 767
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 217 edges and 434 vertex of which 8 / 434 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 46 with 19 rules applied. Total rules applied 871 place count 430 transition count 753
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 213 edges and 426 vertex of which 8 / 426 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 47 with 19 rules applied. Total rules applied 890 place count 422 transition count 739
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 209 edges and 418 vertex of which 8 / 418 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 48 with 19 rules applied. Total rules applied 909 place count 414 transition count 725
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 205 edges and 410 vertex of which 8 / 410 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 49 with 19 rules applied. Total rules applied 928 place count 406 transition count 711
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 201 edges and 402 vertex of which 8 / 402 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 50 with 19 rules applied. Total rules applied 947 place count 398 transition count 697
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 197 edges and 394 vertex of which 8 / 394 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 51 with 19 rules applied. Total rules applied 966 place count 390 transition count 683
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 193 edges and 386 vertex of which 8 / 386 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 52 with 19 rules applied. Total rules applied 985 place count 382 transition count 669
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 189 edges and 378 vertex of which 8 / 378 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 53 with 19 rules applied. Total rules applied 1004 place count 374 transition count 655
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 185 edges and 370 vertex of which 8 / 370 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 54 with 19 rules applied. Total rules applied 1023 place count 366 transition count 641
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 181 edges and 362 vertex of which 8 / 362 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 55 with 19 rules applied. Total rules applied 1042 place count 358 transition count 627
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 177 edges and 354 vertex of which 8 / 354 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 56 with 19 rules applied. Total rules applied 1061 place count 350 transition count 613
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 173 edges and 346 vertex of which 8 / 346 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 57 with 19 rules applied. Total rules applied 1080 place count 342 transition count 599
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 169 edges and 338 vertex of which 8 / 338 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 58 with 19 rules applied. Total rules applied 1099 place count 334 transition count 585
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 165 edges and 330 vertex of which 8 / 330 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 59 with 19 rules applied. Total rules applied 1118 place count 326 transition count 571
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 161 edges and 322 vertex of which 8 / 322 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 60 with 19 rules applied. Total rules applied 1137 place count 318 transition count 557
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 157 edges and 314 vertex of which 8 / 314 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 61 with 19 rules applied. Total rules applied 1156 place count 310 transition count 543
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 153 edges and 306 vertex of which 8 / 306 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 62 with 19 rules applied. Total rules applied 1175 place count 302 transition count 529
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 149 edges and 298 vertex of which 8 / 298 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 63 with 19 rules applied. Total rules applied 1194 place count 294 transition count 515
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 145 edges and 290 vertex of which 8 / 290 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 64 with 19 rules applied. Total rules applied 1213 place count 286 transition count 501
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 141 edges and 282 vertex of which 8 / 282 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 65 with 19 rules applied. Total rules applied 1232 place count 278 transition count 487
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 137 edges and 274 vertex of which 8 / 274 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 66 with 19 rules applied. Total rules applied 1251 place count 270 transition count 473
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 133 edges and 266 vertex of which 6 / 266 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 67 with 19 rules applied. Total rules applied 1270 place count 263 transition count 459
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 131 edges and 260 vertex of which 8 / 260 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 68 with 15 rules applied. Total rules applied 1285 place count 256 transition count 448
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 127 edges and 252 vertex of which 8 / 252 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 69 with 20 rules applied. Total rules applied 1305 place count 248 transition count 433
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 123 edges and 244 vertex of which 8 / 244 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 70 with 19 rules applied. Total rules applied 1324 place count 240 transition count 419
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 119 edges and 236 vertex of which 6 / 236 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 71 with 19 rules applied. Total rules applied 1343 place count 233 transition count 405
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 116 edges and 230 vertex of which 6 / 230 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 72 with 14 rules applied. Total rules applied 1357 place count 227 transition count 395
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 113 edges and 224 vertex of which 6 / 224 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 73 with 16 rules applied. Total rules applied 1373 place count 221 transition count 383
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 111 edges and 218 vertex of which 8 / 218 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 74 with 15 rules applied. Total rules applied 1388 place count 214 transition count 372
Discarding 200 places :
Also discarding 350 output transitions
Drop transitions (Output transitions of discarded places.) removed 350 transitions
Remove reverse transitions (loop back) rule discarded transition t222.t219.t220 and 200 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 5 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 75 with 12 rules applied. Total rules applied 1400 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 76 with 5 rules applied. Total rules applied 1405 place count 8 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 77 with 2 Pre rules applied. Total rules applied 1405 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 77 with 4 rules applied. Total rules applied 1409 place count 6 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 77 with 3 rules applied. Total rules applied 1412 place count 4 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 77 with 1 rules applied. Total rules applied 1413 place count 4 transition count 4
Applied a total of 1413 rules in 201 ms. Remains 4 /802 variables (removed 798) and now considering 4/1398 (removed 1394) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 22:01:55] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 22:01:55] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 22:01:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 22:01:55] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 22:01:55] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 22:01:55] [INFO ] After 26ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 264 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 2 out of 3902 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 : 3902/3902 places, 3902/3902 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1095 transitions
Trivial Post-agglo rules discarded 1095 transitions
Performed 1095 trivial Post agglomeration. Transition count delta: 1095
Iterating post reduction 0 with 1095 rules applied. Total rules applied 1095 place count 3901 transition count 2806
Reduce places removed 1095 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1097 rules applied. Total rules applied 2192 place count 2806 transition count 2804
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2194 place count 2804 transition count 2804
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2194 place count 2804 transition count 2005
Deduced a syphon composed of 799 places in 4 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 3792 place count 2005 transition count 2005
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 0 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 3 with 1794 rules applied. Total rules applied 5586 place count 1108 transition count 1108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5587 place count 1108 transition count 1107
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 5589 place count 1107 transition count 1106
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5791 place count 1006 transition count 1206
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5993 place count 905 transition count 1306
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 6185 place count 809 transition count 1402
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 6187 place count 807 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6188 place count 806 transition count 1400
Applied a total of 6188 rules in 468 ms. Remains 806 /3902 variables (removed 3096) and now considering 1400/3902 (removed 2502) transitions.
// Phase 1: matrix 1400 rows 806 cols
[2024-06-01 22:01:55] [INFO ] Computed 400 invariants in 8 ms
[2024-06-01 22:01:56] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-06-01 22:01:56] [INFO ] Invariant cache hit.
[2024-06-01 22:01:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 22:01:57] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
[2024-06-01 22:01:57] [INFO ] Redundant transitions in 22 ms returned []
Running 1395 sub problems to find dead transitions.
[2024-06-01 22:01:57] [INFO ] Invariant cache hit.
[2024-06-01 22:01:57] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/805 variables, 398/398 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 805/2206 variables, and 398 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 398/400 constraints, State Equation: 0/806 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1395/1395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/805 variables, 398/398 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/805 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 2 (OVERLAPS) 1/806 variables, 2/400 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/2206 variables, and 400 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/806 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 0/1395 constraints, Known Traps: 0/0 constraints]
After SMT, in 60584ms problems are : Problem set: 0 solved, 1395 unsolved
Search for dead transitions found 0 dead transitions in 60595ms
Starting structural reductions in SI_LTL mode, iteration 1 : 806/3902 places, 1400/3902 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62472 ms. Remains : 806/3902 places, 1400/3902 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 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 27 ms :[(NOT p0)]
RANDOM walk for 40000 steps (12 resets) in 674 ms. (59 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 47150 steps, run visited all 1 properties in 751 ms. (steps per millisecond=62 )
Probabilistic random walk after 47150 steps, saw 30186 distinct states, run finished after 791 ms. (steps per millisecond=59 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 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 :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 20 reset in 813 ms.
Product exploration explored 100000 steps with 29 reset in 942 ms.
Support contains 2 out of 806 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 806/806 places, 1400/1400 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 805 transition count 1398
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 804 transition count 1398
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 803 transition count 1400
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 802 transition count 1399
Applied a total of 5 rules in 80 ms. Remains 802 /806 variables (removed 4) and now considering 1399/1400 (removed 1) transitions.
// Phase 1: matrix 1399 rows 802 cols
[2024-06-01 22:03:00] [INFO ] Computed 400 invariants in 8 ms
[2024-06-01 22:03:01] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-06-01 22:03:01] [INFO ] Invariant cache hit.
[2024-06-01 22:03:02] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1322 ms to find 0 implicit places.
[2024-06-01 22:03:02] [INFO ] Redundant transitions in 13 ms returned []
Running 1395 sub problems to find dead transitions.
[2024-06-01 22:03:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/802 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 802/2201 variables, and 400 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/802 constraints, PredecessorRefiner: 1395/1395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/802 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/802 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 2 (OVERLAPS) 1398/2200 variables, 802/1202 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2200 variables, 1395/2597 constraints. Problems are: Problem set: 0 solved, 1395 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 2200/2201 variables, and 2597 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 802/802 constraints, PredecessorRefiner: 1395/1395 constraints, Known Traps: 0/0 constraints]
After SMT, in 60515ms problems are : Problem set: 0 solved, 1395 unsolved
Search for dead transitions found 0 dead transitions in 60526ms
Starting structural reductions in SI_LTL mode, iteration 1 : 802/806 places, 1399/1400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61949 ms. Remains : 802/806 places, 1399/1400 transitions.
Treatment of property ShieldRVt-PT-100B-LTLCardinality-00 finished in 276543 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(X(F((X(F(p1))||p0)))))))'
Support contains 4 out of 3916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3916/3916 places, 3916/3916 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3903 transition count 3903
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3903 transition count 3903
Applied a total of 26 rules in 825 ms. Remains 3903 /3916 variables (removed 13) and now considering 3903/3916 (removed 13) transitions.
// Phase 1: matrix 3903 rows 3903 cols
[2024-06-01 22:04:03] [INFO ] Computed 401 invariants in 20 ms
[2024-06-01 22:04:04] [INFO ] Implicit Places using invariants in 967 ms returned []
[2024-06-01 22:04:04] [INFO ] Invariant cache hit.
[2024-06-01 22:04:08] [INFO ] Implicit Places using invariants and state equation in 3409 ms returned []
Implicit Place search using SMT with State Equation took 4378 ms to find 0 implicit places.
Running 3902 sub problems to find dead transitions.
[2024-06-01 22:04:08] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3902/7806 variables, and 0 constraints, problems are : Problem set: 0 solved, 3902 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3903 constraints, PredecessorRefiner: 3902/3902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3902/7806 variables, and 0 constraints, problems are : Problem set: 0 solved, 3902 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3903 constraints, PredecessorRefiner: 0/3902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61474ms problems are : Problem set: 0 solved, 3902 unsolved
Search for dead transitions found 0 dead transitions in 61506ms
Starting structural reductions in LTL mode, iteration 1 : 3903/3916 places, 3903/3916 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66720 ms. Remains : 3903/3916 places, 3903/3916 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-100B-LTLCardinality-01
Product exploration explored 100000 steps with 20000 reset in 476 ms.
Product exploration explored 100000 steps with 20000 reset in 451 ms.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 468 ms. (85 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 119925 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 3
Probabilistic random walk after 119925 steps, saw 110561 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
[2024-06-01 22:05:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 144/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3755/3903 variables, 397/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3903 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3903/7806 variables, 3903/4304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7806 variables, 0/4304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7806 variables, 0/4304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7806/7806 variables, and 4304 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2085 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 3903/3903 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 144/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3755/3903 variables, 397/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:05:17] [INFO ] Deduced a trap composed of 20 places in 473 ms of which 9 ms to minimize.
[2024-06-01 22:05:18] [INFO ] Deduced a trap composed of 44 places in 472 ms of which 9 ms to minimize.
[2024-06-01 22:05:18] [INFO ] Deduced a trap composed of 50 places in 460 ms of which 8 ms to minimize.
[2024-06-01 22:05:19] [INFO ] Deduced a trap composed of 36 places in 464 ms of which 8 ms to minimize.
[2024-06-01 22:05:19] [INFO ] Deduced a trap composed of 17 places in 453 ms of which 9 ms to minimize.
[2024-06-01 22:05:20] [INFO ] Deduced a trap composed of 35 places in 455 ms of which 8 ms to minimize.
[2024-06-01 22:05:20] [INFO ] Deduced a trap composed of 22 places in 443 ms of which 8 ms to minimize.
[2024-06-01 22:05:21] [INFO ] Deduced a trap composed of 37 places in 436 ms of which 8 ms to minimize.
[2024-06-01 22:05:21] [INFO ] Deduced a trap composed of 43 places in 416 ms of which 7 ms to minimize.
SMT process timed out in 7196ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3903/3903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1096 transitions
Trivial Post-agglo rules discarded 1096 transitions
Performed 1096 trivial Post agglomeration. Transition count delta: 1096
Iterating post reduction 0 with 1096 rules applied. Total rules applied 1096 place count 3903 transition count 2807
Reduce places removed 1096 places and 0 transitions.
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2192 place count 2807 transition count 2807
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2192 place count 2807 transition count 2008
Deduced a syphon composed of 799 places in 5 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3790 place count 2008 transition count 2008
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 0 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 2 with 1802 rules applied. Total rules applied 5592 place count 1107 transition count 1107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5593 place count 1107 transition count 1106
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5595 place count 1106 transition count 1105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5797 place count 1005 transition count 1205
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5999 place count 904 transition count 1305
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6193 place count 807 transition count 1402
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6194 place count 807 transition count 1401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6195 place count 806 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6196 place count 805 transition count 1400
Applied a total of 6196 rules in 604 ms. Remains 805 /3903 variables (removed 3098) and now considering 1400/3903 (removed 2503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 604 ms. Remains : 805/3903 places, 1400/3903 transitions.
RANDOM walk for 40000 steps (13 resets) in 1157 ms. (34 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 268 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 143516 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 3
Probabilistic random walk after 143516 steps, saw 91115 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 1400 rows 805 cols
[2024-06-01 22:05:26] [INFO ] Computed 400 invariants in 7 ms
[2024-06-01 22:05:26] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 37/50 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 127/177 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 173/350 variables, 64/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 32/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 154/504 variables, 56/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 28/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 129/633 variables, 50/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/633 variables, 25/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/633 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 113/746 variables, 42/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/746 variables, 21/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/746 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 110/856 variables, 40/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/856 variables, 20/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/856 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 110/966 variables, 40/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/966 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/966 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 110/1076 variables, 40/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1076 variables, 20/579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1076 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 110/1186 variables, 40/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1186 variables, 20/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1186 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 110/1296 variables, 40/679 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1296 variables, 20/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1296 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 110/1406 variables, 40/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1406 variables, 20/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1406 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 110/1516 variables, 40/799 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1516 variables, 20/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1516 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 108/1624 variables, 40/859 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1624 variables, 20/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1624 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 78/1702 variables, 32/911 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1702 variables, 16/927 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1702 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 36/1738 variables, 16/943 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1738 variables, 8/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1738 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 22/1760 variables, 8/959 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1760 variables, 4/963 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1760 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 22/1782 variables, 8/971 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1782 variables, 4/975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1782 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 22/1804 variables, 8/983 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1804 variables, 4/987 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1804 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 22/1826 variables, 8/995 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1826 variables, 4/999 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1826 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 22/1848 variables, 8/1007 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1848 variables, 4/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1848 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (OVERLAPS) 22/1870 variables, 8/1019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1870 variables, 4/1023 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1870 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 22/1892 variables, 8/1031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1892 variables, 4/1035 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1892 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 22/1914 variables, 8/1043 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1914 variables, 4/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1914 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 22/1936 variables, 8/1055 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1936 variables, 4/1059 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1936 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (OVERLAPS) 22/1958 variables, 8/1067 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1958 variables, 4/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1958 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (OVERLAPS) 22/1980 variables, 8/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1980 variables, 4/1083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1980 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (OVERLAPS) 22/2002 variables, 8/1091 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2002 variables, 4/1095 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2002 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (OVERLAPS) 22/2024 variables, 8/1103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2024 variables, 4/1107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2024 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (OVERLAPS) 22/2046 variables, 8/1115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/2046 variables, 4/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2046 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (OVERLAPS) 22/2068 variables, 8/1127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2068 variables, 4/1131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2068 variables, 0/1131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (OVERLAPS) 22/2090 variables, 8/1139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2090 variables, 4/1143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2090 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (OVERLAPS) 22/2112 variables, 8/1151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/2112 variables, 4/1155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2112 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (OVERLAPS) 22/2134 variables, 8/1163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/2134 variables, 4/1167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2134 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 22/2156 variables, 8/1175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/2156 variables, 4/1179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/2156 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (OVERLAPS) 22/2178 variables, 8/1187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/2178 variables, 4/1191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/2178 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (OVERLAPS) 19/2197 variables, 8/1199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/2197 variables, 4/1203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/2197 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (OVERLAPS) 8/2205 variables, 4/1207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/2205 variables, 2/1209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/2205 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (OVERLAPS) 0/2205 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2205/2205 variables, and 1209 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2297 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 805/805 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 37/50 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 127/177 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 173/350 variables, 64/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 32/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 154/504 variables, 56/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 28/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 129/633 variables, 50/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/633 variables, 25/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/633 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 113/746 variables, 42/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/746 variables, 21/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/746 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 110/856 variables, 40/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/856 variables, 20/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/856 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 110/966 variables, 40/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/966 variables, 20/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/966 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 110/1076 variables, 40/562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1076 variables, 20/582 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1076 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 110/1186 variables, 40/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1186 variables, 20/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1186 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 110/1296 variables, 40/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1296 variables, 20/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1296 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 110/1406 variables, 40/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1406 variables, 20/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1406 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 110/1516 variables, 40/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1516 variables, 20/822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1516 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 108/1624 variables, 40/862 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1624 variables, 20/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1624 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 78/1702 variables, 32/914 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1702 variables, 16/930 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1702 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 36/1738 variables, 16/946 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1738 variables, 8/954 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1738 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 22/1760 variables, 8/962 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1760 variables, 4/966 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1760 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 22/1782 variables, 8/974 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1782 variables, 4/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1782 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 22/1804 variables, 8/986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1804 variables, 4/990 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1804 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 22/1826 variables, 8/998 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1826 variables, 4/1002 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1826 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 22/1848 variables, 8/1010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1848 variables, 4/1014 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1848 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 22/1870 variables, 8/1022 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1870 variables, 4/1026 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1870 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (OVERLAPS) 22/1892 variables, 8/1034 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1892 variables, 4/1038 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1892 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (OVERLAPS) 22/1914 variables, 8/1046 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1914 variables, 4/1050 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1914 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (OVERLAPS) 22/1936 variables, 8/1058 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1936 variables, 4/1062 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1936 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (OVERLAPS) 22/1958 variables, 8/1070 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1958 variables, 4/1074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1958 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (OVERLAPS) 22/1980 variables, 8/1082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1980 variables, 4/1086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1980 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (OVERLAPS) 22/2002 variables, 8/1094 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2002 variables, 4/1098 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2002 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (OVERLAPS) 22/2024 variables, 8/1106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2024 variables, 4/1110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2024 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 22/2046 variables, 8/1118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2046 variables, 4/1122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2046 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (OVERLAPS) 22/2068 variables, 8/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2068 variables, 4/1134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2068 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 22/2090 variables, 8/1142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2090 variables, 4/1146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2090 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (OVERLAPS) 22/2112 variables, 8/1154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2112 variables, 4/1158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2112 variables, 0/1158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 22/2134 variables, 8/1166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2134 variables, 4/1170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/2134 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (OVERLAPS) 22/2156 variables, 8/1178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/2156 variables, 4/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/2156 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (OVERLAPS) 22/2178 variables, 8/1190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/2178 variables, 4/1194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/2178 variables, 0/1194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (OVERLAPS) 19/2197 variables, 8/1202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/2197 variables, 4/1206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/2197 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (OVERLAPS) 8/2205 variables, 4/1210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/2205 variables, 2/1212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2205 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (OVERLAPS) 0/2205 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2205/2205 variables, and 1212 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2794 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 805/805 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 5110ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 672 ms.
Support contains 4 out of 805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 805/805 places, 1400/1400 transitions.
Applied a total of 0 rules in 26 ms. Remains 805 /805 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 805/805 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 805/805 places, 1400/1400 transitions.
Applied a total of 0 rules in 26 ms. Remains 805 /805 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2024-06-01 22:05:31] [INFO ] Invariant cache hit.
[2024-06-01 22:05:32] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-06-01 22:05:32] [INFO ] Invariant cache hit.
[2024-06-01 22:05:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 22:05:33] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2024-06-01 22:05:33] [INFO ] Redundant transitions in 15 ms returned []
Running 1395 sub problems to find dead transitions.
[2024-06-01 22:05:33] [INFO ] Invariant cache hit.
[2024-06-01 22:05:33] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 398/398 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 803/2205 variables, and 398 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 398/400 constraints, State Equation: 0/805 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 1395/1395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 398/398 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/803 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 2 (OVERLAPS) 2/805 variables, 2/400 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/2205 variables, and 400 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/805 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1395 constraints, Known Traps: 0/0 constraints]
After SMT, in 60559ms problems are : Problem set: 0 solved, 1395 unsolved
Search for dead transitions found 0 dead transitions in 60571ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62005 ms. Remains : 805/805 places, 1400/1400 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 397 edges and 805 vertex of which 4 / 805 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2791 edges and 803 vertex of which 801 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 394 edges and 799 vertex of which 4 / 799 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 797 transition count 1391
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 393 edges and 795 vertex of which 6 / 795 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 792 transition count 1382
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 391 edges and 789 vertex of which 8 / 789 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 785 transition count 1371
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 387 edges and 781 vertex of which 8 / 781 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 777 transition count 1357
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 383 edges and 773 vertex of which 8 / 773 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 769 transition count 1343
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 379 edges and 765 vertex of which 8 / 765 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 761 transition count 1329
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 375 edges and 757 vertex of which 8 / 757 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 753 transition count 1315
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 371 edges and 749 vertex of which 8 / 749 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 745 transition count 1301
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 367 edges and 741 vertex of which 8 / 741 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 737 transition count 1287
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 363 edges and 733 vertex of which 8 / 733 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 729 transition count 1273
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 359 edges and 725 vertex of which 8 / 725 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 721 transition count 1259
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 355 edges and 717 vertex of which 8 / 717 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 713 transition count 1245
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 351 edges and 709 vertex of which 8 / 709 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 705 transition count 1231
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 347 edges and 701 vertex of which 8 / 701 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 697 transition count 1217
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 343 edges and 693 vertex of which 8 / 693 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 689 transition count 1203
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 339 edges and 685 vertex of which 8 / 685 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 681 transition count 1189
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 335 edges and 677 vertex of which 8 / 677 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 673 transition count 1175
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 331 edges and 669 vertex of which 8 / 669 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 665 transition count 1161
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 327 edges and 661 vertex of which 8 / 661 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 657 transition count 1147
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 323 edges and 653 vertex of which 8 / 653 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 649 transition count 1133
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 319 edges and 645 vertex of which 8 / 645 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 641 transition count 1119
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 315 edges and 637 vertex of which 8 / 637 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 633 transition count 1105
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 311 edges and 629 vertex of which 8 / 629 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 625 transition count 1091
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 307 edges and 621 vertex of which 8 / 621 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 617 transition count 1077
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 303 edges and 613 vertex of which 8 / 613 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 609 transition count 1063
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 299 edges and 605 vertex of which 8 / 605 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 601 transition count 1049
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 295 edges and 597 vertex of which 8 / 597 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 593 transition count 1035
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 291 edges and 589 vertex of which 8 / 589 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 585 transition count 1021
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 287 edges and 581 vertex of which 8 / 581 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 577 transition count 1007
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 283 edges and 573 vertex of which 8 / 573 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 569 transition count 993
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 279 edges and 565 vertex of which 8 / 565 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 561 transition count 979
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 275 edges and 557 vertex of which 8 / 557 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 586 place count 553 transition count 965
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 271 edges and 549 vertex of which 8 / 549 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 605 place count 545 transition count 951
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 267 edges and 541 vertex of which 8 / 541 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 624 place count 537 transition count 937
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 263 edges and 533 vertex of which 8 / 533 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 643 place count 529 transition count 923
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 259 edges and 525 vertex of which 8 / 525 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 662 place count 521 transition count 909
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 253 edges and 518 vertex of which 4 / 518 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 36 with 16 rules applied. Total rules applied 678 place count 516 transition count 897
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 250 edges and 514 vertex of which 2 / 514 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 37 with 9 rules applied. Total rules applied 687 place count 513 transition count 891
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 5 rules applied. Total rules applied 692 place count 512 transition count 887
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 39 with 3 rules applied. Total rules applied 695 place count 510 transition count 886
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 699 place count 510 transition count 882
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 40 with 5 rules applied. Total rules applied 704 place count 510 transition count 877
Applied a total of 704 rules in 145 ms. Remains 510 /805 variables (removed 295) and now considering 877/1400 (removed 523) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 877 rows 510 cols
[2024-06-01 22:06:33] [INFO ] Computed 253 invariants in 4 ms
[2024-06-01 22:06:34] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 22:06:34] [INFO ] [Nat]Absence check using 253 positive place invariants in 27 ms returned sat
[2024-06-01 22:06:34] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-01 22:06:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 22:06:34] [INFO ] After 73ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 22:06:34] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 22:06:34] [INFO ] After 682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 918 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 3903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3903/3903 places, 3903/3903 transitions.
Applied a total of 0 rules in 401 ms. Remains 3903 /3903 variables (removed 0) and now considering 3903/3903 (removed 0) transitions.
// Phase 1: matrix 3903 rows 3903 cols
[2024-06-01 22:06:35] [INFO ] Computed 401 invariants in 17 ms
[2024-06-01 22:06:36] [INFO ] Implicit Places using invariants in 905 ms returned []
[2024-06-01 22:06:36] [INFO ] Invariant cache hit.
[2024-06-01 22:06:39] [INFO ] Implicit Places using invariants and state equation in 3336 ms returned []
Implicit Place search using SMT with State Equation took 4246 ms to find 0 implicit places.
Running 3902 sub problems to find dead transitions.
[2024-06-01 22:06:39] [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)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 1.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 1.0)
(s1732 1.0)
(s1733 1.0)
(s1734 1.0)
(s1735 1.0)
(s1736 1.0)
(s1737 1.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 1.0)
(s1745 1.0)
(s1746 1.0)
(s1747 1.0)
(s1748 1.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 1.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 1.0)
(s1773 1.0)
(s1774 1.0)
(s1775 1.0)
(s1776 1.0)
(s1777 1.0)
(s1778 1.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 1.0)
(s1787 1.0)
(s1788 1.0)
(s1789 1.0)
(s1790 1.0)
(s1791 1.0)
(s1792 1.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 1.0)
(s1801 1.0)
(s1802 1.0)
(s1803 1.0)
(s1804 1.0)
(s1805 1.0)
(s1806 1.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 1.0)
(s1830 1.0)
(s1831 1.0)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 1.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 1.0)
(s1842 1.0)
(s1843 1.0)
(s1844 1.0)
(s1845 1.0)
(s1846 1.0)
(s1847 1.0)
(s1848 1.0)
(s1849 1.0)
(s1850 1.0)
(s1851 1.0)
(s1852 1.0)
(s1853 1.0)
(s1854 1.0)
(s1855 1.0)
(s1856 1.0)
(s1857 1.0)
(s1858 1.0)
(s1859 1.0)
(s1860 1.0)
(s1861 1.0)
(s1862 1.0)
(s1863 1.0)
(s1864 1.0)
(s1865 1.0)
(s1866 1.0)
(s1867 1.0)
(s1868 1.0)
(s1869 1.0)
(s1870 1.0)
(s1871 1.0)
(s1872 1.0)
(s1873 1.0)
(s1874 1.0)
(s1875 1.0)
(s1876 1.0)
(s1877 1.0)
(s1878 1.0)
(s1879 1.0)
(s1880 1.0)
(s1881 1.0)
(s1882 1.0)
(s1883 1.0)
(s1884 1.0)
(s1885 1.0)
(s1886 1.0)
(s1887 1.0)
(s1888 1.0)
(s1889 1.0)
(s1890 1.0)
(s1891 1.0)
(s1892 1.0)
(s1893 1.0)
(s1894 1.0)
(s1895 1.0)
(s1896 1.0)
(s1897 1.0)
(s1898 1.0)
(s1899 1.0)
(s1900 1.0)
(s1901 1.0)
(s1902 1.0)
(s1903 1.0)
(s1904 1.0)
(s1905 1.0)
(s1906 1.0)
(s1907 1.0)
(s1908 1.0)
(s1909 1.0)
(s1910 1.0)
(s1911 1.0)
(s1912 1.0)
(s1913 1.0)
(s1914 1.0)
(s1915 1.0)
(s1916 1.0)
(s1917 1.0)
(s1918 1.0)
(s1919 1.0)
(s1920 1.0)
(s1921 1.0)
(s1922 1.0)
(s1923 1.0)
(s1924 1.0)
(s1925 1.0)
(s1926 1.0)
(s1927 1.0)
(s1928 1.0)
(s1929 1.0)
(s1930 1.0)
(s1931 1.0)
(s1932 1.0)
(s1933 1.0)
(s1934 1.0)
(s1935 1.0)
(s1936 1.0)
(s1937 1.0)
(s1938 1.0)
(s1939 1.0)
(s1940 1.0)
(s1941 1.0)
(s1942 1.0)
(s1943 1.0)
(s1944 1.0)
(s1945 1.0)
(s1946 1.0)
(s1947 1.0)
(s1948 1.0)
(s1949 1.0)
(s1950 1.0)
(s1951 1.0)
(s1952 1.0)
(s1953 1.0)
(s1954 1.0)
(s1955 1.0)
(s1956 1.0)
(s1957 1.0)
(s1958 1.0)
(s1959 1.0)
(s1960 1.0)
(s1961 1.0)
(s1962 1.0)
(s1963 1.0)
(s1964 1.0)
(s1965 1.0)
(s1966 1.0)
(s1967 1.0)
(s1968 1.0)
(s1969 1.0)
(s1970 1.0)
(s1971 1.0)
(s1972 1.0)
(s1973 1.0)
(s1974 1.0)
(s1975 1.0)
(s1976 1.0)
(s1977 1.0)
(s1978 1.0)
(s1979 1.0)
(s1980 1.0)
(s1981 1.0)
(s1982 1.0)
(s1983 1.0)
(s1984 1.0)
(s1985 1.0)
(s1986 1.0)
(s1987 1.0)
(s1988 1.0)
(s1989 1.0)
(s1990 1.0)
(s1991 1.0)
(s1992 1.0)
(s1993 1.0)
(s1994 1.0)
(s1995 1.0)
(s1996 1.0)
(s1997 1.0)
(s1998 1.0)
(s1999 1.0)
(s2000 1.0)
(s2001 1.0)
(s2002 1.0)
(s2003 1.0)
(s2004 1.0)
(s2005 1.0)
(s2006 1.0)
(s2007 1.0)
(s2008 1.0)
(s2009 1.0)
(s2010 1.0)
(s2011 1.0)
(s2012 1.0)
(s2013 1.0)
(s2014 1.0)
(s2015 1.0)
(s2016 1.0)
(s2017 1.0)
(s2018 1.0)
(s2019 1.0)
(s2020 1.0)
(s2021 1.0)
(s2022 1.0)
(s2023 1.0)
(s2024 1.0)
(s2025 1.0)
(s2026 1.0)
(s2027 1.0)
(s2028 1.0)
(s2029 1.0)
(s2030 1.0)
(s2031 1.0)
(s2032 1.0)
(s2033 1.0)
(s2034 1.0)
(s2035 1.0)
(s2036 1.0)
(s2037 1.0)
(s2038 1.0)
(s2039 1.0)
(s2040 1.0)
(s2041 1.0)
(s2042 1.0)
(s2043 1.0)
(s2044 1.0)
(s2045 1.0)
(s2046 1.0)
(s2047 1.0)
(s2048 1.0)
(s2049 1.0)
(s2050 1.0)
(s2051 1.0)
(s2052 1.0)
(s2053 1.0)
(s2054 1.0)
(s2055 1.0)
(s2056 1.0)
(s2057 1.0)
(s2058 1.0)
(s2059 1.0)
(s2060 1.0)
(s2061 1.0)
(s2062 1.0)
(s2063 1.0)
(s2064 1.0)
(s2065 1.0)
(s2066 1.0)
(s2067 1.0)
(s2068 1.0)
(s2069 1.0)
(s2070 1.0)
(s2071 1.0)
(s2072 1.0)
(s2073 1.0)
(s2074 1.0)
(s2075 1.0)
(s2076 1.0)
(s2077 1.0)
(s2078 1.0)
(s2079 1.0)
(s2080 1.0)
(s2081 1.0)
(s2082 1.0)
(s2083 1.0)
(s2084 1.0)
(s2085 1.0)
(s2086 1.0)
(s2087 1.0)
(s2088 1.0)
(s2089 1.0)
(s2090 1.0)
(s2091 1.0)
(s2092 1.0)
(s2093 1.0)
(s2094 1.0)
(s2095 1.0)
(s2096 1.0)
(s2097 1.0)
(s2098 1.0)
(s2099 1.0)
(s2100 1.0)
(s2101 1.0)
(s2102 1.0)
(s2103 1.0)
(s2104 1.0)
(s2105 1.0)
(s2106 1.0)
(s2107 1.0)
(s2108 1.0)
(s2109 1.0)
(s2110 1.0)
(s2111 1.0)
(s2112 1.0)
(s2113 1.0)
(s2114 1.0)
(s2115 1.0)
(s2116 1.0)
(s2117 1.0)
(s2118 1.0)
(s2119 1.0)
(s2120 1.0)
(s2121 1.0)
(s2122 1.0)
(s2123 1.0)
(s2124 1.0)
(s2125 1.0)
(s2126 1.0)
(s2127 1.0)
(s2128 1.0)
(s2129 1.0)
(s2130 1.0)
(s2131 1.0)
(s2132 1.0)
(s2133 1.0)
(s2134 1.0)
(s2135 1.0)
(s2136 1.0)
(s2137 1.0)
(s2138 1.0)
(s2139 1.0)
(s2140 1.0)
(s2141 1.0)
(s2142 1.0)
(s2143 1.0)
(s2144 1.0)
(s2145 1.0)
(s2146 1.0)
(s2147 1.0)
(s2148 1.0)
(s2149 1.0)
(s2150 1.0)
(s2151 1.0)
(s2152 1.0)
(s2153 1.0)
(s2154 1.0)
(s2155 1.0)
(s2156 1.0)
(s2157 1.0)
(s2158 1.0)
(s2159 1.0)
(s2160 1.0)
(s2161 1.0)
(s2162 1.0)
(s2163 1.0)
(s2164 1.0)
(s2165 1.0)
(s2166 1.0)
(s2167 1.0)
(s2168 1.0)
(s2169 1.0)
(s2170 1.0)
(s2171 1.0)
(s2172 1.0)
(s2173 1.0)
(s2174 1.0)
(s2175 1.0)
(s2176 1.0)
(s2177 1.0)
(s2178 1.0)
(s2179 1.0)
(s2180 1.0)
(s2181 1.0)
(s2182 1.0)
(s2183 1.0)
(s2184 1.0)
(s2185 1.0)
(s2186 1.0)
(s2187 1.0)
(s2188 1.0)
(s2189 1.0)
(s2190 1.0)
(s2191 1.0)
(s2192 1.0)
(s2193 1.0)
(s2194 1.0)
(s2195 1.0)
(s2196 1.0)
(s2197 1.0)
(s2198 1.0)
(s2199 1.0)
(s2200 1.0)
(s2201 1.0)
(s2202 1.0)
(s2203 1.0)
(s2204 1.0)
(s2205 1.0)
(s2206 1.0)
(s2207 1.0)
(s2208 1.0)
(s2209 1.0)
(s2210 1.0)
(s2211 1.0)
(s2212 1.0)
(s2213 1.0)
(s2214 1.0)
(s2215 1.0)
(s2216 1.0)
(s2217 1.0)
(s2218 1.0)
(s2219 1.0)
(s2220 1.0)
(s2221 1.0)
(s2222 1.0)
(s2223 1.0)
(s2224 1.0)
(s2225 1.0)
(s2226 1.0)
(s2227 1.0)
(s2228 1.0)
(s2229 1.0)
(s2230 1.0)
(s2231 1.0)
(s2232 1.0)
(s2233 1.0)
(s2234 1.0)
(s2235 1.0)
(s2236 1.0)
(s2237 1.0)
(s2238 1.0)
(s2239 1.0)
(s2240 1.0)
(s2241 1.0)
(s2242 1.0)
(s2243 1.0)
(s2244 1.0)
(s2245 1.0)
(s2246 1.0)
(s2247 1.0)
(s2248 1.0)
(s2249 1.0)
(s2250 1.0)
(s2251 1.0)
(s2252 1.0)
(s2253 1.0)
(s2254 1.0)
(s2255 1.0)
(s2256 1.0)
(s2257 1.0)
(s2258 1.0)
(s2259 1.0)
(s2260 1.0)
(s2261 1.0)
(s2262 1.0)
(s2263 1.0)
(s2264 1.0)
(s2265 1.0)
(s2266 1.0)
(s2267 1.0)
(s2268 1.0)
(s2269 1.0)
(s2270 1.0)
(s2271 1.0)
(s2272 1.0)
(s2273 1.0)
(s2274 1.0)
(s2275 1.0)
(s2276 1.0)
(s2277 1.0)
(s2278 1.0)
(s2279 1.0)
(s2280 1.0)
(s2281 1.0)
(s2282 1.0)
(s2283 1.0)
(s2284 1.0)
(s2285 1.0)
(s2286 1.0)
(s2287 1.0)
(s2288 1.0)
(s2289 1.0)
(s2290 1.0)
(s2291 1.0)
(s2292 1.0)
(s2293 1.0)
(s2294 1.0)
(s2295 1.0)
(s2296 1.0)
(s2297 1.0)
(s2298 1.0)
(s2299 1.0)
(s2300 1.0)
(s2301 1.0)
(s2302 1.0)
(s2303 1.0)
(s2304 1.0)
(s2305 1.0)
(s2306 1.0)
(s2307 1.0)
(s2308 1.0)
(s2309 1.0)
(s2310 1.0)
(s2311 1.0)
(s2312 1.0)
(s2313 1.0)
(s2314 1.0)
(s2315 1.0)
(s2316 1.0)
(s2317 1.0)
(s2318 1.0)
(s2319 1.0)
(s2320 1.0)
(s2321 1.0)
(s2322 1.0)
(s2323 1.0)
(s2324 1.0)
(s2325 1.0)
(s2326 1.0)
(s2327 1.0)
(s2328 1.0)
(s2329 1.0)
(s2330 1.0)
(s2331 1.0)
(s2332 1.0)
(s2333 1.0)
(s2334 1.0)
(s2335 1.0)
(s2336 1.0)
(s2337 1.0)
(s2338 1.0)
(s2339 1.0)
(s2340 1.0)
(s2341 1.0)
(s2342 1.0)
(s2343 1.0)
(s2344 1.0)
(s2345 1.0)
(s2346 1.0)
(s2347 1.0)
(s2348 1.0)
(s2349 1.0)
(s2350 1.0)
(s2351 1.0)
(s2352 1.0)
(s2353 1.0)
(s2354 1.0)
(s2355 1.0)
(s2356 1.0)
(s2357 1.0)
(s2358 1.0)
(s2359 1.0)
(s2360 1.0)
(s2361 1.0)
(s2362 1.0)
(s2363 1.0)
(s2364 1.0)
(s2365 1.0)
(s2366 1.0)
(s2367 1.0)
(s2368 1.0)
(s2369 1.0)
(s2370 1.0)
(s2371 1.0)
(s2372 1.0)
(s2373 1.0)
(s2374 1.0)
(s2375 1.0)
(s2376 1.0)
(s2377 1.0)
(s2378 1.0)
(s2379 1.0)
(s2380 1.0)
(s2381 1.0)
(s2382 1.0)
(s2383 1.0)
(s2384 1.0)
(s2385 1.0)
(s2386 1.0)
(s2387 1.0)
(s2388 1.0)
(s2389 1.0)
(s2390 1.0)
(s2391 1.0)
(s2392 1.0)
(s2393 1.0)
(s2394 1.0)
(s2395 1.0)
(s2396 1.0)
(s2397 1.0)
(s2398 1.0)
(s2399 1.0)
(s2400 1.0)
(s2401 1.0)
(s2402 1.0)
(s2403 1.0)
(s2404 1.0)
(s2405 1.0)
(s2406 1.0)
(s2407 1.0)
(s2408 1.0)
(s2409 1.0)
(s2410 1.0)
(s2411 1.0)
(s2412 1.0)
(s2413 1.0)
(s2414 1.0)
(s2415 1.0)
(s2416 1.0)
(s2417 1.0)
(s2418 1.0)
(s2419 1.0)
(s2420 1.0)
(s2421 1.0)
(s2422 1.0)
(s2423 1.0)
(s2424 1.0)
(s2425 1.0)
(s2426 1.0)
(s2427 1.0)
(s2428 1.0)
(s2429 1.0)
(s2430 1.0)
(s2431 1.0)
(s2432 1.0)
(s2433 1.0)
(s2434 1.0)
(s2435 1.0)
(s2436 1.0)
(s2437 1.0)
(s2438 1.0)
(s2439 1.0)
(s2440 1.0)
(s2441 1.0)
(s2442 1.0)
(s2443 1.0)
(s2444 1.0)
(s2445 1.0)
(s2446 1.0)
(s2447 1.0)
(s2448 1.0)
(s2449 1.0)
(s2450 1.0)
(s2451 1.0)
(s2452 1.0)
(s2453 1.0)
(s2454 1.0)
(s2455 1.0)
(s2456 1.0)
(s2457 1.0)
(s2458 1.0)
(s2459 1.0)
(s2460 1.0)
(s2461 1.0)
(s2462 1.0)
(s2463 1.0)
(s2464 1.0)
(s2465 1.0)
(s2466 1.0)
(s2467 1.0)
(s2468 1.0)
(s2469 1.0)
(s2470 1.0)
(s2471 1.0)
(s2472 1.0)
(s2473 1.0)
(s2474 1.0)
(s2475 1.0)
(s2476 1.0)
(s2477 1.0)
(s2478 1.0)
(s2479 1.0)
(s2480 1.0)
(s2481 1.0)
(s2482 1.0)
(s2483 1.0)
(s2484 1.0)
(s2485 1.0)
(s2486 1.0)
(s2487 1.0)
(s2488 1.0)
(s2489 1.0)
(s2490 1.0)
(s2491 1.0)
(s2492 1.0)
(s2493 1.0)
(s2494 1.0)
(s2495 1.0)
(s2496 1.0)
(s2497 1.0)
(s2498 1.0)
(s2499 1.0)
(s2500 1.0)
(s2501 1.0)
(s2502 1.0)
(s2503 1.0)
(s2504 1.0)
(s2505 1.0)
(s2506 1.0)
(s2507 1.0)
(s2508 1.0)
(s2509 1.0)
(s2510 1.0)
(s2511 1.0)
(s2512 1.0)
(s2513 1.0)
(s2514 1.0)
(s2515 1.0)
(s2516 1.0)
(s2517 1.0)
(s2518 1.0)
(s2519 1.0)
(s2520 1.0)
(s2521 1.0)
(s2522 1.0)
(s2523 1.0)
(s2524 1.0)
(s2525 1.0)
(s2526 1.0)
(s2527 1.0)
(s2528 1.0)
(s2529 1.0)
(s2530 1.0)
(s2531 1.0)
(s2532 1.0)
(s2533 1.0)
(s2534 1.0)
(s2535 1.0)
(s2536 1.0)
(s2537 1.0)
(s2538 1.0)
(s2539 1.0)
(s2540 1.0)
(s2541 1.0)
(s2542 1.0)
(s2543 1.0)
(s2544 1.0)
(s2545 1.0)
(s2546 1.0)
(s2547 1.0)
(s2548 1.0)
(s2549 1.0)
(s2550 1.0)
(s2551 1.0)
(s2552 1.0)
(s2553 1.0)
(s2554 1.0)
(s2555 1.0)
(s2556 1.0)
(s2557 1.0)
(s2558 1.0)
(s2559 1.0)
(s2560 1.0)
(s2561 1.0)
(s2562 1.0)
(s2563 1.0)
(s2564 1.0)
(s2565 1.0)
(s2566 1.0)
(s2567 1.0)
(s2568 1.0)
(s2569 1.0)
(s2570 1.0)
(s2571 1.0)
(s2572 1.0)
(s2573 1.0)
(s2574 1.0)
(s2575 1.0)
(s2576 1.0)
(s2577 1.0)
(s2578 1.0)
(s2579 1.0)
(s2580 1.0)
(s2581 1.0)
(s2582 1.0)
(s2583 1.0)
(s2584 1.0)
(s2585 1.0)
(s2586 1.0)
(s2587 1.0)
(s2588 1.0)
(s2589 1.0)
(s2590 1.0)
(s2591 1.0)
(s2592 1.0)
(s2593 1.0)
(s2594 1.0)
(s2595 1.0)
(s2596 1.0)
(s2597 1.0)
(s2598 1.0)
(s2599 1.0)
(s2600 1.0)
(s2601 1.0)
(s2602 1.0)
(s2603 1.0)
(s2604 1.0)
(s2605 1.0)
(s2606 1.0)
(s2607 1.0)
(s2608 1.0)
(s2609 1.0)
(s2610 1.0)
(s2611 1.0)
(s2612 1.0)
(s2613 1.0)
(s2614 1.0)
(s2615 1.0)
(s2616 1.0)
(s2617 1.0)
(s2618 1.0)
(s2619 1.0)
(s2620 1.0)
(s2621 1.0)
(s2622 1.0)
(s2623 1.0)
(s2624 1.0)
(s2625 1.0)
(s2626 1.0)
(s2627 1.0)
(s2628 1.0)
(s2629 1.0)
(s2630 1.0)
(s2631 1.0)
(s2632 1.0)
(s2633 1.0)
(s2634 1.0)
(s2635 1.0)
(s2636 1.0)
(s2637 1.0)
(s2638 1.0)
(s2639 1.0)
(s2640 1.0)
(s2641 1.0)
(s2642 1.0)
(s2643 1.0)
(s2644 1.0)
(s2645 1.0)
(s2646 1.0)
(s2647 1.0)
(s2648 1.0)
(s2649 1.0)
(s2650 1.0)
(s2651 1.0)
(s2652 1.0)
(s2653 1.0)
(s2654 1.0)
(s2655 1.0)
(s2656 1.0)
(s2657 1.0)
(s2658 1.0)
(s2659 1.0)
(s2660 1.0)
(s2661 1.0)
(s2662 1.0)
(s2663 1.0)
(s2664 1.0)
(s2665 1.0)
(s2666 1.0)
(s2667 1.0)
(s2668 1.0)
(s2669 1.0)
(s2670 1.0)
(s2671 1.0)
(s2672 1.0)
(s2673 1.0)
(s2674 1.0)
(s2675 1.0)
(s2676 1.0)
(s2677 1.0)
(s2678 1.0)
(s2679 1.0)
(s2680 1.0)
(s2681 1.0)
(s2682 1.0)
(s2683 1.0)
(s2684 1.0)
(s2685 1.0)
(s2686 1.0)
(s2687 1.0)
(s2688 1.0)
(s2689 1.0)
(s2690 1.0)
(s2691 1.0)
(s2692 1.0)
(s2693 1.0)
(s2694 1.0)
(s2695 1.0)
(s2696 1.0)
(s2697 1.0)
(s2698 1.0)
(s2699 1.0)
(s2700 1.0)
(s2701 1.0)
(s2702 1.0)
(s2703 1.0)
(s2704 1.0)
(s2705 1.0)
(s2706 1.0)
(s2707 1.0)
(s2708 1.0)
(s2709 1.0)
(s2710 1.0)
(s2711 1.0)
(s2712 1.0)
(s2713 1.0)
(s2714 1.0)
(s2715 1.0)
(s2716 1.0)
(s2717 1.0)
(s2718 1.0)
(s2719 1.0)
(s2720 1.0)
(s2721 1.0)
(s2722 1.0)
(s2723 1.0)
(s2724 1.0)
(s2725 1.0)
(s2726 1.0)
(s2727 1.0)
(s2728 1.0)
(s2729 1.0)
(s2730 1.0)
(s2731 1.0)
(s2732 1.0)
(s2733 1.0)
(s2734 1.0)
(s2735 1.0)
(s2736 1.0)
(s2737 1.0)
(s2738 1.0)
(s2739 1.0)
(s2740 1.0)
(s2741 1.0)
(s2742 1.0)
(s2743 1.0)
(s2744 1.0)
(s2745 1.0)
(s2746 1.0)
(s2747 1.0)
(s2748 1.0)
(s2749 1.0)
(s2750 1.0)
(s2751 1.0)
(s2752 1.0)
(s2753 1.0)
(s2754 1.0)
(s2755 1.0)
(s2756 1.0)
(s2757 1.0)
(s2758 1.0)
(s2759 1.0)
(s2760 1.0)
(s2761 1.0)
(s2762 1.0)
(s2763 1.0)
(s2764 1.0)
(s2765 1.0)
(s2766 1.0)
(s2767 1.0)
(s2768 1.0)
(s2769 1.0)
(s2770 1.0)
(s2771 1.0)
(s2772 1.0)
(s2773 1.0)
(s2774 1.0)
(s2775 1.0)
(s2776 1.0)
(s2777 1.0)
(s2778 1.0)
(s2779 1.0)
(s2780 1.0)
(s2781 1.0)
(s2782 1.0)
(s2783 1.0)
(s2784 1.0)
(s2785 1.0)
(s2786 1.0)
(s2787 1.0)
(s2788 1.0)
(s2789 1.0)
(s2790 1.0)
(s2791 1.0)
(s2792 1.0)
(s2793 1.0)
(s2794 1.0)
(s2795 1.0)
(s2796 1.0)
(s2797 1.0)
(s2798 1.0)
(s2799 1.0)
(s2800 1.0)
(s2801 1.0)
(s2802 1.0)
(s2803 1.0)
(s2804 1.0)
(s2805 1.0)
(s2806 1.0)
(s2807 1.0)
(s2808 1.0)
(s2809 1.0)
(s2810 1.0)
(s2811 1.0)
(s2812 1.0)
(s2813 1.0)
(s2814 1.0)
(s2815 1.0)
(s2816 1.0)
(s2817 1.0)
(s2818 1.0)
(s2819 1.0)
(s2820 1.0)
(s2821 1.0)
(s2822 1.0)
(s2823 1.0)
(s2824 1.0)
(s2825 1.0)
(s2826 1.0)
(s2827 1.0)
(s2828 1.0)
(s2829 1.0)
(s2830 1.0)
(s2831 1.0)
(s2832 1.0)
(s2833 1.0)
(s2834 1.0)
(s2835 1.0)
(s2836 1.0)
(s2837 1.0)
(s2838 1.0)
(s2839 1.0)
(s2840 1.0)
(s2841 1.0)
(s2842 1.0)
(s2843 1.0)
(s2844 1.0)
(s2845 1.0)
(s2846 1.0)
(s2847 1.0)
(s2848 1.0)
(s2849 1.0)
(s2850 1.0)
(s2851 1.0)
(s2852 1.0)
(s2853 1.0)
(s2854 1.0)
(s2855 1.0)
(s2856 1.0)
(s2857 1.0)
(s2858 1.0)
(s2859 1.0)
(s2860 1.0)
(s2861 1.0)
(s2862 1.0)
(s2863 1.0)
(s2864 1.0)
(s2865 1.0)
(s2866 1.0)
(s2867 1.0)
(s2868 1.0)
(s2869 1.0)
(s2870 1.0)
(s2871 1.0)
(s2872 1.0)
(s2873 1.0)
(s2874 1.0)
(s2875 1.0)
(s2876 1.0)
(s2877 1.0)
(s2878 1.0)
(s2879 1.0)
(s2880 1.0)
(s2881 1.0)
(s2882 1.0)
(s2883 1.0)
(s2884 1.0)
(s2885 1.0)
(s2886 1.0)
(s2887 1.0)
(s2888 1.0)
(s2889 1.0)
(s2890 1.0)
(s2891 1.0)
(s2892 1.0)
(s2893 1.0)
(s2894 1.0)
(s2895 1.0)
(s2896 1.0)
(s2897 1.0)
(s2898 1.0)
(s2899 1.0)
(s2900 1.0)
(s2901 1.0)
(s2902 1.0)
(s2903 1.0)
(s2904 1.0)
(s2905 1.0)
(s2906 1.0)
(s2907 1.0)
(s2908 1.0)
(s2909 1.0)
(s2910 1.0)
(s2911 1.0)
(s2912 1.0)
(s2913 1.0)
(s2914 1.0)
(s2915 1.0)
(s2916 1.0)
(s2917 1.0)
(s2918 1.0)
(s2919 1.0)
(s2920 1.0)
(s2921 1.0)
(s2922 1.0)
(s2923 1.0)
(s2924 1.0)
(s2925 1.0)
(s2926 1.0)
(s2927 1.0)
(s2928 1.0)
(s2929 1.0)
(s2930 1.0)
(s2931 1.0)
(s2932 1.0)
(s2933 1.0)
(s2934 1.0)
(s2935 1.0)
(s2936 1.0)
(s2937 1.0)
(s2938 1.0)
(s2939 1.0)timeout

(s2940 1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3902/7806 variables, and 0 constraints, problems are : Problem set: 0 solved, 3902 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3903 constraints, PredecessorRefiner: 3902/3902 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3902 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3902/7806 variables, and 0 constraints, problems are : Problem set: 0 solved, 3902 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/3903 constraints, PredecessorRefiner: 0/3902 constraints, Known Traps: 0/0 constraints]
After SMT, in 61462ms problems are : Problem set: 0 solved, 3902 unsolved
Search for dead transitions found 0 dead transitions in 61493ms
Finished structural reductions in LTL mode , in 1 iterations and 66153 ms. Remains : 3903/3903 places, 3903/3903 transitions.
Computed a total of 1199 stabilizing places and 1199 stable transitions
Computed a total of 1199 stabilizing places and 1199 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9 resets) in 951 ms. (42 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 122950 steps, run timeout after 3002 ms. (steps per millisecond=40 ) properties seen :0 out of 3
Probabilistic random walk after 122950 steps, saw 113553 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 22:07:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 144/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3755/3903 variables, 397/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3903 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3903/7806 variables, 3903/4304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7806 variables, 0/4304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7806 variables, 0/4304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7806/7806 variables, and 4304 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2102 ms.
Refiners :[Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 3903/3903 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 144/148 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3755/3903 variables, 397/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 22:07:48] [INFO ] Deduced a trap composed of 20 places in 475 ms of which 9 ms to minimize.
[2024-06-01 22:07:48] [INFO ] Deduced a trap composed of 44 places in 469 ms of which 8 ms to minimize.
[2024-06-01 22:07:49] [INFO ] Deduced a trap composed of 50 places in 484 ms of which 9 ms to minimize.
[2024-06-01 22:07:49] [INFO ] Deduced a trap composed of 36 places in 452 ms of which 9 ms to minimize.
[2024-06-01 22:07:50] [INFO ] Deduced a trap composed of 17 places in 462 ms of which 8 ms to minimize.
[2024-06-01 22:07:51] [INFO ] Deduced a trap composed of 35 places in 448 ms of which 8 ms to minimize.
[2024-06-01 22:07:51] [INFO ] Deduced a trap composed of 22 places in 445 ms of which 8 ms to minimize.
[2024-06-01 22:07:51] [INFO ] Deduced a trap composed of 37 places in 425 ms of which 8 ms to minimize.
[2024-06-01 22:07:52] [INFO ] Deduced a trap composed of 43 places in 427 ms of which 8 ms to minimize.
SMT process timed out in 7198ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3903/3903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1096 transitions
Trivial Post-agglo rules discarded 1096 transitions
Performed 1096 trivial Post agglomeration. Transition count delta: 1096
Iterating post reduction 0 with 1096 rules applied. Total rules applied 1096 place count 3903 transition count 2807
Reduce places removed 1096 places and 0 transitions.
Iterating post reduction 1 with 1096 rules applied. Total rules applied 2192 place count 2807 transition count 2807
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2192 place count 2807 transition count 2008
Deduced a syphon composed of 799 places in 5 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 3790 place count 2008 transition count 2008
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 0 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 2 with 1802 rules applied. Total rules applied 5592 place count 1107 transition count 1107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5593 place count 1107 transition count 1106
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5595 place count 1106 transition count 1105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5797 place count 1005 transition count 1205
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5999 place count 904 transition count 1305
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 6193 place count 807 transition count 1402
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6194 place count 807 transition count 1401
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6195 place count 806 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 6196 place count 805 transition count 1400
Applied a total of 6196 rules in 634 ms. Remains 805 /3903 variables (removed 3098) and now considering 1400/3903 (removed 2503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 634 ms. Remains : 805/3903 places, 1400/3903 transitions.
RANDOM walk for 40000 steps (12 resets) in 1107 ms. (36 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 349 ms. (114 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 150530 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 3
Probabilistic random walk after 150530 steps, saw 95590 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
// Phase 1: matrix 1400 rows 805 cols
[2024-06-01 22:07:56] [INFO ] Computed 400 invariants in 9 ms
[2024-06-01 22:07:56] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 37/50 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 127/177 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 173/350 variables, 64/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 32/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 154/504 variables, 56/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 28/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 129/633 variables, 50/311 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/633 variables, 25/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/633 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 113/746 variables, 42/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/746 variables, 21/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/746 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 110/856 variables, 40/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/856 variables, 20/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/856 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 110/966 variables, 40/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/966 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/966 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 110/1076 variables, 40/559 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1076 variables, 20/579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1076 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 110/1186 variables, 40/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1186 variables, 20/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1186 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 110/1296 variables, 40/679 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1296 variables, 20/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1296 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 110/1406 variables, 40/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1406 variables, 20/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1406 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 110/1516 variables, 40/799 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1516 variables, 20/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1516 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 108/1624 variables, 40/859 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1624 variables, 20/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1624 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 78/1702 variables, 32/911 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1702 variables, 16/927 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1702 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 36/1738 variables, 16/943 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1738 variables, 8/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1738 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 22/1760 variables, 8/959 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1760 variables, 4/963 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1760 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 22/1782 variables, 8/971 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1782 variables, 4/975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1782 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 22/1804 variables, 8/983 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1804 variables, 4/987 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1804 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 22/1826 variables, 8/995 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1826 variables, 4/999 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1826 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 22/1848 variables, 8/1007 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1848 variables, 4/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1848 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (OVERLAPS) 22/1870 variables, 8/1019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1870 variables, 4/1023 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1870 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 22/1892 variables, 8/1031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1892 variables, 4/1035 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1892 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (OVERLAPS) 22/1914 variables, 8/1043 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1914 variables, 4/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1914 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 22/1936 variables, 8/1055 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1936 variables, 4/1059 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1936 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (OVERLAPS) 22/1958 variables, 8/1067 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1958 variables, 4/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1958 variables, 0/1071 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (OVERLAPS) 22/1980 variables, 8/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1980 variables, 4/1083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1980 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (OVERLAPS) 22/2002 variables, 8/1091 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2002 variables, 4/1095 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2002 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (OVERLAPS) 22/2024 variables, 8/1103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/2024 variables, 4/1107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2024 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (OVERLAPS) 22/2046 variables, 8/1115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/2046 variables, 4/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2046 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (OVERLAPS) 22/2068 variables, 8/1127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/2068 variables, 4/1131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2068 variables, 0/1131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (OVERLAPS) 22/2090 variables, 8/1139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/2090 variables, 4/1143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2090 variables, 0/1143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (OVERLAPS) 22/2112 variables, 8/1151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/2112 variables, 4/1155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2112 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (OVERLAPS) 22/2134 variables, 8/1163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/2134 variables, 4/1167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2134 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 22/2156 variables, 8/1175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/2156 variables, 4/1179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/2156 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (OVERLAPS) 22/2178 variables, 8/1187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/2178 variables, 4/1191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/2178 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (OVERLAPS) 19/2197 variables, 8/1199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/2197 variables, 4/1203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/2197 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (OVERLAPS) 8/2205 variables, 4/1207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/2205 variables, 2/1209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/2205 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (OVERLAPS) 0/2205 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2205/2205 variables, and 1209 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2283 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 805/805 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 37/50 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 127/177 variables, 40/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 173/350 variables, 64/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 32/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 154/504 variables, 56/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 28/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 129/633 variables, 50/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/633 variables, 25/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/633 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 113/746 variables, 42/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/746 variables, 21/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/746 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 110/856 variables, 40/442 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/856 variables, 20/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/856 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 110/966 variables, 40/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/966 variables, 20/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/966 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 110/1076 variables, 40/562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1076 variables, 20/582 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1076 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 110/1186 variables, 40/622 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1186 variables, 20/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1186 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 110/1296 variables, 40/682 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1296 variables, 20/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1296 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 110/1406 variables, 40/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1406 variables, 20/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1406 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 110/1516 variables, 40/802 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1516 variables, 20/822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1516 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 108/1624 variables, 40/862 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1624 variables, 20/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1624 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 78/1702 variables, 32/914 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1702 variables, 16/930 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1702 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 36/1738 variables, 16/946 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1738 variables, 8/954 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1738 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 22/1760 variables, 8/962 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1760 variables, 4/966 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1760 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 22/1782 variables, 8/974 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1782 variables, 4/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1782 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 22/1804 variables, 8/986 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1804 variables, 4/990 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1804 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 22/1826 variables, 8/998 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1826 variables, 4/1002 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1826 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 22/1848 variables, 8/1010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1848 variables, 4/1014 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1848 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 22/1870 variables, 8/1022 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1870 variables, 4/1026 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1870 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (OVERLAPS) 22/1892 variables, 8/1034 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1892 variables, 4/1038 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1892 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (OVERLAPS) 22/1914 variables, 8/1046 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1914 variables, 4/1050 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1914 variables, 0/1050 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (OVERLAPS) 22/1936 variables, 8/1058 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1936 variables, 4/1062 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1936 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (OVERLAPS) 22/1958 variables, 8/1070 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1958 variables, 4/1074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1958 variables, 0/1074 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (OVERLAPS) 22/1980 variables, 8/1082 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1980 variables, 4/1086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1980 variables, 0/1086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (OVERLAPS) 22/2002 variables, 8/1094 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2002 variables, 4/1098 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2002 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (OVERLAPS) 22/2024 variables, 8/1106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/2024 variables, 4/1110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/2024 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 22/2046 variables, 8/1118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/2046 variables, 4/1122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/2046 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (OVERLAPS) 22/2068 variables, 8/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/2068 variables, 4/1134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/2068 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 22/2090 variables, 8/1142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/2090 variables, 4/1146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/2090 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (OVERLAPS) 22/2112 variables, 8/1154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/2112 variables, 4/1158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/2112 variables, 0/1158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 22/2134 variables, 8/1166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/2134 variables, 4/1170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/2134 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (OVERLAPS) 22/2156 variables, 8/1178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/2156 variables, 4/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/2156 variables, 0/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (OVERLAPS) 22/2178 variables, 8/1190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/2178 variables, 4/1194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/2178 variables, 0/1194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (OVERLAPS) 19/2197 variables, 8/1202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/2197 variables, 4/1206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/2197 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (OVERLAPS) 8/2205 variables, 4/1210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/2205 variables, 2/1212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/2205 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (OVERLAPS) 0/2205 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2205/2205 variables, and 1212 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2778 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 805/805 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 5079ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 500 ms.
Support contains 4 out of 805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 805/805 places, 1400/1400 transitions.
Applied a total of 0 rules in 35 ms. Remains 805 /805 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 805/805 places, 1400/1400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 805/805 places, 1400/1400 transitions.
Applied a total of 0 rules in 26 ms. Remains 805 /805 variables (removed 0) and now considering 1400/1400 (removed 0) transitions.
[2024-06-01 22:08:02] [INFO ] Invariant cache hit.
[2024-06-01 22:08:02] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-06-01 22:08:02] [INFO ] Invariant cache hit.
[2024-06-01 22:08:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 22:08:03] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
[2024-06-01 22:08:03] [INFO ] Redundant transitions in 19 ms returned []
Running 1395 sub problems to find dead transitions.
[2024-06-01 22:08:03] [INFO ] Invariant cache hit.
[2024-06-01 22:08:03] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 398/398 constraints. Problems are: Problem set: 0 solved, 1395 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 Real declared 803/2205 variables, and 398 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 398/400 constraints, State Equation: 0/805 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 1395/1395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/803 variables, 398/398 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/803 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 1395 unsolved
At refinement iteration 2 (OVERLAPS) 2/805 variables, 2/400 constraints. Problems are: Problem set: 0 solved, 1395 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 805/2205 variables, and 400 constraints, problems are : Problem set: 0 solved, 1395 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/805 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1395 constraints, Known Traps: 0/0 constraints]
After SMT, in 60510ms problems are : Problem set: 0 solved, 1395 unsolved
Search for dead transitions found 0 dead transitions in 60522ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61957 ms. Remains : 805/805 places, 1400/1400 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 397 edges and 805 vertex of which 4 / 805 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 2791 edges and 803 vertex of which 801 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 394 edges and 799 vertex of which 4 / 799 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 797 transition count 1391
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 393 edges and 795 vertex of which 6 / 795 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 792 transition count 1382
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 391 edges and 789 vertex of which 8 / 789 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 785 transition count 1371
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 387 edges and 781 vertex of which 8 / 781 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 777 transition count 1357
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 383 edges and 773 vertex of which 8 / 773 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 769 transition count 1343
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 379 edges and 765 vertex of which 8 / 765 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 761 transition count 1329
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 375 edges and 757 vertex of which 8 / 757 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 753 transition count 1315
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 371 edges and 749 vertex of which 8 / 749 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 745 transition count 1301
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 367 edges and 741 vertex of which 8 / 741 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 737 transition count 1287
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 363 edges and 733 vertex of which 8 / 733 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 729 transition count 1273
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 359 edges and 725 vertex of which 8 / 725 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 721 transition count 1259
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 355 edges and 717 vertex of which 8 / 717 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 713 transition count 1245
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 351 edges and 709 vertex of which 8 / 709 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 705 transition count 1231
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 347 edges and 701 vertex of which 8 / 701 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 697 transition count 1217
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 343 edges and 693 vertex of which 8 / 693 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 689 transition count 1203
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 339 edges and 685 vertex of which 8 / 685 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 681 transition count 1189
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 335 edges and 677 vertex of which 8 / 677 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 673 transition count 1175
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 331 edges and 669 vertex of which 8 / 669 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 665 transition count 1161
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 327 edges and 661 vertex of which 8 / 661 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 657 transition count 1147
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 323 edges and 653 vertex of which 8 / 653 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 649 transition count 1133
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 319 edges and 645 vertex of which 8 / 645 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 641 transition count 1119
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 315 edges and 637 vertex of which 8 / 637 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 633 transition count 1105
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 311 edges and 629 vertex of which 8 / 629 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 625 transition count 1091
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 307 edges and 621 vertex of which 8 / 621 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 617 transition count 1077
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 303 edges and 613 vertex of which 8 / 613 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 609 transition count 1063
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 299 edges and 605 vertex of which 8 / 605 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 601 transition count 1049
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 295 edges and 597 vertex of which 8 / 597 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 593 transition count 1035
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 291 edges and 589 vertex of which 8 / 589 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 585 transition count 1021
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 287 edges and 581 vertex of which 8 / 581 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 577 transition count 1007
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 283 edges and 573 vertex of which 8 / 573 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 569 transition count 993
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 279 edges and 565 vertex of which 8 / 565 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 561 transition count 979
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 275 edges and 557 vertex of which 8 / 557 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 586 place count 553 transition count 965
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 271 edges and 549 vertex of which 8 / 549 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 605 place count 545 transition count 951
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 267 edges and 541 vertex of which 8 / 541 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 624 place count 537 transition count 937
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 263 edges and 533 vertex of which 8 / 533 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 643 place count 529 transition count 923
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 259 edges and 525 vertex of which 8 / 525 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 662 place count 521 transition count 909
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 253 edges and 518 vertex of which 4 / 518 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 36 with 16 rules applied. Total rules applied 678 place count 516 transition count 897
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 250 edges and 514 vertex of which 2 / 514 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 37 with 9 rules applied. Total rules applied 687 place count 513 transition count 891
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 5 rules applied. Total rules applied 692 place count 512 transition count 887
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 39 with 3 rules applied. Total rules applied 695 place count 510 transition count 886
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 699 place count 510 transition count 882
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 40 with 5 rules applied. Total rules applied 704 place count 510 transition count 877
Applied a total of 704 rules in 162 ms. Remains 510 /805 variables (removed 295) and now considering 877/1400 (removed 523) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 877 rows 510 cols
[2024-06-01 22:09:04] [INFO ] Computed 253 invariants in 4 ms
[2024-06-01 22:09:04] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 22:09:04] [INFO ] [Nat]Absence check using 253 positive place invariants in 27 ms returned sat
[2024-06-01 22:09:04] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-01 22:09:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 22:09:05] [INFO ] After 78ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 22:09:05] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 22:09:05] [INFO ] After 678ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 930 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 446 ms.
Product exploration explored 100000 steps with 20000 reset in 455 ms.
Applying partial POR strategy [false, true, false, false, false, false]
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 3903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3903/3903 places, 3903/3903 transitions.
Performed 1096 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1096 rules applied. Total rules applied 1096 place count 3903 transition count 3903
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 402 Pre rules applied. Total rules applied 1096 place count 3903 transition count 4304
Deduced a syphon composed of 1498 places in 11 ms
Iterating global reduction 1 with 402 rules applied. Total rules applied 1498 place count 3903 transition count 4304
Performed 1198 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2696 places in 7 ms
Iterating global reduction 1 with 1198 rules applied. Total rules applied 2696 place count 3903 transition count 4304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2697 place count 3903 transition count 4303
Renaming transitions due to excessive name length > 1024 char.
Discarding 796 places :
Symmetric choice reduction at 2 with 796 rule applications. Total rules 3493 place count 3107 transition count 3507
Deduced a syphon composed of 1900 places in 7 ms
Iterating global reduction 2 with 796 rules applied. Total rules applied 4289 place count 3107 transition count 3507
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1901 places in 7 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 4290 place count 3107 transition count 3507
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4292 place count 3105 transition count 3505
Deduced a syphon composed of 1899 places in 6 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 4294 place count 3105 transition count 3505
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 2000 places in 8 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4395 place count 3105 transition count 4237
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4496 place count 3004 transition count 4035
Deduced a syphon composed of 1899 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4597 place count 3004 transition count 4035
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -727
Deduced a syphon composed of 2000 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4698 place count 3004 transition count 4762
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 4799 place count 2903 transition count 4560
Deduced a syphon composed of 1899 places in 6 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 4900 place count 2903 transition count 4560
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -729
Deduced a syphon composed of 2000 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 5001 place count 2903 transition count 5289
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 5103 place count 2801 transition count 5085
Deduced a syphon composed of 1898 places in 5 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 5205 place count 2801 transition count 5085
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -692
Deduced a syphon composed of 1994 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 5301 place count 2801 transition count 5777
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 5397 place count 2705 transition count 5585
Deduced a syphon composed of 1898 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 5493 place count 2705 transition count 5585
Deduced a syphon composed of 1898 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 5496 place count 2705 transition count 5582
Deduced a syphon composed of 1898 places in 1 ms
Applied a total of 5496 rules in 3541 ms. Remains 2705 /3903 variables (removed 1198) and now considering 5582/3903 (removed -1679) transitions.
[2024-06-01 22:09:11] [INFO ] Redundant transitions in 197 ms returned []
Running 5581 sub problems to find dead transitions.
// Phase 1: matrix 5582 rows 2705 cols
[2024-06-01 22:09:11] [INFO ] Computed 401 invariants in 72 ms
[2024-06-01 22:09:11] [INFO ] State equation strengthened by 1784 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/8287 variables, and 0 constraints, problems are : Problem set: 0 solved, 5581 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/2705 constraints, ReadFeed: 0/1784 constraints, PredecessorRefiner: 5581/5581 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/8287 variables, and 0 constraints, problems are : Problem set: 0 solved, 5581 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/2705 constraints, ReadFeed: 0/1784 constraints, PredecessorRefiner: 0/5581 constraints, Known Traps: 0/0 constraints]
After SMT, in 87396ms problems are : Problem set: 0 solved, 5581 unsolved
Search for dead transitions found 0 dead transitions in 87442ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2705/3903 places, 5582/3903 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91199 ms. Remains : 2705/3903 places, 5582/3903 transitions.
Support contains 4 out of 3903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3903/3903 places, 3903/3903 transitions.
Applied a total of 0 rules in 365 ms. Remains 3903 /3903 variables (removed 0) and now considering 3903/3903 (removed 0) transitions.
// Phase 1: matrix 3903 rows 3903 cols
[2024-06-01 22:10:38] [INFO ] Computed 401 invariants in 20 ms
[2024-06-01 22:10:39] [INFO ] Implicit Places using invariants in 983 ms returned []
[2024-06-01 22:10:39] [INFO ] Invariant cache hit.
Could not compute solution for formula : ShieldRVt-PT-100B-LTLCardinality-00
FORMULA ShieldRVt-PT-100B-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldRVt-PT-100B-LTLCardinality-08
Could not compute solution for formula : ShieldRVt-PT-100B-LTLCardinality-09
FORMULA ShieldRVt-PT-100B-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldRVt-PT-100B-LTLCardinality-13
FORMULA ShieldRVt-PT-100B-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-100B-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717280832066

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldRVt-PT-100B-LTLCardinality-00
ltl formula formula --ltl=/tmp/1253/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.130 user 0.120 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1253/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1253/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1253/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1253/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 5004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5022 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~159936 transitions
pnml2lts-mc( 2/ 4): ~4987 levels ~20000 states ~290704 transitions
pnml2lts-mc( 2/ 4): ~9901 levels ~40000 states ~396984 transitions
pnml2lts-mc( 2/ 4): ~18576 levels ~80000 states ~586296 transitions
pnml2lts-mc( 2/ 4): ~34862 levels ~160000 states ~989504 transitions
ltl formula name ShieldRVt-PT-100B-LTLCardinality-01
ltl formula formula --ltl=/tmp/1253/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.450 real 0.120 user 0.140 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1253/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1253/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1253/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1253/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5009 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 17
pnml2lts-mc( 0/ 4): unique states count: 17
pnml2lts-mc( 0/ 4): unique transitions count: 21
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 11
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 37
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 37 states 56 transitions, fanout: 1.514
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 740, Transitions per second: 1120
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 109.6 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLCardinality-02
ltl formula formula --ltl=/tmp/1253/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.130 user 0.130 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1253/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1253/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1253/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1253/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 5004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5014 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~118!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 451
pnml2lts-mc( 0/ 4): unique transitions count: 6258
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 461
pnml2lts-mc( 0/ 4): - cum. max stack depth: 461
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 461 states 6281 transitions, fanout: 13.625
pnml2lts-mc( 0/ 4): Total exploration time 0.510 sec (0.500 sec minimum, 0.502 sec on average)
pnml2lts-mc( 0/ 4): States per second: 904, Transitions per second: 12316
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 47.1 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLCardinality-03
ltl formula formula --ltl=/tmp/1253/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.150 user 0.110 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1253/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1253/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1253/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1253/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5004 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.010 sec minimum, 0.015 sec on average)
pnml2lts-mc( 0/ 4): States per second: 200, Transitions per second: 200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 104.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLCardinality-04
ltl formula formula --ltl=/tmp/1253/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.120 user 0.130 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1253/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1253/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1253/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1253/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 0/ 4): There are 5004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5041 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~199!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 766
pnml2lts-mc( 0/ 4): unique transitions count: 23663
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 774
pnml2lts-mc( 0/ 4): - cum. max stack depth: 774
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 774 states 23700 transitions, fanout: 30.620
pnml2lts-mc( 0/ 4): Total exploration time 0.850 sec (0.840 sec minimum, 0.842 sec on average)
pnml2lts-mc( 0/ 4): States per second: 911, Transitions per second: 27882
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.9MB, 37.9 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.9MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLCardinality-05
ltl formula formula --ltl=/tmp/1253/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.100 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1253/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1253/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1253/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1253/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 5004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5027 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~18!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 63
pnml2lts-mc( 0/ 4): unique transitions count: 326
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 76
pnml2lts-mc( 0/ 4): - cum. max stack depth: 76
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 76 states 357 transitions, fanout: 4.697
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.080 sec minimum, 0.087 sec on average)
pnml2lts-mc( 0/ 4): States per second: 844, Transitions per second: 3967
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 61.7 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLCardinality-06
ltl formula formula --ltl=/tmp/1253/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.350 real 0.110 user 0.140 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1253/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1253/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1253/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1253/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 5004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5013 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~74!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 288
pnml2lts-mc( 0/ 4): unique transitions count: 2050
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 297
pnml2lts-mc( 0/ 4): - cum. max stack depth: 297
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 297 states 2072 transitions, fanout: 6.976
pnml2lts-mc( 0/ 4): Total exploration time 0.410 sec (0.410 sec minimum, 0.410 sec on average)
pnml2lts-mc( 0/ 4): States per second: 724, Transitions per second: 5054
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 55.1 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLCardinality-07
ltl formula formula --ltl=/tmp/1253/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.150 user 0.110 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1253/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1253/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1253/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1253/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5010 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~67!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 250
pnml2lts-mc( 0/ 4): unique transitions count: 2259
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 264
pnml2lts-mc( 0/ 4): - cum. max stack depth: 264
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 264 states 2299 transitions, fanout: 8.708
pnml2lts-mc( 0/ 4): Total exploration time 0.280 sec (0.270 sec minimum, 0.278 sec on average)
pnml2lts-mc( 0/ 4): States per second: 943, Transitions per second: 8211
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 50.7 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLCardinality-08
ltl formula formula --ltl=/tmp/1253/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.140 user 0.110 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1253/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1253/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1253/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1253/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 5004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5011 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1252 levels ~10000 states ~313068 transitions
pnml2lts-mc( 0/ 4): ~1750 levels ~20000 states ~490772 transitions
pnml2lts-mc( 0/ 4): ~1750 levels ~40000 states ~587252 transitions
pnml2lts-mc( 0/ 4): ~1750 levels ~80000 states ~807980 transitions
pnml2lts-mc( 0/ 4): ~1750 levels ~160000 states ~1295380 transitions
ltl formula name ShieldRVt-PT-100B-LTLCardinality-09
ltl formula formula --ltl=/tmp/1253/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.430 real 0.140 user 0.140 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1253/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1253/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1253/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1253/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5018 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~142360 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~275788 transitions
pnml2lts-mc( 3/ 4): ~9667 levels ~40000 states ~334292 transitions
pnml2lts-mc( 3/ 4): ~19308 levels ~80000 states ~526752 transitions
pnml2lts-mc( 3/ 4): ~38508 levels ~160000 states ~938200 transitions
ltl formula name ShieldRVt-PT-100B-LTLCardinality-10
ltl formula formula --ltl=/tmp/1253/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.500 real 0.140 user 0.180 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1253/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1253/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1253/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1253/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 5004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5011 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~1284!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 5562
pnml2lts-mc( 0/ 4): unique transitions count: 153063
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 797
pnml2lts-mc( 0/ 4): - claim success count: 5570
pnml2lts-mc( 0/ 4): - cum. max stack depth: 5570
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5570 states 153081 transitions, fanout: 27.483
pnml2lts-mc( 0/ 4): Total exploration time 6.710 sec (6.710 sec minimum, 6.710 sec on average)
pnml2lts-mc( 0/ 4): States per second: 830, Transitions per second: 22814
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 3.9MB, 27.2 B/state, compr.: 0.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.9MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLCardinality-11
ltl formula formula --ltl=/tmp/1253/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.110 user 0.140 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1253/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1253/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1253/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1253/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 5004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5010 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~57!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 212
pnml2lts-mc( 0/ 4): unique transitions count: 1697
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 227
pnml2lts-mc( 0/ 4): - cum. max stack depth: 227
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 227 states 1741 transitions, fanout: 7.670
pnml2lts-mc( 0/ 4): Total exploration time 0.230 sec (0.230 sec minimum, 0.230 sec on average)
pnml2lts-mc( 0/ 4): States per second: 987, Transitions per second: 7570
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 52.5 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLCardinality-12
ltl formula formula --ltl=/tmp/1253/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.410 real 0.130 user 0.140 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1253/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1253/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1253/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1253/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 0/ 4): There are 5004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5064 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~24!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 91
pnml2lts-mc( 0/ 4): unique transitions count: 510
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 100
pnml2lts-mc( 0/ 4): - cum. max stack depth: 100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 100 states 530 transitions, fanout: 5.300
pnml2lts-mc( 0/ 4): Total exploration time 0.110 sec (0.100 sec minimum, 0.107 sec on average)
pnml2lts-mc( 0/ 4): States per second: 909, Transitions per second: 4818
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 62.6 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLCardinality-13
ltl formula formula --ltl=/tmp/1253/ltl_13_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.120 user 0.130 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1253/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1253/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1253/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1253/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 5004 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5021 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2386 levels ~10000 states ~171956 transitions
pnml2lts-mc( 2/ 4): ~4364 levels ~20000 states ~215368 transitions
pnml2lts-mc( 2/ 4): ~8388 levels ~40000 states ~306596 transitions
pnml2lts-mc( 0/ 4): ~19951 levels ~80000 states ~719128 transitions
pnml2lts-mc( 0/ 4): ~39917 levels ~160000 states ~1213564 transitions
ltl formula name ShieldRVt-PT-100B-LTLCardinality-14
ltl formula formula --ltl=/tmp/1253/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.480 real 0.180 user 0.120 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1253/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1253/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1253/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1253/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5017 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~132!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 517
pnml2lts-mc( 0/ 4): unique transitions count: 5849
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 528
pnml2lts-mc( 0/ 4): - cum. max stack depth: 528
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 528 states 5875 transitions, fanout: 11.127
pnml2lts-mc( 0/ 4): Total exploration time 0.540 sec (0.540 sec minimum, 0.540 sec on average)
pnml2lts-mc( 0/ 4): States per second: 978, Transitions per second: 10880
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 48.0 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-100B-LTLCardinality-15
ltl formula formula --ltl=/tmp/1253/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5003 places, 5003 transitions and 11806 arcs
pnml2lts-mc( 0/ 4): Petri net ShieldRVt-PT-100B analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.350 real 0.100 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1253/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1253/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1253/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1253/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 5005 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5004, there are 5006 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~71!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 264
pnml2lts-mc( 0/ 4): unique transitions count: 2790
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 274
pnml2lts-mc( 0/ 4): - cum. max stack depth: 274
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 274 states 2817 transitions, fanout: 10.281
pnml2lts-mc( 0/ 4): Total exploration time 0.290 sec (0.290 sec minimum, 0.290 sec on average)
pnml2lts-mc( 0/ 4): States per second: 945, Transitions per second: 9714
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 51.9 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 5122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVt-PT-100B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683762401051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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