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-171620117900118.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-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117900118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 18K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 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.1M 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-07b-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2023-02
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-07b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717219954891

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:32:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:32:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:32:37] [INFO ] Load time of PNML (sax parser for PT used): 461 ms
[2024-06-01 05:32:37] [INFO ] Transformed 3222 places.
[2024-06-01 05:32:37] [INFO ] Transformed 3986 transitions.
[2024-06-01 05:32:37] [INFO ] Found NUPN structural information;
[2024-06-01 05:32:37] [INFO ] Parsed PT model containing 3222 places and 3986 transitions and 12126 arcs in 769 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (58 resets) in 1830 ms. (21 steps per ms) remains 6/12 properties
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 599 ms. (66 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 233 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 6/6 properties
// Phase 1: matrix 3986 rows 3222 cols
[2024-06-01 05:32:39] [INFO ] Computed 316 invariants in 224 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 179/204 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 179/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 608/812 variables, 64/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/812 variables, 608/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/812 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2319/3131 variables, 226/1113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3131 variables, 2319/3432 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3131 variables, 0/3432 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 91/3222 variables, 15/3447 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3222 variables, 91/3538 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3222 variables, 0/3538 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7208/7208 variables, and 6760 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5079 ms.
Refiners :[Domain max(s): 3222/3222 constraints, Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 241/241 constraints, State Equation: 3222/3222 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 179/204 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 179/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 608/812 variables, 64/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/812 variables, 608/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/812 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2319/3131 variables, 226/1113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3131 variables, 2319/3432 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:32:48] [INFO ] Deduced a trap composed of 31 places in 1388 ms of which 227 ms to minimize.
[2024-06-01 05:32:49] [INFO ] Deduced a trap composed of 24 places in 1338 ms of which 15 ms to minimize.
[2024-06-01 05:32:50] [INFO ] Deduced a trap composed of 23 places in 1012 ms of which 13 ms to minimize.
SMT process timed out in 11278ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 3222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3222/3222 places, 3986/3986 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 733 transitions
Trivial Post-agglo rules discarded 733 transitions
Performed 733 trivial Post agglomeration. Transition count delta: 733
Iterating post reduction 0 with 733 rules applied. Total rules applied 733 place count 3222 transition count 3253
Reduce places removed 733 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 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 1 with 766 rules applied. Total rules applied 1499 place count 2489 transition count 3220
Reduce places removed 8 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 14 rules applied. Total rules applied 1513 place count 2481 transition count 3214
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1519 place count 2475 transition count 3214
Performed 740 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 740 Pre rules applied. Total rules applied 1519 place count 2475 transition count 2474
Deduced a syphon composed of 740 places in 7 ms
Ensure Unique test removed 69 places
Reduce places removed 809 places and 0 transitions.
Iterating global reduction 4 with 1549 rules applied. Total rules applied 3068 place count 1666 transition count 2474
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 4 with 53 rules applied. Total rules applied 3121 place count 1658 transition count 2429
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 5 with 45 rules applied. Total rules applied 3166 place count 1613 transition count 2429
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 3166 place count 1613 transition count 2404
Deduced a syphon composed of 25 places in 7 ms
Ensure Unique test removed 24 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 3240 place count 1564 transition count 2404
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 3240 place count 1564 transition count 2380
Deduced a syphon composed of 24 places in 19 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 3288 place count 1540 transition count 2380
Discarding 101 places :
Symmetric choice reduction at 6 with 101 rule applications. Total rules 3389 place count 1439 transition count 2279
Iterating global reduction 6 with 101 rules applied. Total rules applied 3490 place count 1439 transition count 2279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3491 place count 1439 transition count 2278
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 34 Pre rules applied. Total rules applied 3491 place count 1439 transition count 2244
Deduced a syphon composed of 34 places in 62 ms
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 69 rules applied. Total rules applied 3560 place count 1404 transition count 2244
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3560 place count 1404 transition count 2243
Deduced a syphon composed of 1 places in 62 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 3563 place count 1402 transition count 2243
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 3571 place count 1394 transition count 2192
Iterating global reduction 7 with 8 rules applied. Total rules applied 3579 place count 1394 transition count 2192
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 3579 place count 1394 transition count 2187
Deduced a syphon composed of 5 places in 60 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 3589 place count 1389 transition count 2187
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3590 place count 1388 transition count 2179
Iterating global reduction 7 with 1 rules applied. Total rules applied 3591 place count 1388 transition count 2179
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3592 place count 1387 transition count 2171
Iterating global reduction 7 with 1 rules applied. Total rules applied 3593 place count 1387 transition count 2171
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3594 place count 1386 transition count 2163
Iterating global reduction 7 with 1 rules applied. Total rules applied 3595 place count 1386 transition count 2163
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3596 place count 1385 transition count 2155
Iterating global reduction 7 with 1 rules applied. Total rules applied 3597 place count 1385 transition count 2155
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3598 place count 1384 transition count 2147
Iterating global reduction 7 with 1 rules applied. Total rules applied 3599 place count 1384 transition count 2147
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3600 place count 1383 transition count 2139
Iterating global reduction 7 with 1 rules applied. Total rules applied 3601 place count 1383 transition count 2139
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3602 place count 1382 transition count 2131
Iterating global reduction 7 with 1 rules applied. Total rules applied 3603 place count 1382 transition count 2131
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3604 place count 1381 transition count 2123
Iterating global reduction 7 with 1 rules applied. Total rules applied 3605 place count 1381 transition count 2123
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3606 place count 1380 transition count 2115
Iterating global reduction 7 with 1 rules applied. Total rules applied 3607 place count 1380 transition count 2115
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3608 place count 1379 transition count 2107
Iterating global reduction 7 with 1 rules applied. Total rules applied 3609 place count 1379 transition count 2107
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3610 place count 1378 transition count 2099
Iterating global reduction 7 with 1 rules applied. Total rules applied 3611 place count 1378 transition count 2099
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3612 place count 1377 transition count 2091
Iterating global reduction 7 with 1 rules applied. Total rules applied 3613 place count 1377 transition count 2091
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3614 place count 1376 transition count 2083
Iterating global reduction 7 with 1 rules applied. Total rules applied 3615 place count 1376 transition count 2083
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3616 place count 1375 transition count 2075
Iterating global reduction 7 with 1 rules applied. Total rules applied 3617 place count 1375 transition count 2075
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3618 place count 1374 transition count 2067
Iterating global reduction 7 with 1 rules applied. Total rules applied 3619 place count 1374 transition count 2067
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3620 place count 1373 transition count 2059
Iterating global reduction 7 with 1 rules applied. Total rules applied 3621 place count 1373 transition count 2059
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 190
Deduced a syphon composed of 190 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 7 with 382 rules applied. Total rules applied 4003 place count 1181 transition count 1869
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4004 place count 1180 transition count 1868
Iterating global reduction 7 with 1 rules applied. Total rules applied 4005 place count 1180 transition count 1868
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4006 place count 1179 transition count 1867
Iterating global reduction 7 with 1 rules applied. Total rules applied 4007 place count 1179 transition count 1867
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 4010 place count 1178 transition count 1865
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4011 place count 1177 transition count 1865
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 4013 place count 1176 transition count 1874
Free-agglomeration rule applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 4021 place count 1176 transition count 1866
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 4029 place count 1168 transition count 1866
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 4037 place count 1168 transition count 1858
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4045 place count 1160 transition count 1858
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 4046 place count 1160 transition count 1858
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4047 place count 1159 transition count 1857
Reduce places removed 12 places and 0 transitions.
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 11 with 18 rules applied. Total rules applied 4065 place count 1147 transition count 1851
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 4071 place count 1141 transition count 1851
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 18 Pre rules applied. Total rules applied 4071 place count 1141 transition count 1833
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 13 with 36 rules applied. Total rules applied 4107 place count 1123 transition count 1833
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 13 with 7 rules applied. Total rules applied 4114 place count 1116 transition count 1833
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 14 with 24 rules applied. Total rules applied 4138 place count 1104 transition count 1821
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 4144 place count 1098 transition count 1815
Iterating global reduction 14 with 6 rules applied. Total rules applied 4150 place count 1098 transition count 1815
Free-agglomeration rule applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 4156 place count 1098 transition count 1809
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 4162 place count 1092 transition count 1809
Applied a total of 4162 rules in 4076 ms. Remains 1092 /3222 variables (removed 2130) and now considering 1809/3986 (removed 2177) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4100 ms. Remains : 1092/3222 places, 1809/3986 transitions.
RANDOM walk for 40000 steps (386 resets) in 541 ms. (73 steps per ms) remains 5/6 properties
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (58 resets) in 148 ms. (268 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (60 resets) in 168 ms. (236 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (61 resets) in 218 ms. (182 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (57 resets) in 145 ms. (273 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (59 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
// Phase 1: matrix 1809 rows 1092 cols
[2024-06-01 05:32:55] [INFO ] Computed 191 invariants in 54 ms
[2024-06-01 05:32:55] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 193/211 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/226 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 513/739 variables, 78/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/739 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 78/817 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/817 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 12/829 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/829 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 238/1067 variables, 54/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1067 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 7/1074 variables, 7/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 18/1092 variables, 6/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1092 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1809/2901 variables, 1092/1283 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2901 variables, 7/1290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2901 variables, 0/1290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/2901 variables, 0/1290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2901/2901 variables, and 1290 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2862 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 1092/1092 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 193/211 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 05:32:58] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 15/226 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 513/739 variables, 78/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 05:32:58] [INFO ] Deduced a trap composed of 54 places in 265 ms of which 4 ms to minimize.
[2024-06-01 05:32:59] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/739 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/739 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 78/817 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 05:32:59] [INFO ] Deduced a trap composed of 35 places in 264 ms of which 4 ms to minimize.
[2024-06-01 05:33:00] [INFO ] Deduced a trap composed of 50 places in 259 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/817 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 05:33:00] [INFO ] Deduced a trap composed of 20 places in 283 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/817 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/817 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 12/829 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/829 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 238/1067 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1067 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 7/1074 variables, 7/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1074 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 18/1092 variables, 6/197 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1092 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 1809/2901 variables, 1092/1289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2901 variables, 7/1296 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2901 variables, 5/1301 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 05:33:05] [INFO ] Deduced a trap composed of 73 places in 331 ms of which 5 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2901 variables, 1/1302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2901 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 0/2901 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2901/2901 variables, and 1302 constraints, problems are : Problem set: 0 solved, 5 unsolved in 13191 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 138/138 constraints, State Equation: 1092/1092 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 7/7 constraints]
After SMT, in 16146ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 15302 ms.
Support contains 18 out of 1092 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1092/1092 places, 1809/1809 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1092 transition count 1807
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1090 transition count 1807
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 1090 transition count 1803
Deduced a syphon composed of 4 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 13 place count 1085 transition count 1803
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 1085 transition count 1802
Deduced a syphon composed of 1 places in 3 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 16 place count 1083 transition count 1802
Applied a total of 16 rules in 75 ms. Remains 1083 /1092 variables (removed 9) and now considering 1802/1809 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1083/1092 places, 1802/1809 transitions.
RANDOM walk for 40000 steps (416 resets) in 394 ms. (101 steps per ms) remains 4/5 properties
FORMULA ASLink-PT-07b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (63 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (57 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (60 resets) in 265 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (58 resets) in 214 ms. (186 steps per ms) remains 4/4 properties
// Phase 1: matrix 1802 rows 1083 cols
[2024-06-01 05:33:27] [INFO ] Computed 189 invariants in 45 ms
[2024-06-01 05:33:27] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 169/184 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/196 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 460/656 variables, 70/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/656 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 103/759 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/759 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 13/772 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/772 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 276/1048 variables, 58/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1048 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 7/1055 variables, 7/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1055 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 28/1083 variables, 8/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1083 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1802/2885 variables, 1083/1272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2885 variables, 7/1279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2885 variables, 0/1279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/2885 variables, 0/1279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2885/2885 variables, and 1279 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2980 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 136/136 constraints, State Equation: 1083/1083 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 169/184 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:33:30] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/196 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 460/656 variables, 70/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/656 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 103/759 variables, 14/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/759 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 13/772 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/772 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 276/1048 variables, 58/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:33:31] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1048 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:33:31] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1048 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1048 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 7/1055 variables, 7/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1055 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 28/1083 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1083 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 1802/2885 variables, 1083/1275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2885 variables, 7/1282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2885 variables, 4/1286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2885 variables, 0/1286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/2885 variables, 0/1286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2885/2885 variables, and 1286 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9802 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 136/136 constraints, State Equation: 1083/1083 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 12861ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 12161 ms.
Support contains 15 out of 1083 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1083/1083 places, 1802/1802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2 place count 1082 transition count 1801
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1081 transition count 1800
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1081 transition count 1800
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1080 transition count 1799
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1080 transition count 1799
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 1080 transition count 1798
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 1080 transition count 1797
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 1079 transition count 1797
Applied a total of 9 rules in 206 ms. Remains 1079 /1083 variables (removed 4) and now considering 1797/1802 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 1079/1083 places, 1797/1802 transitions.
RANDOM walk for 40000 steps (411 resets) in 370 ms. (107 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (62 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (57 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (63 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (63 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 192475 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 4
Probabilistic random walk after 192475 steps, saw 34400 distinct states, run finished after 3007 ms. (steps per millisecond=64 ) properties seen :0
// Phase 1: matrix 1797 rows 1079 cols
[2024-06-01 05:33:55] [INFO ] Computed 189 invariants in 30 ms
[2024-06-01 05:33:55] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 168/183 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 69/252 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 14/266 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 526/792 variables, 89/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/792 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 60/852 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/852 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/855 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/855 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 211/1066 variables, 43/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1066 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 5/1071 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1071 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 8/1079 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1079 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1797/2876 variables, 1079/1268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2876 variables, 7/1275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2876 variables, 0/1275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/2876 variables, 0/1275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2876/2876 variables, and 1275 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2625 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 136/136 constraints, State Equation: 1079/1079 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 168/183 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:33:58] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 69/252 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 14/266 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 526/792 variables, 89/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:33:58] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/792 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/792 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 60/852 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/852 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/855 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:33:59] [INFO ] Deduced a trap composed of 20 places in 259 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/855 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/855 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 211/1066 variables, 43/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1066 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 5/1071 variables, 5/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1071 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 8/1079 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1079 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 1797/2876 variables, 1079/1271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2876 variables, 7/1278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2876 variables, 4/1282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2876 variables, 0/1282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/2876 variables, 0/1282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2876/2876 variables, and 1282 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9559 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 136/136 constraints, State Equation: 1079/1079 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 12249ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 12406 ms.
Support contains 15 out of 1079 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1079/1079 places, 1797/1797 transitions.
Applied a total of 0 rules in 48 ms. Remains 1079 /1079 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1079/1079 places, 1797/1797 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1079/1079 places, 1797/1797 transitions.
Applied a total of 0 rules in 44 ms. Remains 1079 /1079 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
[2024-06-01 05:34:20] [INFO ] Invariant cache hit.
[2024-06-01 05:34:22] [INFO ] Implicit Places using invariants in 2289 ms returned [1, 18, 20, 23, 36, 54, 72, 123, 169, 170, 171, 172, 174, 191, 209, 247, 281, 286, 287, 298, 299, 301, 318, 336, 406, 410, 411, 422, 423, 425, 442, 460, 532, 534, 538, 539, 550, 551, 553, 570, 588, 659, 663, 664, 675, 676, 678, 696, 714, 733, 784, 785, 796, 797, 799, 816, 834, 904, 908, 909, 912, 923, 924, 925, 943, 945, 949, 967, 968, 969, 970, 982, 988, 994, 1000, 1006, 1012, 1018, 1024, 1030, 1036, 1042]
[2024-06-01 05:34:22] [INFO ] Actually due to overlaps returned [943, 925, 36, 54, 191, 318, 442, 570, 696, 816, 949, 174, 301, 425, 553, 799, 170, 171, 298, 422, 550, 675, 678, 796, 923, 967, 172, 299, 423, 551, 676, 797, 924, 945, 968, 1, 286, 287, 410, 411, 538, 539, 663, 664, 784, 785, 908, 909, 18, 72, 169, 209, 336, 460, 588, 834, 969, 1012, 1030, 1042, 20, 23, 714, 733, 912, 970, 982, 988, 994, 1000, 1006, 1018, 1024, 1036]
Discarding 74 places :
Implicit Place search using SMT only with invariants took 2307 ms to find 74 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1005/1079 places, 1797/1797 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 143 rules applied. Total rules applied 143 place count 997 transition count 1662
Reduce places removed 135 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 146 rules applied. Total rules applied 289 place count 862 transition count 1651
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 294 place count 857 transition count 1651
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 294 place count 857 transition count 1614
Deduced a syphon composed of 37 places in 4 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 369 place count 819 transition count 1614
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 17 rules applied. Total rules applied 386 place count 812 transition count 1604
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 396 place count 802 transition count 1604
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 396 place count 802 transition count 1603
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 398 place count 801 transition count 1603
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 413 place count 786 transition count 1588
Iterating global reduction 5 with 15 rules applied. Total rules applied 428 place count 786 transition count 1588
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 431 place count 786 transition count 1585
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 431 place count 786 transition count 1584
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 433 place count 785 transition count 1584
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 436 place count 782 transition count 1578
Iterating global reduction 6 with 3 rules applied. Total rules applied 439 place count 782 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 440 place count 781 transition count 1577
Iterating global reduction 6 with 1 rules applied. Total rules applied 441 place count 781 transition count 1577
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 442 place count 780 transition count 1575
Iterating global reduction 6 with 1 rules applied. Total rules applied 443 place count 780 transition count 1575
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 4 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 551 place count 726 transition count 1521
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 555 place count 722 transition count 1517
Iterating global reduction 6 with 4 rules applied. Total rules applied 559 place count 722 transition count 1517
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 562 place count 722 transition count 1514
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 566 place count 720 transition count 1515
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 567 place count 720 transition count 1514
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 569 place count 719 transition count 1513
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 8 with 18 rules applied. Total rules applied 587 place count 719 transition count 1495
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 605 place count 701 transition count 1495
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 606 place count 701 transition count 1494
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 9 with 21 rules applied. Total rules applied 627 place count 701 transition count 1494
Applied a total of 627 rules in 616 ms. Remains 701 /1005 variables (removed 304) and now considering 1494/1797 (removed 303) transitions.
// Phase 1: matrix 1494 rows 701 cols
[2024-06-01 05:34:23] [INFO ] Computed 99 invariants in 29 ms
[2024-06-01 05:34:25] [INFO ] Implicit Places using invariants in 1596 ms returned [78, 103, 106, 108, 109, 112, 113, 184, 190, 193, 195, 202, 203, 273, 279, 282, 284, 289, 290, 343, 361, 367, 370, 379, 380, 450, 456, 459, 461, 467, 468, 536, 542, 545, 547, 552, 553, 606, 623, 629, 632, 634, 700]
[2024-06-01 05:34:25] [INFO ] Actually due to overlaps returned [112, 202, 289, 379, 467, 552, 113, 203, 290, 380, 468, 553, 103, 108, 184, 190, 195, 273, 279, 284, 361, 367, 450, 456, 461, 536, 542, 547, 623, 629, 634, 78, 109, 343, 370, 606, 700]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 1614 ms to find 37 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 664/1079 places, 1494/1797 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 640 transition count 1470
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 640 transition count 1470
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 634 transition count 1464
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 634 transition count 1464
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 624 transition count 1454
Free-agglomeration rule applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 99 place count 624 transition count 1435
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 118 place count 605 transition count 1435
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 121 place count 605 transition count 1432
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 124 place count 602 transition count 1432
Applied a total of 124 rules in 243 ms. Remains 602 /664 variables (removed 62) and now considering 1432/1494 (removed 62) transitions.
// Phase 1: matrix 1432 rows 602 cols
[2024-06-01 05:34:25] [INFO ] Computed 62 invariants in 30 ms
[2024-06-01 05:34:26] [INFO ] Implicit Places using invariants in 910 ms returned []
[2024-06-01 05:34:26] [INFO ] Invariant cache hit.
[2024-06-01 05:34:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 05:34:29] [INFO ] Implicit Places using invariants and state equation in 2857 ms returned []
Implicit Place search using SMT with State Equation took 3771 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 602/1079 places, 1432/1797 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8595 ms. Remains : 602/1079 places, 1432/1797 transitions.
RANDOM walk for 40000 steps (657 resets) in 274 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (117 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (125 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (118 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (121 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 154193 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 4
Probabilistic random walk after 154193 steps, saw 96415 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2024-06-01 05:34:32] [INFO ] Invariant cache hit.
[2024-06-01 05:34:32] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 92/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 35/142 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/145 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 13/158 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/161 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 395/556 variables, 38/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/556 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/559 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/559 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 43/602 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/602 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1432/2034 variables, 602/664 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2034 variables, 2/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2034 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/2034 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2034/2034 variables, and 666 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1760 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 602/602 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 92/107 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 35/142 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/145 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 13/158 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/161 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 395/556 variables, 38/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/556 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/559 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/559 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 43/602 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:34:35] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/602 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/602 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 1432/2034 variables, 602/665 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2034 variables, 2/667 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2034 variables, 4/671 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:34:38] [INFO ] Deduced a trap composed of 73 places in 180 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2034 variables, 1/672 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2034 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/2034 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2034/2034 variables, and 672 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8286 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 602/602 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 10079ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 8990 ms.
Support contains 15 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 1432/1432 transitions.
Applied a total of 0 rules in 23 ms. Remains 602 /602 variables (removed 0) and now considering 1432/1432 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 602/602 places, 1432/1432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 1432/1432 transitions.
Applied a total of 0 rules in 23 ms. Remains 602 /602 variables (removed 0) and now considering 1432/1432 (removed 0) transitions.
[2024-06-01 05:34:51] [INFO ] Invariant cache hit.
[2024-06-01 05:34:52] [INFO ] Implicit Places using invariants in 1176 ms returned []
[2024-06-01 05:34:52] [INFO ] Invariant cache hit.
[2024-06-01 05:34:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 05:34:55] [INFO ] Implicit Places using invariants and state equation in 2764 ms returned []
Implicit Place search using SMT with State Equation took 3942 ms to find 0 implicit places.
[2024-06-01 05:34:55] [INFO ] Redundant transitions in 167 ms returned []
Running 1401 sub problems to find dead transitions.
[2024-06-01 05:34:55] [INFO ] Invariant cache hit.
[2024-06-01 05:34:55] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 599/2034 variables, and 50 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 10/16 constraints, Generalized P Invariants (flows): 40/46 constraints, State Equation: 0/602 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 1401/1401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 599/2034 variables, and 50 constraints, problems are : Problem set: 0 solved, 1401 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 10/16 constraints, Generalized P Invariants (flows): 40/46 constraints, State Equation: 0/602 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 0/1401 constraints, Known Traps: 0/0 constraints]
After SMT, in 61473ms problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 61508ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65674 ms. Remains : 602/602 places, 1432/1432 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 40 ms. Remains 602 /602 variables (removed 0) and now considering 1432/1432 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-06-01 05:35:57] [INFO ] Invariant cache hit.
[2024-06-01 05:35:57] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 05:35:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-06-01 05:35:57] [INFO ] [Nat]Absence check using 16 positive and 46 generalized place invariants in 40 ms returned sat
[2024-06-01 05:35:59] [INFO ] After 1832ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 05:36:01] [INFO ] Deduced a trap composed of 57 places in 182 ms of which 2 ms to minimize.
[2024-06-01 05:36:01] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2024-06-01 05:36:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 422 ms
TRAPS : Iteration 1
[2024-06-01 05:36:03] [INFO ] After 6026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 05:36:05] [INFO ] After 7910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 8247 ms.
[2024-06-01 05:36:05] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-06-01 05:36:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 602 places, 1432 transitions and 5768 arcs took 22 ms.
[2024-06-01 05:36:06] [INFO ] Flatten gal took : 361 ms
Total runtime 209005 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-07b-ReachabilityCardinality-2024-00
Could not compute solution for formula : ASLink-PT-07b-ReachabilityCardinality-2023-02
Could not compute solution for formula : ASLink-PT-07b-ReachabilityCardinality-2024-07
Could not compute solution for formula : ASLink-PT-07b-ReachabilityCardinality-2024-11

BK_STOP 1717220166525

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name ASLink-PT-07b-ReachabilityCardinality-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/654/inv_0_
rfs formula name ASLink-PT-07b-ReachabilityCardinality-2023-02
rfs formula type EF
rfs formula formula --invariant=/tmp/654/inv_1_
rfs formula name ASLink-PT-07b-ReachabilityCardinality-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/654/inv_2_
rfs formula name ASLink-PT-07b-ReachabilityCardinality-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/654/inv_3_
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-07b"
export BK_EXAMINATION="ReachabilityCardinality"
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-07b, examination is ReachabilityCardinality"
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-171620117900118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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