Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r224-tall-174902009800218.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is ShieldRVt-PT-100B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-174902009800218
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.3M May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1749107001165

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 07:03:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-05 07:03:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:03:22] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2025-06-05 07:03:22] [INFO ] Transformed 5003 places.
[2025-06-05 07:03:22] [INFO ] Transformed 5003 transitions.
[2025-06-05 07:03:22] [INFO ] Found NUPN structural information;
[2025-06-05 07:03:23] [INFO ] Parsed PT model containing 5003 places and 5003 transitions and 11806 arcs in 503 ms.
Structural test allowed to assert that 2001 places are NOT stable. Took 34 ms.
RANDOM walk for 40000 steps (9 resets) in 8152 ms. (4 steps per ms) remains 2716/3002 properties
BEST_FIRST walk for 124 steps (8 resets) in 20 ms. (5 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 26 ms. (4 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 18 ms. (6 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 15 ms. (7 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 26 ms. (4 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 15 ms. (7 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 124 steps (8 resets) in 22 ms. (5 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 122 steps (8 resets) in 14 ms. (8 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 122 steps (8 resets) in 17 ms. (6 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 15 ms. (7 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 15 ms. (7 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 121 steps (8 resets) in 12 ms. (9 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 124 steps (8 resets) in 24 ms. (4 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 17 ms. (6 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 121 steps (8 resets) in 12 ms. (9 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 122 steps (8 resets) in 12 ms. (9 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 122 steps (8 resets) in 15 ms. (7 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2716/2716 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2716/2716 properties
// Phase 1: matrix 5003 rows 5003 cols
[2025-06-05 07:03:26] [INFO ] Computed 401 invariants in 59 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2716 variables, 2716/2716 constraints. Problems are: Problem set: 0 solved, 2716 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2716/10006 variables, and 2716 constraints, problems are : Problem set: 0 solved, 2716 unsolved in 5137 ms.
Refiners :[Domain max(s): 2716/5003 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/5003 constraints, PredecessorRefiner: 2716/2716 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2716 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2716 variables, 2716/2716 constraints. Problems are: Problem set: 0 solved, 2716 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2716/10006 variables, and 2716 constraints, problems are : Problem set: 0 solved, 2716 unsolved in 5044 ms.
Refiners :[Domain max(s): 2716/5003 constraints, Positive P Invariants (semi-flows): 0/401 constraints, State Equation: 0/5003 constraints, PredecessorRefiner: 0/2716 constraints, Known Traps: 0/0 constraints]
After SMT, in 11677ms problems are : Problem set: 0 solved, 2716 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2716 out of 5003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 878 transitions
Trivial Post-agglo rules discarded 878 transitions
Performed 878 trivial Post agglomeration. Transition count delta: 878
Iterating post reduction 0 with 878 rules applied. Total rules applied 878 place count 5003 transition count 4125
Reduce places removed 878 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 880 rules applied. Total rules applied 1758 place count 4125 transition count 4123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1759 place count 4124 transition count 4123
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 1759 place count 4124 transition count 4082
Deduced a syphon composed of 41 places in 38 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1841 place count 4083 transition count 4082
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 1901 place count 4023 transition count 4022
Iterating global reduction 3 with 60 rules applied. Total rules applied 1961 place count 4023 transition count 4022
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 1961 place count 4023 transition count 3999
Deduced a syphon composed of 23 places in 27 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 2007 place count 4000 transition count 3999
Performed 814 Post agglomeration using F-continuation condition.Transition count delta: 814
Deduced a syphon composed of 814 places in 23 ms
Reduce places removed 814 places and 0 transitions.
Iterating global reduction 3 with 1628 rules applied. Total rules applied 3635 place count 3186 transition count 3185
Renaming transitions due to excessive name length > 1024 char.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 26 places in 21 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 3687 place count 3160 transition count 3207
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 3688 place count 3160 transition count 3206
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3690 place count 3160 transition count 3204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3692 place count 3158 transition count 3204
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3693 place count 3158 transition count 3203
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3694 place count 3158 transition count 3203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3695 place count 3157 transition count 3202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3696 place count 3156 transition count 3202
Applied a total of 3696 rules in 1332 ms. Remains 3156 /5003 variables (removed 1847) and now considering 3202/5003 (removed 1801) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1343 ms. Remains : 3156/5003 places, 3202/5003 transitions.
RANDOM walk for 758870 steps (158 resets) in 120004 ms. (6 steps per ms) remains 2270/2716 properties
BEST_FIRST walk for 4002 steps (8 resets) in 100 ms. (39 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4002 steps (8 resets) in 97 ms. (40 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (8 resets) in 104 ms. (38 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (9 resets) in 95 ms. (41 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (8 resets) in 100 ms. (39 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (8 resets) in 104 ms. (38 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (8 resets) in 119 ms. (33 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (8 resets) in 103 ms. (38 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (8 resets) in 113 ms. (35 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (8 resets) in 98 ms. (40 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4002 steps (8 resets) in 94 ms. (42 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (8 resets) in 105 ms. (37 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (8 resets) in 99 ms. (40 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (8 resets) in 106 ms. (37 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (8 resets) in 103 ms. (38 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4003 steps (8 resets) in 92 ms. (43 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 2270/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 2270/2270 properties
// Phase 1: matrix 3202 rows 3156 cols
[2025-06-05 07:04:10] [INFO ] Computed 400 invariants in 17 ms
[2025-06-05 07:04:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 (/ 1.0 2.0))
(s2 (/ 1.0 2.0))
(s3 (/ 1.0 2.0))
(s4 (/ 1.0 2.0))
(s5 (/ 1.0 2.0))
(s6 (/ 1.0 2.0))
(s7 (/ 1.0 2.0))
(s8 (/ 1.0 2.0))
(s9 (/ 1.0 2.0))
(s10 (/ 1.0 2.0))
(s12 (/ 1.0 2.0))
(s13 (/ 1.0 2.0))
(s14 (/ 1.0 2.0))
(s15 (/ 1.0 2.0))
(s16 (/ 1.0 2.0))
(s17 (/ 1.0 2.0))
(s19 (/ 1.0 2.0))
(s20 (/ 1.0 2.0))
(s21 (/ 1.0 2.0))
(s22 (/ 1.0 2.0))
(s23 (/ 1.0 2.0))
(s24 (/ 1.0 2.0))
(s25 (/ 1.0 2.0))
(s26 (/ 1.0 2.0))
(s28 (/ 1.0 2.0))
(s29 (/ 1.0 2.0))
(s30 (/ 1.0 2.0))
(s31 (/ 1.0 2.0))
(s32 (/ 1.0 2.0))
(s33 (/ 1.0 2.0))
(s34 (/ 1.0 2.0))
(s35 (/ 1.0 2.0))
(s37 (/ 1.0 2.0))
(s38 (/ 1.0 2.0))
(s39 (/ 1.0 2.0))
(s40 (/ 1.0 2.0))
(s41 (/ 1.0 2.0))
(s42 (/ 1.0 2.0))
(s43 (/ 1.0 2.0))
(s44 (/ 1.0 2.0))
(s46 (/ 1.0 2.0))
(s47 (/ 1.0 2.0))
(s48 (/ 1.0 2.0))
(s49 (/ 1.0 2.0))
(s50 (/ 1.0 2.0))
(s51 (/ 1.0 2.0))
(s53 (/ 1.0 2.0))
(s54 (/ 1.0 2.0))
(s55 (/ 1.0 2.0))
(s56 (/ 1.0 2.0))
(s57 (/ 1.0 2.0))
(s58 (/ 1.0 2.0))
(s59 (/ 1.0 2.0))
(s60 (/ 1.0 2.0))
(s62 (/ 1.0 2.0))
(s63 (/ 1.0 2.0))
(s64 (/ 1.0 2.0))
(s65 (/ 1.0 2.0))
(s66 (/ 1.0 2.0))
(s67 (/ 1.0 2.0))
(s68 (/ 1.0 2.0))
(s69 (/ 1.0 2.0))
(s71 (/ 1.0 2.0))
(s72 (/ 1.0 2.0))
(s73 (/ 1.0 2.0))
(s74 (/ 1.0 2.0))
(s75 (/ 1.0 2.0))
(s76 (/ 1.0 2.0))
(s77 (/ 1.0 2.0))
(s78 (/ 1.0 2.0))
(s80 (/ 1.0 2.0))
(s81 (/ 1.0 2.0))
(s82 (/ 1.0 2.0))
(s83 (/ 1.0 2.0))
(s84 (/ 1.0 2.0))
(s85 (/ 1.0 2.0))
(s87 (/ 1.0 2.0))
(s88 (/ 1.0 2.0))
(s89 (/ 1.0 2.0))
(s90 (/ 1.0 2.0))
(s91 (/ 1.0 2.0))
(s92 (/ 1.0 2.0))
(s93 (/ 1.0 2.0))
(s94 (/ 1.0 2.0))
(s96 (/ 1.0 2.0))
(s97 (/ 1.0 2.0))
(s98 (/ 1.0 2.0))
(s99 (/ 1.0 2.0))
(s100 (/ 1.0 2.0))
(s101 (/ 1.0 2.0))
(s102 (/ 1.0 2.0))
(s103 (/ 1.0 2.0))
(s105 (/ 1.0 2.0))
(s106 (/ 1.0 2.0))
(s107 (/ 1.0 2.0))
(s108 (/ 1.0 2.0))
(s109 (/ 1.0 2.0))
(s110 (/ 1.0 2.0))
(s111 (/ 1.0 2.0))
(s112 (/ 1.0 2.0))
(s114 (/ 1.0 2.0))
(s115 (/ 1.0 2.0))
(s116 (/ 1.0 2.0))
(s117 (/ 1.0 2.0))
(s118 (/ 1.0 2.0))
(s119 (/ 1.0 2.0))
(s121 (/ 1.0 2.0))
(s122 (/ 1.0 2.0))
(s123 (/ 1.0 2.0))
(s124 (/ 1.0 2.0))
(s125 (/ 1.0 2.0))
(s126 (/ 1.0 2.0))
(s127 (/ 1.0 2.0))
(s128 (/ 1.0 2.0))
(s130 (/ 1.0 2.0))
(s131 (/ 1.0 2.0))
(s132 (/ 1.0 2.0))
(s133 (/ 1.0 2.0))
(s134 (/ 1.0 2.0))
(s135 (/ 1.0 2.0))
(s136 (/ 1.0 2.0))
(s137 (/ 1.0 2.0))
(s139 (/ 1.0 2.0))
(s140 (/ 1.0 2.0))
(s141 (/ 1.0 2.0))
(s142 (/ 1.0 2.0))
(s143 (/ 1.0 2.0))
(s144 (/ 1.0 2.0))
(s145 (/ 1.0 2.0))
(s146 (/ 1.0 2.0))
(s148 (/ 1.0 2.0))
(s149 (/ 1.0 2.0))
(s150 (/ 1.0 2.0))
(s151 (/ 1.0 2.0))
(s152 (/ 1.0 2.0))
(s153 (/ 1.0 2.0))
(s155 (/ 1.0 2.0))
(s156 (/ 1.0 2.0))
(s157 (/ 1.0 2.0))
(s158 (/ 1.0 2.0))
(s159 (/ 1.0 2.0))
(s160 (/ 1.0 2.0))
(s161 (/ 1.0 2.0))
(s162 (/ 1.0 2.0))
(s164 (/ 1.0 2.0))
(s165 (/ 1.0 2.0))
(s166 (/ 1.0 2.0))
(s167 (/ 1.0 2.0))
(s168 (/ 1.0 2.0))
(s169 (/ 1.0 2.0))
(s170 (/ 1.0 2.0))
(s171 (/ 1.0 2.0))
(s173 (/ 1.0 2.0))
(s174 (/ 1.0 2.0))
(s175 (/ 1.0 2.0))
(s176 (/ 1.0 2.0))
(s177 (/ 1.0 2.0))
(s178 (/ 1.0 2.0))
(s179 (/ 1.0 2.0))
(s180 (/ 1.0 2.0))
(s182 (/ 1.0 2.0))
(s183 (/ 1.0 2.0))
(s184 (/ 1.0 2.0))
(s185 (/ 1.0 2.0))
(s186 (/ 1.0 2.0))
(s187 (/ 1.0 2.0))
(s189 (/ 1.0 2.0))
(s190 (/ 1.0 2.0))
(s191 (/ 1.0 2.0))
(s192 (/ 1.0 2.0))
(s193 (/ 1.0 2.0))
(s194 (/ 1.0 2.0))
(s195 (/ 1.0 2.0))
(s196 (/ 1.0 2.0))
(s198 (/ 1.0 2.0))
(s199 (/ 1.0 2.0))
(s200 (/ 1.0 2.0))
(s201 (/ 1.0 2.0))
(s202 (/ 1.0 2.0))
(s203 (/ 1.0 2.0))
(s204 (/ 1.0 2.0))
(s205 (/ 1.0 2.0))
(s207 (/ 1.0 2.0))
(s208 (/ 1.0 2.0))
(s209 (/ 1.0 2.0))
(s210 (/ 1.0 2.0))
(s211 (/ 1.0 2.0))
(s212 (/ 1.0 2.0))
(s213 (/ 1.0 2.0))
(s214 (/ 1.0 2.0))
(s216 (/ 1.0 2.0))
(s217 (/ 1.0 2.0))
(s218 (/ 1.0 2.0))
(s219 (/ 1.0 2.0))
(s220 (/ 1.0 2.0))
(s221 (/ 1.0 2.0))
(s223 (/ 1.0 2.0))
(s224 (/ 1.0 2.0))
(s225 (/ 1.0 2.0))
(s226 (/ 1.0 2.0))
(s227 (/ 1.0 2.0))
(s228 (/ 1.0 2.0))
(s229 (/ 1.0 2.0))
(s230 (/ 1.0 2.0))
(s232 (/ 1.0 2.0))
(s233 (/ 1.0 2.0))
(s234 (/ 1.0 2.0))
(s235 (/ 1.0 2.0))
(s236 (/ 1.0 2.0))
(s237 (/ 1.0 2.0))
(s238 (/ 1.0 2.0))
(s239 (/ 1.0 2.0))
(s241 (/ 1.0 2.0))
(s242 (/ 1.0 2.0))
(s243 (/ 1.0 2.0))
(s244 (/ 1.0 2.0))
(s245 (/ 1.0 2.0))
(s246 (/ 1.0 2.0))
(s247 (/ 1.0 2.0))
(s248 (/ 1.0 2.0))
(s250 (/ 1.0 2.0))
(s251 (/ 1.0 2.0))
(s252 (/ 1.0 2.0))
(s253 (/ 1.0 2.0))
(s254 (/ 1.0 2.0))
(s255 (/ 1.0 2.0))
(s257 (/ 1.0 2.0))
(s258 (/ 1.0 2.0))
(s259 (/ 1.0 2.0))
(s260 (/ 1.0 2.0))
(s261 (/ 1.0 2.0))
(s262 (/ 1.0 2.0))
(s263 (/ 1.0 2.0))
(s264 (/ 1.0 2.0))
(s266 (/ 1.0 2.0))
(s267 (/ 1.0 2.0))
(s268 (/ 1.0 2.0))
(s269 (/ 1.0 2.0))
(s270 (/ 1.0 2.0))
(s271 (/ 1.0 2.0))
(s272 (/ 1.0 2.0))
(s273 (/ 1.0 2.0))
(s275 (/ 1.0 2.0))
(s276 (/ 1.0 2.0))
(s277 (/ 1.0 2.0))
(s278 (/ 1.0 2.0))
(s279 (/ 1.0 2.0))
(s280 (/ 1.0 2.0))
(s281 (/ 1.0 2.0))
(s282 (/ 1.0 2.0))
(s284 (/ 1.0 2.0))
(s285 (/ 1.0 2.0))
(s286 (/ 1.0 2.0))
(s287 (/ 1.0 2.0))
(s288 (/ 1.0 2.0))
(s289 (/ 1.0 2.0))
(s291 (/ 1.0 2.0))
(s292 (/ 1.0 2.0))
(s293 (/ 1.0 2.0))
(s294 (/ 1.0 2.0))
(s295 (/ 1.0 2.0))
(s296 (/ 1.0 2.0))
(s297 (/ 1.0 2.0))
(s298 (/ 1.0 2.0))
(s300 (/ 1.0 2.0))
(s301 (/ 1.0 2.0))
(s302 (/ 1.0 2.0))
(s303 (/ 1.0 2.0))
(s304 (/ 1.0 2.0))
(s305 (/ 1.0 2.0))
(s306 (/ 1.0 2.0))
(s307 (/ 1.0 2.0))
(s309 (/ 1.0 2.0))
(s310 (/ 1.0 2.0))
(s311 (/ 1.0 2.0))
(s312 (/ 1.0 2.0))
(s313 (/ 1.0 2.0))
(s314 (/ 1.0 2.0))
(s315 (/ 1.0 2.0))
(s316 (/ 1.0 2.0))
(s318 (/ 1.0 2.0))
(s319 (/ 1.0 2.0))
(s320 (/ 1.0 2.0))
(s321 (/ 1.0 2.0))
(s322 (/ 1.0 2.0))
(s323 (/ 1.0 2.0))
(s325 (/ 1.0 2.0))
(s326 (/ 1.0 2.0))
(s327 (/ 1.0 2.0))
(s328 (/ 1.0 2.0))
(s329 (/ 1.0 2.0))
(s330 (/ 1.0 2.0))
(s331 (/ 1.0 2.0))
(s332 (/ 1.0 2.0))
(s334 (/ 1.0 2.0))
(s335 (/ 1.0 2.0))
(s336 (/ 1.0 2.0))
(s337 (/ 1.0 2.0))
(s338 (/ 1.0 2.0))
(s339 (/ 1.0 2.0))
(s340 (/ 1.0 2.0))
(s341 (/ 1.0 2.0))
(s343 (/ 1.0 2.0))
(s344 (/ 1.0 2.0))
(s345 (/ 1.0 2.0))
(s346 (/ 1.0 2.0))
(s347 (/ 1.0 2.0))
(s348 (/ 1.0 2.0))
(s349 (/ 1.0 2.0))
(s350 (/ 1.0 2.0))
(s352 (/ 1.0 2.0))
(s353 (/ 1.0 2.0))
(s354 (/ 1.0 2.0))
(s355 (/ 1.0 2.0))
(s356 (/ 1.0 2.0))
(s357 (/ 1.0 2.0))
(s359 (/ 1.0 2.0))
(s360 (/ 1.0 2.0))
(s361 (/ 1.0 2.0))
(s362 (/ 1.0 2.0))
(s363 (/ 1.0 2.0))
(s364 (/ 1.0 2.0))
(s365 (/ 1.0 2.0))
(s366 (/ 1.0 2.0))
(s368 (/ 1.0 2.0))
(s369 (/ 1.0 2.0))
(s370 (/ 1.0 2.0))
(s371 (/ 1.0 2.0))
(s372 (/ 1.0 2.0))
(s373 (/ 1.0 2.0))
(s374 (/ 1.0 2.0))
(s375 (/ 1.0 2.0))
(s377 (/ 1.0 2.0))
(s378 (/ 1.0 2.0))
(s379 (/ 1.0 2.0))
(s380 (/ 1.0 2.0))
(s381 (/ 1.0 2.0))
(s382 (/ 1.0 2.0))
(s383 (/ 1.0 2.0))
(s384 (/ 1.0 2.0))
(s386 (/ 1.0 2.0))
(s387 (/ 1.0 2.0))
(s388 (/ 1.0 2.0))
(s389 (/ 1.0 2.0))
(s390 (/ 1.0 2.0))
(s391 (/ 1.0 2.0))
(s393 (/ 1.0 2.0))
(s394 (/ 1.0 2.0))
(s395 (/ 1.0 2.0))
(s396 (/ 1.0 2.0))
(s397 (/ 1.0 2.0))
(s398 (/ 1.0 2.0))
(s399 (/ 1.0 2.0))
(s400 (/ 1.0 2.0))
(s402 (/ 1.0 2.0))
(s403 (/ 1.0 2.0))
(s404 (/ 1.0 2.0))
(s405 (/ 1.0 2.0))
(s406 (/ 1.0 2.0))
(s407 (/ 1.0 2.0))
(s408 (/ 1.0 2.0))
(s409 (/ 1.0 2.0))
(s411 (/ 1.0 2.0))
(s412 (/ 1.0 2.0))
(s413 (/ 1.0 2.0))
(s414 (/ 1.0 2.0))
(s415 (/ 1.0 2.0))
(s416 (/ 1.0 2.0))
(s417 (/ 1.0 2.0))
(s418 (/ 1.0 2.0))
(s420 (/ 1.0 2.0))
(s421 (/ 1.0 2.0))
(s422 (/ 1.0 2.0))
(s423 (/ 1.0 2.0))
(s424 (/ 1.0 2.0))
(s425 (/ 1.0 2.0))
(s427 (/ 1.0 2.0))
(s428 (/ 1.0 2.0))
(s429 (/ 1.0 2.0))
(s430 (/ 1.0 2.0))
(s431 (/ 1.0 2.0))
(s432 (/ 1.0 2.0))
(s433 (/ 1.0 2.0))
(s434 (/ 1.0 2.0))
(s436 (/ 1.0 2.0))
(s437 (/ 1.0 2.0))
(s438 (/ 1.0 2.0))
(s439 (/ 1.0 2.0))
(s440 (/ 1.0 2.0))
(s441 (/ 1.0 2.0))
(s442 (/ 1.0 2.0))
(s443 (/ 1.0 2.0))
(s445 (/ 1.0 2.0))
(s446 (/ 1.0 2.0))
(s447 (/ 1.0 2.0))
(s448 (/ 1.0 2.0))
(s449 (/ 1.0 2.0))
(s450 (/ 1.0 2.0))
(s451 (/ 1.0 2.0))
(s452 (/ 1.0 2.0))
(s454 (/ 1.0 2.0))
(s455 (/ 1.0 2.0))
(s456 (/ 1.0 2.0))
(s457 (/ 1.0 2.0))
(s458 (/ 1.0 2.0))
(s459 (/ 1.0 2.0))
(s461 (/ 1.0 2.0))
(s462 (/ 1.0 2.0))
(s463 (/ 1.0 2.0))
(s464 (/ 1.0 2.0))
(s465 (/ 1.0 2.0))
(s466 (/ 1.0 2.0))
(s467 (/ 1.0 2.0))
(s468 (/ 1.0 2.0))
(s470 (/ 1.0 2.0))
(s471 (/ 1.0 2.0))
(s472 (/ 1.0 2.0))
(s473 (/ 1.0 2.0))
(s474 (/ 1.0 2.0))
(s475 (/ 1.0 2.0))
(s476 (/ 1.0 2.0))
(s477 (/ 1.0 2.0))
(s479 (/ 1.0 2.0))
(s480 (/ 1.0 2.0))
(s481 (/ 1.0 2.0))
(s482 (/ 1.0 2.0))
(s483 (/ 1.0 2.0))
(s484 (/ 1.0 2.0))
(s485 (/ 1.0 2.0))
(s486 (/ 1.0 2.0))
(s488 (/ 1.0 2.0))
(s489 (/ 1.0 2.0))
(s490 (/ 1.0 2.0))
(s491 (/ 1.0 2.0))
(s492 (/ 1.0 2.0))
(s493 (/ 1.0 2.0))
(s495 (/ 1.0 2.0))
(s496 (/ 1.0 2.0))
(s497 (/ 1.0 2.0))
(s498 (/ 1.0 2.0))
(s499 (/ 1.0 2.0))
(s500 (/ 1.0 2.0))
(s501 (/ 1.0 2.0))
(s502 (/ 1.0 2.0))
(s504 (/ 1.0 2.0))
(s505 (/ 1.0 2.0))
(s506 (/ 1.0 2.0))
(s507 (/ 1.0 2.0))
(s508 (/ 1.0 2.0))
(s509 (/ 1.0 2.0))
(s510 (/ 1.0 2.0))
(s511 (/ 1.0 2.0))
(s513 (/ 1.0 2.0))
(s514 (/ 1.0 2.0))
(s515 (/ 1.0 2.0))
(s516 (/ 1.0 2.0))
(s517 (/ 1.0 2.0))
(s518 (/ 1.0 2.0))
(s519 (/ 1.0 2.0))
(s520 (/ 1.0 2.0))
(s522 (/ 1.0 2.0))
(s523 (/ 1.0 2.0))
(s524 (/ 1.0 2.0))
(s525 (/ 1.0 2.0))
(s526 (/ 1.0 2.0))
(s527 (/ 1.0 2.0))
(s529 (/ 1.0 2.0))
(s530 (/ 1.0 2.0))
(s531 (/ 1.0 2.0))
(s532 (/ 1.0 2.0))
(s533 (/ 1.0 2.0))
(s534 (/ 1.0 2.0))
(s535 (/ 1.0 2.0))
(s536 (/ 1.0 2.0))
(s538 (/ 1.0 2.0))
(s539 (/ 1.0 2.0))
(s540 (/ 1.0 2.0))
(s541 (/ 1.0 2.0))
(s542 (/ 1.0 2.0))
(s543 (/ 1.0 2.0))
(s544 (/ 1.0 2.0))
(s545 (/ 1.0 2.0))
(s547 (/ 1.0 2.0))
(s548 (/ 1.0 2.0))
(s549 (/ 1.0 2.0))
(s550 (/ 1.0 2.0))
(s551 (/ 1.0 2.0))
(s552 (/ 1.0 2.0))
(s553 (/ 1.0 2.0))
(s554 (/ 1.0 2.0))
(s556 (/ 1.0 2.0))
(s557 (/ 1.0 2.0))
(s558 (/ 1.0 2.0))
(s559 (/ 1.0 2.0))
(s560 (/ 1.0 2.0))
(s561 (/ 1.0 2.0))
(s563 (/ 1.0 2.0))
(s564 (/ 1.0 2.0))
(s565 (/ 1.0 2.0))
(s566 (/ 1.0 2.0))
(s567 (/ 1.0 2.0))
(s568 (/ 1.0 2.0))
(s569 (/ 1.0 2.0))
(s570 (/ 1.0 2.0))
(s572 (/ 1.0 2.0))
(s573 (/ 1.0 2.0))
(s574 (/ 1.0 2.0))
(s575 (/ 1.0 2.0))
(s576 (/ 1.0 2.0))
(s577 (/ 1.0 2.0))
(s578 (/ 1.0 2.0))
(s579 (/ 1.0 2.0))
(s581 (/ 1.0 2.0))
(s582 (/ 1.0 2.0))
(s583 (/ 1.0 2.0))
(s584 (/ 1.0 2.0))
(s585 (/ 1.0 2.0))
(s586 (/ 1.0 2.0))
(s587 (/ 1.0 2.0))
(s588 (/ 1.0 2.0))
(s590 (/ 1.0 2.0))
(s591 (/ 1.0 2.0))
(s592 (/ 1.0 2.0))
(s593 (/ 1.0 2.0))
(s594 (/ 1.0 2.0))
(s595 (/ 1.0 2.0))
(s597 (/ 1.0 2.0))
(s598 (/ 1.0 2.0))
(s599 (/ 1.0 2.0))
(s600 (/ 1.0 2.0))
(s601 (/ 1.0 2.0))
(s602 (/ 1.0 2.0))
(s603 (/ 1.0 2.0))
(s604 (/ 1.0 2.0))
(s606 (/ 1.0 2.0))
(s607 (/ 1.0 2.0))
(s608 (/ 1.0 2.0))
(s609 (/ 1.0 2.0))
(s610 (/ 1.0 2.0))
(s611 (/ 1.0 2.0))
(s612 (/ 1.0 2.0))
(s613 (/ 1.0 2.0))
(s615 (/ 1.0 2.0))
(s616 (/ 1.0 2.0))
(s617 (/ 1.0 2.0))
(s618 (/ 1.0 2.0))
(s619 (/ 1.0 2.0))
(s620 (/ 1.0 2.0))
(s621 (/ 1.0 2.0))
(s622 (/ 1.0 2.0))
(s624 (/ 1.0 2.0))
(s625 (/ 1.0 2.0))
(s626 (/ 1.0 2.0))
(s627 (/ 1.0 2.0))
(s628 (/ 1.0 2.0))
(s629 (/ 1.0 2.0))
(s631 (/ 1.0 2.0))
(s632 (/ 1.0 2.0))
(s633 (/ 1.0 2.0))
(s634 (/ 1.0 2.0))
(s635 (/ 1.0 2.0))
(s636 (/ 1.0 2.0))
(s637 (/ 1.0 2.0))
(s638 (/ 1.0 2.0))
(s640 (/ 1.0 2.0))
(s641 (/ 1.0 2.0))
(s642 (/ 1.0 2.0))
(s643 (/ 1.0 2.0))
(s644 (/ 1.0 2.0))
(s645 (/ 1.0 2.0))
(s646 (/ 1.0 2.0))
(s647 (/ 1.0 2.0))
(s649 (/ 1.0 2.0))
(s650 (/ 1.0 2.0))
(s651 (/ 1.0 2.0))
(s652 (/ 1.0 2.0))
(s653 (/ 1.0 2.0))
(s654 (/ 1.0 2.0))
(s655 (/ 1.0 2.0))
(s656 (/ 1.0 2.0))
(s658 (/ 1.0 2.0))
(s659 (/ 1.0 2.0))
(s660 (/ 1.0 2.0))
(s661 (/ 1.0 2.0))
(s662 (/ 1.0 2.0))
(s663 (/ 1.0 2.0))
(s665 (/ 1.0 2.0))
(s666 (/ 1.0 2.0))
(s667 (/ 1.0 2.0))
(s668 (/ 1.0 2.0))
(s669 (/ 1.0 2.0))
(s670 (/ 1.0 2.0))
(s671 (/ 1.0 2.0))
(s672 (/ 1.0 2.0))
(s674 (/ 1.0 2.0))
(s675 (/ 1.0 2.0))
(s676 (/ 1.0 2.0))
(s677 (/ 1.0 2.0))
(s678 (/ 1.0 2.0))
(s679 (/ 1.0 2.0))
(s680 (/ 1.0 2.0))
(s681 (/ 1.0 2.0))
(s683 (/ 1.0 2.0))
(s684 (/ 1.0 2.0))
(s685 (/ 1.0 2.0))
(s686 (/ 1.0 2.0))
(s687 (/ 1.0 2.0))
(s688 (/ 1.0 2.0))
(s689 (/ 1.0 2.0))
(s690 (/ 1.0 2.0))
(s692 (/ 1.0 2.0))
(s693 (/ 1.0 2.0))
(s694 (/ 1.0 2.0))
(s695 (/ 1.0 2.0))
(s696 (/ 1.0 2.0))
(s697 (/ 1.0 2.0))
(s699 (/ 1.0 2.0))
(s700 (/ 1.0 2.0))
(s701 (/ 1.0 2.0))
(s702 (/ 1.0 2.0))
(s703 (/ 1.0 2.0))
(s704 (/ 1.0 2.0))
(s705 (/ 1.0 2.0))
(s706 (/ 1.0 2.0))
(s708timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2270/6358 variables, and 0 constraints, problems are : Problem set: 0 solved, 2270 unsolved in 45042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/400 constraints, State Equation: 0/3156 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2270/2270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2270/6358 variables, and 0 constraints, problems are : Problem set: 0 solved, 2270 unsolved in 45037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/400 constraints, State Equation: 0/3156 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/2270 constraints, Known Traps: 0/0 constraints]
After SMT, in 90993ms problems are : Problem set: 0 solved, 2270 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2270 out of 3156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3156/3156 places, 3202/3202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 3156 transition count 3082
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 3036 transition count 3082
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 240 place count 3036 transition count 3021
Deduced a syphon composed of 61 places in 15 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 362 place count 2975 transition count 3021
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 395 place count 2942 transition count 2988
Iterating global reduction 2 with 33 rules applied. Total rules applied 428 place count 2942 transition count 2988
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 428 place count 2942 transition count 2955
Deduced a syphon composed of 33 places in 15 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 494 place count 2909 transition count 2955
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 17 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 676 place count 2818 transition count 2864
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 44 places in 14 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 764 place count 2774 transition count 2906
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 765 place count 2774 transition count 2905
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 768 place count 2774 transition count 2902
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 771 place count 2771 transition count 2902
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 772 place count 2771 transition count 2901
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 776 place count 2771 transition count 2901
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 777 place count 2771 transition count 2900
Applied a total of 777 rules in 497 ms. Remains 2771 /3156 variables (removed 385) and now considering 2900/3202 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 2771/3156 places, 2900/3202 transitions.
RANDOM walk for 806018 steps (206 resets) in 120004 ms. (6 steps per ms) remains 2066/2270 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 150 ms. (26 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 139 ms. (28 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4002 steps (8 resets) in 152 ms. (26 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 158 ms. (25 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 149 ms. (26 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 96 ms. (41 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 201 ms. (19 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 169 ms. (23 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 165 ms. (24 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 189 ms. (21 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 164 ms. (24 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 144 ms. (27 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 162 ms. (24 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 109 ms. (36 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 165 ms. (24 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 132 ms. (30 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 160 ms. (24 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 154 ms. (25 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 104 ms. (38 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 149 ms. (26 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 145 ms. (27 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 145 ms. (27 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 118 ms. (33 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 151 ms. (26 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4002 steps (8 resets) in 135 ms. (29 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 141 ms. (28 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 122 ms. (32 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 157 ms. (25 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 139 ms. (28 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 101 ms. (39 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 152 ms. (26 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 139 ms. (28 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 117 ms. (33 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4003 steps (8 resets) in 143 ms. (27 steps per ms) remains 2066/2066 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 2066/2066 properties
Probabilistic random walk after 1000001 steps, saw 308717 distinct states, run finished after 71351 ms. (steps per millisecond=14 ) properties seen :30
// Phase 1: matrix 2900 rows 2771 cols
[2025-06-05 07:07:25] [INFO ] Computed 400 invariants in 15 ms
[2025-06-05 07:07:25] [INFO ] State equation strengthened by 1 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2036/5671 variables, and 0 constraints, problems are : Problem set: 0 solved, 2036 unsolved in 75043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/400 constraints, State Equation: 0/2771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2036/2036 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2036 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2036 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2036 unsolved
At refinement iteration 1 (OVERLAPS) 333/2369 variables, 279/279 constraints. Problems are: Problem set: 0 solved, 2036 unsolved
[2025-06-05 07:09:41] [INFO ] Deduced a trap composed of 28 places in 979 ms of which 104 ms to minimize.
[2025-06-05 07:09:42] [INFO ] Deduced a trap composed of 34 places in 900 ms of which 13 ms to minimize.
[2025-06-05 07:09:44] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 5 ms to minimize.
[2025-06-05 07:09:44] [INFO ] Deduced a trap composed of 14 places in 264 ms of which 4 ms to minimize.
[2025-06-05 07:09:45] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 5 ms to minimize.
[2025-06-05 07:09:45] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 4 ms to minimize.
[2025-06-05 07:09:48] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 5 ms to minimize.
[2025-06-05 07:09:48] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 5 ms to minimize.
[2025-06-05 07:09:48] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 4 ms to minimize.
[2025-06-05 07:09:49] [INFO ] Deduced a trap composed of 28 places in 235 ms of which 4 ms to minimize.
[2025-06-05 07:09:49] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 5 ms to minimize.
[2025-06-05 07:09:50] [INFO ] Deduced a trap composed of 28 places in 239 ms of which 4 ms to minimize.
[2025-06-05 07:09:50] [INFO ] Deduced a trap composed of 34 places in 259 ms of which 4 ms to minimize.
[2025-06-05 07:09:52] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 5 ms to minimize.
[2025-06-05 07:09:53] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 4 ms to minimize.
[2025-06-05 07:09:54] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 5 ms to minimize.
[2025-06-05 07:09:54] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2369/5671 variables, and 296 constraints, problems are : Problem set: 0 solved, 2036 unsolved in 75075 ms.
Refiners :[Positive P Invariants (semi-flows): 279/400 constraints, State Equation: 0/2771 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/2036 constraints, Known Traps: 17/17 constraints]
After SMT, in 150684ms problems are : Problem set: 0 solved, 2036 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2036 out of 2771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2771/2771 places, 2900/2900 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 2771 transition count 2838
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 2709 transition count 2838
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 124 place count 2709 transition count 2805
Deduced a syphon composed of 33 places in 12 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 190 place count 2676 transition count 2805
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 204 place count 2662 transition count 2791
Iterating global reduction 2 with 14 rules applied. Total rules applied 218 place count 2662 transition count 2791
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 218 place count 2662 transition count 2777
Deduced a syphon composed of 14 places in 12 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 246 place count 2648 transition count 2777
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 17 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 360 place count 2591 transition count 2720
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 25 places in 11 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 410 place count 2566 transition count 2741
Applied a total of 410 rules in 173 ms. Remains 2566 /2771 variables (removed 205) and now considering 2741/2900 (removed 159) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 2566/2771 places, 2741/2900 transitions.
RANDOM walk for 914622 steps (237 resets) in 120004 ms. (7 steps per ms) remains 1980/2036 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (9 resets) in 90 ms. (43 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 94 ms. (42 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 142 ms. (27 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 147 ms. (27 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 145 ms. (27 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 141 ms. (28 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4002 steps (8 resets) in 93 ms. (42 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 130 ms. (30 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 107 ms. (37 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 144 ms. (27 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 166 ms. (23 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 111 ms. (35 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 106 ms. (37 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 137 ms. (29 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4002 steps (8 resets) in 134 ms. (29 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4002 steps (8 resets) in 134 ms. (29 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 117 ms. (33 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 196 ms. (20 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4003 steps (8 resets) in 119 ms. (33 steps per ms) remains 1980/1980 properties
BEST_FIRST walk for 4004 steps (8 resets) in 145 ms. (27 steps per ms) remains 1980/1980 properties
Probabilistic random walk after 1000001 steps, saw 294722 distinct states, run finished after 57191 ms. (steps per millisecond=17 ) properties seen :138
// Phase 1: matrix 2741 rows 2566 cols
[2025-06-05 07:11:25] [INFO ] Computed 400 invariants in 10 ms
[2025-06-05 07:11:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1842 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1842 unsolved
SMT process timed out in 90500ms, After SMT, problems are : Problem set: 0 solved, 1842 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1842 out of 2566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2566/2566 places, 2741/2741 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 2566 transition count 2693
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 2518 transition count 2693
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 96 place count 2518 transition count 2661
Deduced a syphon composed of 32 places in 10 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 160 place count 2486 transition count 2661
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 166 place count 2480 transition count 2655
Iterating global reduction 2 with 6 rules applied. Total rules applied 172 place count 2480 transition count 2655
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 172 place count 2480 transition count 2649
Deduced a syphon composed of 6 places in 10 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 184 place count 2474 transition count 2649
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 10 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 284 place count 2424 transition count 2599
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 24 places in 9 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 332 place count 2400 transition count 2613
Applied a total of 332 rules in 183 ms. Remains 2400 /2566 variables (removed 166) and now considering 2613/2741 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 2400/2566 places, 2613/2741 transitions.
RANDOM walk for 656312 steps (181 resets) in 120004 ms. (5 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4002 steps (8 resets) in 120 ms. (33 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 111 ms. (35 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4003 steps (8 resets) in 176 ms. (22 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 179 ms. (22 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4002 steps (8 resets) in 109 ms. (36 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 139 ms. (28 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4003 steps (8 resets) in 121 ms. (32 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 178 ms. (22 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4002 steps (8 resets) in 96 ms. (41 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4003 steps (8 resets) in 171 ms. (23 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 189 ms. (21 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 138 ms. (28 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4002 steps (8 resets) in 101 ms. (39 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 155 ms. (25 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4003 steps (8 resets) in 150 ms. (26 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4003 steps (8 resets) in 105 ms. (37 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4003 steps (8 resets) in 138 ms. (28 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4003 steps (8 resets) in 105 ms. (37 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 178 ms. (22 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4003 steps (8 resets) in 113 ms. (35 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 185 ms. (21 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4003 steps (8 resets) in 142 ms. (27 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 155 ms. (25 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 165 ms. (24 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 145 ms. (27 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4003 steps (8 resets) in 105 ms. (37 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4003 steps (8 resets) in 132 ms. (30 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 1842/1842 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1842/1842 properties
Probabilistic random walk after 1000001 steps, saw 302236 distinct states, run finished after 66310 ms. (steps per millisecond=15 ) properties seen :184
// Phase 1: matrix 2613 rows 2400 cols
[2025-06-05 07:14:34] [INFO ] Computed 400 invariants in 11 ms
[2025-06-05 07:14:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1658 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
SMT process timed out in 105487ms, After SMT, problems are : Problem set: 0 solved, 1658 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1658 out of 2400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2613/2613 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 2400 transition count 2572
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 2359 transition count 2572
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 82 place count 2359 transition count 2540
Deduced a syphon composed of 32 places in 12 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 146 place count 2327 transition count 2540
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 151 place count 2322 transition count 2535
Iterating global reduction 2 with 5 rules applied. Total rules applied 156 place count 2322 transition count 2535
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 156 place count 2322 transition count 2530
Deduced a syphon composed of 5 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 166 place count 2317 transition count 2530
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 8 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 270 place count 2265 transition count 2478
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 25 places in 8 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 320 place count 2240 transition count 2490
Applied a total of 320 rules in 134 ms. Remains 2240 /2400 variables (removed 160) and now considering 2490/2613 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 2240/2400 places, 2490/2613 transitions.
RANDOM walk for 723405 steps (189 resets) in 120004 ms. (6 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (9 resets) in 135 ms. (29 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4003 steps (8 resets) in 155 ms. (25 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4003 steps (8 resets) in 101 ms. (39 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4003 steps (8 resets) in 174 ms. (22 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 145 ms. (27 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 131 ms. (30 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 171 ms. (23 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4003 steps (8 resets) in 126 ms. (31 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4003 steps (8 resets) in 124 ms. (32 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4003 steps (8 resets) in 111 ms. (35 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4003 steps (8 resets) in 169 ms. (23 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4003 steps (8 resets) in 119 ms. (33 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 141 ms. (28 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4003 steps (8 resets) in 120 ms. (33 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4002 steps (8 resets) in 137 ms. (29 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4003 steps (8 resets) in 123 ms. (32 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4003 steps (8 resets) in 128 ms. (31 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (9 resets) in 93 ms. (42 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4002 steps (8 resets) in 118 ms. (33 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4003 steps (8 resets) in 128 ms. (31 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1658/1658 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 1658/1658 properties
Probabilistic random walk after 1000001 steps, saw 337907 distinct states, run finished after 66242 ms. (steps per millisecond=15 ) properties seen :206
// Phase 1: matrix 2490 rows 2240 cols
[2025-06-05 07:17:58] [INFO ] Computed 400 invariants in 13 ms
[2025-06-05 07:17:58] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1452 unsolved
At refinement iteration 1 (OVERLAPS) 303/1755 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 1452 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 (/ 1.0 16.0))
(s2 (/ 15.0 16.0))
(s3 (/ 1.0 16.0))
(s4 (/ 1.0 16.0))
(s5 (/ 1.0 16.0))
(s6 (/ 1.0 16.0))
(s7 (/ 1.0 16.0))
(s8 (/ 1.0 16.0))
(s9 (/ 9.0 16.0))
(s10 (/ 1.0 16.0))
(s11 0.0)
(s12 (/ 11.0 16.0))
(s13 (/ 1.0 16.0))
(s14 (/ 1.0 16.0))
(s15 (/ 1.0 16.0))
(s16 (/ 1.0 16.0))
(s17 (/ 1.0 16.0))
(s18 0.0)
(s19 (/ 1.0 16.0))
(s20 (/ 1.0 16.0))
(s21 (/ 1.0 16.0))
(s22 (/ 1.0 16.0))
(s23 (/ 1.0 16.0))
(s24 (/ 1.0 16.0))
(s25 (/ 1.0 16.0))
(s26 (/ 1.0 16.0))
(s27 (/ 1.0 2.0))
(s28 (/ 9.0 16.0))
(s29 (/ 1.0 16.0))
(s30 (/ 1.0 16.0))
(s31 (/ 1.0 16.0))
(s32 (/ 1.0 16.0))
(s33 (/ 1.0 16.0))
(s34 (/ 1.0 16.0))
(s35 (/ 1.0 16.0))
(s36 0.0)
(s37 (/ 1.0 16.0))
(s38 (/ 1.0 16.0))
(s39 (/ 1.0 16.0))
(s40 (/ 1.0 16.0))
(s41 (/ 1.0 16.0))
(s42 (/ 1.0 16.0))
(s43 (/ 1.0 16.0))
(s44 (/ 9.0 16.0))
(s45 0.0)
(s46 (/ 1.0 16.0))
(s47 (/ 1.0 16.0))
(s48 (/ 1.0 16.0))
(s49 (/ 1.0 16.0))
(s50 (/ 1.0 16.0))
(s51 (/ 11.0 16.0))
(s52 0.0)
(s53 (/ 1.0 16.0))
(s54 (/ 9.0 16.0))
(s55 (/ 1.0 16.0))
(s56 (/ 1.0 16.0))
(s57 (/ 1.0 16.0))
(s58 (/ 1.0 16.0))
(s59 (/ 1.0 16.0))
(s60 (/ 1.0 16.0))
(s61 0.0)
(s62 (/ 1.0 16.0))
(s63 (/ 1.0 16.0))
(s64 (/ 1.0 16.0))
(s65 (/ 1.0 16.0))
(s66 (/ 1.0 16.0))
(s67 (/ 1.0 16.0))
(s68 (/ 1.0 16.0))
(s69 (/ 1.0 16.0))
(s70 (/ 1.0 2.0))
(s71 (/ 1.0 16.0))
(s72 (/ 1.0 16.0))
(s73 (/ 1.0 16.0))
(s74 (/ 1.0 16.0))
(s75 (/ 1.0 16.0))
(s76 (/ 1.0 16.0))
(s77 (/ 1.0 16.0))
(s78 (/ 1.0 16.0))
(s79 (/ 1.0 2.0))
(s80 (/ 1.0 16.0))
(s81 (/ 1.0 16.0))
(s82 (/ 11.0 16.0))
(s83 (/ 1.0 16.0))
(s84 (/ 1.0 16.0))
(s85 (/ 1.0 16.0))
(s86 0.0)
(s87 (/ 9.0 16.0))
(s88 (/ 1.0 16.0))
(s89 (/ 1.0 16.0))
(s90 (/ 1.0 16.0))
(s91 (/ 1.0 16.0))
(s92 (/ 1.0 16.0))
(s93 (/ 1.0 16.0))
(s94 (/ 1.0 16.0))
(s95 0.0)
(s96 (/ 1.0 16.0))
(s97 (/ 1.0 16.0))
(s98 (/ 1.0 16.0))
(s99 (/ 1.0 16.0))
(s100 (/ 1.0 16.0))
(s101 (/ 9.0 16.0))
(s102 (/ 1.0 16.0))
(s103 (/ 1.0 16.0))
(s104 0.0)
(s105 (/ 1.0 16.0))
(s106 (/ 1.0 16.0))
(s107 (/ 1.0 16.0))
(s108 (/ 1.0 16.0))
(s109 (/ 1.0 16.0))
(s110 (/ 1.0 16.0))
(s111 (/ 1.0 16.0))
(s112 (/ 9.0 16.0))
(s113 0.0)
(s114 (/ 1.0 16.0))
(s115 (/ 1.0 16.0))
(s116 (/ 1.0 16.0))
(s117 (/ 1.0 16.0))
(s118 (/ 1.0 16.0))
(s119 (/ 11.0 16.0))
(s120 0.0)
(s121 (/ 1.0 16.0))
(s122 (/ 1.0 16.0))
(s123 (/ 1.0 16.0))
(s124 (/ 1.0 16.0))
(s125 (/ 1.0 16.0))
(s126 (/ 1.0 16.0))
(s127 (/ 1.0 16.0))
(s128 (/ 9.0 16.0))
(s129 0.0)
(s130 (/ 1.0 16.0))
(s131 (/ 9.0 16.0))
(s132 (/ 1.0 16.0))
(s133 (/ 1.0 16.0))
(s134 (/ 1.0 16.0))
(s135 (/ 1.0 16.0))
(s136 (/ 1.0 16.0))
(s137 (/ 1.0 16.0))
(s138 0.0)
(s139 (/ 1.0 16.0))
(s140 (/ 1.0 16.0))
(s141 (/ 1.0 16.0))
(s142 (/ 1.0 16.0))
(s143 (/ 1.0 16.0))
(s144 (/ 1.0 16.0))
(s145 (/ 9.0 16.0))
(s146 (/ 1.0 16.0))
(s147 0.0)
(s148 (/ 1.0 16.0))
(s149 (/ 1.0 16.0))
(s150 (/ 11.0 16.0))
(s151 (/ 1.0 16.0))
(s152 (/ 1.0 16.0))
(s153 (/ 1.0 16.0))
(s154 0.0)
(s155 (/ 1.0 16.0))
(s156 (/ 1.0 16.0))
(s157 (/ 1.0 16.0))
(s158 (/ 1.0 16.0))
(s159 (/ 1.0 16.0))
(s160 (/ 1.0 16.0))
(s161 (/ 1.0 16.0))
(s162 (/ 9.0 16.0))
(s163 0.0)
(s164 (/ 9.0 16.0))
(s165 (/ 1.0 16.0))
(s166 (/ 1.0 16.0))
(s167 (/ 1.0 16.0))
(s168 (/ 1.0 16.0))
(s169 (/ 1.0 16.0))
(s170 (/ 1.0 16.0))
(s171 (/ 1.0 16.0))
(s172 0.0)
(s173 (/ 1.0 16.0))
(s174 (/ 1.0 16.0))
(s175 (/ 1.0 16.0))
(s176 (/ 1.0 16.0))
(s177 (/ 1.0 16.0))
(s178 (/ 1.0 16.0))
(s179 (/ 1.0 16.0))
(s180 (/ 1.0 16.0))
(s181 (/ 1.0 2.0))
(s182 (/ 1.0 16.0))
(s183 (/ 1.0 16.0))
(s184 (/ 1.0 16.0))
(s185 (/ 1.0 16.0))
(s186 (/ 1.0 16.0))
(s187 (/ 11.0 16.0))
(s188 0.0)
(s189 (/ 1.0 16.0))
(s190 (/ 1.0 16.0))
(s191 (/ 1.0 16.0))
(s192 (/ 1.0 16.0))
(s193 (/ 9.0 16.0))
(s194 (/ 1.0 16.0))
(s195 (/ 1.0 16.0))
(s196 (/ 1.0 16.0))
(s197 0.0)
(s198 (/ 1.0 16.0))
(s199 (/ 1.0 16.0))
(s200 (/ 1.0 16.0))
(s201 (/ 9.0 16.0))
(s202 (/ 1.0 16.0))
(s203 (/ 1.0 16.0))
(s204 (/ 1.0 16.0))
(s205 (/ 1.0 16.0))
(s206 0.0)
(s207 (/ 1.0 16.0))
(s208 (/ 1.0 16.0))
(s209 (/ 1.0 16.0))
(s210 (/ 9.0 16.0))
(s211 (/ 1.0 16.0))
(s212 (/ 1.0 16.0))
(s213 (/ 1.0 16.0))
(s214 (/ 1.0 16.0))
(s215 0.0)
(s216 (/ 1.0 16.0))
(s217 (/ 11.0 16.0))
(s218 (/ 1.0 16.0))
(s219 (/ 1.0 16.0))
(s220 (/ 1.0 16.0))
(s221 (/ 1.0 16.0))
(s222 0.0)
(s223 (/ 1.0 16.0))
(s224 (/ 9.0 16.0))
(s225 (/ 1.0 16.0))
(s226 (/ 1.0 16.0))
(s227 (/ 1.0 16.0))
(s228 (/ 1.0 16.0))
(s229 (/ 1.0 16.0))
(s230 (/ 1.0 16.0))
(s231 0.0)
(s232 (/ 1.0 16.0))
(s233 (/ 1.0 16.0))
(s234 (/ 1.0 16.0))
(s235 (/ 1.0 16.0))
(s236 (/ 1.0 16.0))
(s237 (/ 1.0 16.0))
(s238 (/ 1.0 16.0))
(s239 (/ 9.0 16.0))
(s240 0.0)
(s241 (/ 9.0 16.0))
(s242 (/ 1.0 16.0))
(s243 (/ 1.0 16.0))
(s244 (/ 1.0 16.0))
(s245 (/ 1.0 16.0))
(s246 (/ 1.0 16.0))
(s247 (/ 1.0 16.0))
(s248 (/ 1.0 16.0))
(s249 0.0)
(s250 (/ 11.0 16.0))
(s251 (/ 1.0 16.0))
(s252 (/ 1.0 16.0))
(s253 (/ 1.0 16.0))
(s254 (/ 1.0 16.0))
(s255 (/ 1.0 16.0))
(s256 0.0)
(s257 (/ 1.0 16.0))
(s258 (/ 9.0 16.0))
(s259 (/ 1.0 16.0))
(s260 (/ 1.0 16.0))
(s261 (/ 1.0 16.0))
(s262 (/ 1.0 16.0))
(s263 (/ 1.0 16.0))
(s264 (/ 1.0 16.0))
(s265 0.0)
(s266 (/ 1.0 16.0))
(s267 (/ 1.0 16.0))
(s268 (/ 1.0 16.0))
(s269 (/ 1.0 16.0))
(s270 (/ 1.0 16.0))
(s271 (/ 1.0 16.0))
(s272 (/ 9.0 16.0))
(s273 (/ 1.0 16.0))
(s274 0.0)
(s275 (/ 1.0 16.0))
(s276 (/ 1.0 16.0))
(s277 (/ 1.0 16.0))
(s278 (/ 9.0 16.0))
(s279 (/ 1.0 16.0))
(s280 (/ 1.0 16.0))
(s281 (/ 1.0 16.0))
(s282 (/ 1.0 16.0))
(s283 0.0)
(s284 (/ 1.0 16.0))
(s285 (/ 1.0 16.0))
(s286 (/ 1.0 16.0))
(s287 (/ 1.0 16.0))
(s288 (/ 11.0 16.0))
(s289 (/ 1.0 16.0))
(s290 0.0)
(s291 (/ 1.0 16.0))
(s292 (/ 1.0 16.0))
(s293 (/ 1.0 16.0))
(s294 (/ 9.0 16.0))
(s295 (/ 1.0 16.0))
(s296 (/ 1.0 16.0))
(s297 (/ 1.0 16.0))
(s298 (/ 1.0 16.0))
(s299 0.0)
(s300 (/ 1.0 16.0))
(s301 (/ 1.0 16.0))
(s302 (/ 1.0 16.0))
(s303 (/ 1.0 16.0))
(s304 (/ 1.0 16.0))
(s305 (/ 9.0 16.0))
(s306 (/ 1.0 16.0))
(s307 (/ 1.0 16.0))
(s308 0.0)
(s309 (/ 1.0 16.0))
(s310 (/ 1.0 16.0))
(s311 (/ 1.0 16.0))
(s312 (/ 1.0 16.0))
(s313 (/ 9.0 16.0))
(s314 (/ 1.0 16.0))
(s315 (/ 1.0 16.0))
(s316 (/ 1.0 16.0))
(s317 0.0)
(s318 (/ 1.0 16.0))
(s319 (/ 1.0 16.0))
(s320 (/ 1.0 16.0))
(s321 (/ 1.0 16.0))
(s322 (/ 11.0 16.0))
(s323 (/ 1.0 16.0))
(s324 0.0)
(s325 (/ 1.0 16.0))
(s326 (/ 1.0 16.0))
(s327 (/ 1.0 16.0))
(s328 (/ 9.0 16.0))
(s329 (/ 1.0 16.0))
(s330 (/ 1.0 16.0))
(s331 (/ 1.0 16.0))
(s332 (/ 1.0 16.0))
(s333 0.0)
(s334 (/ 1.0 16.0))
(s335 (/ 9.0 16.0))
(s336 (/ 1.0 16.0))
(s337 (/ 1.0 16.0))
(s338 (/ 1.0 16.0))
(s339 (/ 1.0 16.0))
(s340 (/ 1.0 16.0))
(s341 (/ 1.0 16.0))
(s342 0.0)
(s343 (/ 1.0 16.0))
(s344 (/ 1.0 16.0))
(s345 (/ 1.0 16.0))
(s346 (/ 1.0 16.0))
(s347 (/ 1.0 16.0))
(s348 (/ 1.0 16.0))
(s349 (/ 9.0 16.0))
(s350 (/ 1.0 16.0))
(s351 0.0)
(s352 (/ 1.0 16.0))
(s353 (/ 1.0 16.0))
(s354 (/ 1.0 16.0))
(s355 (/ 11.0 16.0))
(s356 (/ 1.0 16.0))
(s357 (/ 1.0 16.0))
(s358 0.0)
(s359 (/ 1.0 16.0))
(s360 (/ 1.0 16.0))
(s361 (/ 1.0 16.0))
(s362 (/ 1.0 16.0))
(s363 (/ 1.0 16.0))
(s364 (/ 1.0 16.0))
(s365 (/ 1.0 16.0))
(s366 (/ 9.0 16.0))
(s367 0.0)
(s368 (/ 1.0 16.0))
(s369 (/ 1.0 16.0))
(s370 (/ 1.0 16.0))
(s371 (/ 1.0 16.0))
(s372 (/ 1.0 16.0))
(s373 (/ 1.0 16.0))
(s374 (/ 1.0 16.0))
(s375 (/ 1.0 16.0))
(s376 (/ 1.0 2.0))
(s377 (/ 9.0 16.0))
(s378 (/ 1.0 16.0))
(s379 (/ 1.0 16.0))
(s380 (/ 1.0 16.0))
(s381 (/ 1.0 16.0))
(s382 (/ 1.0 16.0))
(s383 (/ 1.0 16.0))
(s384 (/ 1.0 16.0))
(s385 0.0)
(s386 (/ 1.0 16.0))
(s387 (/ 1.0 16.0))
(s388 (/ 1.0 16.0))
(s389 (/ 1.0 16.0))
(s390 (/ 1.0 16.0))
(s391 (/ 11.0 16.0))
(s392 0.0)
(s393 (/ 1.0 16.0))
(s394 (/ 1.0 16.0))
(s395 (/ 1.0 16.0))
(s396 (/ 1.0 16.0))
(s397 (/ 1.0 16.0))
(s398 (/ 9.0 16.0))
(s399 (/ 1.0 16.0))
(s400 (/ 1.0 16.0))
(s401 0.0)
(s402 (/ 1.0 16.0))
(s403 (/ 9.0 16.0))
(s404 (/ 1.0 16.0))
(s405 (/ 1.0 16.0))
(s406 (/ 1.0 16.0))
(s407 (/ 1.0 16.0))
(s408 (/ 1.0 16.0))
(s409 (/ 1.0 16.0))
(s410 0.0)
(s411 (/ 1.0 16.0))
(s412 (/ 1.0 16.0))
(s413 (/ 9.0 16.0))
(s414 (/ 1.0 16.0))
(s415 (/ 1.0 16.0))
(s416 (/ 1.0 16.0))
(s417 (/ 1.0 16.0))
(s418 (/ 1.0 16.0))
(s419 0.0)
(s420 (/ 1.0 16.0))
(s421 (/ 1.0 16.0))
(s422 (/ 11.0 16.0))
(s423 (/ 1.0 16.0))
(s424 (/ 1.0 16.0))
(s425 (/ 1.0 16.0))
(s426 0.0)
(s427 (/ 1.0 16.0))
(s428 (/ 1.0 16.0))
(s429 (/ 1.0 16.0))
(s430 (/ 1.0 16.0))
(s431 (/ 1.0 16.0))
(s432 (/ 1.0 16.0))
(s433 (/ 1.0 16.0))
(s434 (/ 1.0 16.0))
(s435 (/ 1.0 2.0))
(s436 (/ 1.0 16.0))
(s437 (/ 1.0 16.0))
(s438 (/ 1.0 16.0))
(s439 (/ 1.0 16.0))
(s440 (/ 1.0 16.0))
(s441 (/ 9.0 16.0))
(s442 (/ 1.0 16.0))
(s443 (/ 1.0 16.0))
(s444 0.0)
(s445 (/ 9.0 16.0))
(s446 (/ 1.0 16.0))
(s447 (/ 1.0 16.0))
(s448 (/ 1.0 16.0))
(s449 (/ 1.0 16.0))
(s450 (/ 1.0 16.0))
(s451 (/ 1.0 16.0))
(s452 (/ 1.0 16.0))
(s453 0.0)
(s454 (/ 1.0 16.0))
(s455 (/ 1.0 16.0))
(s456 (/ 1.0 16.0))
(s457 (/ 11.0 16.0))
(s458 (/ 1.0 16.0))
(s459 (/ 1.0 16.0))
(s460 0.0)
(s461 (/ 1.0 16.0))
(s462 (/ 1.0 16.0))
(s463 (/ 1.0 16.0))
(s464 (/ 1.0 16.0))
(s465 (/ 1.0 16.0))
(s466 (/ 1.0 16.0))
(s467 (/ 1.0 16.0))
(s468 (/ 9.0 16.0))
(s469 0.0)
(s470 (/ 1.0 16.0))
(s471 (/ 9.0 16.0))
(s472 (/ 1.0 16.0))
(s473 (/ 1.0 16.0))
(s474 (/ 1.0 16.0))
(s475 (/ 1.0 16.0))
(s476 (/ 1.0 16.0))
(s477 (/ 1.0 16.0))
(s478 0.0)
(s479 (/ 1.0 16.0))
(s480 (/ 1.0 16.0))
(s481 (/ 1.0 16.0))
(s482 (/ 1.0 16.0))
(s483 (/ 9.0 16.0))
(s484 (/ 1.0 16.0))
(s485 (/ 1.0 16.0))
(s486 (/ 1.0 16.0))
(s487 0.0)
(s488 (/ 1.0 16.0))
(s489 (/ 1.0 16.0))
(s490 (/ 11.0 16.0))
(s491 (/ 1.0 16.0))
(s492 (/ 1.0 16.0))
(s493 (/ 1.0 16.0))
(s494 0.0)
(s495 (/ 1.0 16.0))
(s496 (/ 1.0 16.0))
(s497 (/ 1.0 16.0))
(s498 (/ 1.0 16.0))
(s499 (/ 1.0 16.0))
(s500 (/ 9.0 16.0))
(s501 (/ 1.0 16.0))
(s502 (/ 1.0 16.0))
(s503 0.0)
(s504 (/ 1.0 16.0))
(s505 (/ 9.0 16.0))
(s506 (/ 1.0 16.0))
(s507 (/ 1.0 16.0))
(s508 (/ 1.0 16.0))
(s509 (/ 1.0 16.0))
(s510 (/ 1.0 16.0))
(s511 (/ 1.0 16.0))
(s512 0.0)
(s513 (/ 1.0 16.0))
(s514 (/ 1.0 16.0))
(s515 (/ 1.0 16.0))
(s516 (/ 9.0 16.0))
(s517 (/ 1.0 16.0))
(s518 (/ 1.0 16.0))
(s519 (/ 1.0 16.0))
(s520 (/ 1.0 16.0))
(s521 0.0)
(s522 (/ 1.0 16.0))
(s523 (/ 1.0 16.0))
(s524 (/ 1.0 16.0))
(s525 (/ 1.0 16.0))
(s526 (/ 11.0 16.0))
(s527 (/ 1.0 16.0))
(s528 0.0)
(s529 (/ 1.0 16.0))
(s530 (/ 1.0 16.0))
(s531 (/ 1.0 16.0))
(s532 (/ 1.0 16.0))
(s533 (/ 1.0 16.0))
(s534 (/ 1.0 16.0))
(s535 (/ 1.0 16.0))
(s536 (/ 9.0 16.0))
(s537 0.0)
(s538 (/ 1.0 16.0))
(s539 (/ 1.0 16.0))
(s540 (/ 1.0 16.0))
(s541 (/ 9.0 16.0))
(s542 (/ 1.0 16.0))
(s543 (/ 1.0 16.0))
(s544 (/ 1.0 16.0))
(s545 (/ 1.0 16.0))
(s546 0.0)
(s547 (/ 1.0 16.0))
(s548 (/ 1.0 16.0))
(s549 (/ 1.0 16.0))
(s550 (/ 9.0 16.0))
(s551 (/ 1.0 16.0))
(s552 (/ 1.0 16.0))
(s553 (/ 1.0 16.0))
(s554 (/ 1.0 16.0))
(s555 0.0)
(s556 (/ 1.0 16.0))
(s557 (/ 1.0 16.0))
(s558 (/ 1.0 16.0))
(s559 (/ 1.0 16.0))
(s560 (/ 1.0 16.0))
(s561 (/ 1.0 16.0))
(s562 (/ 5.0 8.0))
(s563 (/ 1.0 16.0))
(s564 (/ 1.0 16.0))
(s565 (/ 9.0 16.0))
(s566 (/ 1.0 16.0))
(s567 (/ 1.0 16.0))
(s568 (/ 1.0 16.0))
(s569 (/ 1.0 16.0))
(s570 (/ 1.0 16.0))
(s571 0.0)
(s572 (/ 1.0 16.0))
(s573 (/ 1.0 16.0))
(s574 (/ 1.0 16.0))
(s575 (/ 1.0 16.0))
(s576 (/ 9.0 16.0))
(s577 (/ 1.0 16.0))
(s578 (/ 1.0 16.0))
(s579 (/ 1.0 16.0))
(s580 0.0)
(s581 (/ 1.0 16.0))
(s582 (/ 1.0 16.0))
(s583 (/ 1.0 16.0))
(s584 (/ 1.0 16.0))
(s585 (/ 1.0 16.0))
(s586 (/ 1.0 16.0))
(s587 (/ 1.0 16.0))
(s588 (/ 9.0 16.0))
(s589 0.0)
(s590 (/ 1.0 16.0))
(s591 (/ 1.0 16.0))
(s592 (/ 1.0 16.0))
(s593 (/ 1.0 16.0))
(s594 (/ 11.0 16.0))
(s595 (/ 1.0 16.0))
(s596 0.0)
(s597 (/ 1.0 16.0))
(s598 (/ 1.0 16.0))
(s599 (/ 9.0 16.0))
(s600 (/ 1.0 16.0))
(s601 (/ 1.0 16.0))
(s602 (/ 1.0 16.0))
(s603 (/ 1.0 16.0))
(s604 (/ 1.0 16.0))
(s605 0.0)
(s606 (/ 1.0 16.0))
(s607 (/ 9.0 16.0))
(s608 (/ 1.0 16.0))
(s609 (/ 1.0 16.0))
(s610 (/ 1.0 16.0))
(s611 (/ 1.0 16.0))
(s612 (/ 1.0 16.0))
(s613 (/ 1.0 16.0))
(s614 0.0)
(s615 (/ 9.0 16.0))
(s616 (/ 1.0 16.0))
(s617 (/ 1.0 16.0))
(s618 (/ 1.0 16.0))
(s619 (/ 1.0 16.0))
(s620 (/ 1.0 16.0))
(s621 (/ 1.0 16.0))
(s622 (/ 1.0 16.0))
(s623 0.0)
(s624 (/ 1.0 16.0))
(s625 (/ 11.0 16.0))
(s626 (/ 1.0 16.0))
(s627 (/ 1.0 16.0))
(s628 (/ 1.0 16.0))
(s629 (/ 1.0 16.0))
(s630 0.0)
(s631 (/ 1.0 16.0))
(s632 (/ 1.0 16.0))
(s633 (/ 1.0 16.0))
(s634 (/ 1.0 16.0))
(s635 (/ 1.0 16.0))
(s636 (/ 1.0 16.0))
(s637 (/ 1.0 16.0))
(s638 (/ 9.0 16.0))
(s639 0.0)
(s640 (/ 1.0 16.0))
(s641 (/ 1.0 16.0))
(s642 (/ 1.0 16.0))
(s643 (/ 1.0 16.0))
(s644 (/ 1.0 16.0))
(s645 (/ 1.0 16.0))
(s646 (/ 1.0 16.0))
(s647 (/ 1.0 16.0))
(s648 (/ 1.0 2.0))
(s649 (/ 1.0 16.0))
(s650 (/ 1.0 16.0))
(s651 (/ 1.0 16.0))
(s652 (/ 1.0 16.0))
(s653 (/ 1.0 16.0))
(s654 (/ 9.0 16.0))
(s655 (/ 1.0 16.0))
(s656 (/ 1.0 16.0))
(s657 0.0)
(s658 (/ 11.0 16.0))
(s659 (/ 1.0 16.0))
(s660 (/ 1.0 16.0))
(s661 (/ 1.0 16.0))
(s662 (/ 1.0 16.0))
(s663 (/ 1.0 16.0))
(s664 0.0)
(s665 (/ 1.0 16.0))
(s666 (/ 9.0 16.0))
(s667 (/ 1.0 16.0))
(s668 (/ 1.0 16.0))
(s669 (/ 1.0 16.0))
(s670 (/ 1.0 16.0))
(s671 (/ 1.0 16.0))
(s672 (/ 1.0 16.0))
(s673 0.0)
(s674 (/ 1.0 16.0))
(s675 (/ 1.0 16.0))
(s676 (/ 1.0 16.0))
(s677 (/ 1.0 16.0))
(s678 (/ 1.0 16.0))
(s679 (/ 9.0 16.0))
(s680 (/ 1.0 16.0))
(s681 (/ 1.0 16.0))
(s682 0.0)
(s683 (/ 1.0 16.0))
(s684 (/ 1.0 16.0))
(s685 (/ 1.0 16.0))
(s686 (/ 1.0 16.0))
(s687 (/ 9.0 16.0))
(s688 (/ 1.0 16.0))
(s689 (/ 1.0 16.0))
(s690 (/ 1.0 16.0))
(s691 0.0)
(s692 (/ 11.0 16.0))
(s693 (/ 1.0 16.0))
(s694 (/ 1.0 16.0))
(s695 (/ 1.0 16.0))
(s696 (/ 1.0 16.0))
(s697 (/ 1.0 16.0))
(s698 0.0)
(s699 (/ 9.0 16.0))
(s700 (/ 1.0 16.0))
(s701 (/ 1.0 16.0))
(s702 (/ 1.0 16.0))
(s703 (/ 1.0 16.0))
(s704 (/ 1.0 16.0))
(s705 (/ 1.0 16.0))
(s706 (/ 1.0 16.0))
(s707 0.0)
(s708 (/ 1.0 16.0))
(s709 (/ 1.0 16.0))
(s710 (/ 9.0 16.0))
(s711 (/ 1.0 16.0))
(s712 (/ 1.0 16.0))
(s713 (/ 1.0 16.0))
(s714 (/ 1.0 16.0))
(s715 (/ 1.0 16.0))
(s716 0.0)
(s717 (/ 1.0 16.0))
(s718 (/ 1.0 16.0))
(s719 (/ 1.0 16.0))
(s720 (/ 1.0 16.0))
(s721 (/ 1.0 16.0))
(s722 (/ 1.0 16.0))
(s723 (/ 9.0 16.0))
(s724 (/ 1.0 16.0))
(s725 0.0)
(s726 (/ 1.0 16.0))
(s727 (/ 1.0 16.0))
(s728 (/ 1.0 16.0))
(s729 (/ 1.0 16.0))
(s730 (/ 1.0 16.0))
(s731 (/ 11.0 16.0))
(s732 0.0)
(s733 (/ 1.0 16.0))
(s734 (/ 1.0 16.0))
(s735 (/ 1.0 16.0))
(s736 (/ 1.0 16.0))
(s737 (/ 1.0 16.0))
(s738 (/ 1.0 16.0))
(s739 (/ 1.0 16.0))
(s740 (/ 9.0 16.0))
(s741 0.0)
(s742 (/ 1.0 16.0))
(s743 (/ 1.0 16.0))
(s744 (/ 1.0 16.0))
(s745 (/ 1.0 16.0))
(s746 (/ 1.0 16.0))
(s747 (/ 1.0 16.0))
(s748 (/ 9.0 16.0))
(s749 (/ 1.0 16.0))
(s750 0.0)
(s751 (/ 9.0 16.0))
(s752 (/ 1.0 16.0))
(s753 (/ 1.0 16.0))
(s754 (/ 1.0 16.0))
(s755 (/ 1.0 16.0))
(s756 (/ 1.0 16.0))
(s757 (/ 1.0 16.0))
(s758 (/ 1.0 16.0))
(s759 0.0)
(s760 (/ 1.0 16.0))
(s761 (/ 1.0 16.0))
(s762 (/ 1.0 16.0))
(s763 (/ 11.0 16.0))
(s764 (/ 1.0 16.0))
(s765 (/ 1.0 16.0))
(s766 0.0)
(s767 (/ 9.0 16.0))
(s768 (/ 1.0 16.0))
(s769 (/ 1.0 16.0))
(s770 (/ 1.0 16.0))
(s771 (/ 1.0 16.0))
(s772 (/ 1.0 16.0))
(s773 (/ 1.0 16.0))
(s774 (/ 1.0 16.0))
(s775 0.0)
(s776 (/ 9.0 16.0))
(s777 (/ 1.0 16.0))
(s778 (/ 1.0 16.0))
(s779 (/ 1.0 16.0))
(s780 (/ 1.0 16.0))
(s781 (/ 1.0 16.0))
(s782 (/ 1.0 16.0))
(s783 (/ 1.0 16.0))
(s784 0.0)
(s785 (/ 9.0 16.0))
(s786 (/ 1.0 16.0))
(s787 (/ 1.0 16.0))
(s788 (/ 1.0 16.0))
(s789 (/ 1.0 16.0))
(s790 (/ 1.0 16.0))
(s791 (/ 1.0 16.0))
(s792 (/ 1.0 16.0))
(s793 0.0)
(s794 (/ 1.0 16.0))
(s795 (/ 1.0 16.0))
(s796 (/ 11.0 16.0))
(s797 (/ 1.0 16.0))
(s798 (/ 1.0 16.0))
(s799 (/ 1.0 16.0))
(s800 0.0)
(s801 (/ 1.0 16.0))
(s802 (/ 9.0 16.0))
(s803 (/ 1.0 16.0))
(s804 (/ 1.0 16.0))
(s805 (/ 1.0 16.0))
(s806 (/ 1.0 16.0))
(s807 (/ 1.0 16.0))
(s808 (/ 1.0 16.0))
(s809 0.0)
(s810 (/ 1.0 16.0))
(s811 (/ 1.0 16.0))
(s812 (/ 9.0 16.0))
(s813 (/ 1.0 16.0))
(s814 (/ 1.0 16.0))
(s815 (/ 1.0 16.0))
(s816 (/ 1.0 16.0))
(s817 (/ 1.0 16.0))
(s818 0.0)
(s819 (/ 9.0 16.0))
(s820 (/ 1.0 16.0))
(s821 (/ 1.0 16.0))
(s822 (/ 1.0 16.0))
(s823 (/ 1.0 16.0))
(s824 (/ 1.0 16.0))
(s825 (/ 1.0 16.0))
(s826 (/ 1.0 16.0))
(s827 0.0)
(s828 (/ 1.0 16.0))
(s829 (/ 1.0 16.0))
(s830 (/ 1.0 16.0))
(s831 (/ 1.0 16.0))
(s832 (/ 1.0 16.0))
(s833 (/ 1.0 16.0))
(s834 timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1755/4730 variables, and 207 constraints, problems are : Problem set: 0 solved, 1452 unsolved in 120035 ms.
Refiners :[Positive P Invariants (semi-flows): 207/400 constraints, State Equation: 0/2240 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1452/1452 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1452 unsolved
At refinement iteration 1 (OVERLAPS) 303/1755 variables, 207/207 constraints. Problems are: Problem set: 0 solved, 1452 unsolved
[2025-06-05 07:20:30] [INFO ] Deduced a trap composed of 28 places in 569 ms of which 13 ms to minimize.
[2025-06-05 07:20:32] [INFO ] Deduced a trap composed of 24 places in 200 ms of which 4 ms to minimize.
[2025-06-05 07:20:32] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 3 ms to minimize.
[2025-06-05 07:20:32] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 4 ms to minimize.
[2025-06-05 07:20:33] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 4 ms to minimize.
[2025-06-05 07:20:33] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 4 ms to minimize.
[2025-06-05 07:20:34] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 4 ms to minimize.
[2025-06-05 07:20:35] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 4 ms to minimize.
[2025-06-05 07:20:35] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 4 ms to minimize.
[2025-06-05 07:20:36] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 4 ms to minimize.
[2025-06-05 07:20:36] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 3 ms to minimize.
[2025-06-05 07:20:37] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 4 ms to minimize.
[2025-06-05 07:20:38] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 4 ms to minimize.
[2025-06-05 07:20:38] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 4 ms to minimize.
[2025-06-05 07:20:39] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 4 ms to minimize.
[2025-06-05 07:20:40] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 4 ms to minimize.
[2025-06-05 07:20:41] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 8 ms to minimize.
[2025-06-05 07:20:41] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 4 ms to minimize.
[2025-06-05 07:20:41] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 4 ms to minimize.
[2025-06-05 07:20:43] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1755 variables, 20/227 constraints. Problems are: Problem set: 0 solved, 1452 unsolved
[2025-06-05 07:20:44] [INFO ] Deduced a trap composed of 38 places in 566 ms of which 9 ms to minimize.
[2025-06-05 07:20:45] [INFO ] Deduced a trap composed of 40 places in 549 ms of which 9 ms to minimize.
[2025-06-05 07:20:45] [INFO ] Deduced a trap composed of 70 places in 550 ms of which 10 ms to minimize.
[2025-06-05 07:20:46] [INFO ] Deduced a trap composed of 58 places in 551 ms of which 10 ms to minimize.
[2025-06-05 07:20:47] [INFO ] Deduced a trap composed of 40 places in 540 ms of which 9 ms to minimize.
[2025-06-05 07:20:51] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 3 ms to minimize.
[2025-06-05 07:20:51] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 3 ms to minimize.
[2025-06-05 07:20:54] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 4 ms to minimize.
[2025-06-05 07:20:54] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 3 ms to minimize.
[2025-06-05 07:20:55] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 3 ms to minimize.
[2025-06-05 07:20:55] [INFO ] Deduced a trap composed of 60 places in 166 ms of which 4 ms to minimize.
[2025-06-05 07:20:55] [INFO ] Deduced a trap composed of 52 places in 159 ms of which 4 ms to minimize.
[2025-06-05 07:20:55] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 3 ms to minimize.
[2025-06-05 07:20:56] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 4 ms to minimize.
[2025-06-05 07:20:56] [INFO ] Deduced a trap composed of 34 places in 166 ms of which 3 ms to minimize.
[2025-06-05 07:20:57] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 4 ms to minimize.
[2025-06-05 07:20:58] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 4 ms to minimize.
[2025-06-05 07:20:58] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 3 ms to minimize.
[2025-06-05 07:20:58] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 6 ms to minimize.
[2025-06-05 07:20:58] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1755 variables, 20/247 constraints. Problems are: Problem set: 0 solved, 1452 unsolved
[2025-06-05 07:20:59] [INFO ] Deduced a trap composed of 22 places in 545 ms of which 9 ms to minimize.
[2025-06-05 07:21:01] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 3 ms to minimize.
[2025-06-05 07:21:02] [INFO ] Deduced a trap composed of 62 places in 158 ms of which 3 ms to minimize.
[2025-06-05 07:21:03] [INFO ] Deduced a trap composed of 62 places in 155 ms of which 3 ms to minimize.
[2025-06-05 07:21:04] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 3 ms to minimize.
[2025-06-05 07:21:04] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 3 ms to minimize.
[2025-06-05 07:21:04] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 4 ms to minimize.
[2025-06-05 07:21:05] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 3 ms to minimize.
[2025-06-05 07:21:05] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 3 ms to minimize.
[2025-06-05 07:21:05] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 2 ms to minimize.
[2025-06-05 07:21:07] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 3 ms to minimize.
[2025-06-05 07:21:07] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 3 ms to minimize.
[2025-06-05 07:21:07] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 3 ms to minimize.
[2025-06-05 07:21:07] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 3 ms to minimize.
[2025-06-05 07:21:08] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 3 ms to minimize.
[2025-06-05 07:21:08] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 3 ms to minimize.
[2025-06-05 07:21:08] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 3 ms to minimize.
[2025-06-05 07:21:08] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 3 ms to minimize.
[2025-06-05 07:21:12] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 4 ms to minimize.
[2025-06-05 07:21:12] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1755 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 1452 unsolved
[2025-06-05 07:21:18] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 3 ms to minimize.
[2025-06-05 07:21:23] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 4 ms to minimize.
[2025-06-05 07:21:23] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 4 ms to minimize.
[2025-06-05 07:21:24] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 4 ms to minimize.
[2025-06-05 07:21:25] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 4 ms to minimize.
[2025-06-05 07:21:26] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 3 ms to minimize.
[2025-06-05 07:21:26] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 4 ms to minimize.
[2025-06-05 07:21:26] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 4 ms to minimize.
[2025-06-05 07:21:27] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 4 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 4 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 4 ms to minimize.
[2025-06-05 07:21:29] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 4 ms to minimize.
[2025-06-05 07:21:30] [INFO ] Deduced a trap composed of 18 places in 197 ms of which 4 ms to minimize.
[2025-06-05 07:21:30] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 4 ms to minimize.
[2025-06-05 07:21:31] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 3 ms to minimize.
[2025-06-05 07:21:31] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 4 ms to minimize.
[2025-06-05 07:21:31] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 4 ms to minimize.
[2025-06-05 07:21:33] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 4 ms to minimize.
[2025-06-05 07:21:33] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 4 ms to minimize.
[2025-06-05 07:21:34] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1755 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 1452 unsolved
[2025-06-05 07:21:36] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 3 ms to minimize.
[2025-06-05 07:21:37] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2025-06-05 07:21:40] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 4 ms to minimize.
[2025-06-05 07:21:40] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 4 ms to minimize.
[2025-06-05 07:21:41] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 3 ms to minimize.
[2025-06-05 07:21:41] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 3 ms to minimize.
[2025-06-05 07:21:41] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 3 ms to minimize.
[2025-06-05 07:21:41] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 4 ms to minimize.
[2025-06-05 07:21:47] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 3 ms to minimize.
[2025-06-05 07:21:47] [INFO ] Deduced a trap composed of 58 places in 178 ms of which 3 ms to minimize.
[2025-06-05 07:21:47] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 3 ms to minimize.
[2025-06-05 07:21:50] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 3 ms to minimize.
[2025-06-05 07:21:51] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 4 ms to minimize.
[2025-06-05 07:21:51] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 4 ms to minimize.
[2025-06-05 07:21:51] [INFO ] Deduced a trap composed of 34 places in 185 ms of which 3 ms to minimize.
[2025-06-05 07:21:55] [INFO ] Deduced a trap composed of 28 places in 204 ms of which 4 ms to minimize.
[2025-06-05 07:21:56] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 4 ms to minimize.
[2025-06-05 07:21:56] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 4 ms to minimize.
[2025-06-05 07:21:57] [INFO ] Deduced a trap composed of 52 places in 207 ms of which 4 ms to minimize.
[2025-06-05 07:21:57] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1755 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 1452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1755/4730 variables, and 307 constraints, problems are : Problem set: 0 solved, 1452 unsolved in 120039 ms.
Refiners :[Positive P Invariants (semi-flows): 207/400 constraints, State Equation: 0/2240 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1452 constraints, Known Traps: 100/100 constraints]
After SMT, in 240467ms problems are : Problem set: 0 solved, 1452 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1452 out of 2240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2240/2240 places, 2490/2490 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 2240 transition count 2442
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 2192 transition count 2442
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 96 place count 2192 transition count 2407
Deduced a syphon composed of 35 places in 7 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 166 place count 2157 transition count 2407
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 172 place count 2151 transition count 2401
Iterating global reduction 2 with 6 rules applied. Total rules applied 178 place count 2151 transition count 2401
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 178 place count 2151 transition count 2395
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 190 place count 2145 transition count 2395
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 8 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 302 place count 2089 transition count 2339
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 27 places in 6 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 356 place count 2062 transition count 2353
Applied a total of 356 rules in 135 ms. Remains 2062 /2240 variables (removed 178) and now considering 2353/2490 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 2062/2240 places, 2353/2490 transitions.
RANDOM walk for 1240622 steps (315 resets) in 120004 ms. (10 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 78 ms. (50 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 104 ms. (38 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 128 ms. (31 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4002 steps (8 resets) in 118 ms. (33 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 105 ms. (37 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 131 ms. (30 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 126 ms. (31 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 128 ms. (31 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 141 ms. (28 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 100 ms. (39 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 113 ms. (35 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4002 steps (8 resets) in 138 ms. (28 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4002 steps (8 resets) in 133 ms. (29 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 122 ms. (32 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 129 ms. (30 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 146 ms. (27 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 109 ms. (36 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4002 steps (8 resets) in 101 ms. (39 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4002 steps (8 resets) in 113 ms. (35 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 130 ms. (30 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4002 steps (8 resets) in 92 ms. (43 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 107 ms. (37 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 114 ms. (34 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 136 ms. (29 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4003 steps (8 resets) in 112 ms. (35 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 1452/1452 properties
BEST_FIRST walk for 4004 steps (8 resets) in 145 ms. (27 steps per ms) remains 1452/1452 properties
Probabilistic random walk after 1000001 steps, saw 357574 distinct states, run finished after 61116 ms. (steps per millisecond=16 ) properties seen :192
// Phase 1: matrix 2353 rows 2062 cols
[2025-06-05 07:23:31] [INFO ] Computed 400 invariants in 7 ms
[2025-06-05 07:23:31] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
At refinement iteration 1 (OVERLAPS) 266/1526 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1526/4415 variables, and 180 constraints, problems are : Problem set: 0 solved, 1260 unsolved in 135032 ms.
Refiners :[Positive P Invariants (semi-flows): 180/400 constraints, State Equation: 0/2062 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1260/1260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
At refinement iteration 1 (OVERLAPS) 266/1526 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2025-06-05 07:26:09] [INFO ] Deduced a trap composed of 54 places in 446 ms of which 8 ms to minimize.
[2025-06-05 07:26:09] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2025-06-05 07:26:10] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 3 ms to minimize.
[2025-06-05 07:26:10] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 3 ms to minimize.
[2025-06-05 07:26:10] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 4 ms to minimize.
[2025-06-05 07:26:12] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 4 ms to minimize.
[2025-06-05 07:26:12] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 3 ms to minimize.
[2025-06-05 07:26:12] [INFO ] Deduced a trap composed of 32 places in 168 ms of which 3 ms to minimize.
[2025-06-05 07:26:13] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 3 ms to minimize.
[2025-06-05 07:26:14] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 4 ms to minimize.
[2025-06-05 07:26:14] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 4 ms to minimize.
[2025-06-05 07:26:15] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 4 ms to minimize.
[2025-06-05 07:26:15] [INFO ] Deduced a trap composed of 30 places in 175 ms of which 4 ms to minimize.
[2025-06-05 07:26:16] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 4 ms to minimize.
[2025-06-05 07:26:16] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 3 ms to minimize.
[2025-06-05 07:26:17] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 4 ms to minimize.
[2025-06-05 07:26:18] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 4 ms to minimize.
[2025-06-05 07:26:19] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 3 ms to minimize.
[2025-06-05 07:26:19] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 4 ms to minimize.
[2025-06-05 07:26:19] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1526 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2025-06-05 07:26:21] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2025-06-05 07:26:21] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2025-06-05 07:26:25] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 3 ms to minimize.
[2025-06-05 07:26:27] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 3 ms to minimize.
[2025-06-05 07:26:27] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 5 ms to minimize.
[2025-06-05 07:26:27] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 3 ms to minimize.
[2025-06-05 07:26:27] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 4 ms to minimize.
[2025-06-05 07:26:28] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 3 ms to minimize.
[2025-06-05 07:26:29] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 3 ms to minimize.
[2025-06-05 07:26:29] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 3 ms to minimize.
[2025-06-05 07:26:30] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 4 ms to minimize.
[2025-06-05 07:26:31] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 4 ms to minimize.
[2025-06-05 07:26:31] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 5 ms to minimize.
[2025-06-05 07:26:31] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 3 ms to minimize.
[2025-06-05 07:26:31] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 3 ms to minimize.
[2025-06-05 07:26:32] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 4 ms to minimize.
[2025-06-05 07:26:32] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 3 ms to minimize.
[2025-06-05 07:26:33] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 4 ms to minimize.
[2025-06-05 07:26:33] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 3 ms to minimize.
[2025-06-05 07:26:33] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1526 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2025-06-05 07:26:34] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:26:34] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2025-06-05 07:26:37] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 3 ms to minimize.
[2025-06-05 07:26:39] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 3 ms to minimize.
[2025-06-05 07:26:40] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 3 ms to minimize.
[2025-06-05 07:26:41] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 3 ms to minimize.
[2025-06-05 07:26:41] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 3 ms to minimize.
[2025-06-05 07:26:41] [INFO ] Deduced a trap composed of 62 places in 153 ms of which 4 ms to minimize.
[2025-06-05 07:26:41] [INFO ] Deduced a trap composed of 60 places in 154 ms of which 3 ms to minimize.
[2025-06-05 07:26:41] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 3 ms to minimize.
[2025-06-05 07:26:42] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 3 ms to minimize.
[2025-06-05 07:26:42] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 3 ms to minimize.
[2025-06-05 07:26:42] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 3 ms to minimize.
[2025-06-05 07:26:42] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 3 ms to minimize.
[2025-06-05 07:26:43] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 3 ms to minimize.
[2025-06-05 07:26:43] [INFO ] Deduced a trap composed of 66 places in 153 ms of which 3 ms to minimize.
[2025-06-05 07:26:43] [INFO ] Deduced a trap composed of 74 places in 151 ms of which 4 ms to minimize.
[2025-06-05 07:26:43] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 4 ms to minimize.
[2025-06-05 07:26:43] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 3 ms to minimize.
[2025-06-05 07:26:44] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1526 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2025-06-05 07:26:44] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2025-06-05 07:26:45] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2025-06-05 07:26:48] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2025-06-05 07:26:48] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2025-06-05 07:26:50] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2025-06-05 07:26:50] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2025-06-05 07:26:50] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
[2025-06-05 07:26:50] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
[2025-06-05 07:26:50] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2025-06-05 07:26:50] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2025-06-05 07:26:50] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 0 ms to minimize.
[2025-06-05 07:26:51] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 0 ms to minimize.
[2025-06-05 07:26:51] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2025-06-05 07:26:51] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2025-06-05 07:26:52] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 3 ms to minimize.
[2025-06-05 07:26:53] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 4 ms to minimize.
[2025-06-05 07:26:53] [INFO ] Deduced a trap composed of 72 places in 195 ms of which 4 ms to minimize.
[2025-06-05 07:26:53] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 4 ms to minimize.
[2025-06-05 07:26:53] [INFO ] Deduced a trap composed of 64 places in 188 ms of which 4 ms to minimize.
[2025-06-05 07:26:53] [INFO ] Deduced a trap composed of 58 places in 185 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1526 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2025-06-05 07:26:57] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2025-06-05 07:26:57] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2025-06-05 07:26:57] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2025-06-05 07:26:57] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2025-06-05 07:26:58] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 0 ms to minimize.
[2025-06-05 07:26:59] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2025-06-05 07:26:59] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2025-06-05 07:27:00] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2025-06-05 07:27:00] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2025-06-05 07:27:00] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2025-06-05 07:27:02] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2025-06-05 07:27:02] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2025-06-05 07:27:02] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 1 ms to minimize.
[2025-06-05 07:27:02] [INFO ] Deduced a trap composed of 69 places in 182 ms of which 3 ms to minimize.
[2025-06-05 07:27:03] [INFO ] Deduced a trap composed of 68 places in 186 ms of which 4 ms to minimize.
[2025-06-05 07:27:03] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 3 ms to minimize.
[2025-06-05 07:27:03] [INFO ] Deduced a trap composed of 65 places in 177 ms of which 3 ms to minimize.
[2025-06-05 07:27:03] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 3 ms to minimize.
[2025-06-05 07:27:03] [INFO ] Deduced a trap composed of 60 places in 176 ms of which 3 ms to minimize.
[2025-06-05 07:27:04] [INFO ] Deduced a trap composed of 62 places in 167 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1526 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2025-06-05 07:27:07] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 4 ms to minimize.
[2025-06-05 07:27:07] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 4 ms to minimize.
[2025-06-05 07:27:08] [INFO ] Deduced a trap composed of 62 places in 181 ms of which 4 ms to minimize.
[2025-06-05 07:27:08] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 4 ms to minimize.
[2025-06-05 07:27:08] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 3 ms to minimize.
[2025-06-05 07:27:08] [INFO ] Deduced a trap composed of 58 places in 189 ms of which 4 ms to minimize.
[2025-06-05 07:27:09] [INFO ] Deduced a trap composed of 62 places in 182 ms of which 4 ms to minimize.
[2025-06-05 07:27:09] [INFO ] Deduced a trap composed of 72 places in 176 ms of which 4 ms to minimize.
[2025-06-05 07:27:09] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 3 ms to minimize.
[2025-06-05 07:27:09] [INFO ] Deduced a trap composed of 68 places in 178 ms of which 4 ms to minimize.
[2025-06-05 07:27:10] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 4 ms to minimize.
[2025-06-05 07:27:11] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 4 ms to minimize.
[2025-06-05 07:27:11] [INFO ] Deduced a trap composed of 34 places in 192 ms of which 4 ms to minimize.
[2025-06-05 07:27:11] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 3 ms to minimize.
[2025-06-05 07:27:11] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 4 ms to minimize.
[2025-06-05 07:27:11] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 4 ms to minimize.
[2025-06-05 07:27:12] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 4 ms to minimize.
[2025-06-05 07:27:12] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 3 ms to minimize.
[2025-06-05 07:27:12] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 3 ms to minimize.
[2025-06-05 07:27:13] [INFO ] Deduced a trap composed of 32 places in 193 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1526 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2025-06-05 07:27:13] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2025-06-05 07:27:14] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2025-06-05 07:27:17] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2025-06-05 07:27:19] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 3 ms to minimize.
[2025-06-05 07:27:19] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 3 ms to minimize.
[2025-06-05 07:27:19] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 3 ms to minimize.
[2025-06-05 07:27:19] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 3 ms to minimize.
[2025-06-05 07:27:19] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 3 ms to minimize.
[2025-06-05 07:27:20] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 3 ms to minimize.
[2025-06-05 07:27:20] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 3 ms to minimize.
[2025-06-05 07:27:20] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 3 ms to minimize.
[2025-06-05 07:27:20] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 4 ms to minimize.
[2025-06-05 07:27:20] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 3 ms to minimize.
[2025-06-05 07:27:20] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 3 ms to minimize.
[2025-06-05 07:27:22] [INFO ] Deduced a trap composed of 70 places in 158 ms of which 3 ms to minimize.
[2025-06-05 07:27:22] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 3 ms to minimize.
[2025-06-05 07:27:22] [INFO ] Deduced a trap composed of 60 places in 151 ms of which 3 ms to minimize.
[2025-06-05 07:27:22] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 4 ms to minimize.
[2025-06-05 07:27:23] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 3 ms to minimize.
[2025-06-05 07:27:23] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2025-06-05 07:27:31] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 4 ms to minimize.
[2025-06-05 07:27:31] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 3 ms to minimize.
[2025-06-05 07:27:31] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 3 ms to minimize.
[2025-06-05 07:27:34] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 2 ms to minimize.
[2025-06-05 07:27:35] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 3 ms to minimize.
[2025-06-05 07:27:36] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 4 ms to minimize.
[2025-06-05 07:27:36] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 4 ms to minimize.
[2025-06-05 07:27:36] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 3 ms to minimize.
[2025-06-05 07:27:37] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 3 ms to minimize.
[2025-06-05 07:27:38] [INFO ] Deduced a trap composed of 24 places in 189 ms of which 3 ms to minimize.
[2025-06-05 07:27:38] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 4 ms to minimize.
[2025-06-05 07:27:39] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 3 ms to minimize.
[2025-06-05 07:27:39] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 4 ms to minimize.
[2025-06-05 07:27:39] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2025-06-05 07:27:39] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 4 ms to minimize.
[2025-06-05 07:27:40] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 3 ms to minimize.
[2025-06-05 07:27:41] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 4 ms to minimize.
[2025-06-05 07:27:41] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 4 ms to minimize.
[2025-06-05 07:27:42] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 4 ms to minimize.
[2025-06-05 07:27:43] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 20/340 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2025-06-05 07:27:47] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 3 ms to minimize.
[2025-06-05 07:27:49] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 2 ms to minimize.
[2025-06-05 07:27:49] [INFO ] Deduced a trap composed of 62 places in 161 ms of which 3 ms to minimize.
[2025-06-05 07:27:49] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 3 ms to minimize.
[2025-06-05 07:27:49] [INFO ] Deduced a trap composed of 64 places in 153 ms of which 3 ms to minimize.
[2025-06-05 07:27:49] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 3 ms to minimize.
[2025-06-05 07:27:50] [INFO ] Deduced a trap composed of 60 places in 151 ms of which 3 ms to minimize.
[2025-06-05 07:27:50] [INFO ] Deduced a trap composed of 64 places in 148 ms of which 3 ms to minimize.
[2025-06-05 07:27:50] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 3 ms to minimize.
[2025-06-05 07:27:50] [INFO ] Deduced a trap composed of 68 places in 149 ms of which 3 ms to minimize.
[2025-06-05 07:27:56] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 3 ms to minimize.
[2025-06-05 07:27:57] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 4 ms to minimize.
[2025-06-05 07:27:57] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 4 ms to minimize.
[2025-06-05 07:27:58] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 4 ms to minimize.
[2025-06-05 07:27:58] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 4 ms to minimize.
[2025-06-05 07:27:58] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2025-06-05 07:28:01] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 3 ms to minimize.
[2025-06-05 07:28:01] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 4 ms to minimize.
[2025-06-05 07:28:01] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1526/4415 variables, and 359 constraints, problems are : Problem set: 0 solved, 1260 unsolved in 135033 ms.
Refiners :[Positive P Invariants (semi-flows): 180/400 constraints, State Equation: 0/2062 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1260 constraints, Known Traps: 179/179 constraints]
After SMT, in 270346ms problems are : Problem set: 0 solved, 1260 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1260 out of 2062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2062/2062 places, 2353/2353 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 2062 transition count 2310
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 2019 transition count 2310
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 86 place count 2019 transition count 2277
Deduced a syphon composed of 33 places in 5 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 152 place count 1986 transition count 2277
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 158 place count 1980 transition count 2271
Iterating global reduction 2 with 6 rules applied. Total rules applied 164 place count 1980 transition count 2271
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 164 place count 1980 transition count 2265
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 176 place count 1974 transition count 2265
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 5 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 282 place count 1921 transition count 2212
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 26 places in 5 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 334 place count 1895 transition count 2225
Applied a total of 334 rules in 114 ms. Remains 1895 /2062 variables (removed 167) and now considering 2225/2353 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 1895/2062 places, 2225/2353 transitions.
RANDOM walk for 1382201 steps (382 resets) in 120004 ms. (11 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 80 ms. (49 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 140 ms. (28 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 123 ms. (32 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 136 ms. (29 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 134 ms. (29 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 94 ms. (42 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 113 ms. (35 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 105 ms. (37 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 128 ms. (31 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 130 ms. (30 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 103 ms. (38 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 128 ms. (31 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 119 ms. (33 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 118 ms. (33 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 93 ms. (42 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 137 ms. (29 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 123 ms. (32 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 122 ms. (32 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 92 ms. (43 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 140 ms. (28 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 116 ms. (34 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 122 ms. (32 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 124 ms. (32 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 128 ms. (31 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4003 steps (8 resets) in 139 ms. (28 steps per ms) remains 1260/1260 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 1260/1260 properties
Probabilistic random walk after 1000001 steps, saw 683355 distinct states, run finished after 87527 ms. (steps per millisecond=11 ) properties seen :0
// Phase 1: matrix 2225 rows 1895 cols
[2025-06-05 07:30:01] [INFO ] Computed 400 invariants in 15 ms
[2025-06-05 07:30:01] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
At refinement iteration 1 (OVERLAPS) 195/1455 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1455 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
At refinement iteration 3 (OVERLAPS) 1493/2948 variables, 1455/1635 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 (/ 1.0 66.0))
(t1 0.0)
(t2 (/ 131.0 132.0))
(t3 0.0)
(t4 (/ 1.0 66.0))
(t5 0.0)
(t6 (/ 131.0 132.0))
(t7 0.0)
(t8 (/ 131.0 132.0))
(t9 0.0)
(t10 (/ 1.0 22.0))
(t11 0.0)
(t12 (/ 1.0 66.0))
(t13 0.0)
(t14 0.0)
(t15 (/ 65.0 264.0))
(t16 (/ 61.0 264.0))
(t17 (/ 59.0 264.0))
(t18 0.0)
(t19 (/ 1.0 132.0))
(t20 0.0)
(t21 (/ 67.0 264.0))
(t22 (/ 1.0 33.0))
(t23 (/ 65.0 264.0))
(t24 (/ 65.0 264.0))
(t25 (/ 65.0 264.0))
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 (/ 19.0 88.0))
(t30 (/ 19.0 88.0))
(t31 (/ 19.0 88.0))
(t32 (/ 19.0 88.0))
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 (/ 67.0 264.0))
(t37 (/ 5.0 132.0))
(t38 (/ 1.0 44.0))
(t39 (/ 1.0 66.0))
(t40 0.0)
(t41 (/ 1.0 132.0))
(t42 0.0)
(t43 (/ 5.0 24.0))
(t44 (/ 65.0 264.0))
(t45 (/ 67.0 264.0))
(t46 (/ 67.0 264.0))
(t47 (/ 67.0 264.0))
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 (/ 1.0 132.0))
(t52 (/ 21.0 88.0))
(t53 (/ 61.0 264.0))
(t54 (/ 19.0 88.0))
(t55 (/ 5.0 24.0))
(t56 0.0)
(t57 (/ 1.0 132.0))
(t58 0.0)
(t59 0.0)
(t60 (/ 67.0 264.0))
(t61 (/ 67.0 264.0))
(t62 (/ 67.0 264.0))
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 (/ 1.0 132.0))
(t67 (/ 23.0 88.0))
(t68 (/ 23.0 88.0))
(t69 (/ 23.0 88.0))
(t70 (/ 67.0 264.0))
(t71 0.0)
(t72 0.0)
(t73 (/ 67.0 264.0))
(t74 (/ 1.0 12.0))
(t75 (/ 5.0 66.0))
(t76 (/ 2.0 33.0))
(t77 (/ 7.0 132.0))
(t78 0.0)
(t79 (/ 1.0 132.0))
(t80 0.0)
(t81 0.0)
(t82 (/ 17.0 88.0))
(t83 (/ 49.0 264.0))
(t84 (/ 15.0 88.0))
(t85 (/ 43.0 264.0))
(t86 0.0)
(t87 (/ 1.0 132.0))
(t88 0.0)
(t89 0.0)
(t90 (/ 5.0 132.0))
(t91 (/ 1.0 44.0))
(t92 (/ 1.0 66.0))
(t93 0.0)
(t94 (/ 1.0 132.0))
(t95 0.0)
(t96 (/ 1.0 132.0))
(t97 (/ 1.0 132.0))
(t98 (/ 1.0 132.0))
(t99 (/ 1.0 132.0))
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 (/ 13.0 88.0))
(t105 (/ 4.0 33.0))
(t106 (/ 7.0 66.0))
(t107 (/ 13.0 132.0))
(t108 0.0)
(t109 (/ 1.0 132.0))
(t110 0.0)
(t111 0.0)
(t112 (/ 13.0 88.0))
(t113 (/ 49.0 264.0))
(t114 (/ 15.0 88.0))
(t115 (/ 43.0 264.0))
(t116 0.0)
(t117 (/ 1.0 132.0))
(t118 0.0)
(t119 (/ 1.0 22.0))
(t120 (/ 1.0 12.0))
(t121 (/ 3.0 44.0))
(t122 (/ 2.0 33.0))
(t123 (/ 1.0 22.0))
(t124 (/ 1.0 132.0))
(t125 0.0)
(t126 0.0)
(t127 (/ 5.0 132.0))
(t128 (/ 1.0 44.0))
(t129 (/ 1.0 66.0))
(t130 0.0)
(t131 (/ 1.0 132.0))
(t132 0.0)
(t133 (/ 1.0 22.0))
(t134 (/ 13.0 88.0))
(t135 (/ 5.0 66.0))
(t136 (/ 2.0 33.0))
(t137 (/ 7.0 132.0))
(t138 0.0)
(t139 (/ 1.0 132.0))
(t140 0.0)
(t141 0.0)
(t142 (/ 13.0 88.0))
(t143 (/ 37.0 264.0))
(t144 (/ 1.0 8.0))
(t145 (/ 31.0 264.0))
(t146 0.0)
(t147 (/ 1.0 132.0))
(t148 0.0)
(t149 0.0)
(t150 (/ 5.0 132.0))
(t151 (/ 1.0 44.0))
(t152 (/ 1.0 66.0))
(t153 0.0)
(t154 (/ 1.0 132.0))
(t155 0.0)
(t156 (/ 1.0 132.0))
(t157 (/ 1.0 132.0))
(t158 (/ 1.0 132.0))
(t159 (/ 1.0 132.0))
(t160 0.0)
(t161 0.0)
(t162 0.0)
(t163 0.0)
(t164 (/ 9.0 88.0))
(t165 (/ 23.0 132.0))
(t166 (/ 7.0 44.0))
(t167 (/ 5.0 33.0))
(t168 0.0)
(t169 (/ 1.0 132.0))
(t170 0.0)
(t171 (/ 7.0 88.0))
(t172 (/ 9.0 88.0))
(t173 (/ 17.0 88.0))
(t174 (/ 47.0 264.0))
(t175 (/ 15.0 88.0))
(t176 0.0)
(t177 (/ 1.0 132.0))
(t178 0.0)
(t179 (/ 13.0 132.0))
(t180 (/ 3.0 22.0))
(t181 (/ 4.0 33.0))
(t182 (/ 5.0 44.0))
(t183 0.0)
(t184 (/ 1.0 132.0))
(t185 0.0)
(t186 0.0)
(t187 (/ 5.0 132.0))
(t188 (/ 1.0 44.0))
(t189 (/ 1.0 66.0))
(t190 0.0)
(t191 (/ 1.0 132.0))
(t192 0.0)
(t193 (/ 1.0 22.0))
(t194 (/ 41.0 264.0))
(t195 (/ 13.0 88.0))
(t196 (/ 35.0 264.0))
(t197 (/ 1.0 8.0))
(t198 0.0)
(t199 (/ 1.0 132.0))
(t200 0.0)
(t201 0.0)
(t202 (/ 41.0 264.0))
(t203 (/ 29.0 132.0))
(t204 (/ 9.0 44.0))
(t205 (/ 13.0 66.0))
(t206 0.0)
(t207 (/ 1.0 132.0))
(t208 0.0)
(t209 (/ 19.0 264.0))
(t210 (/ 29.0 264.0))
(t211 (/ 25.0 264.0))
(t212 (/ 23.0 264.0))
(t213 0.0)
(t214 (/ 1.0 132.0))
(t215 0.0)
(t216 (/ 1.0 132.0))
(t217 (/ 23.0 264.0))
(t218 (/ 23.0 264.0))
(t219 (/ 23.0 264.0))
(t220 0.0)
(t221 0.0)
(t222 0.0)
(t223 (/ 7.0 88.0))
(t224 (/ 17.0 132.0))
(t225 (/ 4.0 33.0))
(t226 (/ 7.0 66.0))
(t227 (/ 13.0 132.0))
(t228 (/ 1.0 12.0))
(t229 (/ 1.0 132.0))
(t230 0.0)
(t231 0.0)
(t232 (/ 2.0 11.0))
(t233 (/ 29.0 132.0))
(t234 (/ 9.0 44.0))
(t235 (/ 13.0 66.0))
(t236 0.0)
(t237 (/ 1.0 132.0))
(t238 0.0)
(t239 (/ 1.0 22.0))
(t240 (/ 1.0 12.0))
(t241 (/ 3.0 44.0))
(t242 (/ 2.0 33.0))
(t243 (/ 1.0 22.0))
(t244 (/ 1.0 132.0))
(t245 0.0)
(t246 0.0)
(t247 (/ 5.0 132.0))
(t248 (/ 1.0 44.0))
(t249 (/ 1.0 66.0))
(t250 0.0)
(t251 (/ 1.0 132.0))
(t252 0.0)
(t253 (/ 1.0 22.0))
(t254 (/ 1.0 12.0))
(t255 (/ 5.0 66.0))
(t256 (/ 2.0 33.0))
(t257 (/ 7.0 132.0))
(t258 0.0)
(t259 (/ 1.0 132.0))
(t260 0.0)
(t261 0.0)
(t262 (/ 2.0 11.0))
(t263 (/ 23.0 132.0))
(t264 (/ 7.0 44.0))
(t265 (/ 5.0 33.0))
(t266 0.0)
(t267 (/ 1.0 132.0))
(t268 0.0)
(t269 0.0)
(t270 (/ 5.0 132.0))
(t271 (/ 1.0 44.0))
(t272 (/ 1.0 66.0))
(t273 0.0)
(t274 (/ 1.0 132.0))
(t275 0.0)
(t276 (/ 1.0 132.0))
(t277 (/ 1.0 132.0))
(t278 (/ 1.0 132.0))
(t279 (/ 1.0 132.0))
(t280 0.0)
(t281 0.0)
(t282 0.0)
(t283 0.0)
(t284 (/ 1.0 12.0))
(t285 (/ 5.0 66.0))
(t286 (/ 2.0 33.0))
(t287 (/ 7.0 132.0))
(t288 (/ 5.0 132.0))
(t289 (/ 1.0 132.0))
(t290 0.0)
(t291 0.0)
(t292 (/ 3.0 22.0))
(t293 (/ 17.0 132.0))
(t294 (/ 5.0 44.0))
(t295 (/ 7.0 66.0))
(t296 0.0)
(t297 (/ 1.0 132.0))
(t298 0.0)
(t299 0.0)
(t300 (/ 5.0 132.0))
(t301 (/ 1.0 44.0))
(t302 (/ 1.0 66.0))
(t303 0.0)
(t304 (/ 1.0 132.0))
(t305 0.0)
(t306 (/ 1.0 132.0))
(t307 (/ 1.0 132.0))
(t308 (/ 1.0 132.0))
(t309 (/ 1.0 132.0))
(t310 0.0)
(t311 0.0)
(t312 0.0)
(t313 0.0)
(t314 (/ 5.0 132.0))
(t315 (/ 5.0 66.0))
(t316 (/ 2.0 33.0))
(t317 (/ 7.0 132.0))
(t318 0.0)
(t319 (/ 1.0 132.0))
(t320 0.0)
(t321 (/ 1.0 22.0))
(t322 (/ 1.0 11.0))
(t323 (/ 1.0 12.0))
(t324 (/ 3.0 44.0))
(t325 (/ 2.0 33.0))
(t326 0.0)
(t327 (/ 1.0 132.0))
(t328 0.0)
(t329 0.0)
(t330 (/ 5.0 132.0))
(t331 (/ 1.0 44.0))
(t332 (/ 1.0 66.0))
(t333 0.0)
(t334 (/ 1.0 132.0))
(t335 0.0)
(t336 (/ 1.0 22.0))
(t337 (/ 5.0 132.0))
(t338 (/ 1.0 44.0))
(t339 (/ 1.0 66.0))
(t340 0.0)
(t341 (/ 1.0 132.0))
(t342 0.0)
(t343 0.0)
(t344 (/ 1.0 22.0))
(t345 (/ 1.0 22.0))
(t346 (/ 1.0 22.0))
(t347 (/ 1.0 22.0))
(t348 0.0)
(t349 0.0)
(t350 0.0)
(t351 0.0)
(t352 (/ 1.0 22.0))
(t353 (/ 5.0 132.0))
(t354 (/ 1.0 44.0))
(t355 (/ 1.0 66.0))
(t356 0.0)
(t357 (/ 1.0 132.0))
(t358 0.0)
(t359 0.0)
(t360 (/ 5.0 132.0))
(t361 (/ 1.0 44.0))
(t362 (/ 1.0 66.0))
(t363 0.0)
(t364 (/ 1.0 132.0))
(t365 0.0)
(t366 (/ 7.0 132.0))
(t367 (/ 7.0 132.0))
(t368 (/ 7.0 132.0))
(t369 (/ 7.0 132.0))
(t370 0.0)
(t371 0.0)
(t372 0.0)
(t373 0.0)
(t374 0.0)
(t375 (/ 71.0 264.0))
(t376 (/ 67.0 264.0))
(t377 (/ 65.0 264.0))
(t378 0.0)
(t379 (/ 1.0 132.0))
(t380 0.0)
(t381 (/ 73.0 264.0))
(t382 0.0)
(t383 (/ 49.0 264.0))
(t384 (/ 15.0 88.0))
(t385 (/ 43.0 264.0))
(t386 0.0)
(t387 (/ 1.0 132.0))
(t388 0.0)
(t389 (/ 17.0 88.0))
(t390 (/ 61.0 264.0))
(t391 (/ 19.0 88.0))
(t392 (/ 5.0 24.0))
(t393 (/ 17.0 88.0))
(t394 (/ 1.0 132.0))
(t395 0.0)
(t396 (/ 73.0 264.0))
(t397 (/ 1.0 12.0))
(t398 (/ 3.0 44.0))
(t399 (/ 2.0 33.0))
(t400 0.0)
(t401 (/ 1.0 132.0))
(t402 0.0)
(t403 0.0)
(t404 (/ 41.0 264.0))
(t405 (/ 13.0 44.0))
(t406 (/ 13.0 44.0))
(t407 (/ 13.0 44.0))
(t408 (/ 19.0 66.0))
(t409 0.0)
(t410 0.0)
(t411 (/ 37.0 264.0))
(t412 (/ 13.0 88.0))
(t413 (/ 37.0 264.0))
(t414 (/ 1.0 8.0))
(t415 (/ 31.0 264.0))
(t416 0.0)
(t417 (/ 1.0 132.0))
(t418 0.0)
(t419 0.0)
(t420 (/ 13.0 44.0))
(t421 (/ 13.0 44.0))
(t422 (/ 13.0 44.0))
(t423 0.0)
(t424 0.0)
(t425 0.0)
(t426 (/ 5.0 264.0))
(t427 (/ 83.0 264.0))
(t428 (/ 79.0 264.0))
(t429 (/ 7.0 24.0))
(t430 0.0)
(t431 (/ 1.0 132.0))
(t432 0.0)
(t433 (/ 13.0 44.0))
(t434 (/ 9.0 88.0))
(t435 (/ 13.0 88.0))
(t436 (/ 35.0 264.0))
(t437 (/ 1.0 8.0))
(t438 0.0)
(t439 (/ 1.0 132.0))
(t440 0.0)
(t441 (/ 7.0 132.0))
(t442 (/ 9.0 88.0))
(t443 (/ 1.0 6.0))
(t444 (/ 5.0 33.0))
(t445 (/ 19.0 132.0))
(t446 0.0)
(t447 (/ 1.0 132.0))
(t448 0.0)
(t449 (/ 19.0 264.0))
(t450 (/ 29.0 264.0))
(t451 (/ 25.0 264.0))
(t452 (/ 23.0 264.0))
(t453 0.0)
(t454 (/ 1.0 132.0))
(t455 0.0)
(t456 (/ 2.0 33.0))
(t457 (/ 37.0 264.0))
(t458 (/ 37.0 264.0))
(t459 (/ 37.0 264.0))
(t460 0.0)
(t461 0.0)
(t462 0.0)
(t463 (/ 7.0 88.0))
(t464 (/ 17.0 132.0))
(t465 (/ 4.0 33.0))
(t466 (/ 7.0 66.0))
(t467 (/ 13.0 132.0))
(t468 (/ 1.0 12.0))
(t469 (/ 1.0 132.0))
(t470 0.0)
(t471 0.0)
(t472 0.0)
(t473 (/ 5.0 132.0))
(t474 (/ 1.0 44.0))
(t475 (/ 1.0 66.0))
(t476 0.0)
(t477 (/ 1.0 132.0))
(t478 0.0)
(t479 (/ 1.0 22.0))
(t480 (/ 1.0 12.0))
(t481 (/ 3.0 44.0))
(t482 (/ 2.0 33.0))
(t483 0.0)
(t484 (/ 1.0 132.0))
(t485 0.0)
(t486 (/ 1.0 132.0))
(t487 (/ 2.0 33.0))
(t488 (/ 2.0 33.0))
(t489 (/ 2.0 33.0))
(t490 0.0)
(t491 0.0)
(t492 0.0)
(t493 (/ 7.0 132.0))
(t494 0.0)
(t495 (/ 17.0 66.0))
(t496 (/ 8.0 33.0))
(t497 (/ 31.0 132.0))
(t498 0.0)
(t499 (/ 1.0 132.0))
(t500 0.0)
(t501 (/ 35.0 132.0))
(t502 0.0)
(t503 (/ 23.0 132.0))
(t504 (/ 7.0 44.0))
(t505 (/ 5.0 33.0))
(t506 0.0)
(t507 (/ 1.0 132.0))
(t508 0.0)
(t509 (/ 2.0 11.0))
(t510 (/ 29.0 132.0))
(t511 (/ 9.0 44.0))
(t512 (/ 13.0 66.0))
(t513 0.0)
(t514 (/ 1.0 132.0))
(t515 0.0)
(t516 (/ 35.0 132.0))
(t517 (/ 5.0 132.0))
(t518 (/ 1.0 44.0))
(t519 (/ 1.0 66.0))
(t520 0.0)
(t521 (/ 1.0 132.0))
(t522 0.0)
(t523 (/ 2.0 11.0))
(t524 (/ 3.0 22.0))
(t525 (/ 5.0 66.0))
(t526 (/ 2.0 33.0))
(t527 (/ 7.0 132.0))
(t528 0.0)
(t529 (/ 1.0 132.0))
(t530 0.0)
(t531 0.0)
(t532 (/ 3.0 22.0))
(t533 (/ 17.0 132.0))
(t534 (/ 5.0 44.0))
(t535 (/ 7.0 66.0))
(t536 0.0)
(t537 (/ 1.0 132.0))
(t538 0.0)
(t539 0.0)
(t540 (/ 5.0 132.0))
(t541 (/ 1.0 44.0))
(t542 (/ 1.0 66.0))
(t543 0.0)
(t544 (/ 1.0 132.0))
(t545 0.0)
(t546 (/ 37.0 132.0))
(t547 (/ 37.0 132.0))
(t548 (/ 37.0 132.0))
(t549 (/ 37.0 132.0))
(t550 (/ 35.0 132.0))
(t551 0.0)
(t552 0.0)
(t553 0.0)
(t554 0.0)
(t555 (/ 5.0 66.0))
(t556 (/ 2.0 33.0))
(t557 (/ 7.0 132.0))
(t558 0.0)
(t559 (/ 1.0 132.0))
(t560 0.0)
(t561 (/ 1.0 12.0))
(t562 (/ 1.0 11.0))
(t563 (/ 1.0 12.0))
(t564 (/ 3.0 44.0))
(t565 (/ 2.0 33.0))
(t566 0.0)
(t567 (/ 1.0 132.0))
(t568 0.0)
(t569 0.0)
(t570 (/ 5.0 132.0))
(t571 (/ 1.0 44.0))
(t572 (/ 1.0 66.0))
(t573 0.0)
(t574 (/ 1.0 132.0))
(t575 0.0)
(t576 (/ 37.0 132.0))
(t577 (/ 37.0 132.0))
(t578 (/ 37.0 132.0))
(t579 (/ 37.0 132.0))
(t580 0.0)
(t581 0.0)
(t582 0.0)
(t583 0.0)
(t584 (/ 1.0 22.0))
(t585 (/ 5.0 66.0))
(t586 (/ 2.0 33.0))
(t587 (/ 7.0 132.0))
(t588 (/ 5.0 132.0))
(t589 (/ 1.0 132.0))
(t590 0.0)
(t591 (/ 5.0 132.0))
(t592 (/ 1.0 22.0))
(t593 (/ 5.0 132.0))
(t594 (/ 1.0 44.0))
(t595 (/ 1.0 66.0))
(t596 0.0)
(t597 (/ 1.0 132.0))
(t598 0.0)
(t599 0.0)
(t600 (/ 5.0 132.0))
(t601 (/ 1.0 44.0))
(t602 (/ 1.0 66.0))
(t603 0.0)
(t604 (/ 1.0 132.0))
(t605 0.0)
(t606 (/ 37.0 132.0))
(t607 (/ 37.0 132.0))
(t608 (/ 37.0 132.0))
(t609 (/ 37.0 132.0))
(t610 0.0)
(t611 0.0)
(t612 0.0)
(t613 0.0)
(t614 0.0)
(t615 (/ 1.0 6.0))
(t616 (/ 5.0 33.0))
(t617 (/ 19.0 132.0))
(t618 0.0)
(t619 (/ 1.0 132.0))
(t620 0.0)
(t621 (/ 23.0 132.0))
(t622 0.0)
(t623 (/ 1.0 12.0))
(t624 (/ 3.0 44.0))
(t625 (/ 2.0 33.0))
(t626 0.0)
(t627 (/ 1.0 132.0))
(t628 0.0)
(t629 (/ 1.0 11.0))
(t630 (/ 17.0 132.0))
(t631 (/ 5.0 44.0))
(t632 (/ 7.0 66.0))
(t633 (/ 1.0 11.0))
(t634 (/ 1.0 132.0))
(t635 0.0)
(t636 (/ 2.0 11.0))
(t637 (/ 37.0 132.0))
(t638 (/ 37.0 132.0))
(t639 (/ 37.0 132.0))
(t640 0.0)
(t641 0.0)
(t642 0.0)
(t643 (/ 13.0 132.0))
(t644 (/ 7.0 132.0))
(t645 (/ 31.0 264.0))
(t646 (/ 31.0 264.0))
(t647 (/ 31.0 264.0))
(t648 (/ 29.0 264.0))
(t649 0.0)
(t650 0.0)
(t651 (/ 17.0 264.0))
(t652 (/ 1.0 22.0))
(t653 (/ 5.0 132.0))
(t654 (/ 1.0 44.0))
(t655 (/ 1.0 66.0))
(t656 0.0)
(t657 (/ 1.0 132.0))
(t658 0.0)
(t659 0.0)
(t660 (/ 31.0 264.0))
(t661 (/ 31.0 264.0))
(t662 (/ 31.0 264.0))
(t663 0.0)
(t664 0.0)
(t665 0.0)
(t666 (/ 17.0 264.0))
(t667 (/ 2.0 11.0))
(t668 (/ 2.0 11.0))
(t669 (/ 2.0 11.0))
(t670 0.0)
(t671 0.0)
(t672 0.0)
(t673 (/ 31.0 264.0))
(t674 0.0)
(t675 (/ 1.0 6.0))
(t676 (/ 5.0 33.0))
(t677 (/ 19.0 132.0))
(t678 0.0)
(t679 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2948/4120 variables, and 1635 constraints, problems are : Problem set: 0 solved, 1260 unsolved in 150028 ms.
Refiners :[Positive P Invariants (semi-flows): 180/400 constraints, State Equation: 1455/1895 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1260/1260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
At refinement iteration 1 (OVERLAPS) 195/1455 variables, 180/180 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2025-06-05 07:32:53] [INFO ] Deduced a trap composed of 36 places in 407 ms of which 8 ms to minimize.
[2025-06-05 07:32:53] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2025-06-05 07:32:54] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 3 ms to minimize.
[2025-06-05 07:32:55] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 2 ms to minimize.
[2025-06-05 07:32:55] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 3 ms to minimize.
[2025-06-05 07:32:56] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 3 ms to minimize.
[2025-06-05 07:32:56] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 3 ms to minimize.
[2025-06-05 07:32:57] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 3 ms to minimize.
[2025-06-05 07:32:57] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 3 ms to minimize.
[2025-06-05 07:32:58] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 3 ms to minimize.
[2025-06-05 07:32:59] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 4 ms to minimize.
[2025-06-05 07:32:59] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 3 ms to minimize.
[2025-06-05 07:32:59] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 4 ms to minimize.
[2025-06-05 07:33:01] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 4 ms to minimize.
[2025-06-05 07:33:01] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2025-06-05 07:33:01] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 4 ms to minimize.
[2025-06-05 07:33:02] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 3 ms to minimize.
[2025-06-05 07:33:03] [INFO ] Deduced a trap composed of 18 places in 169 ms of which 3 ms to minimize.
[2025-06-05 07:33:03] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 4 ms to minimize.
[2025-06-05 07:33:03] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1455 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2025-06-05 07:33:04] [INFO ] Deduced a trap composed of 20 places in 412 ms of which 7 ms to minimize.
[2025-06-05 07:33:05] [INFO ] Deduced a trap composed of 26 places in 409 ms of which 8 ms to minimize.
[2025-06-05 07:33:06] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 2 ms to minimize.
[2025-06-05 07:33:08] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2025-06-05 07:33:09] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2025-06-05 07:33:09] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2025-06-05 07:33:10] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 3 ms to minimize.
[2025-06-05 07:33:12] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 3 ms to minimize.
[2025-06-05 07:33:12] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 3 ms to minimize.
[2025-06-05 07:33:13] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 3 ms to minimize.
[2025-06-05 07:33:13] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 3 ms to minimize.
[2025-06-05 07:33:14] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 3 ms to minimize.
[2025-06-05 07:33:14] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 3 ms to minimize.
[2025-06-05 07:33:15] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 4 ms to minimize.
[2025-06-05 07:33:15] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 4 ms to minimize.
[2025-06-05 07:33:16] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 3 ms to minimize.
[2025-06-05 07:33:16] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 3 ms to minimize.
[2025-06-05 07:33:16] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 3 ms to minimize.
[2025-06-05 07:33:16] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 1 ms to minimize.
[2025-06-05 07:33:17] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1455 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 1260 unsolved
[2025-06-05 07:33:18] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 3 ms to minimize.
[2025-06-05 07:33:18] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 3 ms to minimize.
[2025-06-05 07:33:19] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 3 ms to minimize.
[2025-06-05 07:33:20] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 3 ms to minimize.
[2025-06-05 07:33:20] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 2 ms to minimize.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="StableMarking"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool gold2024"
echo " Input is ShieldRVt-PT-100B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-174902009800218"
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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;