Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-08b-CTLCardinality-2024-00
FORMULA_NAME ASLink-PT-08b-CTLCardinality-2024-01
FORMULA_NAME ASLink-PT-08b-CTLCardinality-2024-02
FORMULA_NAME ASLink-PT-08b-CTLCardinality-2024-03
FORMULA_NAME ASLink-PT-08b-CTLCardinality-2024-04
FORMULA_NAME ASLink-PT-08b-CTLCardinality-2024-05
FORMULA_NAME ASLink-PT-08b-CTLCardinality-2024-06
FORMULA_NAME ASLink-PT-08b-CTLCardinality-2024-07
FORMULA_NAME ASLink-PT-08b-CTLCardinality-2024-08
FORMULA_NAME ASLink-PT-08b-CTLCardinality-2024-09
FORMULA_NAME ASLink-PT-08b-CTLCardinality-2024-10
FORMULA_NAME ASLink-PT-08b-CTLCardinality-2024-11
FORMULA_NAME ASLink-PT-08b-CTLCardinality-2023-12
FORMULA_NAME ASLink-PT-08b-CTLCardinality-2023-13
FORMULA_NAME ASLink-PT-08b-CTLCardinality-2023-14
FORMULA_NAME ASLink-PT-08b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717224749481

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:52:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:52:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:52:31] [INFO ] Load time of PNML (sax parser for PT used): 445 ms
[2024-06-01 06:52:31] [INFO ] Transformed 3618 places.
[2024-06-01 06:52:31] [INFO ] Transformed 4459 transitions.
[2024-06-01 06:52:31] [INFO ] Found NUPN structural information;
[2024-06-01 06:52:31] [INFO ] Parsed PT model containing 3618 places and 4459 transitions and 13543 arcs in 711 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Support contains 128 out of 3618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Discarding 213 places :
Symmetric choice reduction at 0 with 213 rule applications. Total rules 213 place count 3405 transition count 4246
Iterating global reduction 0 with 213 rules applied. Total rules applied 426 place count 3405 transition count 4246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 427 place count 3405 transition count 4245
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 505 place count 3327 transition count 4129
Iterating global reduction 1 with 78 rules applied. Total rules applied 583 place count 3327 transition count 4129
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 608 place count 3327 transition count 4104
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 617 place count 3318 transition count 4095
Iterating global reduction 2 with 9 rules applied. Total rules applied 626 place count 3318 transition count 4095
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 630 place count 3314 transition count 4084
Iterating global reduction 2 with 4 rules applied. Total rules applied 634 place count 3314 transition count 4084
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 637 place count 3311 transition count 4081
Iterating global reduction 2 with 3 rules applied. Total rules applied 640 place count 3311 transition count 4081
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 642 place count 3309 transition count 4079
Iterating global reduction 2 with 2 rules applied. Total rules applied 644 place count 3309 transition count 4079
Applied a total of 644 rules in 3289 ms. Remains 3309 /3618 variables (removed 309) and now considering 4079/4459 (removed 380) transitions.
// Phase 1: matrix 4079 rows 3309 cols
[2024-06-01 06:52:35] [INFO ] Computed 355 invariants in 207 ms
[2024-06-01 06:52:38] [INFO ] Implicit Places using invariants in 3283 ms returned [3142, 3153, 3164, 3172, 3180, 3188, 3196, 3207, 3215, 3234]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 3340 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3299/3618 places, 4079/4459 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3288 transition count 4068
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3288 transition count 4068
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 3279 transition count 4059
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 3279 transition count 4059
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 3272 transition count 4052
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 3272 transition count 4052
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 3270 transition count 4050
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 3270 transition count 4050
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 3269 transition count 4049
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 3269 transition count 4049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 3268 transition count 4048
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 3268 transition count 4048
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 3267 transition count 4047
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 3267 transition count 4047
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 3266 transition count 4046
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 3266 transition count 4046
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 3265 transition count 4045
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 3265 transition count 4045
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 3264 transition count 4044
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 3264 transition count 4044
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 3263 transition count 4043
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 3263 transition count 4043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 3262 transition count 4042
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 3262 transition count 4042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 3261 transition count 4041
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 3261 transition count 4041
Applied a total of 76 rules in 4102 ms. Remains 3261 /3299 variables (removed 38) and now considering 4041/4079 (removed 38) transitions.
// Phase 1: matrix 4041 rows 3261 cols
[2024-06-01 06:52:43] [INFO ] Computed 345 invariants in 144 ms
[2024-06-01 06:52:45] [INFO ] Implicit Places using invariants in 2399 ms returned []
[2024-06-01 06:52:45] [INFO ] Invariant cache hit.
[2024-06-01 06:53:05] [INFO ] Implicit Places using invariants and state equation in 20012 ms returned []
Implicit Place search using SMT with State Equation took 22420 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3261/3618 places, 4041/4459 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33182 ms. Remains : 3261/3618 places, 4041/4459 transitions.
Support contains 128 out of 3261 places after structural reductions.
[2024-06-01 06:53:06] [INFO ] Flatten gal took : 387 ms
[2024-06-01 06:53:06] [INFO ] Flatten gal took : 230 ms
[2024-06-01 06:53:06] [INFO ] Input system was already deterministic with 4041 transitions.
Support contains 102 out of 3261 places (down from 128) after GAL structural reductions.
FORMULA ASLink-PT-08b-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (59 resets) in 2374 ms. (16 steps per ms) remains 26/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
[2024-06-01 06:53:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 317/367 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 493/860 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/860 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 2307/3167 variables, 251/333 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3167 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 94/3261 variables, 12/345 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3261/7302 variables, and 345 constraints, problems are : Problem set: 0 solved, 26 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 82/82 constraints, Generalized P Invariants (flows): 263/263 constraints, State Equation: 0/3261 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 317/367 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 493/860 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 06:53:14] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 25 ms to minimize.
[2024-06-01 06:53:14] [INFO ] Deduced a trap composed of 116 places in 109 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/860 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/860 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 2307/3167 variables, 251/335 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-01 06:53:17] [INFO ] Deduced a trap composed of 23 places in 1213 ms of which 21 ms to minimize.
[2024-06-01 06:53:18] [INFO ] Deduced a trap composed of 26 places in 1057 ms of which 14 ms to minimize.
SMT process timed out in 10505ms, After SMT, problems are : Problem set: 0 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 3261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3261/3261 places, 4041/4041 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 581 transitions
Trivial Post-agglo rules discarded 581 transitions
Performed 581 trivial Post agglomeration. Transition count delta: 581
Iterating post reduction 0 with 581 rules applied. Total rules applied 581 place count 3261 transition count 3460
Reduce places removed 581 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 587 rules applied. Total rules applied 1168 place count 2680 transition count 3454
Reduce places removed 3 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 14 rules applied. Total rules applied 1182 place count 2677 transition count 3443
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1193 place count 2666 transition count 3443
Performed 851 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 851 Pre rules applied. Total rules applied 1193 place count 2666 transition count 2592
Deduced a syphon composed of 851 places in 9 ms
Ensure Unique test removed 81 places
Reduce places removed 932 places and 0 transitions.
Iterating global reduction 4 with 1783 rules applied. Total rules applied 2976 place count 1734 transition count 2592
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 4 with 60 rules applied. Total rules applied 3036 place count 1725 transition count 2541
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 52 rules applied. Total rules applied 3088 place count 1674 transition count 2540
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3089 place count 1673 transition count 2540
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 28 Pre rules applied. Total rules applied 3089 place count 1673 transition count 2512
Deduced a syphon composed of 28 places in 11 ms
Ensure Unique test removed 25 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 7 with 81 rules applied. Total rules applied 3170 place count 1620 transition count 2512
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 3171 place count 1619 transition count 2512
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 24 Pre rules applied. Total rules applied 3171 place count 1619 transition count 2488
Deduced a syphon composed of 24 places in 9 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 8 with 48 rules applied. Total rules applied 3219 place count 1595 transition count 2488
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 3224 place count 1590 transition count 2476
Iterating global reduction 8 with 5 rules applied. Total rules applied 3229 place count 1590 transition count 2476
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 3229 place count 1590 transition count 2474
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3233 place count 1588 transition count 2474
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3235 place count 1586 transition count 2460
Iterating global reduction 8 with 2 rules applied. Total rules applied 3237 place count 1586 transition count 2460
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3238 place count 1585 transition count 2452
Iterating global reduction 8 with 1 rules applied. Total rules applied 3239 place count 1585 transition count 2452
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3240 place count 1584 transition count 2444
Iterating global reduction 8 with 1 rules applied. Total rules applied 3241 place count 1584 transition count 2444
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3242 place count 1583 transition count 2436
Iterating global reduction 8 with 1 rules applied. Total rules applied 3243 place count 1583 transition count 2436
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3244 place count 1582 transition count 2428
Iterating global reduction 8 with 1 rules applied. Total rules applied 3245 place count 1582 transition count 2428
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3246 place count 1581 transition count 2420
Iterating global reduction 8 with 1 rules applied. Total rules applied 3247 place count 1581 transition count 2420
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3248 place count 1580 transition count 2412
Iterating global reduction 8 with 1 rules applied. Total rules applied 3249 place count 1580 transition count 2412
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3250 place count 1579 transition count 2404
Iterating global reduction 8 with 1 rules applied. Total rules applied 3251 place count 1579 transition count 2404
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3252 place count 1578 transition count 2396
Iterating global reduction 8 with 1 rules applied. Total rules applied 3253 place count 1578 transition count 2396
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3254 place count 1577 transition count 2388
Iterating global reduction 8 with 1 rules applied. Total rules applied 3255 place count 1577 transition count 2388
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3256 place count 1576 transition count 2380
Iterating global reduction 8 with 1 rules applied. Total rules applied 3257 place count 1576 transition count 2380
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3258 place count 1575 transition count 2372
Iterating global reduction 8 with 1 rules applied. Total rules applied 3259 place count 1575 transition count 2372
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3260 place count 1574 transition count 2364
Iterating global reduction 8 with 1 rules applied. Total rules applied 3261 place count 1574 transition count 2364
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3262 place count 1573 transition count 2356
Iterating global reduction 8 with 1 rules applied. Total rules applied 3263 place count 1573 transition count 2356
Performed 260 Post agglomeration using F-continuation condition.Transition count delta: 260
Deduced a syphon composed of 260 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 262 places and 0 transitions.
Iterating global reduction 8 with 522 rules applied. Total rules applied 3785 place count 1311 transition count 2096
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 3787 place count 1309 transition count 2094
Iterating global reduction 8 with 2 rules applied. Total rules applied 3789 place count 1309 transition count 2094
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3791 place count 1308 transition count 2101
Free-agglomeration rule applied 13 times.
Iterating global reduction 8 with 13 rules applied. Total rules applied 3804 place count 1308 transition count 2088
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 3817 place count 1295 transition count 2088
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 3825 place count 1295 transition count 2080
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 3833 place count 1287 transition count 2080
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 3838 place count 1287 transition count 2080
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3839 place count 1286 transition count 2079
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 10 with 23 rules applied. Total rules applied 3862 place count 1270 transition count 2072
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 8 rules applied. Total rules applied 3870 place count 1263 transition count 2071
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 3871 place count 1262 transition count 2071
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 23 Pre rules applied. Total rules applied 3871 place count 1262 transition count 2048
Deduced a syphon composed of 23 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 13 with 47 rules applied. Total rules applied 3918 place count 1238 transition count 2048
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 13 with 9 rules applied. Total rules applied 3927 place count 1229 transition count 2048
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 3927 place count 1229 transition count 2047
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 3929 place count 1228 transition count 2047
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 6 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 32 rules applied. Total rules applied 3961 place count 1212 transition count 2031
Discarding 7 places :
Symmetric choice reduction at 14 with 7 rule applications. Total rules 3968 place count 1205 transition count 2024
Iterating global reduction 14 with 7 rules applied. Total rules applied 3975 place count 1205 transition count 2024
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 3976 place count 1204 transition count 2023
Iterating global reduction 14 with 1 rules applied. Total rules applied 3977 place count 1204 transition count 2023
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 3978 place count 1204 transition count 2022
Free-agglomeration rule applied 7 times.
Iterating global reduction 15 with 7 rules applied. Total rules applied 3985 place count 1204 transition count 2015
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 3992 place count 1197 transition count 2015
Applied a total of 3992 rules in 2882 ms. Remains 1197 /3261 variables (removed 2064) and now considering 2015/4041 (removed 2026) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2883 ms. Remains : 1197/3261 places, 2015/4041 transitions.
RANDOM walk for 40000 steps (391 resets) in 654 ms. (61 steps per ms) remains 23/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
// Phase 1: matrix 2015 rows 1197 cols
[2024-06-01 06:53:22] [INFO ] Computed 201 invariants in 38 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 272/317 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 23/340 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 694/1034 variables, 105/143 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1034 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 22/1056 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1056 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 139/1195 variables, 44/199 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1195 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 2/1197 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 2015/3212 variables, 1197/1398 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3212 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 0/3212 variables, 0/1398 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3212/3212 variables, and 1398 constraints, problems are : Problem set: 0 solved, 23 unsolved in 7658 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 149/149 constraints, State Equation: 1197/1197 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 272/317 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 23/340 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 694/1034 variables, 105/143 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 06:53:31] [INFO ] Deduced a trap composed of 38 places in 711 ms of which 9 ms to minimize.
[2024-06-01 06:53:31] [INFO ] Deduced a trap composed of 37 places in 259 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1034 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1034 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 22/1056 variables, 12/157 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1056 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 139/1195 variables, 44/201 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1195 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 2/1197 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1197 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (OVERLAPS) 2015/3212 variables, 1197/1400 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3212 variables, 23/1423 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3212/3212 variables, and 1423 constraints, problems are : Problem set: 0 solved, 23 unsolved in 45022 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 149/149 constraints, State Equation: 1197/1197 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 2/2 constraints]
After SMT, in 52757ms problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 1197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1197/1197 places, 2015/2015 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1197 transition count 2014
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1196 transition count 2014
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 1196 transition count 2011
Deduced a syphon composed of 3 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 9 place count 1192 transition count 2011
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 1192 transition count 2010
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 12 place count 1190 transition count 2010
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 1190 transition count 2010
Applied a total of 13 rules in 174 ms. Remains 1190 /1197 variables (removed 7) and now considering 2010/2015 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 1190/1197 places, 2010/2015 transitions.
RANDOM walk for 40000 steps (378 resets) in 787 ms. (50 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 118422 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 23
Probabilistic random walk after 118422 steps, saw 25865 distinct states, run finished after 3010 ms. (steps per millisecond=39 ) properties seen :0
// Phase 1: matrix 2010 rows 1190 cols
[2024-06-01 06:54:18] [INFO ] Computed 199 invariants in 38 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 281/326 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 24/350 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 679/1029 variables, 103/142 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1029 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 21/1050 variables, 11/153 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1050 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 138/1188 variables, 44/197 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1188 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 2/1190 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1190 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 2010/3200 variables, 1190/1389 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3200 variables, 0/1389 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 0/3200 variables, 0/1389 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3200/3200 variables, and 1389 constraints, problems are : Problem set: 0 solved, 23 unsolved in 9138 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 147/147 constraints, State Equation: 1190/1190 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 281/326 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/326 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 24/350 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 679/1029 variables, 103/142 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 34 places in 714 ms of which 10 ms to minimize.
[2024-06-01 06:54:30] [INFO ] Deduced a trap composed of 35 places in 703 ms of which 8 ms to minimize.
[2024-06-01 06:54:30] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 3 ms to minimize.
[2024-06-01 06:54:31] [INFO ] Deduced a trap composed of 32 places in 283 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1029 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1029 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 21/1050 variables, 11/157 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1050 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 138/1188 variables, 44/201 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1188 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 2/1190 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1190 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (OVERLAPS) 2010/3200 variables, 1190/1393 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3200 variables, 23/1416 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 73 places in 508 ms of which 7 ms to minimize.
[2024-06-01 06:55:30] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 3 ms to minimize.
[2024-06-01 06:55:31] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 3 ms to minimize.
[2024-06-01 06:55:31] [INFO ] Deduced a trap composed of 45 places in 215 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3200 variables, 4/1420 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3200/3200 variables, and 1420 constraints, problems are : Problem set: 0 solved, 23 unsolved in 75021 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 147/147 constraints, State Equation: 1190/1190 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 8/8 constraints]
After SMT, in 84233ms problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 1190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1190/1190 places, 2010/2010 transitions.
Applied a total of 0 rules in 49 ms. Remains 1190 /1190 variables (removed 0) and now considering 2010/2010 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1190/1190 places, 2010/2010 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1190/1190 places, 2010/2010 transitions.
Applied a total of 0 rules in 48 ms. Remains 1190 /1190 variables (removed 0) and now considering 2010/2010 (removed 0) transitions.
[2024-06-01 06:55:42] [INFO ] Invariant cache hit.
[2024-06-01 06:55:44] [INFO ] Implicit Places using invariants in 1969 ms returned [1, 19, 20, 21, 37, 54, 73, 127, 147, 151, 160, 161, 163, 180, 198, 254, 279, 283, 284, 295, 296, 298, 315, 333, 409, 410, 421, 422, 424, 441, 459, 498, 538, 542, 543, 554, 555, 557, 575, 593, 634, 669, 673, 677, 678, 689, 690, 694, 729, 801, 805, 806, 817, 818, 839, 857, 876, 925, 930, 931, 943, 944, 946, 964, 983, 1054, 1058, 1059, 1062, 1073, 1074, 1075, 1093, 1094, 1098, 1116, 1117, 1118, 1119, 1152]
[2024-06-01 06:55:44] [INFO ] Actually due to overlaps returned [1093, 1075, 54, 180, 315, 441, 557, 575, 839, 964, 37, 163, 424, 694, 946, 160, 295, 298, 421, 554, 689, 817, 943, 1073, 1116, 19, 161, 296, 422, 555, 690, 818, 944, 1074, 1117, 1, 283, 284, 409, 410, 542, 543, 677, 678, 805, 806, 930, 931, 1058, 1059, 1094, 20, 73, 198, 333, 459, 593, 729, 983, 1098, 1118, 21, 857, 876, 925, 1062, 1119, 1152]
Discarding 68 places :
Implicit Place search using SMT only with invariants took 1986 ms to find 68 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1122/1190 places, 2010/2010 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 1111 transition count 1898
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 132 rules applied. Total rules applied 255 place count 999 transition count 1878
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 270 place count 984 transition count 1878
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 270 place count 984 transition count 1841
Deduced a syphon composed of 37 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 75 rules applied. Total rules applied 345 place count 946 transition count 1841
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 9 rules applied. Total rules applied 354 place count 943 transition count 1835
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 360 place count 937 transition count 1835
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 364 place count 933 transition count 1831
Iterating global reduction 5 with 4 rules applied. Total rules applied 368 place count 933 transition count 1831
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 370 place count 933 transition count 1829
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 371 place count 932 transition count 1827
Iterating global reduction 6 with 1 rules applied. Total rules applied 372 place count 932 transition count 1827
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 5 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 480 place count 878 transition count 1773
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 487 place count 871 transition count 1765
Iterating global reduction 6 with 7 rules applied. Total rules applied 494 place count 871 transition count 1765
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 500 place count 871 transition count 1759
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 504 place count 869 transition count 1759
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 505 place count 869 transition count 1758
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 506 place count 869 transition count 1757
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 507 place count 868 transition count 1757
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 8 with 26 rules applied. Total rules applied 533 place count 868 transition count 1731
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 8 with 27 rules applied. Total rules applied 560 place count 841 transition count 1731
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 562 place count 841 transition count 1729
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 580 place count 841 transition count 1729
Applied a total of 580 rules in 871 ms. Remains 841 /1122 variables (removed 281) and now considering 1729/2010 (removed 281) transitions.
// Phase 1: matrix 1729 rows 841 cols
[2024-06-01 06:55:45] [INFO ] Computed 115 invariants in 21 ms
[2024-06-01 06:55:46] [INFO ] Implicit Places using invariants in 1273 ms returned [78, 102, 105, 107, 108, 111, 112, 165, 203, 205, 210, 211, 282, 288, 291, 293, 296, 301, 302, 356, 379, 385, 388, 390, 395, 396, 450, 471, 477, 480, 490, 491, 548, 570, 578, 584, 589, 590, 672, 675, 677, 683, 684, 739, 765, 768, 770, 840]
[2024-06-01 06:55:46] [INFO ] Actually due to overlaps returned [111, 210, 301, 395, 490, 589, 683, 211, 302, 396, 491, 590, 684, 112, 102, 107, 205, 282, 288, 293, 385, 390, 471, 477, 672, 677, 765, 770, 78, 108, 165, 296, 356, 379, 450, 480, 548, 570, 578, 584, 739, 840]
Discarding 42 places :
Implicit Place search using SMT only with invariants took 1289 ms to find 42 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 799/1190 places, 1729/2010 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 783 transition count 1713
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 783 transition count 1713
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 779 transition count 1709
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 779 transition count 1709
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 777 transition count 1707
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 777 transition count 1707
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 776 transition count 1706
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 776 transition count 1706
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 6 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 72 place count 763 transition count 1693
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 73 place count 763 transition count 1692
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 91 place count 763 transition count 1674
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 109 place count 745 transition count 1674
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 745 transition count 1669
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 119 place count 740 transition count 1669
Applied a total of 119 rules in 487 ms. Remains 740 /799 variables (removed 59) and now considering 1669/1729 (removed 60) transitions.
// Phase 1: matrix 1669 rows 740 cols
[2024-06-01 06:55:47] [INFO ] Computed 73 invariants in 28 ms
[2024-06-01 06:55:48] [INFO ] Implicit Places using invariants in 764 ms returned []
[2024-06-01 06:55:48] [INFO ] Invariant cache hit.
[2024-06-01 06:55:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:55:51] [INFO ] Implicit Places using invariants and state equation in 2970 ms returned []
Implicit Place search using SMT with State Equation took 3745 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 740/1190 places, 1669/2010 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8426 ms. Remains : 740/1190 places, 1669/2010 transitions.
[2024-06-01 06:55:51] [INFO ] Flatten gal took : 135 ms
[2024-06-01 06:55:51] [INFO ] Flatten gal took : 147 ms
[2024-06-01 06:55:51] [INFO ] Input system was already deterministic with 4041 transitions.
Computed a total of 134 stabilizing places and 134 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 3261/3261 places, 4041/4041 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 3244 transition count 4017
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 3244 transition count 4017
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 3244 transition count 4015
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 3236 transition count 3990
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 3236 transition count 3990
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 3233 transition count 3987
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 3233 transition count 3987
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 3232 transition count 3979
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 3232 transition count 3979
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 3231 transition count 3971
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 3231 transition count 3971
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 3230 transition count 3970
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 3230 transition count 3970
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 3229 transition count 3962
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 3229 transition count 3962
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 3228 transition count 3954
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 3228 transition count 3954
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 3227 transition count 3953
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 3227 transition count 3953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 3226 transition count 3945
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 3226 transition count 3945
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 3225 transition count 3937
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 3225 transition count 3937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 3224 transition count 3936
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 3224 transition count 3936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 3223 transition count 3928
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 3223 transition count 3928
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 3222 transition count 3920
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 3222 transition count 3920
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 3221 transition count 3919
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 3221 transition count 3919
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 3220 transition count 3911
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 3220 transition count 3911
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 3219 transition count 3903
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 3219 transition count 3903
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 3218 transition count 3902
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 3218 transition count 3902
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 3217 transition count 3894
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 3217 transition count 3894
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 3216 transition count 3886
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 3216 transition count 3886
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 3215 transition count 3885
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 3215 transition count 3885
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 3214 transition count 3877
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 3214 transition count 3877
Applied a total of 96 rules in 7384 ms. Remains 3214 /3261 variables (removed 47) and now considering 3877/4041 (removed 164) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7385 ms. Remains : 3214/3261 places, 3877/4041 transitions.
[2024-06-01 06:55:59] [INFO ] Flatten gal took : 129 ms
[2024-06-01 06:55:59] [INFO ] Flatten gal took : 125 ms
[2024-06-01 06:55:59] [INFO ] Input system was already deterministic with 3877 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3261/3261 places, 4041/4041 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 616 transitions
Trivial Post-agglo rules discarded 616 transitions
Performed 616 trivial Post agglomeration. Transition count delta: 616
Iterating post reduction 0 with 616 rules applied. Total rules applied 616 place count 3260 transition count 3424
Reduce places removed 616 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 622 rules applied. Total rules applied 1238 place count 2644 transition count 3418
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1241 place count 2641 transition count 3418
Performed 871 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 871 Pre rules applied. Total rules applied 1241 place count 2641 transition count 2547
Deduced a syphon composed of 871 places in 7 ms
Ensure Unique test removed 84 places
Reduce places removed 955 places and 0 transitions.
Iterating global reduction 3 with 1826 rules applied. Total rules applied 3067 place count 1686 transition count 2547
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 60 rules applied. Total rules applied 3127 place count 1678 transition count 2495
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 3179 place count 1626 transition count 2495
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 3179 place count 1626 transition count 2462
Deduced a syphon composed of 33 places in 7 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 99 rules applied. Total rules applied 3278 place count 1560 transition count 2462
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3278 place count 1560 transition count 2430
Deduced a syphon composed of 32 places in 7 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 3342 place count 1528 transition count 2430
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 3350 place count 1520 transition count 2415
Iterating global reduction 5 with 8 rules applied. Total rules applied 3358 place count 1520 transition count 2415
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 3358 place count 1520 transition count 2411
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 3366 place count 1516 transition count 2411
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 3369 place count 1513 transition count 2391
Iterating global reduction 5 with 3 rules applied. Total rules applied 3372 place count 1513 transition count 2391
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3373 place count 1512 transition count 2383
Iterating global reduction 5 with 1 rules applied. Total rules applied 3374 place count 1512 transition count 2383
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3375 place count 1511 transition count 2375
Iterating global reduction 5 with 1 rules applied. Total rules applied 3376 place count 1511 transition count 2375
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3377 place count 1510 transition count 2367
Iterating global reduction 5 with 1 rules applied. Total rules applied 3378 place count 1510 transition count 2367
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3379 place count 1509 transition count 2359
Iterating global reduction 5 with 1 rules applied. Total rules applied 3380 place count 1509 transition count 2359
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3381 place count 1508 transition count 2351
Iterating global reduction 5 with 1 rules applied. Total rules applied 3382 place count 1508 transition count 2351
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3383 place count 1507 transition count 2343
Iterating global reduction 5 with 1 rules applied. Total rules applied 3384 place count 1507 transition count 2343
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3385 place count 1506 transition count 2335
Iterating global reduction 5 with 1 rules applied. Total rules applied 3386 place count 1506 transition count 2335
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3387 place count 1505 transition count 2327
Iterating global reduction 5 with 1 rules applied. Total rules applied 3388 place count 1505 transition count 2327
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3389 place count 1504 transition count 2319
Iterating global reduction 5 with 1 rules applied. Total rules applied 3390 place count 1504 transition count 2319
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3391 place count 1503 transition count 2311
Iterating global reduction 5 with 1 rules applied. Total rules applied 3392 place count 1503 transition count 2311
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3393 place count 1502 transition count 2303
Iterating global reduction 5 with 1 rules applied. Total rules applied 3394 place count 1502 transition count 2303
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3395 place count 1501 transition count 2295
Iterating global reduction 5 with 1 rules applied. Total rules applied 3396 place count 1501 transition count 2295
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3397 place count 1500 transition count 2287
Iterating global reduction 5 with 1 rules applied. Total rules applied 3398 place count 1500 transition count 2287
Performed 209 Post agglomeration using F-continuation condition.Transition count delta: 209
Deduced a syphon composed of 209 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 5 with 419 rules applied. Total rules applied 3817 place count 1290 transition count 2078
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 3820 place count 1287 transition count 2075
Iterating global reduction 5 with 3 rules applied. Total rules applied 3823 place count 1287 transition count 2075
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3823 place count 1287 transition count 2074
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3825 place count 1286 transition count 2074
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3826 place count 1285 transition count 2073
Iterating global reduction 5 with 1 rules applied. Total rules applied 3827 place count 1285 transition count 2073
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3829 place count 1283 transition count 2071
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 5 with 24 rules applied. Total rules applied 3853 place count 1267 transition count 2063
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 3861 place count 1259 transition count 2063
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 32 Pre rules applied. Total rules applied 3861 place count 1259 transition count 2031
Deduced a syphon composed of 32 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 65 rules applied. Total rules applied 3926 place count 1226 transition count 2031
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 7 with 16 rules applied. Total rules applied 3942 place count 1210 transition count 2031
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3942 place count 1210 transition count 2030
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3944 place count 1209 transition count 2030
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 3976 place count 1193 transition count 2014
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 3991 place count 1178 transition count 1999
Iterating global reduction 8 with 15 rules applied. Total rules applied 4006 place count 1178 transition count 1999
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 4013 place count 1171 transition count 1992
Iterating global reduction 8 with 7 rules applied. Total rules applied 4020 place count 1171 transition count 1992
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 4027 place count 1171 transition count 1985
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 7 Pre rules applied. Total rules applied 4027 place count 1171 transition count 1978
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 4041 place count 1164 transition count 1978
Applied a total of 4041 rules in 2127 ms. Remains 1164 /3261 variables (removed 2097) and now considering 1978/4041 (removed 2063) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2128 ms. Remains : 1164/3261 places, 1978/4041 transitions.
[2024-06-01 06:56:01] [INFO ] Flatten gal took : 96 ms
[2024-06-01 06:56:02] [INFO ] Flatten gal took : 80 ms
[2024-06-01 06:56:02] [INFO ] Input system was already deterministic with 1978 transitions.
RANDOM walk for 40000 steps (296 resets) in 353 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (50 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 152323 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 1
Probabilistic random walk after 152323 steps, saw 62383 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
// Phase 1: matrix 1978 rows 1164 cols
[2024-06-01 06:56:05] [INFO ] Computed 186 invariants in 25 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/73 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/106 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 451/557 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 91/648 variables, 19/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/668 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/668 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 368/1036 variables, 60/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1036 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 54/1090 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1090 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1096 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1096 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 68/1164 variables, 16/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1164 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1978/3142 variables, 1164/1350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3142 variables, 0/1350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/3142 variables, 0/1350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3142/3142 variables, and 1350 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2141 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 144/144 constraints, State Equation: 1164/1164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/73 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/106 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 451/557 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 91/648 variables, 19/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/668 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:56:08] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/668 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/668 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 368/1036 variables, 60/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1036 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 54/1090 variables, 7/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1090 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1096 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1096 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 68/1164 variables, 16/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1164 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3142/3142 variables, and 1351 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2455 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 144/144 constraints, State Equation: 1164/1164 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 4637ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 1 out of 1164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1164/1164 places, 1978/1978 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 1124 transition count 1938
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 1123 transition count 1944
Free-agglomeration rule applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 99 place count 1123 transition count 1927
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 116 place count 1106 transition count 1927
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 123 place count 1106 transition count 1920
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 130 place count 1099 transition count 1920
Applied a total of 130 rules in 410 ms. Remains 1099 /1164 variables (removed 65) and now considering 1920/1978 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 1099/1164 places, 1920/1978 transitions.
RANDOM walk for 4000000 steps (41944 resets) in 19643 ms. (203 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (5111 resets) in 7729 ms. (517 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1534208 steps, run timeout after 21001 ms. (steps per millisecond=73 ) properties seen :0 out of 1
Probabilistic random walk after 1534208 steps, saw 413121 distinct states, run finished after 21001 ms. (steps per millisecond=73 ) properties seen :0
// Phase 1: matrix 1920 rows 1099 cols
[2024-06-01 06:56:38] [INFO ] Computed 186 invariants in 30 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/62 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/64 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 86/150 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/174 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/176 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/176 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 93/269 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/293 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/293 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/295 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/295 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 93/388 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/388 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 24/412 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/412 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/414 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/414 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 94/508 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/508 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 26/534 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/534 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/536 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/536 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 94/630 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/630 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 24/654 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/654 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 2/656 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/656 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 93/749 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/749 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 24/773 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/773 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 2/775 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/775 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 91/866 variables, 14/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/866 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 39/905 variables, 5/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/905 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 15/920 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/920 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 100/1020 variables, 13/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1020 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 38/1058 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1058 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 2/1060 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1060 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 37/1097 variables, 11/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:56:41] [INFO ] Deduced a trap composed of 36 places in 1363 ms of which 14 ms to minimize.
At refinement iteration 56 (INCLUDED_ONLY) 0/1097 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1097 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 1/1098 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1098 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 1/1099 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1099 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 1920/3019 variables, 1099/1286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/3019 variables, 0/1286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 0/3019 variables, 0/1286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3019/3019 variables, and 1286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4652 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 130/130 constraints, State Equation: 1099/1099 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/62 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/64 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 86/150 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/174 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/176 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/176 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 93/269 variables, 14/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/269 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/293 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/293 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/295 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/295 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 93/388 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/388 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 24/412 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/412 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/414 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/414 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 94/508 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/508 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 26/534 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/534 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/536 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/536 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 94/630 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/630 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 24/654 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/654 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 2/656 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/656 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 93/749 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/749 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 24/773 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/773 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 2/775 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/775 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 91/866 variables, 14/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/866 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 39/905 variables, 5/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/905 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 15/920 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/920 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 100/1020 variables, 13/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1020 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 38/1058 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1058 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 2/1060 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1060 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 37/1097 variables, 11/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1097 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1097 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 1/1098 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1098 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 1/1099 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1099 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 1920/3019 variables, 1099/1286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/3019 variables, 1/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/3019 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 0/3019 variables, 0/1287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3019/3019 variables, and 1287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3174 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 130/130 constraints, State Equation: 1099/1099 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 7876ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 86 ms.
Support contains 1 out of 1099 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1099/1099 places, 1920/1920 transitions.
Applied a total of 0 rules in 53 ms. Remains 1099 /1099 variables (removed 0) and now considering 1920/1920 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1099/1099 places, 1920/1920 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1099/1099 places, 1920/1920 transitions.
Applied a total of 0 rules in 50 ms. Remains 1099 /1099 variables (removed 0) and now considering 1920/1920 (removed 0) transitions.
[2024-06-01 06:56:46] [INFO ] Invariant cache hit.
[2024-06-01 06:56:48] [INFO ] Implicit Places using invariants in 1675 ms returned [1, 18, 19, 20, 36, 53, 71, 91, 140, 149, 150, 152, 169, 187, 207, 256, 257, 268, 269, 271, 288, 306, 326, 375, 376, 387, 388, 390, 407, 425, 445, 494, 495, 506, 507, 509, 526, 544, 613, 617, 618, 629, 630, 632, 649, 667, 686, 736, 737, 748, 749, 751, 768, 786, 805, 855, 856, 867, 868, 870, 887, 905, 924, 974, 975, 978, 989, 990, 991, 1009, 1013, 1031, 1032, 1033, 1034, 1061]
[2024-06-01 06:56:48] [INFO ] Actually due to overlaps returned [1009, 991, 53, 169, 288, 407, 526, 649, 768, 887, 509, 36, 149, 152, 268, 271, 387, 390, 506, 629, 632, 748, 751, 867, 870, 989, 1031, 18, 150, 269, 388, 507, 630, 749, 868, 990, 1032, 1, 256, 257, 375, 376, 494, 495, 617, 618, 736, 737, 855, 856, 974, 975, 19, 544, 1013, 1033, 20, 71, 91, 187, 207, 306, 326, 425, 445, 667, 686, 786, 805, 905, 924, 978, 1034, 1061]
Discarding 74 places :
Implicit Place search using SMT only with invariants took 1679 ms to find 74 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1025/1099 places, 1920/1920 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 1024 transition count 1789
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 139 rules applied. Total rules applied 271 place count 893 transition count 1781
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 271 place count 893 transition count 1742
Deduced a syphon composed of 39 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 79 rules applied. Total rules applied 350 place count 853 transition count 1742
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 362 place count 849 transition count 1734
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 370 place count 841 transition count 1734
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 375 place count 836 transition count 1729
Iterating global reduction 4 with 5 rules applied. Total rules applied 380 place count 836 transition count 1729
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 383 place count 836 transition count 1726
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 384 place count 835 transition count 1724
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 835 transition count 1724
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 5 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 5 with 124 rules applied. Total rules applied 509 place count 773 transition count 1662
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 510 place count 772 transition count 1661
Iterating global reduction 5 with 1 rules applied. Total rules applied 511 place count 772 transition count 1661
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 512 place count 772 transition count 1660
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 516 place count 770 transition count 1661
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 6 with 24 rules applied. Total rules applied 540 place count 770 transition count 1637
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 565 place count 745 transition count 1637
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 566 place count 745 transition count 1636
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 7 with 24 rules applied. Total rules applied 590 place count 745 transition count 1636
Applied a total of 590 rules in 526 ms. Remains 745 /1025 variables (removed 280) and now considering 1636/1920 (removed 284) transitions.
// Phase 1: matrix 1636 rows 745 cols
[2024-06-01 06:56:48] [INFO ] Computed 105 invariants in 18 ms
[2024-06-01 06:56:49] [INFO ] Implicit Places using invariants in 1088 ms returned [87, 93, 96, 98, 99, 102, 103, 169, 175, 178, 180, 185, 186, 252, 258, 261, 263, 268, 269, 335, 341, 344, 346, 351, 352, 404, 421, 427, 430, 432, 437, 438, 504, 510, 513, 515, 520, 521, 587, 593, 596, 598, 603, 604, 670, 676, 679, 681]
[2024-06-01 06:56:50] [INFO ] Actually due to overlaps returned [102, 185, 268, 351, 437, 520, 603, 103, 186, 269, 352, 438, 521, 604, 87, 93, 98, 169, 175, 180, 252, 258, 263, 335, 341, 346, 421, 427, 432, 504, 510, 515, 587, 593, 598, 670, 676, 681, 99, 404]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1099 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 705/1099 places, 1636/1920 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 673 transition count 1604
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 673 transition count 1604
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 72 place count 665 transition count 1596
Iterating global reduction 0 with 8 rules applied. Total rules applied 80 place count 665 transition count 1596
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 98 place count 656 transition count 1587
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 122 place count 656 transition count 1563
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 146 place count 632 transition count 1563
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 147 place count 632 transition count 1562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 148 place count 631 transition count 1562
Applied a total of 148 rules in 163 ms. Remains 631 /705 variables (removed 74) and now considering 1562/1636 (removed 74) transitions.
// Phase 1: matrix 1562 rows 631 cols
[2024-06-01 06:56:50] [INFO ] Computed 65 invariants in 26 ms
[2024-06-01 06:56:50] [INFO ] Implicit Places using invariants in 770 ms returned []
[2024-06-01 06:56:50] [INFO ] Invariant cache hit.
[2024-06-01 06:56:53] [INFO ] Implicit Places using invariants and state equation in 2627 ms returned []
Implicit Place search using SMT with State Equation took 3403 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 631/1099 places, 1562/1920 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6921 ms. Remains : 631/1099 places, 1562/1920 transitions.
RANDOM walk for 4000000 steps (67547 resets) in 13849 ms. (288 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (11270 resets) in 4753 ms. (841 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1477564 steps, run timeout after 12001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 1477564 steps, saw 257497 distinct states, run finished after 12001 ms. (steps per millisecond=123 ) properties seen :0
[2024-06-01 06:57:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/101 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 136/239 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/241 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 136/377 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/392 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 156/548 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/588 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/588 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 43/631 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2193/2193 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1436 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/101 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 136/239 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/241 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 136/377 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/392 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 156/548 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/588 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/588 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 43/631 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2193 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2193/2193 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1280 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2726ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 48 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 631/631 places, 1562/1562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 47 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2024-06-01 06:57:13] [INFO ] Invariant cache hit.
[2024-06-01 06:57:14] [INFO ] Implicit Places using invariants in 1053 ms returned []
[2024-06-01 06:57:14] [INFO ] Invariant cache hit.
[2024-06-01 06:57:17] [INFO ] Implicit Places using invariants and state equation in 3406 ms returned []
Implicit Place search using SMT with State Equation took 4462 ms to find 0 implicit places.
[2024-06-01 06:57:17] [INFO ] Redundant transitions in 221 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:57:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 0/0 constraints]
After SMT, in 61495ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 61524ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66274 ms. Remains : 631/631 places, 1562/1562 transitions.
RANDOM walk for 400000 steps (6763 resets) in 3353 ms. (119 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-06-01 06:58:20] [INFO ] Invariant cache hit.
[2024-06-01 06:58:20] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 06:58:20] [INFO ] [Real]Absence check using 12 positive and 53 generalized place invariants in 29 ms returned sat
[2024-06-01 06:58:21] [INFO ] After 943ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:58:21] [INFO ] After 1035ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:58:21] [INFO ] After 1192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:58:21] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 06:58:21] [INFO ] [Nat]Absence check using 12 positive and 53 generalized place invariants in 27 ms returned sat
[2024-06-01 06:58:22] [INFO ] After 860ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:58:22] [INFO ] After 971ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:58:22] [INFO ] After 1115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (67172 resets) in 16026 ms. (249 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (11190 resets) in 4743 ms. (843 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1780613 steps, run timeout after 15001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 1780613 steps, saw 306816 distinct states, run finished after 15001 ms. (steps per millisecond=118 ) properties seen :0
[2024-06-01 06:58:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/101 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 136/239 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/241 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 136/377 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/392 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 156/548 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/588 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/588 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 43/631 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2193/2193 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1887 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/101 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 136/239 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/241 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 136/377 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/392 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 156/548 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/588 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/588 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 43/631 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2193 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2193/2193 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1138 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3045ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 48 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 631/631 places, 1562/1562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 48 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2024-06-01 06:58:46] [INFO ] Invariant cache hit.
[2024-06-01 06:58:47] [INFO ] Implicit Places using invariants in 964 ms returned []
[2024-06-01 06:58:47] [INFO ] Invariant cache hit.
[2024-06-01 06:58:50] [INFO ] Implicit Places using invariants and state equation in 3156 ms returned []
Implicit Place search using SMT with State Equation took 4130 ms to find 0 implicit places.
[2024-06-01 06:58:50] [INFO ] Redundant transitions in 98 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 06:58:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 0/0 constraints]
After SMT, in 61540ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 61577ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65871 ms. Remains : 631/631 places, 1562/1562 transitions.
RANDOM walk for 400000 steps (6777 resets) in 2055 ms. (194 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-06-01 06:59:52] [INFO ] Invariant cache hit.
[2024-06-01 06:59:52] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-01 06:59:52] [INFO ] [Real]Absence check using 12 positive and 53 generalized place invariants in 45 ms returned sat
[2024-06-01 06:59:54] [INFO ] After 1174ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:59:54] [INFO ] After 1286ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:59:54] [INFO ] After 1518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:59:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 06:59:54] [INFO ] [Nat]Absence check using 12 positive and 53 generalized place invariants in 54 ms returned sat
[2024-06-01 06:59:55] [INFO ] After 1312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:59:55] [INFO ] After 1448ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:59:55] [INFO ] After 1677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (696 resets) in 311 ms. (128 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (116 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 293522 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 1
Probabilistic random walk after 293522 steps, saw 63428 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
[2024-06-01 06:59:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/101 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 136/239 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/241 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 136/377 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/392 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 156/548 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/588 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/588 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 43/631 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2193/2193 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1935 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/101 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 136/239 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/241 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 136/377 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/392 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 156/548 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/588 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/588 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 43/631 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2193 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2193/2193 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1437 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3381ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 48 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 631/631 places, 1562/1562 transitions.
RANDOM walk for 40000 steps (633 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (104 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 274650 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 274650 steps, saw 60153 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2024-06-01 07:00:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/101 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 136/239 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/241 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 136/377 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/392 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 156/548 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/588 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/588 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 43/631 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2193/2193 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2071 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/101 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 136/239 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/241 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 136/377 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/392 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 156/548 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/588 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/588 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 43/631 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2193 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2193/2193 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1495 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3576ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 48 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 631/631 places, 1562/1562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 47 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2024-06-01 07:00:09] [INFO ] Invariant cache hit.
[2024-06-01 07:00:10] [INFO ] Implicit Places using invariants in 1323 ms returned []
[2024-06-01 07:00:10] [INFO ] Invariant cache hit.
[2024-06-01 07:00:13] [INFO ] Implicit Places using invariants and state equation in 3101 ms returned []
Implicit Place search using SMT with State Equation took 4434 ms to find 0 implicit places.
[2024-06-01 07:00:13] [INFO ] Redundant transitions in 71 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:00:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 0/0 constraints]
After SMT, in 61631ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 61669ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66235 ms. Remains : 631/631 places, 1562/1562 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 48 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 07:01:15] [INFO ] Invariant cache hit.
[2024-06-01 07:01:15] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 07:01:15] [INFO ] [Real]Absence check using 12 positive and 53 generalized place invariants in 53 ms returned sat
[2024-06-01 07:01:17] [INFO ] After 1454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:01:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 07:01:17] [INFO ] [Nat]Absence check using 12 positive and 53 generalized place invariants in 36 ms returned sat
[2024-06-01 07:01:18] [INFO ] After 1302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:01:18] [INFO ] After 1417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:01:18] [INFO ] After 1672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 3199 ms.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 29 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 07:01:18] [INFO ] Invariant cache hit.
[2024-06-01 07:01:18] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 07:01:19] [INFO ] [Real]Absence check using 12 positive and 53 generalized place invariants in 55 ms returned sat
[2024-06-01 07:01:20] [INFO ] After 1494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:01:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 07:01:20] [INFO ] [Nat]Absence check using 12 positive and 53 generalized place invariants in 50 ms returned sat
[2024-06-01 07:01:21] [INFO ] After 1214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:01:21] [INFO ] After 1303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:01:21] [INFO ] After 1628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 3171 ms.
Starting structural reductions in LTL mode, iteration 0 : 3261/3261 places, 4041/4041 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3245 transition count 4018
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3245 transition count 4018
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 3245 transition count 4017
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 3237 transition count 3992
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 3237 transition count 3992
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 3234 transition count 3989
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 3234 transition count 3989
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 3233 transition count 3981
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 3233 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 3232 transition count 3973
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 3232 transition count 3973
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 3231 transition count 3972
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 3231 transition count 3972
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 3230 transition count 3964
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 3230 transition count 3964
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 3229 transition count 3956
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 3229 transition count 3956
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 3228 transition count 3955
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 3228 transition count 3955
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 3227 transition count 3947
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 3227 transition count 3947
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 3226 transition count 3939
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 3226 transition count 3939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 3225 transition count 3938
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 3225 transition count 3938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 3224 transition count 3930
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 3224 transition count 3930
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 3223 transition count 3922
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 3223 transition count 3922
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 3222 transition count 3921
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 3222 transition count 3921
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 3221 transition count 3913
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 3221 transition count 3913
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 3220 transition count 3905
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 3220 transition count 3905
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 3219 transition count 3904
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 3219 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 3218 transition count 3896
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 3218 transition count 3896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 3217 transition count 3888
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 3217 transition count 3888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 3216 transition count 3887
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 3216 transition count 3887
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 3215 transition count 3879
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 3215 transition count 3879
Applied a total of 93 rules in 9796 ms. Remains 3215 /3261 variables (removed 46) and now considering 3879/4041 (removed 162) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9799 ms. Remains : 3215/3261 places, 3879/4041 transitions.
[2024-06-01 07:01:31] [INFO ] Flatten gal took : 115 ms
[2024-06-01 07:01:32] [INFO ] Flatten gal took : 173 ms
[2024-06-01 07:01:32] [INFO ] Input system was already deterministic with 3879 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3261/3261 places, 4041/4041 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3247 transition count 4027
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3247 transition count 4027
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 3247 transition count 4025
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 3241 transition count 4014
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 3241 transition count 4014
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 3240 transition count 4013
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 3240 transition count 4013
Applied a total of 44 rules in 1510 ms. Remains 3240 /3261 variables (removed 21) and now considering 4013/4041 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1512 ms. Remains : 3240/3261 places, 4013/4041 transitions.
[2024-06-01 07:01:34] [INFO ] Flatten gal took : 115 ms
[2024-06-01 07:01:34] [INFO ] Flatten gal took : 133 ms
[2024-06-01 07:01:34] [INFO ] Input system was already deterministic with 4013 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3261/3261 places, 4041/4041 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 614 transitions
Trivial Post-agglo rules discarded 614 transitions
Performed 614 trivial Post agglomeration. Transition count delta: 614
Iterating post reduction 0 with 614 rules applied. Total rules applied 614 place count 3260 transition count 3426
Reduce places removed 614 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 620 rules applied. Total rules applied 1234 place count 2646 transition count 3420
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 1238 place count 2643 transition count 3419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1239 place count 2642 transition count 3419
Performed 866 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 866 Pre rules applied. Total rules applied 1239 place count 2642 transition count 2553
Deduced a syphon composed of 866 places in 7 ms
Ensure Unique test removed 83 places
Reduce places removed 949 places and 0 transitions.
Iterating global reduction 4 with 1815 rules applied. Total rules applied 3054 place count 1693 transition count 2553
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 4 with 60 rules applied. Total rules applied 3114 place count 1685 transition count 2501
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 3166 place count 1633 transition count 2501
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 3166 place count 1633 transition count 2469
Deduced a syphon composed of 32 places in 8 ms
Ensure Unique test removed 32 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 3262 place count 1569 transition count 2469
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 31 Pre rules applied. Total rules applied 3262 place count 1569 transition count 2438
Deduced a syphon composed of 31 places in 7 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 3324 place count 1538 transition count 2438
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 3332 place count 1530 transition count 2423
Iterating global reduction 6 with 8 rules applied. Total rules applied 3340 place count 1530 transition count 2423
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 3340 place count 1530 transition count 2419
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 3348 place count 1526 transition count 2419
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 3351 place count 1523 transition count 2399
Iterating global reduction 6 with 3 rules applied. Total rules applied 3354 place count 1523 transition count 2399
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3355 place count 1522 transition count 2391
Iterating global reduction 6 with 1 rules applied. Total rules applied 3356 place count 1522 transition count 2391
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3357 place count 1521 transition count 2383
Iterating global reduction 6 with 1 rules applied. Total rules applied 3358 place count 1521 transition count 2383
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3359 place count 1520 transition count 2375
Iterating global reduction 6 with 1 rules applied. Total rules applied 3360 place count 1520 transition count 2375
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3361 place count 1519 transition count 2367
Iterating global reduction 6 with 1 rules applied. Total rules applied 3362 place count 1519 transition count 2367
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3363 place count 1518 transition count 2359
Iterating global reduction 6 with 1 rules applied. Total rules applied 3364 place count 1518 transition count 2359
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3365 place count 1517 transition count 2351
Iterating global reduction 6 with 1 rules applied. Total rules applied 3366 place count 1517 transition count 2351
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3367 place count 1516 transition count 2343
Iterating global reduction 6 with 1 rules applied. Total rules applied 3368 place count 1516 transition count 2343
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3369 place count 1515 transition count 2335
Iterating global reduction 6 with 1 rules applied. Total rules applied 3370 place count 1515 transition count 2335
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3371 place count 1514 transition count 2327
Iterating global reduction 6 with 1 rules applied. Total rules applied 3372 place count 1514 transition count 2327
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3373 place count 1513 transition count 2319
Iterating global reduction 6 with 1 rules applied. Total rules applied 3374 place count 1513 transition count 2319
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3375 place count 1512 transition count 2311
Iterating global reduction 6 with 1 rules applied. Total rules applied 3376 place count 1512 transition count 2311
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3377 place count 1511 transition count 2303
Iterating global reduction 6 with 1 rules applied. Total rules applied 3378 place count 1511 transition count 2303
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3379 place count 1510 transition count 2295
Iterating global reduction 6 with 1 rules applied. Total rules applied 3380 place count 1510 transition count 2295
Performed 209 Post agglomeration using F-continuation condition.Transition count delta: 209
Deduced a syphon composed of 209 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 6 with 419 rules applied. Total rules applied 3799 place count 1300 transition count 2086
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3803 place count 1296 transition count 2082
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3808 place count 1295 transition count 2082
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3808 place count 1295 transition count 2081
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3810 place count 1294 transition count 2081
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 3812 place count 1292 transition count 2079
Iterating global reduction 6 with 2 rules applied. Total rules applied 3814 place count 1292 transition count 2079
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 6 with 2 rules applied. Total rules applied 3816 place count 1292 transition count 2077
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3817 place count 1291 transition count 2077
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3817 place count 1291 transition count 2076
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3819 place count 1290 transition count 2076
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3821 place count 1288 transition count 2074
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 8 with 24 rules applied. Total rules applied 3845 place count 1272 transition count 2066
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 3853 place count 1264 transition count 2066
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 32 Pre rules applied. Total rules applied 3853 place count 1264 transition count 2034
Deduced a syphon composed of 32 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 65 rules applied. Total rules applied 3918 place count 1231 transition count 2034
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 10 with 16 rules applied. Total rules applied 3934 place count 1215 transition count 2034
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 3934 place count 1215 transition count 2033
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3936 place count 1214 transition count 2033
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 32 rules applied. Total rules applied 3968 place count 1198 transition count 2017
Discarding 15 places :
Symmetric choice reduction at 11 with 15 rule applications. Total rules 3983 place count 1183 transition count 2002
Iterating global reduction 11 with 15 rules applied. Total rules applied 3998 place count 1183 transition count 2002
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 4005 place count 1176 transition count 1995
Iterating global reduction 11 with 7 rules applied. Total rules applied 4012 place count 1176 transition count 1995
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 4019 place count 1176 transition count 1988
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 7 Pre rules applied. Total rules applied 4019 place count 1176 transition count 1981
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 11 with 14 rules applied. Total rules applied 4033 place count 1169 transition count 1981
Applied a total of 4033 rules in 2022 ms. Remains 1169 /3261 variables (removed 2092) and now considering 1981/4041 (removed 2060) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2023 ms. Remains : 1169/3261 places, 1981/4041 transitions.
[2024-06-01 07:01:36] [INFO ] Flatten gal took : 90 ms
[2024-06-01 07:01:36] [INFO ] Flatten gal took : 106 ms
[2024-06-01 07:01:36] [INFO ] Input system was already deterministic with 1981 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3261/3261 places, 4041/4041 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3246 transition count 4019
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3246 transition count 4019
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 3246 transition count 4017
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 3240 transition count 3994
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 3240 transition count 3994
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 3237 transition count 3991
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 3237 transition count 3991
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 3236 transition count 3983
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 3236 transition count 3983
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 3235 transition count 3975
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 3235 transition count 3975
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 3234 transition count 3974
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 3234 transition count 3974
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 3233 transition count 3966
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 3233 transition count 3966
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 3232 transition count 3958
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 3232 transition count 3958
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 3231 transition count 3957
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 3231 transition count 3957
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 3230 transition count 3949
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 3230 transition count 3949
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 3229 transition count 3941
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 3229 transition count 3941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 3228 transition count 3940
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 3228 transition count 3940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 3227 transition count 3932
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 3227 transition count 3932
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 3226 transition count 3924
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 3226 transition count 3924
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 3225 transition count 3923
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 3225 transition count 3923
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 3224 transition count 3915
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 3224 transition count 3915
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 3223 transition count 3907
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 3223 transition count 3907
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 3222 transition count 3906
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 3222 transition count 3906
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 3221 transition count 3898
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 3221 transition count 3898
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 3220 transition count 3890
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 3220 transition count 3890
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 3219 transition count 3889
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 3219 transition count 3889
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 3218 transition count 3881
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 3218 transition count 3881
Applied a total of 88 rules in 7427 ms. Remains 3218 /3261 variables (removed 43) and now considering 3881/4041 (removed 160) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7427 ms. Remains : 3218/3261 places, 3881/4041 transitions.
[2024-06-01 07:01:44] [INFO ] Flatten gal took : 94 ms
[2024-06-01 07:01:44] [INFO ] Flatten gal took : 105 ms
[2024-06-01 07:01:44] [INFO ] Input system was already deterministic with 3881 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3261/3261 places, 4041/4041 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 3244 transition count 4017
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 3244 transition count 4017
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 3244 transition count 4015
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 3236 transition count 3990
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 3236 transition count 3990
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 3233 transition count 3987
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 3233 transition count 3987
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 3232 transition count 3979
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 3232 transition count 3979
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 3231 transition count 3971
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 3231 transition count 3971
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 3230 transition count 3970
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 3230 transition count 3970
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 3229 transition count 3962
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 3229 transition count 3962
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 3228 transition count 3954
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 3228 transition count 3954
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 3227 transition count 3953
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 3227 transition count 3953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 3226 transition count 3945
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 3226 transition count 3945
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 3225 transition count 3937
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 3225 transition count 3937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 3224 transition count 3936
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 3224 transition count 3936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 3223 transition count 3928
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 3223 transition count 3928
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 3222 transition count 3920
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 3222 transition count 3920
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 3221 transition count 3919
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 3221 transition count 3919
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 3220 transition count 3911
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 3220 transition count 3911
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 3219 transition count 3903
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 3219 transition count 3903
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 3218 transition count 3902
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 3218 transition count 3902
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 3217 transition count 3894
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 3217 transition count 3894
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 3216 transition count 3886
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 3216 transition count 3886
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 3215 transition count 3885
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 3215 transition count 3885
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 3214 transition count 3877
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 3214 transition count 3877
Applied a total of 96 rules in 7534 ms. Remains 3214 /3261 variables (removed 47) and now considering 3877/4041 (removed 164) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7535 ms. Remains : 3214/3261 places, 3877/4041 transitions.
[2024-06-01 07:01:52] [INFO ] Flatten gal took : 92 ms
[2024-06-01 07:01:52] [INFO ] Flatten gal took : 104 ms
[2024-06-01 07:01:52] [INFO ] Input system was already deterministic with 3877 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3261/3261 places, 4041/4041 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 3244 transition count 4017
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 3244 transition count 4017
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 3244 transition count 4015
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 3236 transition count 3990
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 3236 transition count 3990
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 3233 transition count 3987
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 3233 transition count 3987
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 3232 transition count 3979
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 3232 transition count 3979
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 3231 transition count 3971
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 3231 transition count 3971
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 3230 transition count 3970
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 3230 transition count 3970
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 3229 transition count 3962
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 3229 transition count 3962
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 3228 transition count 3954
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 3228 transition count 3954
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 3227 transition count 3953
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 3227 transition count 3953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 3226 transition count 3945
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 3226 transition count 3945
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 3225 transition count 3937
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 3225 transition count 3937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 3224 transition count 3936
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 3224 transition count 3936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 3223 transition count 3928
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 3223 transition count 3928
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 3222 transition count 3920
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 3222 transition count 3920
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 3221 transition count 3919
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 3221 transition count 3919
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 3220 transition count 3911
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 3220 transition count 3911
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 3219 transition count 3903
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 3219 transition count 3903
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 3218 transition count 3902
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 3218 transition count 3902
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 3217 transition count 3894
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 3217 transition count 3894
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 3216 transition count 3886
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 3216 transition count 3886
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 3215 transition count 3885
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 3215 transition count 3885
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 3214 transition count 3877
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 3214 transition count 3877
Applied a total of 96 rules in 8089 ms. Remains 3214 /3261 variables (removed 47) and now considering 3877/4041 (removed 164) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8089 ms. Remains : 3214/3261 places, 3877/4041 transitions.
[2024-06-01 07:02:00] [INFO ] Flatten gal took : 100 ms
[2024-06-01 07:02:00] [INFO ] Flatten gal took : 114 ms
[2024-06-01 07:02:01] [INFO ] Input system was already deterministic with 3877 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3261/3261 places, 4041/4041 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3247 transition count 4020
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3247 transition count 4020
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 3247 transition count 4018
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 3241 transition count 4000
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 3241 transition count 4000
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 3239 transition count 3998
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 3239 transition count 3998
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 3238 transition count 3990
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 3238 transition count 3990
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 3237 transition count 3982
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 3237 transition count 3982
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 3236 transition count 3981
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 3236 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 3235 transition count 3973
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 3235 transition count 3973
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 3234 transition count 3965
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 3234 transition count 3965
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 3233 transition count 3964
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 3233 transition count 3964
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 3232 transition count 3956
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 3232 transition count 3956
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 3231 transition count 3948
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 3231 transition count 3948
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 3230 transition count 3947
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 3230 transition count 3947
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 3229 transition count 3939
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 3229 transition count 3939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 3228 transition count 3931
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 3228 transition count 3931
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 3227 transition count 3930
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 3227 transition count 3930
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 3226 transition count 3922
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 3226 transition count 3922
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 3225 transition count 3914
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 3225 transition count 3914
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 3224 transition count 3913
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 3224 transition count 3913
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 3223 transition count 3905
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 3223 transition count 3905
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 3222 transition count 3897
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 3222 transition count 3897
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 3221 transition count 3896
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 3221 transition count 3896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 3220 transition count 3888
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 3220 transition count 3888
Applied a total of 84 rules in 8521 ms. Remains 3220 /3261 variables (removed 41) and now considering 3888/4041 (removed 153) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8522 ms. Remains : 3220/3261 places, 3888/4041 transitions.
[2024-06-01 07:02:09] [INFO ] Flatten gal took : 89 ms
[2024-06-01 07:02:09] [INFO ] Flatten gal took : 101 ms
[2024-06-01 07:02:10] [INFO ] Input system was already deterministic with 3888 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3261/3261 places, 4041/4041 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3245 transition count 4018
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3245 transition count 4018
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 3245 transition count 4017
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 3237 transition count 3992
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 3237 transition count 3992
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 3234 transition count 3989
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 3234 transition count 3989
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 3233 transition count 3981
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 3233 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 3232 transition count 3973
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 3232 transition count 3973
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 3231 transition count 3972
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 3231 transition count 3972
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 3230 transition count 3964
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 3230 transition count 3964
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 3229 transition count 3956
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 3229 transition count 3956
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 3228 transition count 3955
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 3228 transition count 3955
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 3227 transition count 3947
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 3227 transition count 3947
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 3226 transition count 3939
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 3226 transition count 3939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 3225 transition count 3938
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 3225 transition count 3938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 3224 transition count 3930
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 3224 transition count 3930
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 3223 transition count 3922
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 3223 transition count 3922
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 3222 transition count 3921
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 3222 transition count 3921
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 3221 transition count 3913
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 3221 transition count 3913
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 3220 transition count 3905
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 3220 transition count 3905
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 3219 transition count 3904
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 3219 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 3218 transition count 3896
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 3218 transition count 3896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 3217 transition count 3888
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 3217 transition count 3888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 3216 transition count 3887
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 3216 transition count 3887
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 3215 transition count 3879
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 3215 transition count 3879
Applied a total of 93 rules in 7491 ms. Remains 3215 /3261 variables (removed 46) and now considering 3879/4041 (removed 162) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7492 ms. Remains : 3215/3261 places, 3879/4041 transitions.
[2024-06-01 07:02:17] [INFO ] Flatten gal took : 142 ms
[2024-06-01 07:02:17] [INFO ] Flatten gal took : 157 ms
[2024-06-01 07:02:18] [INFO ] Input system was already deterministic with 3879 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3261/3261 places, 4041/4041 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3245 transition count 4018
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3245 transition count 4018
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 3245 transition count 4016
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 3238 transition count 3992
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 3238 transition count 3992
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 3235 transition count 3989
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 3235 transition count 3989
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 3234 transition count 3981
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 3234 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 3233 transition count 3973
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 3233 transition count 3973
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 3232 transition count 3972
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 3232 transition count 3972
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 3231 transition count 3964
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 3231 transition count 3964
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 3230 transition count 3956
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 3230 transition count 3956
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 3229 transition count 3955
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 3229 transition count 3955
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 3228 transition count 3947
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 3228 transition count 3947
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 3227 transition count 3939
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 3227 transition count 3939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 3226 transition count 3938
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 3226 transition count 3938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 3225 transition count 3930
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 3225 transition count 3930
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 3224 transition count 3922
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 3224 transition count 3922
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 3223 transition count 3921
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 3223 transition count 3921
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 3222 transition count 3913
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 3222 transition count 3913
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 3221 transition count 3905
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 3221 transition count 3905
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 3220 transition count 3904
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 3220 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 3219 transition count 3896
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 3219 transition count 3896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 3218 transition count 3888
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 3218 transition count 3888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 3217 transition count 3887
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 3217 transition count 3887
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 3216 transition count 3879
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 3216 transition count 3879
Applied a total of 92 rules in 7257 ms. Remains 3216 /3261 variables (removed 45) and now considering 3879/4041 (removed 162) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7257 ms. Remains : 3216/3261 places, 3879/4041 transitions.
[2024-06-01 07:02:25] [INFO ] Flatten gal took : 89 ms
[2024-06-01 07:02:25] [INFO ] Flatten gal took : 99 ms
[2024-06-01 07:02:25] [INFO ] Input system was already deterministic with 3879 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3261/3261 places, 4041/4041 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3247 transition count 4027
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3247 transition count 4027
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 3247 transition count 4025
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 3240 transition count 4008
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 3240 transition count 4008
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 3238 transition count 4006
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 3238 transition count 4006
Applied a total of 48 rules in 1291 ms. Remains 3238 /3261 variables (removed 23) and now considering 4006/4041 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1291 ms. Remains : 3238/3261 places, 4006/4041 transitions.
[2024-06-01 07:02:27] [INFO ] Flatten gal took : 86 ms
[2024-06-01 07:02:27] [INFO ] Flatten gal took : 97 ms
[2024-06-01 07:02:27] [INFO ] Input system was already deterministic with 4006 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3261/3261 places, 4041/4041 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 607 transitions
Trivial Post-agglo rules discarded 607 transitions
Performed 607 trivial Post agglomeration. Transition count delta: 607
Iterating post reduction 0 with 607 rules applied. Total rules applied 607 place count 3260 transition count 3433
Reduce places removed 607 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 613 rules applied. Total rules applied 1220 place count 2653 transition count 3427
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 1225 place count 2650 transition count 3425
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1227 place count 2648 transition count 3425
Performed 871 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 871 Pre rules applied. Total rules applied 1227 place count 2648 transition count 2554
Deduced a syphon composed of 871 places in 7 ms
Ensure Unique test removed 83 places
Reduce places removed 954 places and 0 transitions.
Iterating global reduction 4 with 1825 rules applied. Total rules applied 3052 place count 1694 transition count 2554
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 4 with 60 rules applied. Total rules applied 3112 place count 1686 transition count 2502
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 3164 place count 1634 transition count 2502
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 3164 place count 1634 transition count 2470
Deduced a syphon composed of 32 places in 6 ms
Ensure Unique test removed 31 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 6 with 95 rules applied. Total rules applied 3259 place count 1571 transition count 2470
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 30 Pre rules applied. Total rules applied 3259 place count 1571 transition count 2440
Deduced a syphon composed of 30 places in 7 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 3319 place count 1541 transition count 2440
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 3327 place count 1533 transition count 2425
Iterating global reduction 6 with 8 rules applied. Total rules applied 3335 place count 1533 transition count 2425
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 3335 place count 1533 transition count 2421
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 3343 place count 1529 transition count 2421
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 3346 place count 1526 transition count 2401
Iterating global reduction 6 with 3 rules applied. Total rules applied 3349 place count 1526 transition count 2401
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3350 place count 1525 transition count 2393
Iterating global reduction 6 with 1 rules applied. Total rules applied 3351 place count 1525 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3352 place count 1524 transition count 2385
Iterating global reduction 6 with 1 rules applied. Total rules applied 3353 place count 1524 transition count 2385
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3354 place count 1523 transition count 2377
Iterating global reduction 6 with 1 rules applied. Total rules applied 3355 place count 1523 transition count 2377
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3356 place count 1522 transition count 2369
Iterating global reduction 6 with 1 rules applied. Total rules applied 3357 place count 1522 transition count 2369
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3358 place count 1521 transition count 2361
Iterating global reduction 6 with 1 rules applied. Total rules applied 3359 place count 1521 transition count 2361
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3360 place count 1520 transition count 2353
Iterating global reduction 6 with 1 rules applied. Total rules applied 3361 place count 1520 transition count 2353
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3362 place count 1519 transition count 2345
Iterating global reduction 6 with 1 rules applied. Total rules applied 3363 place count 1519 transition count 2345
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3364 place count 1518 transition count 2337
Iterating global reduction 6 with 1 rules applied. Total rules applied 3365 place count 1518 transition count 2337
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3366 place count 1517 transition count 2329
Iterating global reduction 6 with 1 rules applied. Total rules applied 3367 place count 1517 transition count 2329
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3368 place count 1516 transition count 2321
Iterating global reduction 6 with 1 rules applied. Total rules applied 3369 place count 1516 transition count 2321
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3370 place count 1515 transition count 2313
Iterating global reduction 6 with 1 rules applied. Total rules applied 3371 place count 1515 transition count 2313
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3372 place count 1514 transition count 2305
Iterating global reduction 6 with 1 rules applied. Total rules applied 3373 place count 1514 transition count 2305
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3374 place count 1513 transition count 2297
Iterating global reduction 6 with 1 rules applied. Total rules applied 3375 place count 1513 transition count 2297
Performed 211 Post agglomeration using F-continuation condition.Transition count delta: 211
Deduced a syphon composed of 211 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 213 places and 0 transitions.
Iterating global reduction 6 with 424 rules applied. Total rules applied 3799 place count 1300 transition count 2086
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3803 place count 1296 transition count 2082
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 3808 place count 1295 transition count 2082
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3808 place count 1295 transition count 2081
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3810 place count 1294 transition count 2081
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 3811 place count 1293 transition count 2080
Iterating global reduction 6 with 1 rules applied. Total rules applied 3812 place count 1293 transition count 2080
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 6 with 2 rules applied. Total rules applied 3814 place count 1293 transition count 2078
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3815 place count 1292 transition count 2078
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3815 place count 1292 transition count 2077
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3817 place count 1291 transition count 2077
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 3819 place count 1289 transition count 2075
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 8 with 24 rules applied. Total rules applied 3843 place count 1273 transition count 2067
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 3851 place count 1265 transition count 2067
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 32 Pre rules applied. Total rules applied 3851 place count 1265 transition count 2035
Deduced a syphon composed of 32 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 10 with 65 rules applied. Total rules applied 3916 place count 1232 transition count 2035
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 10 with 16 rules applied. Total rules applied 3932 place count 1216 transition count 2035
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 3932 place count 1216 transition count 2034
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3934 place count 1215 transition count 2034
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 32 rules applied. Total rules applied 3966 place count 1199 transition count 2018
Discarding 15 places :
Symmetric choice reduction at 11 with 15 rule applications. Total rules 3981 place count 1184 transition count 2003
Iterating global reduction 11 with 15 rules applied. Total rules applied 3996 place count 1184 transition count 2003
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 4003 place count 1177 transition count 1996
Iterating global reduction 11 with 7 rules applied. Total rules applied 4010 place count 1177 transition count 1996
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 4017 place count 1177 transition count 1989
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 7 Pre rules applied. Total rules applied 4017 place count 1177 transition count 1982
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 11 with 14 rules applied. Total rules applied 4031 place count 1170 transition count 1982
Applied a total of 4031 rules in 1951 ms. Remains 1170 /3261 variables (removed 2091) and now considering 1982/4041 (removed 2059) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1952 ms. Remains : 1170/3261 places, 1982/4041 transitions.
[2024-06-01 07:02:29] [INFO ] Flatten gal took : 50 ms
[2024-06-01 07:02:29] [INFO ] Flatten gal took : 56 ms
[2024-06-01 07:02:29] [INFO ] Input system was already deterministic with 1982 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3261/3261 places, 4041/4041 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 616 transitions
Trivial Post-agglo rules discarded 616 transitions
Performed 616 trivial Post agglomeration. Transition count delta: 616
Iterating post reduction 0 with 616 rules applied. Total rules applied 616 place count 3260 transition count 3424
Reduce places removed 616 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 622 rules applied. Total rules applied 1238 place count 2644 transition count 3418
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1241 place count 2641 transition count 3418
Performed 871 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 871 Pre rules applied. Total rules applied 1241 place count 2641 transition count 2547
Deduced a syphon composed of 871 places in 7 ms
Ensure Unique test removed 84 places
Reduce places removed 955 places and 0 transitions.
Iterating global reduction 3 with 1826 rules applied. Total rules applied 3067 place count 1686 transition count 2547
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 60 rules applied. Total rules applied 3127 place count 1678 transition count 2495
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 3179 place count 1626 transition count 2495
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 3179 place count 1626 transition count 2462
Deduced a syphon composed of 33 places in 7 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 99 rules applied. Total rules applied 3278 place count 1560 transition count 2462
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 3278 place count 1560 transition count 2430
Deduced a syphon composed of 32 places in 6 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 3342 place count 1528 transition count 2430
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 3350 place count 1520 transition count 2415
Iterating global reduction 5 with 8 rules applied. Total rules applied 3358 place count 1520 transition count 2415
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 3358 place count 1520 transition count 2411
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 3366 place count 1516 transition count 2411
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 3369 place count 1513 transition count 2391
Iterating global reduction 5 with 3 rules applied. Total rules applied 3372 place count 1513 transition count 2391
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3373 place count 1512 transition count 2383
Iterating global reduction 5 with 1 rules applied. Total rules applied 3374 place count 1512 transition count 2383
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3375 place count 1511 transition count 2375
Iterating global reduction 5 with 1 rules applied. Total rules applied 3376 place count 1511 transition count 2375
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3377 place count 1510 transition count 2367
Iterating global reduction 5 with 1 rules applied. Total rules applied 3378 place count 1510 transition count 2367
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3379 place count 1509 transition count 2359
Iterating global reduction 5 with 1 rules applied. Total rules applied 3380 place count 1509 transition count 2359
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3381 place count 1508 transition count 2351
Iterating global reduction 5 with 1 rules applied. Total rules applied 3382 place count 1508 transition count 2351
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3383 place count 1507 transition count 2343
Iterating global reduction 5 with 1 rules applied. Total rules applied 3384 place count 1507 transition count 2343
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3385 place count 1506 transition count 2335
Iterating global reduction 5 with 1 rules applied. Total rules applied 3386 place count 1506 transition count 2335
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3387 place count 1505 transition count 2327
Iterating global reduction 5 with 1 rules applied. Total rules applied 3388 place count 1505 transition count 2327
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3389 place count 1504 transition count 2319
Iterating global reduction 5 with 1 rules applied. Total rules applied 3390 place count 1504 transition count 2319
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3391 place count 1503 transition count 2311
Iterating global reduction 5 with 1 rules applied. Total rules applied 3392 place count 1503 transition count 2311
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3393 place count 1502 transition count 2303
Iterating global reduction 5 with 1 rules applied. Total rules applied 3394 place count 1502 transition count 2303
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3395 place count 1501 transition count 2295
Iterating global reduction 5 with 1 rules applied. Total rules applied 3396 place count 1501 transition count 2295
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 3397 place count 1500 transition count 2287
Iterating global reduction 5 with 1 rules applied. Total rules applied 3398 place count 1500 transition count 2287
Performed 209 Post agglomeration using F-continuation condition.Transition count delta: 209
Deduced a syphon composed of 209 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 5 with 419 rules applied. Total rules applied 3817 place count 1290 transition count 2078
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 3821 place count 1286 transition count 2074
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 3826 place count 1285 transition count 2074
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3826 place count 1285 transition count 2073
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3828 place count 1284 transition count 2073
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 3830 place count 1282 transition count 2071
Iterating global reduction 5 with 2 rules applied. Total rules applied 3832 place count 1282 transition count 2071
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 5 with 2 rules applied. Total rules applied 3834 place count 1282 transition count 2069
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3835 place count 1281 transition count 2069
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3835 place count 1281 transition count 2068
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3837 place count 1280 transition count 2068
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3839 place count 1278 transition count 2066
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 7 with 24 rules applied. Total rules applied 3863 place count 1262 transition count 2058
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 3871 place count 1254 transition count 2058
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 32 Pre rules applied. Total rules applied 3871 place count 1254 transition count 2026
Deduced a syphon composed of 32 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 9 with 65 rules applied. Total rules applied 3936 place count 1221 transition count 2026
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 9 with 16 rules applied. Total rules applied 3952 place count 1205 transition count 2026
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 3952 place count 1205 transition count 2025
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3954 place count 1204 transition count 2025
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 10 with 32 rules applied. Total rules applied 3986 place count 1188 transition count 2009
Discarding 15 places :
Symmetric choice reduction at 10 with 15 rule applications. Total rules 4001 place count 1173 transition count 1994
Iterating global reduction 10 with 15 rules applied. Total rules applied 4016 place count 1173 transition count 1994
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 4023 place count 1166 transition count 1987
Iterating global reduction 10 with 7 rules applied. Total rules applied 4030 place count 1166 transition count 1987
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 4037 place count 1166 transition count 1980
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 7 Pre rules applied. Total rules applied 4037 place count 1166 transition count 1973
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 4051 place count 1159 transition count 1973
Applied a total of 4051 rules in 1910 ms. Remains 1159 /3261 variables (removed 2102) and now considering 1973/4041 (removed 2068) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1910 ms. Remains : 1159/3261 places, 1973/4041 transitions.
[2024-06-01 07:02:31] [INFO ] Flatten gal took : 80 ms
[2024-06-01 07:02:31] [INFO ] Flatten gal took : 90 ms
[2024-06-01 07:02:31] [INFO ] Input system was already deterministic with 1973 transitions.
RANDOM walk for 40000 steps (313 resets) in 505 ms. (79 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (50 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 159824 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 1
Probabilistic random walk after 159824 steps, saw 64473 distinct states, run finished after 3004 ms. (steps per millisecond=53 ) properties seen :0
// Phase 1: matrix 1973 rows 1159 cols
[2024-06-01 07:02:34] [INFO ] Computed 185 invariants in 26 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/46 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/134 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/163 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/165 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/165 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 131/296 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/296 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 31/327 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/329 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/329 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 333/662 variables, 54/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/662 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 75/737 variables, 14/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/737 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 16/753 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/753 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 278/1031 variables, 43/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1031 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 51/1082 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1082 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/1084 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1084 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 73/1157 variables, 16/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1157 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 1/1158 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1158 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 1/1159 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1159 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3132/3132 variables, and 1344 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2695 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 143/143 constraints, State Equation: 1159/1159 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/46 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/134 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/163 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/165 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/165 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 131/296 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/296 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 31/327 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/327 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/329 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/329 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 333/662 variables, 54/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/662 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 75/737 variables, 14/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/737 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 16/753 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/753 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 278/1031 variables, 43/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1031 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 51/1082 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1082 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/1084 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1084 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 73/1157 variables, 16/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:02:38] [INFO ] Deduced a trap composed of 36 places in 452 ms of which 6 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/1157 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1157 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 1/1158 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1158 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 1/1159 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1159 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3132/3132 variables, and 1345 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2916 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 143/143 constraints, State Equation: 1159/1159 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 5662ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 1 out of 1159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1159/1159 places, 1973/1973 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 4 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 1120 transition count 1934
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 1119 transition count 1940
Free-agglomeration rule applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 97 place count 1119 transition count 1923
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 114 place count 1102 transition count 1923
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 121 place count 1102 transition count 1916
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 128 place count 1095 transition count 1916
Applied a total of 128 rules in 279 ms. Remains 1095 /1159 variables (removed 64) and now considering 1916/1973 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 1095/1159 places, 1916/1973 transitions.
RANDOM walk for 4000000 steps (41807 resets) in 22588 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (5129 resets) in 8150 ms. (490 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1680943 steps, run timeout after 24001 ms. (steps per millisecond=70 ) properties seen :0 out of 1
Probabilistic random walk after 1680943 steps, saw 436134 distinct states, run finished after 24005 ms. (steps per millisecond=70 ) properties seen :0
// Phase 1: matrix 1916 rows 1095 cols
[2024-06-01 07:03:13] [INFO ] Computed 185 invariants in 27 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/43 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 72/115 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/138 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/140 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 99/239 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/263 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/263 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/265 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/265 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 93/358 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/358 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 24/382 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/382 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/384 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/384 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 94/478 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/478 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 26/504 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/504 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/506 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/506 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 94/600 variables, 15/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/600 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 24/624 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/624 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 2/626 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/626 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 93/719 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/719 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 24/743 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/743 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 2/745 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/745 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 93/838 variables, 14/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/838 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 24/862 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/862 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 2/864 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/864 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 98/962 variables, 14/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/962 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 19/981 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/981 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 62/1043 variables, 8/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1043 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 33/1076 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1076 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 4/1080 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1080 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 15/1095 variables, 9/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1095 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 1916/3011 variables, 1095/1280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/3011 variables, 0/1280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 63 (OVERLAPS) 0/3011 variables, 0/1280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3011/3011 variables, and 1280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3586 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1095/1095 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/43 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 72/115 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/138 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/140 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 99/239 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 24/263 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/263 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/265 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/265 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 93/358 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/358 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 24/382 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/382 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/384 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/384 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 94/478 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/478 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 26/504 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/504 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/506 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/506 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 94/600 variables, 15/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/600 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 24/624 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/624 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 2/626 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/626 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 93/719 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/719 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 24/743 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/743 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 2/745 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/745 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 93/838 variables, 14/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/838 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 24/862 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/862 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 2/864 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/864 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 98/962 variables, 14/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/962 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 19/981 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/981 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 62/1043 variables, 8/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1043 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 33/1076 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1076 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 4/1080 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1080 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 15/1095 variables, 9/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1095 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 1916/3011 variables, 1095/1280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/3011 variables, 1/1281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 89 places in 650 ms of which 8 ms to minimize.
[2024-06-01 07:03:20] [INFO ] Deduced a trap composed of 81 places in 582 ms of which 8 ms to minimize.
At refinement iteration 63 (INCLUDED_ONLY) 0/3011 variables, 2/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/3011 variables, 0/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 0/3011 variables, 0/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3011/3011 variables, and 1283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4351 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 128/128 constraints, State Equation: 1095/1095 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 7977ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 279 ms.
Support contains 1 out of 1095 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1095/1095 places, 1916/1916 transitions.
Applied a total of 0 rules in 80 ms. Remains 1095 /1095 variables (removed 0) and now considering 1916/1916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1095/1095 places, 1916/1916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1095/1095 places, 1916/1916 transitions.
Applied a total of 0 rules in 81 ms. Remains 1095 /1095 variables (removed 0) and now considering 1916/1916 (removed 0) transitions.
[2024-06-01 07:03:21] [INFO ] Invariant cache hit.
[2024-06-01 07:03:23] [INFO ] Implicit Places using invariants in 2149 ms returned [1, 18, 19, 31, 48, 66, 87, 136, 145, 146, 148, 165, 183, 203, 252, 253, 264, 265, 267, 284, 302, 322, 371, 372, 383, 384, 386, 403, 421, 441, 490, 491, 502, 503, 505, 522, 540, 609, 613, 614, 625, 626, 628, 645, 663, 682, 732, 733, 744, 745, 747, 764, 782, 801, 851, 852, 863, 864, 866, 883, 901, 920, 970, 971, 974, 985, 986, 987, 1005, 1009, 1027, 1028, 1029, 1030, 1057]
[2024-06-01 07:03:23] [INFO ] Actually due to overlaps returned [1005, 987, 48, 165, 284, 403, 522, 645, 764, 883, 505, 31, 145, 148, 264, 267, 383, 386, 502, 625, 628, 744, 747, 863, 866, 985, 1027, 146, 265, 384, 503, 626, 745, 864, 986, 1028, 1, 18, 252, 253, 371, 372, 490, 491, 613, 614, 732, 733, 851, 852, 970, 971, 540, 1009, 1029, 19, 66, 87, 183, 203, 302, 322, 421, 441, 663, 682, 782, 801, 901, 920, 974, 1030, 1057]
Discarding 73 places :
Implicit Place search using SMT only with invariants took 2153 ms to find 73 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1022/1095 places, 1916/1916 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 1021 transition count 1786
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 269 place count 891 transition count 1778
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 269 place count 891 transition count 1739
Deduced a syphon composed of 39 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 79 rules applied. Total rules applied 348 place count 851 transition count 1739
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 360 place count 847 transition count 1731
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 368 place count 839 transition count 1731
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 373 place count 834 transition count 1726
Iterating global reduction 4 with 5 rules applied. Total rules applied 378 place count 834 transition count 1726
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 381 place count 834 transition count 1723
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 382 place count 833 transition count 1721
Iterating global reduction 5 with 1 rules applied. Total rules applied 383 place count 833 transition count 1721
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 5 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 505 place count 772 transition count 1660
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 506 place count 771 transition count 1659
Iterating global reduction 5 with 1 rules applied. Total rules applied 507 place count 771 transition count 1659
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 508 place count 771 transition count 1658
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 512 place count 769 transition count 1659
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 6 with 23 rules applied. Total rules applied 535 place count 769 transition count 1636
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 6 with 24 rules applied. Total rules applied 559 place count 745 transition count 1636
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 7 with 24 rules applied. Total rules applied 583 place count 745 transition count 1636
Applied a total of 583 rules in 434 ms. Remains 745 /1022 variables (removed 277) and now considering 1636/1916 (removed 280) transitions.
// Phase 1: matrix 1636 rows 745 cols
[2024-06-01 07:03:24] [INFO ] Computed 105 invariants in 29 ms
[2024-06-01 07:03:25] [INFO ] Implicit Places using invariants in 1722 ms returned [87, 93, 96, 98, 99, 102, 103, 169, 175, 178, 180, 185, 186, 252, 258, 261, 263, 268, 269, 335, 341, 344, 346, 351, 352, 404, 421, 427, 430, 432, 437, 438, 504, 510, 513, 515, 520, 521, 587, 593, 596, 598, 603, 604, 670, 676, 679, 681]
[2024-06-01 07:03:25] [INFO ] Actually due to overlaps returned [102, 185, 268, 351, 437, 520, 603, 103, 186, 269, 352, 438, 521, 604, 87, 93, 98, 169, 175, 180, 252, 258, 263, 335, 341, 346, 421, 427, 432, 504, 510, 515, 587, 593, 598, 670, 676, 681, 99, 404]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1729 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 705/1095 places, 1636/1916 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 673 transition count 1604
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 673 transition count 1604
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 72 place count 665 transition count 1596
Iterating global reduction 0 with 8 rules applied. Total rules applied 80 place count 665 transition count 1596
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 98 place count 656 transition count 1587
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 122 place count 656 transition count 1563
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 146 place count 632 transition count 1563
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 147 place count 632 transition count 1562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 148 place count 631 transition count 1562
Applied a total of 148 rules in 275 ms. Remains 631 /705 variables (removed 74) and now considering 1562/1636 (removed 74) transitions.
// Phase 1: matrix 1562 rows 631 cols
[2024-06-01 07:03:26] [INFO ] Computed 65 invariants in 25 ms
[2024-06-01 07:03:27] [INFO ] Implicit Places using invariants in 1063 ms returned []
[2024-06-01 07:03:27] [INFO ] Invariant cache hit.
[2024-06-01 07:03:29] [INFO ] Implicit Places using invariants and state equation in 2690 ms returned []
Implicit Place search using SMT with State Equation took 3757 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 631/1095 places, 1562/1916 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8429 ms. Remains : 631/1095 places, 1562/1916 transitions.
RANDOM walk for 4000000 steps (67619 resets) in 14729 ms. (271 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (11190 resets) in 4757 ms. (840 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1677581 steps, run timeout after 15001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 1677581 steps, saw 290902 distinct states, run finished after 15005 ms. (steps per millisecond=111 ) properties seen :0
[2024-06-01 07:03:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/170 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/172 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 136/308 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/310 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 134/444 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/448 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 100/548 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 40/588 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/588 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 43/631 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2193/2193 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1314 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/170 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/172 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 136/308 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/310 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 134/444 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/448 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 100/548 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 40/588 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/588 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 43/631 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2193 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2193/2193 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1512 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2842ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 45 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 631/631 places, 1562/1562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 47 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2024-06-01 07:03:52] [INFO ] Invariant cache hit.
[2024-06-01 07:03:54] [INFO ] Implicit Places using invariants in 1097 ms returned []
[2024-06-01 07:03:54] [INFO ] Invariant cache hit.
[2024-06-01 07:03:56] [INFO ] Implicit Places using invariants and state equation in 2492 ms returned []
Implicit Place search using SMT with State Equation took 3627 ms to find 0 implicit places.
[2024-06-01 07:03:56] [INFO ] Redundant transitions in 50 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:03:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 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 Real declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 0/0 constraints]
After SMT, in 61556ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 61592ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65333 ms. Remains : 631/631 places, 1562/1562 transitions.
RANDOM walk for 400000 steps (6713 resets) in 2263 ms. (176 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-06-01 07:04:58] [INFO ] Invariant cache hit.
[2024-06-01 07:04:59] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 07:04:59] [INFO ] [Real]Absence check using 12 positive and 53 generalized place invariants in 35 ms returned sat
[2024-06-01 07:04:59] [INFO ] After 760ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:05:00] [INFO ] After 884ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:05:00] [INFO ] After 1056ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:05:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 07:05:00] [INFO ] [Nat]Absence check using 12 positive and 53 generalized place invariants in 50 ms returned sat
[2024-06-01 07:05:01] [INFO ] After 827ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:05:01] [INFO ] After 924ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:05:01] [INFO ] After 1163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (67733 resets) in 14518 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (11242 resets) in 4659 ms. (858 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1361477 steps, run timeout after 12001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 1361477 steps, saw 236722 distinct states, run finished after 12001 ms. (steps per millisecond=113 ) properties seen :0
[2024-06-01 07:05:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/170 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/172 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 136/308 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/310 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 134/444 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/448 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 100/548 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 40/588 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/588 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 43/631 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2193/2193 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1523 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/170 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/172 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 136/308 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/310 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 134/444 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/448 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 100/548 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 40/588 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/588 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 43/631 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2193 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2193/2193 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1483 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3017ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 31 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 631/631 places, 1562/1562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 32 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2024-06-01 07:05:21] [INFO ] Invariant cache hit.
[2024-06-01 07:05:22] [INFO ] Implicit Places using invariants in 748 ms returned []
[2024-06-01 07:05:22] [INFO ] Invariant cache hit.
[2024-06-01 07:05:24] [INFO ] Implicit Places using invariants and state equation in 2626 ms returned []
Implicit Place search using SMT with State Equation took 3377 ms to find 0 implicit places.
[2024-06-01 07:05:24] [INFO ] Redundant transitions in 49 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:05:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 0/0 constraints]
After SMT, in 61394ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 61426ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64906 ms. Remains : 631/631 places, 1562/1562 transitions.
RANDOM walk for 400000 steps (6807 resets) in 2062 ms. (193 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-06-01 07:06:26] [INFO ] Invariant cache hit.
[2024-06-01 07:06:26] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-01 07:06:26] [INFO ] [Real]Absence check using 12 positive and 53 generalized place invariants in 50 ms returned sat
[2024-06-01 07:06:27] [INFO ] After 950ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:06:28] [INFO ] After 1077ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:06:28] [INFO ] After 1300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:06:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 07:06:28] [INFO ] [Nat]Absence check using 12 positive and 53 generalized place invariants in 51 ms returned sat
[2024-06-01 07:06:29] [INFO ] After 962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:06:29] [INFO ] After 1125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:06:29] [INFO ] After 1350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (688 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (107 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 264820 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 264820 steps, saw 58394 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2024-06-01 07:06:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/170 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/172 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 136/308 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/310 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 134/444 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/448 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 100/548 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 40/588 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/588 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 43/631 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2193/2193 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1266 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/170 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/172 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 136/308 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/310 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 134/444 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/448 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 100/548 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 40/588 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/588 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 43/631 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2193/2193 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1591 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2880ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 44 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 631/631 places, 1562/1562 transitions.
RANDOM walk for 40000 steps (707 resets) in 309 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (109 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 274421 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 274421 steps, saw 60111 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2024-06-01 07:06:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/170 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/172 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 136/308 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/310 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 134/444 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/448 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 100/548 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 40/588 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/588 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 43/631 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/2193 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2193/2193 variables, and 696 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1528 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/170 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/172 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 136/308 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/310 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 134/444 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/448 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/448 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 100/548 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/548 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 40/588 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/588 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 43/631 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/631 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1562/2193 variables, 631/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2193 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/2193 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2193/2193 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1537 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3074ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 47 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 631/631 places, 1562/1562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1562/1562 transitions.
Applied a total of 0 rules in 47 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2024-06-01 07:06:41] [INFO ] Invariant cache hit.
[2024-06-01 07:06:42] [INFO ] Implicit Places using invariants in 1131 ms returned []
[2024-06-01 07:06:42] [INFO ] Invariant cache hit.
[2024-06-01 07:06:45] [INFO ] Implicit Places using invariants and state equation in 2867 ms returned []
Implicit Place search using SMT with State Equation took 4002 ms to find 0 implicit places.
[2024-06-01 07:06:45] [INFO ] Redundant transitions in 35 ms returned []
Running 1521 sub problems to find dead transitions.
[2024-06-01 07:06:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 53/63 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/2193 variables, and 63 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/12 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 0/0 constraints]
After SMT, in 61630ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 61662ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65759 ms. Remains : 631/631 places, 1562/1562 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 28 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 07:07:47] [INFO ] Invariant cache hit.
[2024-06-01 07:07:47] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 07:07:47] [INFO ] [Real]Absence check using 12 positive and 53 generalized place invariants in 46 ms returned sat
[2024-06-01 07:07:48] [INFO ] After 1333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:07:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-06-01 07:07:49] [INFO ] [Nat]Absence check using 12 positive and 53 generalized place invariants in 33 ms returned sat
[2024-06-01 07:07:49] [INFO ] After 667ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:07:49] [INFO ] After 756ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:07:49] [INFO ] After 969ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2355 ms.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 28 ms. Remains 631 /631 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 07:07:49] [INFO ] Invariant cache hit.
[2024-06-01 07:07:50] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-06-01 07:07:50] [INFO ] [Real]Absence check using 12 positive and 53 generalized place invariants in 50 ms returned sat
[2024-06-01 07:07:51] [INFO ] After 1172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 07:07:51] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-06-01 07:07:51] [INFO ] [Nat]Absence check using 12 positive and 53 generalized place invariants in 36 ms returned sat
[2024-06-01 07:07:52] [INFO ] After 985ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 07:07:52] [INFO ] After 1118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 07:07:52] [INFO ] After 1361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2581 ms.
Starting structural reductions in LTL mode, iteration 0 : 3261/3261 places, 4041/4041 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3245 transition count 4018
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3245 transition count 4018
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 3245 transition count 4016
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 42 place count 3237 transition count 3991
Iterating global reduction 1 with 8 rules applied. Total rules applied 50 place count 3237 transition count 3991
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 3234 transition count 3988
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 3234 transition count 3988
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 3233 transition count 3980
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 3233 transition count 3980
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 3232 transition count 3972
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 3232 transition count 3972
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 3231 transition count 3971
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 3231 transition count 3971
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 3230 transition count 3963
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 3230 transition count 3963
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 3229 transition count 3955
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 3229 transition count 3955
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 3228 transition count 3954
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 3228 transition count 3954
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 3227 transition count 3946
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 3227 transition count 3946
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 3226 transition count 3938
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 3226 transition count 3938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 3225 transition count 3937
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 3225 transition count 3937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 3224 transition count 3929
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 3224 transition count 3929
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 3223 transition count 3921
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 3223 transition count 3921
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 3222 transition count 3920
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 3222 transition count 3920
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 3221 transition count 3912
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 3221 transition count 3912
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 3220 transition count 3904
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 3220 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 3219 transition count 3903
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 3219 transition count 3903
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 3218 transition count 3895
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 3218 transition count 3895
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 3217 transition count 3887
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 3217 transition count 3887
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 3216 transition count 3886
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 3216 transition count 3886
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 3215 transition count 3878
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 3215 transition count 3878
Applied a total of 94 rules in 7428 ms. Remains 3215 /3261 variables (removed 46) and now considering 3878/4041 (removed 163) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7430 ms. Remains : 3215/3261 places, 3878/4041 transitions.
[2024-06-01 07:08:00] [INFO ] Flatten gal took : 88 ms
[2024-06-01 07:08:00] [INFO ] Flatten gal took : 101 ms
[2024-06-01 07:08:00] [INFO ] Input system was already deterministic with 3878 transitions.
[2024-06-01 07:08:00] [INFO ] Flatten gal took : 101 ms
[2024-06-01 07:08:00] [INFO ] Flatten gal took : 105 ms
[2024-06-01 07:08:00] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-01 07:08:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3261 places, 4041 transitions and 12549 arcs took 29 ms.
Total runtime 929443 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ASLink-PT-08b-CTLCardinality-2024-00
Could not compute solution for formula : ASLink-PT-08b-CTLCardinality-2024-01
Could not compute solution for formula : ASLink-PT-08b-CTLCardinality-2024-02
Could not compute solution for formula : ASLink-PT-08b-CTLCardinality-2024-03
Could not compute solution for formula : ASLink-PT-08b-CTLCardinality-2024-04
Could not compute solution for formula : ASLink-PT-08b-CTLCardinality-2024-05
Could not compute solution for formula : ASLink-PT-08b-CTLCardinality-2024-06
Could not compute solution for formula : ASLink-PT-08b-CTLCardinality-2024-07
Could not compute solution for formula : ASLink-PT-08b-CTLCardinality-2024-08
Could not compute solution for formula : ASLink-PT-08b-CTLCardinality-2024-09
Could not compute solution for formula : ASLink-PT-08b-CTLCardinality-2024-10
Could not compute solution for formula : ASLink-PT-08b-CTLCardinality-2024-11
Could not compute solution for formula : ASLink-PT-08b-CTLCardinality-2023-13
Could not compute solution for formula : ASLink-PT-08b-CTLCardinality-2023-14
Could not compute solution for formula : ASLink-PT-08b-CTLCardinality-2023-15

BK_STOP 1717225681208

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name ASLink-PT-08b-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/921/ctl_0_
ctl formula name ASLink-PT-08b-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/921/ctl_1_
ctl formula name ASLink-PT-08b-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/921/ctl_2_
ctl formula name ASLink-PT-08b-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/921/ctl_3_
ctl formula name ASLink-PT-08b-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/921/ctl_4_
ctl formula name ASLink-PT-08b-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/921/ctl_5_
ctl formula name ASLink-PT-08b-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/921/ctl_6_
ctl formula name ASLink-PT-08b-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/921/ctl_7_
ctl formula name ASLink-PT-08b-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/921/ctl_8_
ctl formula name ASLink-PT-08b-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/921/ctl_9_
ctl formula name ASLink-PT-08b-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/921/ctl_10_
ctl formula name ASLink-PT-08b-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/921/ctl_11_
ctl formula name ASLink-PT-08b-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/921/ctl_12_
ctl formula name ASLink-PT-08b-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/921/ctl_13_
ctl formula name ASLink-PT-08b-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/921/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ASLink-PT-08b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-08b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117900129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-08b.tgz
mv ASLink-PT-08b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;