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-174902009800198.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-040B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-174902009800198
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.9K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 489K 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 1749106764122

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-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 06:59:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-05 06:59:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:59:25] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2025-06-05 06:59:25] [INFO ] Transformed 2003 places.
[2025-06-05 06:59:25] [INFO ] Transformed 2003 transitions.
[2025-06-05 06:59:25] [INFO ] Found NUPN structural information;
[2025-06-05 06:59:25] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 300 ms.
Structural test allowed to assert that 801 places are NOT stable. Took 18 ms.
RANDOM walk for 40000 steps (8 resets) in 3978 ms. (10 steps per ms) remains 768/1202 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 768/768 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 768/768 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 24 ms. (4 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 30 ms. (4 steps per ms) remains 768/768 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 768/768 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 768/768 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 768/768 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 768/768 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 768/768 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 768/768 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 768/768 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 768/768 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 768/768 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 768/768 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 768/768 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 768/768 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 768/768 properties
BEST_FIRST walk for 122 steps (8 resets) in 6 ms. (17 steps per ms) remains 768/768 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 768/768 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 768/768 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 768/768 properties
BEST_FIRST walk for 123 steps (8 resets) in 5 ms. (20 steps per ms) remains 768/768 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 768/768 properties
BEST_FIRST walk for 122 steps (8 resets) in 6 ms. (17 steps per ms) remains 768/768 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 768/768 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 768/768 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 768/768 properties
// Phase 1: matrix 2003 rows 2003 cols
[2025-06-05 06:59:27] [INFO ] Computed 161 invariants in 28 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 768/768 constraints. Problems are: Problem set: 0 solved, 768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/4006 variables, and 768 constraints, problems are : Problem set: 0 solved, 768 unsolved in 5088 ms.
Refiners :[Domain max(s): 768/2003 constraints, Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/2003 constraints, PredecessorRefiner: 768/768 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 768/768 constraints. Problems are: Problem set: 0 solved, 768 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/4006 variables, and 768 constraints, problems are : Problem set: 0 solved, 768 unsolved in 5017 ms.
Refiners :[Domain max(s): 768/2003 constraints, Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/2003 constraints, PredecessorRefiner: 0/768 constraints, Known Traps: 0/0 constraints]
After SMT, in 10412ms problems are : Problem set: 0 solved, 768 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 768 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 436 transitions
Trivial Post-agglo rules discarded 436 transitions
Performed 436 trivial Post agglomeration. Transition count delta: 436
Iterating post reduction 0 with 436 rules applied. Total rules applied 436 place count 2003 transition count 1567
Reduce places removed 436 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 438 rules applied. Total rules applied 874 place count 1567 transition count 1565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 875 place count 1566 transition count 1565
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 875 place count 1566 transition count 1504
Deduced a syphon composed of 61 places in 4 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 997 place count 1505 transition count 1504
Discarding 95 places :
Symmetric choice reduction at 3 with 95 rule applications. Total rules 1092 place count 1410 transition count 1409
Iterating global reduction 3 with 95 rules applied. Total rules applied 1187 place count 1410 transition count 1409
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 1187 place count 1410 transition count 1371
Deduced a syphon composed of 38 places in 38 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1263 place count 1372 transition count 1371
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 29 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 3 with 678 rules applied. Total rules applied 1941 place count 1033 transition count 1032
Renaming transitions due to excessive name length > 1024 char.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 39 places in 24 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 2019 place count 994 transition count 1066
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 2020 place count 994 transition count 1065
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2024 place count 994 transition count 1061
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2028 place count 990 transition count 1061
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 2031 place count 990 transition count 1058
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 2032 place count 990 transition count 1058
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2033 place count 989 transition count 1057
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2034 place count 988 transition count 1057
Applied a total of 2034 rules in 781 ms. Remains 988 /2003 variables (removed 1015) and now considering 1057/2003 (removed 946) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 793 ms. Remains : 988/2003 places, 1057/2003 transitions.
RANDOM walk for 3462391 steps (854 resets) in 120008 ms. (28 steps per ms) remains 316/768 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (10 resets) in 257 ms. (155 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40003 steps (8 resets) in 204 ms. (195 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (10 resets) in 190 ms. (209 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40003 steps (9 resets) in 190 ms. (209 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (9 resets) in 194 ms. (205 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40002 steps (9 resets) in 178 ms. (223 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (9 resets) in 181 ms. (219 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40003 steps (9 resets) in 181 ms. (219 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40002 steps (8 resets) in 182 ms. (218 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (10 resets) in 185 ms. (215 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40002 steps (8 resets) in 191 ms. (208 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (9 resets) in 185 ms. (215 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40002 steps (9 resets) in 188 ms. (211 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40002 steps (8 resets) in 187 ms. (212 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40003 steps (9 resets) in 197 ms. (202 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (9 resets) in 189 ms. (210 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (9 resets) in 183 ms. (217 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (10 resets) in 188 ms. (211 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (9 resets) in 181 ms. (219 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 316/316 properties
BEST_FIRST walk for 40004 steps (9 resets) in 183 ms. (217 steps per ms) remains 316/316 properties
// Phase 1: matrix 1057 rows 988 cols
[2025-06-05 07:00:11] [INFO ] Computed 160 invariants in 4 ms
[2025-06-05 07:00:11] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 104/420 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (OVERLAPS) 423/843 variables, 420/470 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/843 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (OVERLAPS) 44/887 variables, 20/490 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/887 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 32/919 variables, 6/496 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/919 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 34/953 variables, 36/532 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/953 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 316 unsolved
SMT process timed out in 45075ms, After SMT, problems are : Problem set: 0 solved, 316 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 316 out of 988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 988/988 places, 1057/1057 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 122 place count 988 transition count 935
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 244 place count 866 transition count 935
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 244 place count 866 transition count 875
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 364 place count 806 transition count 875
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 401 place count 769 transition count 838
Iterating global reduction 2 with 37 rules applied. Total rules applied 438 place count 769 transition count 838
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 438 place count 769 transition count 801
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 512 place count 732 transition count 801
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 690 place count 643 transition count 712
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 778 place count 599 transition count 755
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 779 place count 599 transition count 754
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 782 place count 599 transition count 751
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 785 place count 596 transition count 751
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 786 place count 596 transition count 750
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 787 place count 596 transition count 750
Applied a total of 787 rules in 126 ms. Remains 596 /988 variables (removed 392) and now considering 750/1057 (removed 307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 596/988 places, 750/1057 transitions.
RANDOM walk for 4000000 steps (985 resets) in 94103 ms. (42 steps per ms) remains 252/316 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (10 resets) in 165 ms. (240 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (9 resets) in 169 ms. (235 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (9 resets) in 168 ms. (236 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40001 steps (8 resets) in 171 ms. (232 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (9 resets) in 176 ms. (226 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (9 resets) in 168 ms. (236 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (9 resets) in 163 ms. (243 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (9 resets) in 167 ms. (238 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (10 resets) in 174 ms. (228 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (10 resets) in 173 ms. (229 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (9 resets) in 175 ms. (227 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (9 resets) in 166 ms. (239 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (9 resets) in 167 ms. (238 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (12 resets) in 175 ms. (227 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (9 resets) in 173 ms. (229 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (9 resets) in 174 ms. (228 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40002 steps (8 resets) in 175 ms. (227 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (10 resets) in 176 ms. (226 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (9 resets) in 173 ms. (229 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (8 resets) in 170 ms. (233 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (10 resets) in 180 ms. (221 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (9 resets) in 175 ms. (227 steps per ms) remains 252/252 properties
// Phase 1: matrix 750 rows 596 cols
[2025-06-05 07:01:23] [INFO ] Computed 160 invariants in 3 ms
[2025-06-05 07:01:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 91/343 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 348/691 variables, 343/385 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/691 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 41/732 variables, 18/403 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/732 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/732 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 7/739 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/739 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/739 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 11 (OVERLAPS) 13/752 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/752 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/752 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 14 (OVERLAPS) 1/753 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/753 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/753 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 17 (OVERLAPS) 27/780 variables, 10/433 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/780 variables, 3/436 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/780 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 20 (OVERLAPS) 1/781 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/781 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/781 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 23 (OVERLAPS) 22/803 variables, 8/446 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/803 variables, 4/450 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/803 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 26 (OVERLAPS) 22/825 variables, 8/458 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/825 variables, 4/462 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/825 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 29 (OVERLAPS) 22/847 variables, 8/470 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/847 variables, 4/474 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 847/1346 variables, and 474 constraints, problems are : Problem set: 0 solved, 252 unsolved in 75022 ms.
Refiners :[Positive P Invariants (semi-flows): 66/160 constraints, State Equation: 408/596 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 91/343 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2025-06-05 07:02:39] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 19 ms to minimize.
[2025-06-05 07:02:40] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 3 ms to minimize.
[2025-06-05 07:02:40] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2025-06-05 07:02:40] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 3 ms to minimize.
[2025-06-05 07:02:40] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2025-06-05 07:02:40] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2025-06-05 07:02:40] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2025-06-05 07:02:40] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2025-06-05 07:02:41] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 1 ms to minimize.
[2025-06-05 07:02:41] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2025-06-05 07:02:41] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2025-06-05 07:02:41] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 16 ms to minimize.
[2025-06-05 07:02:41] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2025-06-05 07:02:41] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 0 ms to minimize.
[2025-06-05 07:02:41] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:02:41] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2025-06-05 07:02:42] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:02:42] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2025-06-05 07:02:42] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2025-06-05 07:02:42] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2025-06-05 07:02:42] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2025-06-05 07:02:42] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2025-06-05 07:02:42] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:02:42] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2025-06-05 07:02:42] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2025-06-05 07:02:42] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 2 ms to minimize.
[2025-06-05 07:02:42] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2025-06-05 07:02:42] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2025-06-05 07:02:42] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2025-06-05 07:02:43] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:02:43] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:02:43] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:02:43] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2025-06-05 07:02:43] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 4 ms to minimize.
[2025-06-05 07:02:43] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2025-06-05 07:02:43] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2025-06-05 07:02:43] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2025-06-05 07:02:44] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:02:44] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2025-06-05 07:02:44] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2025-06-05 07:02:44] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2025-06-05 07:02:44] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2025-06-05 07:02:44] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2025-06-05 07:02:44] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2025-06-05 07:02:44] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2025-06-05 07:02:44] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2025-06-05 07:02:44] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2025-06-05 07:02:44] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2025-06-05 07:02:45] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2025-06-05 07:02:45] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
[2025-06-05 07:02:45] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:02:45] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2025-06-05 07:02:45] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2025-06-05 07:02:45] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:02:45] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2025-06-05 07:02:45] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2025-06-05 07:02:45] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 13 ms to minimize.
[2025-06-05 07:02:46] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2025-06-05 07:02:46] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 2 ms to minimize.
[2025-06-05 07:02:46] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2025-06-05 07:02:46] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2025-06-05 07:02:47] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2025-06-05 07:02:47] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2025-06-05 07:02:47] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
[2025-06-05 07:02:47] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:02:47] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
[2025-06-05 07:02:47] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:02:47] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 2 ms to minimize.
[2025-06-05 07:02:47] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
[2025-06-05 07:02:47] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:02:48] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:02:48] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:02:48] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2025-06-05 07:02:48] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2025-06-05 07:02:49] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:02:50] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:02:50] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2025-06-05 07:02:50] [INFO ] Deduced a trap composed of 49 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2025-06-05 07:02:51] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2025-06-05 07:02:51] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:02:52] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:02:52] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:02:52] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2025-06-05 07:02:54] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2025-06-05 07:02:54] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2025-06-05 07:02:54] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2025-06-05 07:02:54] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2025-06-05 07:02:54] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2025-06-05 07:02:55] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:02:55] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2025-06-05 07:02:55] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2025-06-05 07:02:55] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2025-06-05 07:02:56] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2025-06-05 07:02:56] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 2 ms to minimize.
[2025-06-05 07:02:56] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 2 ms to minimize.
[2025-06-05 07:02:56] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:02:56] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 2 ms to minimize.
[2025-06-05 07:02:56] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:02:56] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 1 ms to minimize.
[2025-06-05 07:02:56] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2025-06-05 07:02:56] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:02:56] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
[2025-06-05 07:02:56] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 15/145 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2025-06-05 07:02:58] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2025-06-05 07:02:58] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2025-06-05 07:02:58] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2025-06-05 07:02:58] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2025-06-05 07:02:58] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2025-06-05 07:02:58] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2025-06-05 07:02:58] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2025-06-05 07:02:58] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2025-06-05 07:02:58] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 9/154 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2025-06-05 07:03:00] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:03:00] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2025-06-05 07:03:00] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 2 ms to minimize.
[2025-06-05 07:03:00] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:03:00] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2025-06-05 07:03:00] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 ms to minimize.
[2025-06-05 07:03:00] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:03:00] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:03:00] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 2 ms to minimize.
[2025-06-05 07:03:00] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:03:01] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 2 ms to minimize.
[2025-06-05 07:03:01] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2025-06-05 07:03:01] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2025-06-05 07:03:01] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:03:01] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2025-06-05 07:03:01] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 2 ms to minimize.
[2025-06-05 07:03:01] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:03:01] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:03:01] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:03:01] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2025-06-05 07:03:01] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 2 ms to minimize.
[2025-06-05 07:03:02] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 14 (OVERLAPS) 348/691 variables, 343/519 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/691 variables, 252/771 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2025-06-05 07:03:17] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2025-06-05 07:03:20] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2025-06-05 07:03:20] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:03:20] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:03:21] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2025-06-05 07:03:21] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2025-06-05 07:03:21] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:03:22] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:03:23] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:03:24] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/691 variables, 10/781 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/691 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 18 (OVERLAPS) 41/732 variables, 18/799 constraints. Problems are: Problem set: 0 solved, 252 unsolved
SMT process timed out in 150080ms, After SMT, problems are : Problem set: 0 solved, 252 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 252 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 750/750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 596 transition count 734
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 580 transition count 734
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 580 transition count 724
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 570 transition count 724
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 94 place count 549 transition count 703
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 545 transition count 706
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 103 place count 545 transition count 705
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 545 transition count 701
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 111 place count 541 transition count 701
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 112 place count 541 transition count 700
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 541 transition count 700
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 115 place count 541 transition count 699
Applied a total of 115 rules in 107 ms. Remains 541 /596 variables (removed 55) and now considering 699/750 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 541/596 places, 699/750 transitions.
RANDOM walk for 4000000 steps (1065 resets) in 81736 ms. (48 steps per ms) remains 32/252 properties
BEST_FIRST walk for 400003 steps (19 resets) in 1558 ms. (256 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (13 resets) in 1591 ms. (251 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (11 resets) in 1663 ms. (240 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (18 resets) in 1612 ms. (247 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (16 resets) in 1611 ms. (248 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (13 resets) in 1727 ms. (231 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (18 resets) in 1660 ms. (240 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (16 resets) in 1632 ms. (244 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (10 resets) in 1683 ms. (237 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (13 resets) in 1515 ms. (263 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (13 resets) in 1565 ms. (255 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (10 resets) in 1654 ms. (241 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (11 resets) in 1646 ms. (242 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (12 resets) in 1630 ms. (245 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (18 resets) in 1562 ms. (255 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (19 resets) in 1610 ms. (248 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (13 resets) in 1579 ms. (253 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (12 resets) in 1559 ms. (256 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (15 resets) in 1619 ms. (246 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (20 resets) in 1609 ms. (248 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (12 resets) in 1558 ms. (256 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (13 resets) in 1620 ms. (246 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (15 resets) in 1602 ms. (249 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (12 resets) in 1573 ms. (254 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (11 resets) in 1573 ms. (254 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (13 resets) in 1577 ms. (253 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (12 resets) in 1551 ms. (257 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (9 resets) in 1557 ms. (256 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (17 resets) in 1648 ms. (242 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (16 resets) in 1625 ms. (246 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (17 resets) in 1559 ms. (256 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (17 resets) in 1588 ms. (251 steps per ms) remains 32/32 properties
// Phase 1: matrix 699 rows 541 cols
[2025-06-05 07:04:33] [INFO ] Computed 160 invariants in 2 ms
[2025-06-05 07:04:33] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 68/100 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 106/206 variables, 100/112 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 74/280 variables, 32/144 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 65/345 variables, 11/155 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 64/409 variables, 69/226 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 16/425 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 37/462 variables, 24/253 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (OVERLAPS) 23/485 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/485 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 18 (OVERLAPS) 41/526 variables, 33/290 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 20 (OVERLAPS) 9/535 variables, 4/294 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/535 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/535 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 23 (OVERLAPS) 27/562 variables, 15/313 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/562 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/562 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 26 (OVERLAPS) 9/571 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/571 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/571 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 29 (OVERLAPS) 29/600 variables, 16/334 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/600 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/600 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 32 (OVERLAPS) 6/606 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/606 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/606 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 35 (OVERLAPS) 27/633 variables, 11/352 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/633 variables, 2/354 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/633 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 38 (OVERLAPS) 3/636 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/636 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/636 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 41 (OVERLAPS) 18/654 variables, 8/367 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/654 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/654 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 44 (OVERLAPS) 21/675 variables, 8/379 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/675 variables, 4/383 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/675 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 47 (OVERLAPS) 22/697 variables, 8/391 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/697 variables, 4/395 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/697 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 50 (OVERLAPS) 22/719 variables, 8/403 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/719 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/719 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 53 (OVERLAPS) 22/741 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/741 variables, 4/419 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/741 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 56 (OVERLAPS) 22/763 variables, 8/427 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/763 variables, 4/431 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/763 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 59 (OVERLAPS) 22/785 variables, 8/439 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/785 variables, 4/443 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/785 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 62 (OVERLAPS) 22/807 variables, 8/451 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/807 variables, 4/455 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/807 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 65 (OVERLAPS) 22/829 variables, 8/463 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/829 variables, 4/467 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/829 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 68 (OVERLAPS) 22/851 variables, 8/475 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/851 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/851 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 71 (OVERLAPS) 22/873 variables, 8/487 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/873 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/873 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 74 (OVERLAPS) 22/895 variables, 8/499 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/895 variables, 4/503 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/895 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 77 (OVERLAPS) 22/917 variables, 8/511 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/917 variables, 4/515 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/917 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 80 (OVERLAPS) 22/939 variables, 8/523 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/939 variables, 4/527 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/939 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 83 (OVERLAPS) 22/961 variables, 8/535 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/961 variables, 4/539 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/961 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/961 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 87 (OVERLAPS) 18/979 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/979 variables, 4/552 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/979 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 90 (OVERLAPS) 18/997 variables, 8/560 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/997 variables, 4/564 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/997 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 93 (OVERLAPS) 19/1016 variables, 8/572 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1016 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1016 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 96 (OVERLAPS) 21/1037 variables, 8/584 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1037 variables, 4/588 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1037 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 99 (OVERLAPS) 22/1059 variables, 8/596 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1059 variables, 4/600 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1059 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 102 (OVERLAPS) 22/1081 variables, 8/608 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1081 variables, 4/612 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1081 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 105 (OVERLAPS) 22/1103 variables, 8/620 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1103 variables, 4/624 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1103 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 108 (OVERLAPS) 22/1125 variables, 8/632 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1125 variables, 4/636 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1125 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 111 (OVERLAPS) 22/1147 variables, 8/644 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1147 variables, 4/648 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1147 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 114 (OVERLAPS) 22/1169 variables, 8/656 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1169 variables, 4/660 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1169 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 117 (OVERLAPS) 22/1191 variables, 8/668 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1191 variables, 4/672 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1191 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 120 (OVERLAPS) 22/1213 variables, 8/680 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1213 variables, 4/684 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1213 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 123 (OVERLAPS) 19/1232 variables, 8/692 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1232 variables, 4/696 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1232 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 126 (OVERLAPS) 8/1240 variables, 4/700 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1240 variables, 2/702 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1240 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 129 (OVERLAPS) 0/1240 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1240/1240 variables, and 702 constraints, problems are : Problem set: 0 solved, 32 unsolved in 16021 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 541/541 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 68/100 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 106/206 variables, 100/112 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 32/144 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-06-05 07:04:50] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2025-06-05 07:04:50] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2025-06-05 07:04:50] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 74/280 variables, 32/179 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 65/345 variables, 11/190 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 64/409 variables, 69/261 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/409 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (OVERLAPS) 16/425 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/425 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 17 (OVERLAPS) 37/462 variables, 24/288 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/462 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 19 (OVERLAPS) 23/485 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/485 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 21 (OVERLAPS) 41/526 variables, 33/325 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 23 (OVERLAPS) 9/535 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/535 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/535 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 26 (OVERLAPS) 27/562 variables, 15/348 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/562 variables, 2/350 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/562 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 29 (OVERLAPS) 9/571 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/571 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/571 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 32 (OVERLAPS) 29/600 variables, 16/369 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/600 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/600 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 35 (OVERLAPS) 6/606 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/606 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/606 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 38 (OVERLAPS) 27/633 variables, 11/387 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/633 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/633 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 41 (OVERLAPS) 3/636 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/636 variables, 3/394 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/636 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 44 (OVERLAPS) 18/654 variables, 8/402 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/654 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/654 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 47 (OVERLAPS) 21/675 variables, 8/414 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/675 variables, 4/418 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/675 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 50 (OVERLAPS) 22/697 variables, 8/426 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/697 variables, 4/430 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/697 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 53 (OVERLAPS) 22/719 variables, 8/438 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/719 variables, 4/442 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/719 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 56 (OVERLAPS) 22/741 variables, 8/450 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/741 variables, 4/454 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/741 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 59 (OVERLAPS) 22/763 variables, 8/462 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/763 variables, 4/466 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/763 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 62 (OVERLAPS) 22/785 variables, 8/474 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/785 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/785 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 65 (OVERLAPS) 22/807 variables, 8/486 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/807 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/807 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 68 (OVERLAPS) 22/829 variables, 8/498 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/829 variables, 4/502 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/829 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 71 (OVERLAPS) 22/851 variables, 8/510 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/851 variables, 4/514 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/851 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 74 (OVERLAPS) 22/873 variables, 8/522 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/873 variables, 4/526 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/873 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 77 (OVERLAPS) 22/895 variables, 8/534 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/895 variables, 4/538 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/895 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 80 (OVERLAPS) 22/917 variables, 8/546 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/917 variables, 4/550 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/917 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 83 (OVERLAPS) 22/939 variables, 8/558 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/939 variables, 4/562 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/939 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 86 (OVERLAPS) 22/961 variables, 8/570 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/961 variables, 4/574 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/961 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/961 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 90 (OVERLAPS) 18/979 variables, 8/583 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/979 variables, 4/587 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/979 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 93 (OVERLAPS) 18/997 variables, 8/595 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/997 variables, 4/599 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/997 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 96 (OVERLAPS) 19/1016 variables, 8/607 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1016 variables, 4/611 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1016 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 99 (OVERLAPS) 21/1037 variables, 8/619 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1037 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1037 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 102 (OVERLAPS) 22/1059 variables, 8/631 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1059 variables, 4/635 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1059 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 105 (OVERLAPS) 22/1081 variables, 8/643 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1081 variables, 4/647 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1081 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 108 (OVERLAPS) 22/1103 variables, 8/655 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1103 variables, 4/659 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1103 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 111 (OVERLAPS) 22/1125 variables, 8/667 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1125 variables, 4/671 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1125 variables, 0/671 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 114 (OVERLAPS) 22/1147 variables, 8/679 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1147 variables, 4/683 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1147 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 117 (OVERLAPS) 22/1169 variables, 8/691 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1169 variables, 4/695 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1169 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 120 (OVERLAPS) 22/1191 variables, 8/703 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1191 variables, 4/707 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1191 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 123 (OVERLAPS) 22/1213 variables, 8/715 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1213 variables, 4/719 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1213 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 126 (OVERLAPS) 19/1232 variables, 8/727 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 127 (INCLUDED_ONLY) 0/1232 variables, 4/731 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/1232 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 129 (OVERLAPS) 8/1240 variables, 4/735 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/1240 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 131 (INCLUDED_ONLY) 0/1240 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 132 (OVERLAPS) 0/1240 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1240/1240 variables, and 737 constraints, problems are : Problem set: 0 solved, 32 unsolved in 25326 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 541/541 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 3/3 constraints]
After SMT, in 41369ms problems are : Problem set: 0 solved, 32 unsolved
Fused 32 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 32 out of 541 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 541/541 places, 699/699 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 541 transition count 643
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 485 transition count 643
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 112 place count 485 transition count 613
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 172 place count 455 transition count 613
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 189 place count 438 transition count 596
Iterating global reduction 2 with 17 rules applied. Total rules applied 206 place count 438 transition count 596
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 206 place count 438 transition count 579
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 240 place count 421 transition count 579
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 334 place count 374 transition count 532
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 372 place count 355 transition count 550
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 373 place count 355 transition count 549
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 378 place count 355 transition count 544
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 383 place count 350 transition count 544
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 386 place count 350 transition count 541
Applied a total of 386 rules in 64 ms. Remains 350 /541 variables (removed 191) and now considering 541/699 (removed 158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 350/541 places, 541/699 transitions.
RANDOM walk for 4000000 steps (1019 resets) in 54347 ms. (73 steps per ms) remains 5/32 properties
BEST_FIRST walk for 4000002 steps (114 resets) in 13579 ms. (294 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000001 steps (120 resets) in 14051 ms. (284 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (93 resets) in 14069 ms. (284 steps per ms) remains 5/5 properties
BEST_FIRST walk for 3964010 steps (105 resets) in 14241 ms. (278 steps per ms) remains 0/5 properties
Able to resolve query StableMarking after proving 1203 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 391371 ms.
ITS solved all properties within timeout

BK_STOP 1749107156842

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-040B"
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-040B, 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-174902009800198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-040B.tgz
mv ShieldRVt-PT-040B 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 ;