Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729000294.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is ASLink-PT-01b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729000294
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 293K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748566781728

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 00:59:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 00:59:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 00:59:43] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2025-05-30 00:59:43] [INFO ] Transformed 846 places.
[2025-05-30 00:59:43] [INFO ] Transformed 1148 transitions.
[2025-05-30 00:59:43] [INFO ] Found NUPN structural information;
[2025-05-30 00:59:43] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-01b-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 00:59:43] [INFO ] Flatten gal took : 165 ms
RANDOM walk for 40000 steps (231 resets) in 1649 ms. (24 steps per ms) remains 6/13 properties
FORMULA ASLink-PT-01b-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (61 resets) in 480 ms. (83 steps per ms) remains 6/6 properties
[2025-05-30 00:59:44] [INFO ] Flatten gal took : 219 ms
[2025-05-30 00:59:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality353840674636493203.gal : 66 ms
BEST_FIRST walk for 40003 steps (70 resets) in 431 ms. (92 steps per ms) remains 6/6 properties
[2025-05-30 00:59:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16193337269459872438.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality353840674636493203.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16193337269459872438.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (72 resets) in 163 ms. (243 steps per ms) remains 6/6 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40004 steps (71 resets) in 171 ms. (232 steps per ms) remains 5/6 properties
FORMULA ASLink-PT-01b-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (73 resets) in 255 ms. (156 steps per ms) remains 5/5 properties
Loading property file /tmp/ReachabilityCardinality16193337269459872438.prop.
BEST_FIRST walk for 40003 steps (64 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
// Phase 1: matrix 1148 rows 846 cols
[2025-05-30 00:59:44] [INFO ] Computed 82 invariants in 65 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :13 after 46
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :46 after 178
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :178 after 571
At refinement iteration 2 (OVERLAPS) 214/277 variables, 16/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :571 after 689
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :689 after 10045
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 214/293 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :10045 after 28954
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 12/289 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 12/308 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :28954 after 435646
Problem ASLink-PT-01b-ReachabilityCardinality-2025-08 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 548/837 variables, 60/368 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :435646 after 9.83056e+07
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 548/916 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :9.83056e+07 after 1.00295e+08
At refinement iteration 10 (INCLUDED_ONLY) 0/837 variables, 0/916 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/846 variables, 3/919 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/846 variables, 9/928 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :1.00295e+08 after 1.16726e+08
At refinement iteration 13 (INCLUDED_ONLY) 0/846 variables, 0/928 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1148/1994 variables, 846/1774 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1994 variables, 0/1774 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1994 variables, 0/1774 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :1.16726e+08 after 1.59208e+08
After SMT solving in domain Real declared 1994/1994 variables, and 1774 constraints, problems are : Problem set: 1 solved, 4 unsolved in 3267 ms.
Refiners :[Domain max(s): 846/846 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 846/846 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 214/276 variables, 16/78 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 214/292 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:48] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 1/293 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/293 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 12/288 variables, 3/296 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 12/308 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/308 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 549/837 variables, 60/368 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/837 variables, 549/917 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:49] [INFO ] Deduced a trap composed of 32 places in 356 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:49] [INFO ] Deduced a trap composed of 34 places in 355 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:50] [INFO ] Deduced a trap composed of 35 places in 371 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:50] [INFO ] Deduced a trap composed of 37 places in 319 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:51] [INFO ] Deduced a trap composed of 60 places in 374 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:51] [INFO ] Deduced a trap composed of 73 places in 246 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:51] [INFO ] Deduced a trap composed of 78 places in 274 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :1.59208e+08 after 1.88343e+09
[2025-05-30 00:59:52] [INFO ] Deduced a trap composed of 50 places in 369 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:52] [INFO ] Deduced a trap composed of 55 places in 366 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:53] [INFO ] Deduced a trap composed of 82 places in 392 ms of which 120 ms to minimize.
SMT process timed out in 8832ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 62 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 846 transition count 1004
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 165 rules applied. Total rules applied 309 place count 702 transition count 983
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 326 place count 685 transition count 983
Performed 169 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 169 Pre rules applied. Total rules applied 326 place count 685 transition count 814
Deduced a syphon composed of 169 places in 4 ms
Ensure Unique test removed 6 places
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 3 with 344 rules applied. Total rules applied 670 place count 510 transition count 814
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 5 rules applied. Total rules applied 675 place count 509 transition count 810
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 679 place count 505 transition count 810
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 679 place count 505 transition count 809
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 681 place count 504 transition count 809
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 699 place count 486 transition count 791
Iterating global reduction 5 with 18 rules applied. Total rules applied 717 place count 486 transition count 791
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 718 place count 486 transition count 790
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 718 place count 486 transition count 785
Deduced a syphon composed of 5 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 729 place count 480 transition count 785
Discarding 1 places :
Implicit places reduction removed 1 places
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 731 place count 479 transition count 784
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 732 place count 478 transition count 784
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 734 place count 476 transition count 769
Iterating global reduction 8 with 2 rules applied. Total rules applied 736 place count 476 transition count 769
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 736 place count 476 transition count 768
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 738 place count 475 transition count 768
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 739 place count 474 transition count 760
Iterating global reduction 8 with 1 rules applied. Total rules applied 740 place count 474 transition count 760
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 741 place count 473 transition count 752
Iterating global reduction 8 with 1 rules applied. Total rules applied 742 place count 473 transition count 752
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 743 place count 472 transition count 744
Iterating global reduction 8 with 1 rules applied. Total rules applied 744 place count 472 transition count 744
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 8 with 86 rules applied. Total rules applied 830 place count 428 transition count 702
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 832 place count 427 transition count 701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 833 place count 426 transition count 701
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 835 place count 425 transition count 710
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 836 place count 425 transition count 709
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 841 place count 425 transition count 704
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 846 place count 420 transition count 704
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 850 place count 420 transition count 700
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 854 place count 416 transition count 700
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 857 place count 416 transition count 700
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 858 place count 415 transition count 699
Applied a total of 858 rules in 404 ms. Remains 415 /846 variables (removed 431) and now considering 699/1148 (removed 449) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 415/846 places, 699/1148 transitions.
RANDOM walk for 40000 steps (726 resets) in 267 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (271 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (291 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (284 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (272 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 525259 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :1 out of 4
Probabilistic random walk after 525259 steps, saw 123438 distinct states, run finished after 3006 ms. (steps per millisecond=174 ) properties seen :1
FORMULA ASLink-PT-01b-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 699 rows 415 cols
[2025-05-30 00:59:56] [INFO ] Computed 70 invariants in 24 ms
[2025-05-30 00:59:56] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/193 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/200 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 215/415 variables, 51/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 699/1114 variables, 415/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1114 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1114 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1114 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 489 constraints, problems are : Problem set: 0 solved, 3 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 415/415 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/193 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/200 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 215/415 variables, 51/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:57] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:58] [INFO ] Deduced a trap composed of 114 places in 215 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:58] [INFO ] Deduced a trap composed of 51 places in 198 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:58] [INFO ] Deduced a trap composed of 72 places in 214 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:58] [INFO ] Deduced a trap composed of 81 places in 279 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:59] [INFO ] Deduced a trap composed of 82 places in 214 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:59] [INFO ] Deduced a trap composed of 88 places in 204 ms of which 44 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:59:59] [INFO ] Deduced a trap composed of 72 places in 153 ms of which 29 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 699/1114 variables, 415/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1114 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1114 variables, 2/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1114 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1114 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 499 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4863 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 415/415 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5499ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 15235 ms.
Support contains 52 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 699/699 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 0 with 3 rules applied. Total rules applied 3 place count 415 transition count 696
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 412 transition count 695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 411 transition count 695
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 411 transition count 693
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 409 transition count 693
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 408 transition count 685
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 408 transition count 685
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 407 transition count 677
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 407 transition count 677
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 19 place count 405 transition count 676
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 3 with 2 rules applied. Total rules applied 21 place count 405 transition count 674
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 22 place count 404 transition count 674
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 23 place count 404 transition count 673
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 24 place count 403 transition count 673
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 25 place count 403 transition count 672
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 26 place count 402 transition count 672
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 27 place count 402 transition count 672
Applied a total of 27 rules in 127 ms. Remains 402 /415 variables (removed 13) and now considering 672/699 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 402/415 places, 672/699 transitions.
RANDOM walk for 40000 steps (709 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (266 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (298 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (301 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 556909 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :0 out of 3
Probabilistic random walk after 556909 steps, saw 134518 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
// Phase 1: matrix 672 rows 402 cols
[2025-05-30 01:00:20] [INFO ] Computed 69 invariants in 6 ms
[2025-05-30 01:00:20] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 138/190 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/194 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 206/400 variables, 48/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/402 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 672/1074 variables, 402/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1074 variables, 6/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1074 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1074 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1074/1074 variables, and 477 constraints, problems are : Problem set: 0 solved, 3 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 402/402 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 138/190 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/194 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 206/400 variables, 48/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:21] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:22] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:22] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:22] [INFO ] Deduced a trap composed of 78 places in 409 ms of which 254 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:22] [INFO ] Deduced a trap composed of 79 places in 182 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:23] [INFO ] Deduced a trap composed of 85 places in 166 ms of which 36 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:23] [INFO ] Deduced a trap composed of 112 places in 210 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:23] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 23 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/402 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 672/1074 variables, 402/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1074 variables, 6/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1074 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1074 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1074 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1074/1074 variables, and 487 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3872 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 402/402 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4551ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA ASLink-PT-01b-ReachabilityCardinality-2025-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 27306 ms.
Support contains 38 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 672/672 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 0 with 3 rules applied. Total rules applied 3 place count 402 transition count 669
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 399 transition count 667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 398 transition count 667
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 9 place count 398 transition count 659
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 25 place count 390 transition count 659
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 389 transition count 659
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 27 place count 388 transition count 658
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 388 transition count 658
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 32 place count 386 transition count 656
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 386 transition count 655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 34 place count 385 transition count 655
Applied a total of 34 rules in 58 ms. Remains 385 /402 variables (removed 17) and now considering 655/672 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 385/402 places, 655/672 transitions.
RANDOM walk for 40000 steps (639 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (221 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (252 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 555695 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :0 out of 2
Probabilistic random walk after 555695 steps, saw 138949 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
// Phase 1: matrix 655 rows 385 cols
[2025-05-30 01:00:55] [INFO ] Computed 68 invariants in 13 ms
[2025-05-30 01:00:55] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 134/172 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/177 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 206/383 variables, 48/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/385 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 655/1040 variables, 385/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1040 variables, 7/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1040 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1040 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1040/1040 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 385/385 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 134/172 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/177 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 206/383 variables, 48/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:56] [INFO ] Deduced a trap composed of 73 places in 178 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:57] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:57] [INFO ] Deduced a trap composed of 65 places in 204 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:00:57] [INFO ] Deduced a trap composed of 78 places in 190 ms of which 50 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/385 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 655/1040 variables, 385/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1040 variables, 7/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1040 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1040 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1040 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1040/1040 variables, and 465 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1988 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 385/385 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2484ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 874 ms.
Support contains 38 out of 385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 655/655 transitions.
Applied a total of 0 rules in 10 ms. Remains 385 /385 variables (removed 0) and now considering 655/655 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 385/385 places, 655/655 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 655/655 transitions.
Applied a total of 0 rules in 11 ms. Remains 385 /385 variables (removed 0) and now considering 655/655 (removed 0) transitions.
[2025-05-30 01:00:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:00:59] [INFO ] Implicit Places using invariants in 371 ms returned [1, 19, 21, 28, 43, 60, 78, 123, 140, 143, 156, 169, 199, 200, 202, 204, 234, 241, 259, 264, 265, 284, 290, 296, 302, 309, 315, 322, 328, 334, 340, 346]
[2025-05-30 01:00:59] [INFO ] Actually due to overlaps returned [234, 204, 43, 60, 241, 200, 202, 259, 1, 19, 78, 199, 264, 315, 334, 346, 21, 28, 123, 265, 284, 290, 296, 302, 309, 322, 328, 340]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 382 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 357/385 places, 655/655 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 355 transition count 627
Reduce places removed 28 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 35 rules applied. Total rules applied 65 place count 327 transition count 620
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 72 place count 320 transition count 620
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 72 place count 320 transition count 616
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 80 place count 316 transition count 616
Discarding 3 places :
Implicit places reduction removed 3 places
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 3 with 5 rules applied. Total rules applied 85 place count 313 transition count 614
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 87 place count 311 transition count 614
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 96 place count 302 transition count 605
Iterating global reduction 5 with 9 rules applied. Total rules applied 105 place count 302 transition count 605
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 105 place count 302 transition count 604
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 107 place count 301 transition count 604
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 111 place count 297 transition count 599
Iterating global reduction 5 with 4 rules applied. Total rules applied 115 place count 297 transition count 599
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 116 place count 296 transition count 598
Iterating global reduction 5 with 1 rules applied. Total rules applied 117 place count 296 transition count 598
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 118 place count 295 transition count 596
Iterating global reduction 5 with 1 rules applied. Total rules applied 119 place count 295 transition count 596
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 161 place count 274 transition count 575
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 162 place count 273 transition count 574
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 273 transition count 574
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 165 place count 272 transition count 574
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 272 transition count 573
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 167 place count 271 transition count 573
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 180 place count 271 transition count 560
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 194 place count 257 transition count 560
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 196 place count 257 transition count 558
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 199 place count 257 transition count 558
Applied a total of 199 rules in 84 ms. Remains 257 /357 variables (removed 100) and now considering 558/655 (removed 97) transitions.
// Phase 1: matrix 558 rows 257 cols
[2025-05-30 01:00:59] [INFO ] Computed 34 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:00:59] [INFO ] Implicit Places using invariants in 165 ms returned [85, 114, 117, 132, 222, 239, 242, 245, 256]
[2025-05-30 01:00:59] [INFO ] Actually due to overlaps returned [222, 85, 114, 132, 239, 242, 245, 256]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 168 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 249/385 places, 558/655 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 0 with 2 rules applied. Total rules applied 2 place count 248 transition count 557
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 247 transition count 557
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 6 place count 244 transition count 554
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 244 transition count 554
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 12 place count 241 transition count 551
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 241 transition count 551
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 241 transition count 549
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 240 transition count 548
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 240 transition count 547
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 240 transition count 546
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 239 transition count 546
Applied a total of 22 rules in 37 ms. Remains 239 /249 variables (removed 10) and now considering 546/558 (removed 12) transitions.
// Phase 1: matrix 546 rows 239 cols
[2025-05-30 01:01:00] [INFO ] Computed 25 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:01:00] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-05-30 01:01:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:01:00] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 239/385 places, 546/655 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1293 ms. Remains : 239/385 places, 546/655 transitions.
RANDOM walk for 40000 steps (822 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (340 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (334 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 655490 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :0 out of 2
Probabilistic random walk after 655490 steps, saw 196567 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
[2025-05-30 01:01:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 89/127 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 112/239 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 546/785 variables, 239/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/785 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/785 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 785/785 variables, and 264 constraints, problems are : Problem set: 0 solved, 2 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 89/127 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 112/239 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:04] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:04] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:04] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:04] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:04] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:04] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 546/785 variables, 239/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/785 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/785 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/785 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 785/785 variables, and 272 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2235 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2511ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 478 ms.
Support contains 38 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 546/546 transitions.
Applied a total of 0 rules in 11 ms. Remains 239 /239 variables (removed 0) and now considering 546/546 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 239/239 places, 546/546 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 546/546 transitions.
Applied a total of 0 rules in 9 ms. Remains 239 /239 variables (removed 0) and now considering 546/546 (removed 0) transitions.
[2025-05-30 01:01:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:01:06] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-05-30 01:01:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:01:07] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:01:07] [INFO ] Redundant transitions in 42 ms returned []
Running 543 sub problems to find dead transitions.
[2025-05-30 01:01:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (OVERLAPS) 3/239 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:16] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:16] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:16] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:17] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:17] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:17] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:17] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:17] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:17] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:17] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:18] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:19] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:19] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:19] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:19] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:20] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:20] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:21] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:21] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:22] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:25] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:26] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 27 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:29] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:30] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:31] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:31] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:32] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:33] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:33] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:35] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 239/785 variables, and 55 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/239 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 543 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (OVERLAPS) 3/239 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:01:43] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 21 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
At refinement iteration 9 (OVERLAPS) 546/785 variables, 239/295 constraints. Problems are: Problem set: 156 solved, 387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 785/785 variables, and 682 constraints, problems are : Problem set: 156 solved, 387 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 387/543 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60293ms problems are : Problem set: 156 solved, 387 unsolved
Search for dead transitions found 156 dead transitions in 60297ms
Found 156 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 156 transitions
Dead transitions reduction (with SMT) removed 156 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 239/239 places, 390/546 transitions.
Applied a total of 0 rules in 5 ms. Remains 239 /239 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:02:07] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60943 ms. Remains : 239/239 places, 390/546 transitions.
RANDOM walk for 40000 steps (866 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (352 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (344 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 695521 steps, run timeout after 3001 ms. (steps per millisecond=231 ) properties seen :0 out of 2
Probabilistic random walk after 695521 steps, saw 207904 distinct states, run finished after 3001 ms. (steps per millisecond=231 ) properties seen :0
// Phase 1: matrix 390 rows 239 cols
[2025-05-30 01:02:10] [INFO ] Computed 25 invariants in 3 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/135 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 104/239 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 390/629 variables, 239/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/629 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/629 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 264 constraints, problems are : Problem set: 0 solved, 2 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/135 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:11] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 104/239 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:11] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:11] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:11] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:11] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:11] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:12] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:12] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:12] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:12] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:12] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:12] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 390/629 variables, 239/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/629 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 629/629 variables, and 278 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2719 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2979ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 413 ms.
Support contains 38 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 390/390 transitions.
Applied a total of 0 rules in 4 ms. Remains 239 /239 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 239/239 places, 390/390 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 390/390 transitions.
Applied a total of 0 rules in 4 ms. Remains 239 /239 variables (removed 0) and now considering 390/390 (removed 0) transitions.
[2025-05-30 01:02:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:02:14] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-05-30 01:02:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:02:14] [INFO ] Implicit Places using invariants and state equation in 417 ms returned [3, 5, 9, 11, 13, 15, 35, 37, 39, 41, 43, 45, 47, 68, 70]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 547 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 224/239 places, 390/390 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 217 transition count 317
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 217 transition count 317
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 217 transition count 316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 216 transition count 316
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 216 transition count 315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 215 transition count 315
Applied a total of 18 rules in 19 ms. Remains 215 /224 variables (removed 9) and now considering 315/390 (removed 75) transitions.
// Phase 1: matrix 315 rows 215 cols
[2025-05-30 01:02:14] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:02:14] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-05-30 01:02:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:02:15] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 215/239 places, 315/390 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 927 ms. Remains : 215/239 places, 315/390 transitions.
RANDOM walk for 40000 steps (864 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (323 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (351 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 756257 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 2
Probabilistic random walk after 756257 steps, saw 224045 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
[2025-05-30 01:02:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 83/121 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/205 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 315/520 variables, 205/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/530 variables, 10/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/530 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 237 constraints, problems are : Problem set: 0 solved, 2 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 83/121 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:18] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 84/205 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:18] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:18] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:18] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 315/520 variables, 205/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/530 variables, 10/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:19] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:19] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 23 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/530 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 245 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1242 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1472ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 638 ms.
Support contains 38 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 315/315 transitions.
Applied a total of 0 rules in 3 ms. Remains 215 /215 variables (removed 0) and now considering 315/315 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 215/215 places, 315/315 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 315/315 transitions.
Applied a total of 0 rules in 4 ms. Remains 215 /215 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2025-05-30 01:02:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:02:20] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-05-30 01:02:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:02:20] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:02:20] [INFO ] Redundant transitions in 11 ms returned []
Running 312 sub problems to find dead transitions.
[2025-05-30 01:02:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 3/215 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:25] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:25] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:25] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:25] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:25] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:25] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:26] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 8 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD134 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:26] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 8 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:26] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 6 ms to minimize.
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:26] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:26] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:26] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:27] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:27] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 14/36 constraints. Problems are: Problem set: 21 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/36 constraints. Problems are: Problem set: 21 solved, 291 unsolved
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
At refinement iteration 7 (OVERLAPS) 315/530 variables, 215/251 constraints. Problems are: Problem set: 62 solved, 250 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:31] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:31] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:32] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 21 ms to minimize.
Problem TDEAD100 is UNSAT
Problem TDEAD117 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:33] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:33] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 6 ms to minimize.
Problem TDEAD305 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 5/256 constraints. Problems are: Problem set: 65 solved, 247 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:34] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:34] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 15 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 2/258 constraints. Problems are: Problem set: 65 solved, 247 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/258 constraints. Problems are: Problem set: 65 solved, 247 unsolved
At refinement iteration 11 (OVERLAPS) 0/530 variables, 0/258 constraints. Problems are: Problem set: 65 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 258 constraints, problems are : Problem set: 65 solved, 247 unsolved in 26855 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 65 solved, 247 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/212 variables, 2/2 constraints. Problems are: Problem set: 65 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/212 variables, 6/8 constraints. Problems are: Problem set: 65 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 5/13 constraints. Problems are: Problem set: 65 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/13 constraints. Problems are: Problem set: 65 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 3/215 variables, 8/21 constraints. Problems are: Problem set: 65 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 6/27 constraints. Problems are: Problem set: 65 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 16/43 constraints. Problems are: Problem set: 65 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/43 constraints. Problems are: Problem set: 65 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 315/530 variables, 215/258 constraints. Problems are: Problem set: 65 solved, 247 unsolved
Problem TDEAD107 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 247/505 constraints. Problems are: Problem set: 72 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:54] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:02:54] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 2/507 constraints. Problems are: Problem set: 72 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/530 variables, and 507 constraints, problems are : Problem set: 72 solved, 240 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 247/312 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56908ms problems are : Problem set: 72 solved, 240 unsolved
Search for dead transitions found 72 dead transitions in 56909ms
Found 72 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 72 transitions
Dead transitions reduction (with SMT) removed 72 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/215 places, 243/315 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 211 transition count 226
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 39 place count 194 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 193 transition count 225
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 193 transition count 223
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 44 place count 191 transition count 223
Applied a total of 44 rules in 22 ms. Remains 191 /215 variables (removed 24) and now considering 223/243 (removed 20) transitions.
// Phase 1: matrix 223 rows 191 cols
[2025-05-30 01:03:17] [INFO ] Computed 27 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:03:17] [INFO ] Implicit Places using invariants in 98 ms returned [4, 22, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 100 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 188/215 places, 223/315 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 188 transition count 211
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 176 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 176 transition count 210
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 175 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 174 transition count 209
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 174 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 173 transition count 208
Applied a total of 30 rules in 14 ms. Remains 173 /188 variables (removed 15) and now considering 208/223 (removed 15) transitions.
// Phase 1: matrix 208 rows 173 cols
[2025-05-30 01:03:17] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:03:17] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-30 01:03:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:03:17] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 173/215 places, 208/315 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 57666 ms. Remains : 173/215 places, 208/315 transitions.
RANDOM walk for 40000 steps (1050 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (390 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (362 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 894259 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :0 out of 2
Probabilistic random walk after 894259 steps, saw 264858 distinct states, run finished after 3001 ms. (steps per millisecond=297 ) properties seen :0
[2025-05-30 01:03:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 150.0 s and query timeout 15000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 62/100 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 73/173 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:21] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:21] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 208/381 variables, 173/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/381 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 199 constraints, problems are : Problem set: 0 solved, 2 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 150.0 s and query timeout 15000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 62/100 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 73/173 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:21] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:21] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:21] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:21] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:21] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:21] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 208/381 variables, 173/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:22] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/381 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 208 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1462 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1791ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 568 ms.
Support contains 38 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 173 /173 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 173/173 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 173 /173 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2025-05-30 01:03:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:03:23] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-30 01:03:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:03:23] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:03:23] [INFO ] Redundant transitions in 0 ms returned []
Running 205 sub problems to find dead transitions.
[2025-05-30 01:03:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 3/173 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:26] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:26] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:26] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:26] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:26] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:26] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:26] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:26] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:27] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:27] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:27] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:27] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:27] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:27] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:28] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:28] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 208/381 variables, 173/213 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:31] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:36] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 5 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/381 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:38] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/381 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:42] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 14 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/381 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/381 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 16 (OVERLAPS) 0/381 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 217 constraints, problems are : Problem set: 0 solved, 205 unsolved in 26559 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 3/173 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:51] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:52] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 208/381 variables, 173/219 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 205/424 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:56] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:03:56] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:04] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/381 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/381 variables, and 427 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56602ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 56603ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56867 ms. Remains : 173/173 places, 208/208 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 173 transition count 207
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 207
Applied a total of 2 rules in 4 ms. Remains 172 /173 variables (removed 1) and now considering 207/208 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 207 rows 172 cols
[2025-05-30 01:04:20] [INFO ] Computed 24 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 01:04:20] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 01:04:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-30 01:04:20] [INFO ] [Nat]Absence check using 11 positive and 13 generalized place invariants in 3 ms returned sat
[2025-05-30 01:04:20] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:20] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:20] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:20] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 6 ms to minimize.
[2025-05-30 01:04:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 258 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:04:20] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 4 ms to minimize.
[2025-05-30 01:04:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
TRAPS : Iteration 1
[2025-05-30 01:04:21] [INFO ] After 558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-05-30 01:04:21] [INFO ] After 726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-05-30 01:04:21] [INFO ] Flatten gal took : 24 ms
[2025-05-30 01:04:21] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:04:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2503355524448547945.gal : 2 ms
[2025-05-30 01:04:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13249302427507569794.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2503355524448547945.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13249302427507569794.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13249302427507569794.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 22
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :22 after 30
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :30 after 74
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :74 after 778
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :778 after 1106
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1106 after 2770
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2770 after 14200
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :14200 after 56451
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :56451 after 388855
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :388855 after 3.06044e+06
Detected timeout of ITS tools.
[2025-05-30 01:04:36] [INFO ] Flatten gal took : 16 ms
[2025-05-30 01:04:36] [INFO ] Applying decomposition
[2025-05-30 01:04:36] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1311192356507624236.txt' '-o' '/tmp/graph1311192356507624236.bin' '-w' '/tmp/graph1311192356507624236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1311192356507624236.bin' '-l' '-1' '-v' '-w' '/tmp/graph1311192356507624236.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:04:36] [INFO ] Decomposing Gal with order
[2025-05-30 01:04:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:04:36] [INFO ] Removed a total of 161 redundant transitions.
[2025-05-30 01:04:36] [INFO ] Flatten gal took : 53 ms
[2025-05-30 01:04:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 9 ms.
[2025-05-30 01:04:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16436365210563659062.gal : 4 ms
[2025-05-30 01:04:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7975181758682130233.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16436365210563659062.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7975181758682130233.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7975181758682130233.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 34
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :34 after 34
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :34 after 814
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :814 after 2764
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2764 after 47996
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :47996 after 160670
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :160670 after 7.34304e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.40327e+07,5.31748,130940,1547,1126,221570,24779,688,299745,241,189543,0
Total reachable state count : 34032668

Verifying 2 reachability properties.
Reachability property ASLink-PT-01b-ReachabilityCardinality-2025-09 does not hold.
No reachable states exhibit your property : ASLink-PT-01b-ReachabilityCardinality-2025-09

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-01b-ReachabilityCardinality-2025-09,0,5.34834,131196,1,0,221570,24779,719,299745,256,189543,7764
Invariant property ASLink-PT-01b-ReachabilityCardinality-2025-12 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-01b-ReachabilityCardinality-2025-12,0,5.35569,131196,1,0,221570,24779,747,299745,259,189543,10776
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA ASLink-PT-01b-ReachabilityCardinality-2025-12 TRUE TECHNIQUES OVER_APPROXIMATION
FORMULA ASLink-PT-01b-ReachabilityCardinality-2025-09 FALSE TECHNIQUES OVER_APPROXIMATION
Over-approximation ignoring read arcs solved -2 properties in 21532 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 298903 ms.

BK_STOP 1748567081955

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-01b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is ASLink-PT-01b, 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 r002-tall-174853729000294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01b.tgz
mv ASLink-PT-01b 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.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 ;