About the Execution of LTSMin+red for FunctionPointer-PT-c004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9647.976 | 926617.00 | 1149836.00 | 1807.60 | 0 ? 0 ? 0 ? inf 0 0 0 ? ? ? 0 0 4 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r496-tall-171640603100285.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FunctionPointer-PT-c004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603100285
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717190957199
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:29:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:29:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:29:18] [INFO ] Load time of PNML (sax parser for PT used): 385 ms
[2024-05-31 21:29:18] [INFO ] Transformed 2826 places.
[2024-05-31 21:29:18] [INFO ] Transformed 8960 transitions.
[2024-05-31 21:29:18] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 532 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1198 places in 35 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:29:19] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-31 21:29:19] [INFO ] Computed 4 invariants in 87 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
RANDOM walk for 10000 steps (2 resets) in 264 ms. (37 steps per ms)
BEST_FIRST walk for 80008 steps (16 resets) in 174 ms. (457 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2, 1, 0, 2, 4, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2024-05-31 21:29:19] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
[2024-05-31 21:29:19] [INFO ] Invariant cache hit.
[2024-05-31 21:29:20] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2024-05-31 21:29:20] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:29:20] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2024-05-31 21:29:21] [INFO ] State equation strengthened by 479 read => feed constraints.
[2024-05-31 21:29:21] [INFO ] [Real]Added 479 Read/Feed constraints in 158 ms returned sat
[2024-05-31 21:29:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:29:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:29:22] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2024-05-31 21:29:22] [INFO ] [Nat]Added 479 Read/Feed constraints in 161 ms returned sat
[2024-05-31 21:29:23] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 768 ms.
[2024-05-31 21:29:23] [INFO ] Added : 2 causal constraints over 1 iterations in 1157 ms. Result :sat
Minimization took 599 ms.
[2024-05-31 21:29:24] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:29:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:29:25] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2024-05-31 21:29:25] [INFO ] [Real]Added 479 Read/Feed constraints in 119 ms returned sat
[2024-05-31 21:29:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:29:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:29:26] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2024-05-31 21:29:26] [INFO ] [Nat]Added 479 Read/Feed constraints in 99 ms returned sat
[2024-05-31 21:29:27] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 687 ms.
[2024-05-31 21:29:29] [INFO ] Deduced a trap composed of 142 places in 1308 ms of which 88 ms to minimize.
[2024-05-31 21:29:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1563 ms
[2024-05-31 21:29:29] [INFO ] Added : 2 causal constraints over 1 iterations in 2680 ms. Result :sat
Minimization took 577 ms.
[2024-05-31 21:29:30] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:29:30] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:29:30] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2024-05-31 21:29:31] [INFO ] [Real]Added 479 Read/Feed constraints in 107 ms returned sat
[2024-05-31 21:29:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:29:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:29:32] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2024-05-31 21:29:32] [INFO ] [Nat]Added 479 Read/Feed constraints in 116 ms returned sat
[2024-05-31 21:29:32] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 447 ms.
[2024-05-31 21:29:33] [INFO ] Added : 2 causal constraints over 1 iterations in 779 ms. Result :sat
Minimization took 581 ms.
[2024-05-31 21:29:33] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:29:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:29:34] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2024-05-31 21:29:34] [INFO ] [Real]Added 479 Read/Feed constraints in 110 ms returned sat
[2024-05-31 21:29:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:29:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:29:35] [INFO ] [Nat]Absence check using state equation in 672 ms returned sat
[2024-05-31 21:29:35] [INFO ] [Nat]Added 479 Read/Feed constraints in 236 ms returned sat
[2024-05-31 21:29:36] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 420 ms.
[2024-05-31 21:29:36] [INFO ] Added : 2 causal constraints over 1 iterations in 755 ms. Result :sat
Minimization took 599 ms.
[2024-05-31 21:29:37] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:29:37] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:29:38] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2024-05-31 21:29:38] [INFO ] [Real]Added 479 Read/Feed constraints in 146 ms returned sat
[2024-05-31 21:29:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2024-05-31 21:29:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:29:39] [INFO ] [Nat]Absence check using state equation in 781 ms returned sat
[2024-05-31 21:29:39] [INFO ] [Nat]Added 479 Read/Feed constraints in 121 ms returned sat
[2024-05-31 21:29:40] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 448 ms.
[2024-05-31 21:29:40] [INFO ] Added : 2 causal constraints over 1 iterations in 787 ms. Result :sat
Minimization took 587 ms.
[2024-05-31 21:29:41] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:29:41] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:29:42] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2024-05-31 21:29:42] [INFO ] [Real]Added 479 Read/Feed constraints in 100 ms returned sat
[2024-05-31 21:29:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:29:42] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:29:43] [INFO ] [Nat]Absence check using state equation in 793 ms returned sat
[2024-05-31 21:29:43] [INFO ] [Nat]Added 479 Read/Feed constraints in 135 ms returned sat
[2024-05-31 21:29:44] [INFO ] Deduced a trap composed of 164 places in 1228 ms of which 11 ms to minimize.
[2024-05-31 21:29:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1429 ms
[2024-05-31 21:29:45] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 469 ms.
[2024-05-31 21:29:45] [INFO ] Added : 2 causal constraints over 1 iterations in 779 ms. Result :sat
Minimization took 585 ms.
[2024-05-31 21:29:46] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:29:46] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:29:47] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2024-05-31 21:29:47] [INFO ] [Real]Added 479 Read/Feed constraints in 151 ms returned sat
[2024-05-31 21:29:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:29:47] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:29:48] [INFO ] [Nat]Absence check using state equation in 798 ms returned sat
[2024-05-31 21:29:48] [INFO ] [Nat]Added 479 Read/Feed constraints in 137 ms returned sat
[2024-05-31 21:29:49] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 424 ms.
[2024-05-31 21:29:49] [INFO ] Added : 2 causal constraints over 1 iterations in 771 ms. Result :sat
Minimization took 576 ms.
[2024-05-31 21:29:50] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:29:50] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:29:51] [INFO ] [Real]Absence check using state equation in 770 ms returned sat
[2024-05-31 21:29:51] [INFO ] [Real]Added 479 Read/Feed constraints in 139 ms returned sat
[2024-05-31 21:29:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:29:51] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:29:52] [INFO ] [Nat]Absence check using state equation in 764 ms returned sat
[2024-05-31 21:29:52] [INFO ] [Nat]Added 479 Read/Feed constraints in 154 ms returned sat
[2024-05-31 21:29:52] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 416 ms.
[2024-05-31 21:29:53] [INFO ] Added : 2 causal constraints over 1 iterations in 740 ms. Result :sat
Minimization took 583 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2, 1, 0, 2, 4, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 1, 0, 2, 4, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
Support contains 8 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1423 are kept as prefixes of interest. Removing 205 places using SCC suffix rule.12 ms
Discarding 205 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 1423 transition count 5583
Discarding 300 places :
Symmetric choice reduction at 1 with 300 rule applications. Total rules 680 place count 1123 transition count 3301
Iterating global reduction 1 with 300 rules applied. Total rules applied 980 place count 1123 transition count 3301
Ensure Unique test removed 362 transitions
Reduce isomorphic transitions removed 362 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 1342 place count 1123 transition count 2939
Discarding 155 places :
Symmetric choice reduction at 2 with 155 rule applications. Total rules 1497 place count 968 transition count 2629
Iterating global reduction 2 with 155 rules applied. Total rules applied 1652 place count 968 transition count 2629
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1720 place count 968 transition count 2561
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1733 place count 955 transition count 2535
Iterating global reduction 3 with 13 rules applied. Total rules applied 1746 place count 955 transition count 2535
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1759 place count 942 transition count 2509
Iterating global reduction 3 with 13 rules applied. Total rules applied 1772 place count 942 transition count 2509
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1785 place count 929 transition count 2483
Iterating global reduction 3 with 13 rules applied. Total rules applied 1798 place count 929 transition count 2483
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1811 place count 916 transition count 2457
Iterating global reduction 3 with 13 rules applied. Total rules applied 1824 place count 916 transition count 2457
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1837 place count 903 transition count 2431
Iterating global reduction 3 with 13 rules applied. Total rules applied 1850 place count 903 transition count 2431
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1863 place count 890 transition count 2405
Iterating global reduction 3 with 13 rules applied. Total rules applied 1876 place count 890 transition count 2405
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1889 place count 877 transition count 2379
Iterating global reduction 3 with 13 rules applied. Total rules applied 1902 place count 877 transition count 2379
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1954 place count 825 transition count 2185
Iterating global reduction 3 with 52 rules applied. Total rules applied 2006 place count 825 transition count 2185
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2063 place count 768 transition count 1957
Iterating global reduction 3 with 57 rules applied. Total rules applied 2120 place count 768 transition count 1957
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2177 place count 711 transition count 1815
Iterating global reduction 3 with 57 rules applied. Total rules applied 2234 place count 711 transition count 1815
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2291 place count 654 transition count 1701
Iterating global reduction 3 with 57 rules applied. Total rules applied 2348 place count 654 transition count 1701
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2405 place count 597 transition count 1587
Iterating global reduction 3 with 57 rules applied. Total rules applied 2462 place count 597 transition count 1587
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2519 place count 540 transition count 1473
Iterating global reduction 3 with 57 rules applied. Total rules applied 2576 place count 540 transition count 1473
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2633 place count 483 transition count 1359
Iterating global reduction 3 with 57 rules applied. Total rules applied 2690 place count 483 transition count 1359
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 2704 place count 469 transition count 1331
Iterating global reduction 3 with 14 rules applied. Total rules applied 2718 place count 469 transition count 1331
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 2732 place count 469 transition count 1317
Applied a total of 2732 rules in 1158 ms. Remains 469 /1628 variables (removed 1159) and now considering 1317/5962 (removed 4645) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1170 ms. Remains : 469/1628 places, 1317/5962 transitions.
[2024-05-31 21:29:55] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
Found an invariant !
This invariant on transitions {224=1, 350=1, 684=1, 755=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {248=1, 374=1, 708=1, 759=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :[2, 0, 0, 0, 0, 3, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 0, 2, 1, 0, 3, 4, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2024-05-31 21:29:55] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-31 21:29:55] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0, 2, 1, 0, 3, 4, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
RANDOM walk for 1000001 steps (2 resets) in 2359 ms. (423 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 4782 ms. (1672 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 5, 5, 376, 0, 359, 4, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2024-05-31 21:30:02] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:30:02] [INFO ] Invariant cache hit.
[2024-05-31 21:30:02] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:30:02] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-31 21:30:02] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-31 21:30:02] [INFO ] [Real]Added 95 Read/Feed constraints in 42 ms returned sat
[2024-05-31 21:30:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:30:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:30:03] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-31 21:30:03] [INFO ] [Nat]Added 95 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:30:03] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 75 ms.
[2024-05-31 21:30:03] [INFO ] Added : 2 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 306 ms.
[2024-05-31 21:30:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:30:04] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-31 21:30:04] [INFO ] [Real]Added 95 Read/Feed constraints in 48 ms returned sat
[2024-05-31 21:30:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:30:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:30:04] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-31 21:30:04] [INFO ] [Nat]Added 95 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:30:04] [INFO ] Deduced a trap composed of 75 places in 218 ms of which 3 ms to minimize.
[2024-05-31 21:30:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2024-05-31 21:30:04] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 60 ms.
[2024-05-31 21:30:04] [INFO ] Added : 2 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 295 ms.
[2024-05-31 21:30:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:30:05] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-31 21:30:05] [INFO ] [Real]Added 95 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:30:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:30:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 21:30:05] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-31 21:30:05] [INFO ] [Nat]Added 95 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:30:05] [INFO ] Deduced a trap composed of 100 places in 222 ms of which 3 ms to minimize.
[2024-05-31 21:30:06] [INFO ] Deduced a trap composed of 82 places in 215 ms of which 4 ms to minimize.
[2024-05-31 21:30:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 503 ms
[2024-05-31 21:30:06] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 67 ms.
[2024-05-31 21:30:06] [INFO ] Added : 2 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 311 ms.
[2024-05-31 21:30:06] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:30:06] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-31 21:30:07] [INFO ] [Real]Added 95 Read/Feed constraints in 49 ms returned sat
[2024-05-31 21:30:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:30:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:30:07] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-31 21:30:07] [INFO ] [Nat]Added 95 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:30:07] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 64 ms.
[2024-05-31 21:30:07] [INFO ] Added : 4 causal constraints over 1 iterations in 156 ms. Result :sat
Minimization took 278 ms.
[2024-05-31 21:30:07] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:30:08] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-31 21:30:08] [INFO ] [Real]Added 95 Read/Feed constraints in 25 ms returned sat
[2024-05-31 21:30:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:30:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:30:08] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-31 21:30:08] [INFO ] [Nat]Added 95 Read/Feed constraints in 26 ms returned sat
[2024-05-31 21:30:08] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 64 ms.
[2024-05-31 21:30:08] [INFO ] Added : 2 causal constraints over 1 iterations in 151 ms. Result :sat
Minimization took 313 ms.
[2024-05-31 21:30:08] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:30:09] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:30:09] [INFO ] [Real]Added 95 Read/Feed constraints in 45 ms returned sat
[2024-05-31 21:30:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:30:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:30:09] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-31 21:30:09] [INFO ] [Nat]Added 95 Read/Feed constraints in 47 ms returned sat
[2024-05-31 21:30:09] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 64 ms.
[2024-05-31 21:30:09] [INFO ] Added : 2 causal constraints over 1 iterations in 151 ms. Result :sat
Minimization took 279 ms.
[2024-05-31 21:30:10] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:30:10] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-31 21:30:10] [INFO ] [Real]Added 95 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:30:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:30:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:30:10] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-31 21:30:10] [INFO ] [Nat]Added 95 Read/Feed constraints in 34 ms returned sat
[2024-05-31 21:30:10] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 64 ms.
[2024-05-31 21:30:10] [INFO ] Added : 2 causal constraints over 1 iterations in 158 ms. Result :sat
Minimization took 276 ms.
[2024-05-31 21:30:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:30:11] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:30:11] [INFO ] [Real]Added 95 Read/Feed constraints in 29 ms returned sat
[2024-05-31 21:30:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:30:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:30:11] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 21:30:11] [INFO ] [Nat]Added 95 Read/Feed constraints in 41 ms returned sat
[2024-05-31 21:30:11] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 63 ms.
[2024-05-31 21:30:11] [INFO ] Added : 2 causal constraints over 1 iterations in 149 ms. Result :sat
Minimization took 398 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 5, 5, 376, 0, 359, 4, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 5, 5, 3389, 2, 359, 4, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
Support contains 8 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 63 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 49 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-31 21:30:13] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:30:13] [INFO ] Invariant cache hit.
[2024-05-31 21:30:13] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-31 21:30:13] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:30:13] [INFO ] Invariant cache hit.
[2024-05-31 21:30:14] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-31 21:30:15] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2024-05-31 21:30:15] [INFO ] Redundant transitions in 76 ms returned []
Running 1315 sub problems to find dead transitions.
[2024-05-31 21:30:15] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:30:15] [INFO ] Invariant cache hit.
[2024-05-31 21:30:15] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
[2024-05-31 21:30:31] [INFO ] Deduced a trap composed of 131 places in 167 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1232 variables, and 4 constraints, problems are : Problem set: 0 solved, 1315 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/469 constraints, ReadFeed: 0/95 constraints, PredecessorRefiner: 1315/1315 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 3 (OVERLAPS) 763/1231 variables, 468/472 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1231 variables, 95/567 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1231 variables, 256/823 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1231/1232 variables, and 823 constraints, problems are : Problem set: 0 solved, 1315 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 468/469 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 256/1315 constraints, Known Traps: 1/1 constraints]
After SMT, in 64417ms problems are : Problem set: 0 solved, 1315 unsolved
Search for dead transitions found 0 dead transitions in 64443ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66368 ms. Remains : 469/469 places, 1317/1317 transitions.
[2024-05-31 21:31:19] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
Found an invariant !
This invariant on transitions {224=1, 350=1, 684=1, 755=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {248=1, 374=1, 708=1, 759=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :[0, 2, 3, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 5, 5, 3389, 2, 359, 4, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2024-05-31 21:31:20] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:31:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 5, 5, 3389, 2, 359, 4, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
RANDOM walk for 1000003 steps (2 resets) in 2334 ms. (428 steps per ms)
BEST_FIRST walk for 8000006 steps (16 resets) in 4688 ms. (1706 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 5, 463, 3389, 2, 359, 4, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2024-05-31 21:31:27] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:31:27] [INFO ] Invariant cache hit.
[2024-05-31 21:31:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:31:27] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2024-05-31 21:31:27] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-31 21:31:27] [INFO ] [Real]Added 95 Read/Feed constraints in 42 ms returned sat
[2024-05-31 21:31:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:31:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:31:27] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-31 21:31:27] [INFO ] [Nat]Added 95 Read/Feed constraints in 27 ms returned sat
[2024-05-31 21:31:28] [INFO ] Deduced a trap composed of 75 places in 260 ms of which 3 ms to minimize.
[2024-05-31 21:31:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2024-05-31 21:31:28] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 66 ms.
[2024-05-31 21:31:28] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 273 ms.
[2024-05-31 21:31:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:31:28] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:31:28] [INFO ] [Real]Added 95 Read/Feed constraints in 47 ms returned sat
[2024-05-31 21:31:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:31:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:31:29] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-31 21:31:29] [INFO ] [Nat]Added 95 Read/Feed constraints in 34 ms returned sat
[2024-05-31 21:31:29] [INFO ] Deduced a trap composed of 75 places in 212 ms of which 3 ms to minimize.
[2024-05-31 21:31:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2024-05-31 21:31:29] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 63 ms.
[2024-05-31 21:31:29] [INFO ] Added : 2 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 274 ms.
[2024-05-31 21:31:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:31:30] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:31:30] [INFO ] [Real]Added 95 Read/Feed constraints in 49 ms returned sat
[2024-05-31 21:31:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:31:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:31:30] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-31 21:31:30] [INFO ] [Nat]Added 95 Read/Feed constraints in 35 ms returned sat
[2024-05-31 21:31:30] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 64 ms.
[2024-05-31 21:31:30] [INFO ] Added : 2 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 280 ms.
[2024-05-31 21:31:31] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:31:31] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-31 21:31:31] [INFO ] [Real]Added 95 Read/Feed constraints in 44 ms returned sat
[2024-05-31 21:31:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:31:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:31:31] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:31:31] [INFO ] [Nat]Added 95 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:31:31] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 62 ms.
[2024-05-31 21:31:31] [INFO ] Added : 4 causal constraints over 1 iterations in 152 ms. Result :sat
Minimization took 263 ms.
[2024-05-31 21:31:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:31:32] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:31:32] [INFO ] [Real]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:31:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:31:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:31:32] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-31 21:31:32] [INFO ] [Nat]Added 95 Read/Feed constraints in 47 ms returned sat
[2024-05-31 21:31:32] [INFO ] Deduced a trap composed of 100 places in 217 ms of which 3 ms to minimize.
[2024-05-31 21:31:33] [INFO ] Deduced a trap composed of 93 places in 202 ms of which 3 ms to minimize.
[2024-05-31 21:31:33] [INFO ] Deduced a trap composed of 83 places in 206 ms of which 3 ms to minimize.
[2024-05-31 21:31:33] [INFO ] Deduced a trap composed of 78 places in 204 ms of which 3 ms to minimize.
[2024-05-31 21:31:33] [INFO ] Deduced a trap composed of 76 places in 222 ms of which 4 ms to minimize.
[2024-05-31 21:31:34] [INFO ] Deduced a trap composed of 75 places in 205 ms of which 3 ms to minimize.
[2024-05-31 21:31:34] [INFO ] Deduced a trap composed of 82 places in 220 ms of which 3 ms to minimize.
[2024-05-31 21:31:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1696 ms
[2024-05-31 21:31:34] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 70 ms.
[2024-05-31 21:31:34] [INFO ] Added : 2 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 299 ms.
[2024-05-31 21:31:34] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:31:35] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-31 21:31:35] [INFO ] [Real]Added 95 Read/Feed constraints in 51 ms returned sat
[2024-05-31 21:31:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:31:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:31:35] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-05-31 21:31:35] [INFO ] [Nat]Added 95 Read/Feed constraints in 38 ms returned sat
[2024-05-31 21:31:35] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 77 ms.
[2024-05-31 21:31:35] [INFO ] Added : 2 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 268 ms.
[2024-05-31 21:31:36] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:31:36] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:31:36] [INFO ] [Real]Added 95 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:31:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:31:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:31:36] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-31 21:31:36] [INFO ] [Nat]Added 95 Read/Feed constraints in 38 ms returned sat
[2024-05-31 21:31:36] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 67 ms.
[2024-05-31 21:31:36] [INFO ] Added : 2 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 317 ms.
[2024-05-31 21:31:37] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:31:37] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2024-05-31 21:31:37] [INFO ] [Real]Added 95 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:31:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:31:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:31:37] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:31:37] [INFO ] [Nat]Added 95 Read/Feed constraints in 41 ms returned sat
[2024-05-31 21:31:37] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 64 ms.
[2024-05-31 21:31:37] [INFO ] Added : 2 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 352 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 5, 463, 3389, 2, 359, 4, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 5, 463, 3659, 2, 359, 4, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
Support contains 8 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 51 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 49 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-31 21:31:41] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:31:41] [INFO ] Invariant cache hit.
[2024-05-31 21:31:41] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-31 21:31:41] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:31:41] [INFO ] Invariant cache hit.
[2024-05-31 21:31:41] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-31 21:31:43] [INFO ] Implicit Places using invariants and state equation in 1488 ms returned []
Implicit Place search using SMT with State Equation took 1997 ms to find 0 implicit places.
[2024-05-31 21:31:43] [INFO ] Redundant transitions in 22 ms returned []
Running 1315 sub problems to find dead transitions.
[2024-05-31 21:31:43] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:31:43] [INFO ] Invariant cache hit.
[2024-05-31 21:31:43] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
[2024-05-31 21:31:58] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1232 variables, and 4 constraints, problems are : Problem set: 0 solved, 1315 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/469 constraints, ReadFeed: 0/95 constraints, PredecessorRefiner: 1315/1315 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 3 (OVERLAPS) 763/1231 variables, 468/472 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1231 variables, 95/567 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1231 variables, 256/823 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1231/1232 variables, and 823 constraints, problems are : Problem set: 0 solved, 1315 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 468/469 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 256/1315 constraints, Known Traps: 1/1 constraints]
After SMT, in 64250ms problems are : Problem set: 0 solved, 1315 unsolved
Search for dead transitions found 0 dead transitions in 64262ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66341 ms. Remains : 469/469 places, 1317/1317 transitions.
[2024-05-31 21:32:47] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
Found an invariant !
This invariant on transitions {224=1, 350=1, 684=1, 755=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {248=1, 374=1, 708=1, 759=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :[0, 2, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[10, 5, 463, 3659, 2, 359, 4, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2024-05-31 21:32:47] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:32:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 5, 463, 3659, 2, 359, 4, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
RANDOM walk for 1000000 steps (2 resets) in 2184 ms. (457 steps per ms)
BEST_FIRST walk for 8000007 steps (16 resets) in 4679 ms. (1709 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 5, 463, 7089, 2, 359, 4, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
[2024-05-31 21:32:54] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:32:54] [INFO ] Invariant cache hit.
[2024-05-31 21:32:54] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:32:54] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 21:32:54] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-31 21:32:54] [INFO ] [Real]Added 95 Read/Feed constraints in 41 ms returned sat
[2024-05-31 21:32:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:32:55] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:32:55] [INFO ] [Nat]Added 95 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:32:55] [INFO ] Deduced a trap composed of 75 places in 225 ms of which 3 ms to minimize.
[2024-05-31 21:32:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2024-05-31 21:32:55] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 61 ms.
[2024-05-31 21:32:55] [INFO ] Added : 2 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 270 ms.
[2024-05-31 21:32:56] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:32:56] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-31 21:32:56] [INFO ] [Real]Added 95 Read/Feed constraints in 44 ms returned sat
[2024-05-31 21:32:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:32:56] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:32:56] [INFO ] [Nat]Added 95 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:32:56] [INFO ] Deduced a trap composed of 75 places in 229 ms of which 3 ms to minimize.
[2024-05-31 21:32:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2024-05-31 21:32:56] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 63 ms.
[2024-05-31 21:32:56] [INFO ] Added : 2 causal constraints over 1 iterations in 153 ms. Result :sat
Minimization took 263 ms.
[2024-05-31 21:32:57] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:32:57] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-31 21:32:57] [INFO ] [Real]Added 95 Read/Feed constraints in 47 ms returned sat
[2024-05-31 21:32:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:32:57] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-31 21:32:57] [INFO ] [Nat]Added 95 Read/Feed constraints in 34 ms returned sat
[2024-05-31 21:32:57] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 64 ms.
[2024-05-31 21:32:57] [INFO ] Added : 2 causal constraints over 1 iterations in 153 ms. Result :sat
Minimization took 265 ms.
[2024-05-31 21:32:58] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:32:58] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-31 21:32:58] [INFO ] [Real]Added 95 Read/Feed constraints in 41 ms returned sat
[2024-05-31 21:32:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:32:58] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:32:58] [INFO ] [Nat]Added 95 Read/Feed constraints in 38 ms returned sat
[2024-05-31 21:32:58] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 64 ms.
[2024-05-31 21:32:58] [INFO ] Added : 4 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 260 ms.
[2024-05-31 21:32:59] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:32:59] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-31 21:32:59] [INFO ] [Real]Added 95 Read/Feed constraints in 24 ms returned sat
[2024-05-31 21:32:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:32:59] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-31 21:32:59] [INFO ] [Nat]Added 95 Read/Feed constraints in 58 ms returned sat
[2024-05-31 21:33:00] [INFO ] Deduced a trap composed of 100 places in 218 ms of which 3 ms to minimize.
[2024-05-31 21:33:00] [INFO ] Deduced a trap composed of 93 places in 215 ms of which 3 ms to minimize.
[2024-05-31 21:33:00] [INFO ] Deduced a trap composed of 83 places in 208 ms of which 3 ms to minimize.
[2024-05-31 21:33:00] [INFO ] Deduced a trap composed of 78 places in 207 ms of which 3 ms to minimize.
[2024-05-31 21:33:01] [INFO ] Deduced a trap composed of 76 places in 207 ms of which 3 ms to minimize.
[2024-05-31 21:33:01] [INFO ] Deduced a trap composed of 75 places in 208 ms of which 3 ms to minimize.
[2024-05-31 21:33:01] [INFO ] Deduced a trap composed of 82 places in 211 ms of which 3 ms to minimize.
[2024-05-31 21:33:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1676 ms
[2024-05-31 21:33:01] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-31 21:33:01] [INFO ] Added : 2 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 290 ms.
[2024-05-31 21:33:02] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:33:02] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-31 21:33:02] [INFO ] [Real]Added 95 Read/Feed constraints in 53 ms returned sat
[2024-05-31 21:33:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:33:02] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:33:02] [INFO ] [Nat]Added 95 Read/Feed constraints in 38 ms returned sat
[2024-05-31 21:33:02] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 64 ms.
[2024-05-31 21:33:02] [INFO ] Added : 2 causal constraints over 1 iterations in 156 ms. Result :sat
Minimization took 265 ms.
[2024-05-31 21:33:03] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:33:03] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-31 21:33:03] [INFO ] [Real]Added 95 Read/Feed constraints in 41 ms returned sat
[2024-05-31 21:33:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:33:03] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-31 21:33:03] [INFO ] [Nat]Added 95 Read/Feed constraints in 35 ms returned sat
[2024-05-31 21:33:03] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 64 ms.
[2024-05-31 21:33:03] [INFO ] Added : 2 causal constraints over 1 iterations in 155 ms. Result :sat
Minimization took 265 ms.
[2024-05-31 21:33:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:33:04] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-31 21:33:04] [INFO ] [Real]Added 95 Read/Feed constraints in 29 ms returned sat
[2024-05-31 21:33:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:33:04] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-31 21:33:04] [INFO ] [Nat]Added 95 Read/Feed constraints in 41 ms returned sat
[2024-05-31 21:33:04] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 77 ms.
[2024-05-31 21:33:04] [INFO ] Added : 2 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 354 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 5, 463, 7089, 2, 359, 4, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, 4]
FORMULA FunctionPointer-PT-c004-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 5, 463, 7089, 2, 359, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 66 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 469/469 places, 1317/1317 transitions.
[2024-05-31 21:33:08] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
Found an invariant !
This invariant on transitions {224=1, 350=1, 684=1, 755=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {248=1, 374=1, 708=1, 759=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :[0, 0, 0, 40, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[10, 5, 463, 7089, 2, 359, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:33:08] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:33:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 5, 463, 7089, 2, 359, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000003 steps (2 resets) in 2234 ms. (447 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 4080 ms. (1715 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 5, 463, 7089, 2, 359, 480] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:33:14] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:33:14] [INFO ] Invariant cache hit.
[2024-05-31 21:33:15] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:33:15] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-31 21:33:15] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-31 21:33:15] [INFO ] [Real]Added 95 Read/Feed constraints in 45 ms returned sat
[2024-05-31 21:33:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:33:15] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-31 21:33:15] [INFO ] [Nat]Added 95 Read/Feed constraints in 27 ms returned sat
[2024-05-31 21:33:15] [INFO ] Deduced a trap composed of 75 places in 217 ms of which 3 ms to minimize.
[2024-05-31 21:33:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2024-05-31 21:33:15] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 67 ms.
[2024-05-31 21:33:15] [INFO ] Added : 2 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 330 ms.
[2024-05-31 21:33:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:33:16] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:33:16] [INFO ] [Real]Added 95 Read/Feed constraints in 46 ms returned sat
[2024-05-31 21:33:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:33:16] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-31 21:33:16] [INFO ] [Nat]Added 95 Read/Feed constraints in 35 ms returned sat
[2024-05-31 21:33:17] [INFO ] Deduced a trap composed of 75 places in 216 ms of which 3 ms to minimize.
[2024-05-31 21:33:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2024-05-31 21:33:17] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 71 ms.
[2024-05-31 21:33:17] [INFO ] Added : 2 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 329 ms.
[2024-05-31 21:33:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:33:17] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:33:17] [INFO ] [Real]Added 95 Read/Feed constraints in 45 ms returned sat
[2024-05-31 21:33:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:33:18] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-31 21:33:18] [INFO ] [Nat]Added 95 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:33:18] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-31 21:33:18] [INFO ] Added : 2 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 316 ms.
[2024-05-31 21:33:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:33:19] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-31 21:33:19] [INFO ] [Real]Added 95 Read/Feed constraints in 43 ms returned sat
[2024-05-31 21:33:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:33:19] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-31 21:33:19] [INFO ] [Nat]Added 95 Read/Feed constraints in 41 ms returned sat
[2024-05-31 21:33:19] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-31 21:33:19] [INFO ] Added : 4 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 326 ms.
[2024-05-31 21:33:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:33:20] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:33:20] [INFO ] [Real]Added 95 Read/Feed constraints in 21 ms returned sat
[2024-05-31 21:33:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:33:20] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-31 21:33:20] [INFO ] [Nat]Added 95 Read/Feed constraints in 48 ms returned sat
[2024-05-31 21:33:20] [INFO ] Deduced a trap composed of 100 places in 216 ms of which 3 ms to minimize.
[2024-05-31 21:33:20] [INFO ] Deduced a trap composed of 93 places in 216 ms of which 4 ms to minimize.
[2024-05-31 21:33:21] [INFO ] Deduced a trap composed of 83 places in 220 ms of which 3 ms to minimize.
[2024-05-31 21:33:21] [INFO ] Deduced a trap composed of 78 places in 199 ms of which 3 ms to minimize.
[2024-05-31 21:33:21] [INFO ] Deduced a trap composed of 76 places in 195 ms of which 3 ms to minimize.
[2024-05-31 21:33:21] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 3 ms to minimize.
[2024-05-31 21:33:22] [INFO ] Deduced a trap composed of 82 places in 211 ms of which 3 ms to minimize.
[2024-05-31 21:33:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1681 ms
[2024-05-31 21:33:22] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-31 21:33:22] [INFO ] Added : 2 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 356 ms.
[2024-05-31 21:33:22] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:33:22] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-31 21:33:22] [INFO ] [Real]Added 95 Read/Feed constraints in 49 ms returned sat
[2024-05-31 21:33:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:33:23] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-31 21:33:23] [INFO ] [Nat]Added 95 Read/Feed constraints in 40 ms returned sat
[2024-05-31 21:33:23] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-31 21:33:23] [INFO ] Added : 2 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 317 ms.
[2024-05-31 21:33:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:33:24] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:33:24] [INFO ] [Real]Added 95 Read/Feed constraints in 48 ms returned sat
[2024-05-31 21:33:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:33:24] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-31 21:33:24] [INFO ] [Nat]Added 95 Read/Feed constraints in 43 ms returned sat
[2024-05-31 21:33:24] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 73 ms.
[2024-05-31 21:33:24] [INFO ] Added : 2 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 321 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 5, 463, 7089, 2, 359, 480] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 5, 463, 7089, 2, 359, 480] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 53 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 48 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-31 21:33:29] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:33:29] [INFO ] Invariant cache hit.
[2024-05-31 21:33:29] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-31 21:33:29] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:33:29] [INFO ] Invariant cache hit.
[2024-05-31 21:33:30] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-31 21:33:31] [INFO ] Implicit Places using invariants and state equation in 1434 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
[2024-05-31 21:33:31] [INFO ] Redundant transitions in 22 ms returned []
Running 1315 sub problems to find dead transitions.
[2024-05-31 21:33:31] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:33:31] [INFO ] Invariant cache hit.
[2024-05-31 21:33:31] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
[2024-05-31 21:33:47] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/1232 variables, and 4 constraints, problems are : Problem set: 0 solved, 1315 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/469 constraints, ReadFeed: 0/95 constraints, PredecessorRefiner: 1315/1315 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 3 (OVERLAPS) 763/1231 variables, 468/472 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1231 variables, 95/567 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1231 variables, 256/823 constraints. Problems are: Problem set: 0 solved, 1315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1231/1232 variables, and 823 constraints, problems are : Problem set: 0 solved, 1315 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 468/469 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 256/1315 constraints, Known Traps: 1/1 constraints]
After SMT, in 64789ms problems are : Problem set: 0 solved, 1315 unsolved
Search for dead transitions found 0 dead transitions in 64803ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66659 ms. Remains : 469/469 places, 1317/1317 transitions.
[2024-05-31 21:34:36] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
Found an invariant !
This invariant on transitions {224=1, 350=1, 684=1, 755=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {248=1, 374=1, 708=1, 759=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :[0, 2, 0, 2147483647, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[10, 5, 463, +inf, 2, 359, 480] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:34:36] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:34:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10, 5, 463, +inf, 2, 359, 480] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 2339 ms. (427 steps per ms)
FORMULA FunctionPointer-PT-c004-UpperBounds-06 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 6000006 steps (12 resets) in 3709 ms. (1617 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 5, 542, 3, 359, 480] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:34:42] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-31 21:34:42] [INFO ] Invariant cache hit.
[2024-05-31 21:34:42] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:34:42] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 21:34:42] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-31 21:34:42] [INFO ] [Real]Added 95 Read/Feed constraints in 43 ms returned sat
[2024-05-31 21:34:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:34:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:34:43] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-31 21:34:43] [INFO ] [Nat]Added 95 Read/Feed constraints in 35 ms returned sat
[2024-05-31 21:34:43] [INFO ] Deduced a trap composed of 75 places in 216 ms of which 3 ms to minimize.
[2024-05-31 21:34:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2024-05-31 21:34:43] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 75 ms.
[2024-05-31 21:34:43] [INFO ] Added : 2 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 280 ms.
[2024-05-31 21:34:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:34:44] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-31 21:34:44] [INFO ] [Real]Added 95 Read/Feed constraints in 45 ms returned sat
[2024-05-31 21:34:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:34:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:34:44] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:34:44] [INFO ] [Nat]Added 95 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:34:44] [INFO ] Deduced a trap composed of 75 places in 219 ms of which 3 ms to minimize.
[2024-05-31 21:34:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2024-05-31 21:34:44] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 79 ms.
[2024-05-31 21:34:45] [INFO ] Added : 2 causal constraints over 1 iterations in 180 ms. Result :sat
Minimization took 277 ms.
[2024-05-31 21:34:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:34:45] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-31 21:34:45] [INFO ] [Real]Added 95 Read/Feed constraints in 49 ms returned sat
[2024-05-31 21:34:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:34:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:34:45] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-31 21:34:45] [INFO ] [Nat]Added 95 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:34:46] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-31 21:34:46] [INFO ] Added : 2 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 300 ms.
[2024-05-31 21:34:46] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:34:46] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-31 21:34:46] [INFO ] [Real]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:34:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:34:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:34:46] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-31 21:34:47] [INFO ] [Nat]Added 95 Read/Feed constraints in 43 ms returned sat
[2024-05-31 21:34:47] [INFO ] Deduced a trap composed of 100 places in 219 ms of which 4 ms to minimize.
[2024-05-31 21:34:47] [INFO ] Deduced a trap composed of 93 places in 199 ms of which 4 ms to minimize.
[2024-05-31 21:34:47] [INFO ] Deduced a trap composed of 83 places in 206 ms of which 3 ms to minimize.
[2024-05-31 21:34:47] [INFO ] Deduced a trap composed of 78 places in 204 ms of which 3 ms to minimize.
[2024-05-31 21:34:48] [INFO ] Deduced a trap composed of 76 places in 203 ms of which 3 ms to minimize.
[2024-05-31 21:34:48] [INFO ] Deduced a trap composed of 82 places in 200 ms of which 3 ms to minimize.
[2024-05-31 21:34:48] [INFO ] Deduced a trap composed of 135 places in 169 ms of which 3 ms to minimize.
[2024-05-31 21:34:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1619 ms
[2024-05-31 21:34:48] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 70 ms.
[2024-05-31 21:34:48] [INFO ] Added : 2 causal constraints over 1 iterations in 155 ms. Result :sat
Minimization took 356 ms.
[2024-05-31 21:34:49] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:34:49] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-31 21:34:49] [INFO ] [Real]Added 95 Read/Feed constraints in 47 ms returned sat
[2024-05-31 21:34:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:34:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:34:49] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-31 21:34:49] [INFO ] [Nat]Added 95 Read/Feed constraints in 40 ms returned sat
[2024-05-31 21:34:49] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 66 ms.
[2024-05-31 21:34:49] [INFO ] Added : 2 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 326 ms.
[2024-05-31 21:34:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:34:50] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:34:50] [INFO ] [Real]Added 95 Read/Feed constraints in 46 ms returned sat
[2024-05-31 21:34:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:34:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:34:50] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-31 21:34:50] [INFO ] [Nat]Added 95 Read/Feed constraints in 41 ms returned sat
[2024-05-31 21:34:50] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-31 21:34:51] [INFO ] Added : 2 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 318 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 5, 542, 3, 359, 480] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 5, 542, 3, 359, 480] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Graph (complete) has 2272 edges and 469 vertex of which 468 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 467 transition count 1315
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 467 transition count 1315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 466 transition count 1313
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 466 transition count 1313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 465 transition count 1311
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 465 transition count 1311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 464 transition count 1309
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 464 transition count 1309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 463 transition count 1307
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 463 transition count 1307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 462 transition count 1305
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 462 transition count 1305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 461 transition count 1303
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 461 transition count 1303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 460 transition count 1301
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 460 transition count 1301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 459 transition count 1299
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 459 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 458 transition count 1295
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 458 transition count 1295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 457 transition count 1293
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 457 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 456 transition count 1291
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 456 transition count 1291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 26 place count 455 transition count 1289
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 455 transition count 1289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 454 transition count 1287
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 454 transition count 1287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 453 transition count 1285
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 453 transition count 1285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 32 place count 452 transition count 1283
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 452 transition count 1283
Applied a total of 33 rules in 195 ms. Remains 452 /469 variables (removed 17) and now considering 1283/1317 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 452/469 places, 1283/1317 transitions.
[2024-05-31 21:34:56] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
Found an invariant !
This invariant on transitions {250=1, 363=1, 566=1, 730=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 365=1, 696=1, 734=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :[0, 0, 3, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[10, 5, 542, 3, 359, 480] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:34:56] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
// Phase 1: matrix 739 rows 452 cols
[2024-05-31 21:34:56] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 5, 542, 3, 359, 480] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2153 ms. (464 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3458 ms. (1734 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 5, 542, 3, 359, 480] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:35:02] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
[2024-05-31 21:35:02] [INFO ] Invariant cache hit.
[2024-05-31 21:35:02] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:35:02] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-31 21:35:02] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-31 21:35:02] [INFO ] [Real]Added 90 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:35:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:35:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:35:02] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:35:02] [INFO ] [Nat]Added 90 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:35:02] [INFO ] Deduced a trap composed of 118 places in 211 ms of which 3 ms to minimize.
[2024-05-31 21:35:03] [INFO ] Deduced a trap composed of 110 places in 202 ms of which 3 ms to minimize.
[2024-05-31 21:35:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 492 ms
[2024-05-31 21:35:03] [INFO ] Computed and/alt/rep : 221/1346/221 causal constraints (skipped 516 transitions) in 63 ms.
[2024-05-31 21:35:03] [INFO ] Added : 32 causal constraints over 8 iterations in 431 ms. Result :sat
Minimization took 331 ms.
[2024-05-31 21:35:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:35:04] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:35:04] [INFO ] [Real]Added 90 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:35:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:35:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:35:04] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-31 21:35:04] [INFO ] [Nat]Added 90 Read/Feed constraints in 39 ms returned sat
[2024-05-31 21:35:04] [INFO ] Computed and/alt/rep : 221/1346/221 causal constraints (skipped 516 transitions) in 65 ms.
[2024-05-31 21:35:04] [INFO ] Added : 11 causal constraints over 3 iterations in 248 ms. Result :sat
Minimization took 312 ms.
[2024-05-31 21:35:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:35:05] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:35:05] [INFO ] [Real]Added 90 Read/Feed constraints in 43 ms returned sat
[2024-05-31 21:35:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:35:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:35:05] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-31 21:35:05] [INFO ] [Nat]Added 90 Read/Feed constraints in 34 ms returned sat
[2024-05-31 21:35:05] [INFO ] Deduced a trap composed of 133 places in 211 ms of which 3 ms to minimize.
[2024-05-31 21:35:06] [INFO ] Deduced a trap composed of 121 places in 206 ms of which 3 ms to minimize.
[2024-05-31 21:35:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 491 ms
[2024-05-31 21:35:06] [INFO ] Computed and/alt/rep : 221/1346/221 causal constraints (skipped 516 transitions) in 62 ms.
[2024-05-31 21:35:06] [INFO ] Added : 27 causal constraints over 7 iterations in 361 ms. Result :sat
Minimization took 281 ms.
[2024-05-31 21:35:06] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:35:07] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-31 21:35:07] [INFO ] [Real]Added 90 Read/Feed constraints in 25 ms returned sat
[2024-05-31 21:35:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:35:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:35:07] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:35:07] [INFO ] [Nat]Added 90 Read/Feed constraints in 48 ms returned sat
[2024-05-31 21:35:07] [INFO ] Deduced a trap composed of 132 places in 196 ms of which 3 ms to minimize.
[2024-05-31 21:35:07] [INFO ] Deduced a trap composed of 219 places in 206 ms of which 4 ms to minimize.
[2024-05-31 21:35:07] [INFO ] Deduced a trap composed of 131 places in 168 ms of which 4 ms to minimize.
[2024-05-31 21:35:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 688 ms
[2024-05-31 21:35:08] [INFO ] Computed and/alt/rep : 221/1346/221 causal constraints (skipped 516 transitions) in 76 ms.
[2024-05-31 21:35:08] [INFO ] Added : 2 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 297 ms.
[2024-05-31 21:35:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:35:08] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:35:08] [INFO ] [Real]Added 90 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:35:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:35:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:35:09] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-31 21:35:09] [INFO ] [Nat]Added 90 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:35:09] [INFO ] Deduced a trap composed of 145 places in 211 ms of which 3 ms to minimize.
[2024-05-31 21:35:09] [INFO ] Deduced a trap composed of 134 places in 201 ms of which 3 ms to minimize.
[2024-05-31 21:35:09] [INFO ] Deduced a trap composed of 130 places in 199 ms of which 3 ms to minimize.
[2024-05-31 21:35:09] [INFO ] Deduced a trap composed of 98 places in 202 ms of which 3 ms to minimize.
[2024-05-31 21:35:10] [INFO ] Deduced a trap composed of 108 places in 196 ms of which 4 ms to minimize.
[2024-05-31 21:35:10] [INFO ] Deduced a trap composed of 85 places in 191 ms of which 4 ms to minimize.
[2024-05-31 21:35:10] [INFO ] Deduced a trap composed of 94 places in 199 ms of which 3 ms to minimize.
[2024-05-31 21:35:10] [INFO ] Deduced a trap composed of 80 places in 193 ms of which 3 ms to minimize.
[2024-05-31 21:35:11] [INFO ] Deduced a trap composed of 87 places in 194 ms of which 3 ms to minimize.
[2024-05-31 21:35:11] [INFO ] Deduced a trap composed of 86 places in 192 ms of which 3 ms to minimize.
[2024-05-31 21:35:11] [INFO ] Deduced a trap composed of 95 places in 211 ms of which 3 ms to minimize.
[2024-05-31 21:35:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2473 ms
[2024-05-31 21:35:11] [INFO ] Computed and/alt/rep : 221/1346/221 causal constraints (skipped 516 transitions) in 65 ms.
[2024-05-31 21:35:11] [INFO ] Added : 27 causal constraints over 7 iterations in 371 ms. Result :sat
Minimization took 286 ms.
[2024-05-31 21:35:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:35:12] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 21:35:12] [INFO ] [Real]Added 90 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:35:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:35:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:35:12] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-31 21:35:12] [INFO ] [Nat]Added 90 Read/Feed constraints in 39 ms returned sat
[2024-05-31 21:35:12] [INFO ] Deduced a trap composed of 144 places in 192 ms of which 2 ms to minimize.
[2024-05-31 21:35:13] [INFO ] Deduced a trap composed of 138 places in 183 ms of which 3 ms to minimize.
[2024-05-31 21:35:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2024-05-31 21:35:13] [INFO ] Computed and/alt/rep : 221/1346/221 causal constraints (skipped 516 transitions) in 68 ms.
[2024-05-31 21:35:13] [INFO ] Added : 29 causal constraints over 7 iterations in 432 ms. Result :sat
Minimization took 282 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 5, 542, 3, 359, 480] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 5, 542, 3, 359, 480] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 1283/1283 transitions.
Applied a total of 0 rules in 46 ms. Remains 452 /452 variables (removed 0) and now considering 1283/1283 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 452/452 places, 1283/1283 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 1283/1283 transitions.
Applied a total of 0 rules in 45 ms. Remains 452 /452 variables (removed 0) and now considering 1283/1283 (removed 0) transitions.
[2024-05-31 21:35:14] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
[2024-05-31 21:35:14] [INFO ] Invariant cache hit.
[2024-05-31 21:35:14] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-31 21:35:14] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
[2024-05-31 21:35:14] [INFO ] Invariant cache hit.
[2024-05-31 21:35:14] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-31 21:35:15] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1639 ms to find 0 implicit places.
[2024-05-31 21:35:15] [INFO ] Redundant transitions in 22 ms returned []
Running 1281 sub problems to find dead transitions.
[2024-05-31 21:35:15] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
[2024-05-31 21:35:15] [INFO ] Invariant cache hit.
[2024-05-31 21:35:15] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
[2024-05-31 21:35:30] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 452/1191 variables, and 4 constraints, problems are : Problem set: 0 solved, 1281 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/452 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 1281/1281 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 3 (OVERLAPS) 739/1191 variables, 452/456 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1191 variables, 90/546 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1191 variables, 1281/1827 constraints. Problems are: Problem set: 0 solved, 1281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1191/1191 variables, and 1827 constraints, problems are : Problem set: 0 solved, 1281 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 452/452 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1281/1281 constraints, Known Traps: 1/1 constraints]
After SMT, in 64026ms problems are : Problem set: 0 solved, 1281 unsolved
Search for dead transitions found 0 dead transitions in 64040ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65759 ms. Remains : 452/452 places, 1283/1283 transitions.
[2024-05-31 21:36:19] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
Found an invariant !
This invariant on transitions {250=1, 363=1, 566=1, 730=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 365=1, 696=1, 734=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :[0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[10, 5, 542, 3, 359, 480] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40000 steps (8 resets) in 692 ms. (57 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
[2024-05-31 21:36:20] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
[2024-05-31 21:36:20] [INFO ] Invariant cache hit.
[2024-05-31 21:36:20] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 391/409 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 14/423 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 633/1056 variables, 356/384 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1056 variables, 87/471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1056 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 62/1118 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1118 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 72/1190 variables, 72/544 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1190 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/1191 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1191 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/1191 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1191/1191 variables, and 545 constraints, problems are : Problem set: 0 solved, 5 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 452/452 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 391/409 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 14/423 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 633/1056 variables, 356/389 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1056 variables, 87/476 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1056 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 62/1118 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 21:36:21] [INFO ] Deduced a trap composed of 135 places in 163 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1118 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1118 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 72/1190 variables, 72/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1190 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 1/1191 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1191 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/1191 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1191/1191 variables, and 551 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1152 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 452/452 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 1895ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 41926 ms.
Support contains 4 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 1283/1283 transitions.
Graph (complete) has 2212 edges and 452 vertex of which 449 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 449 transition count 1278
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 448 transition count 1276
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 448 transition count 1276
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 447 transition count 1272
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 447 transition count 1272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 446 transition count 1270
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 446 transition count 1270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 445 transition count 1268
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 445 transition count 1268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 444 transition count 1266
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 444 transition count 1266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 443 transition count 1264
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 443 transition count 1264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 442 transition count 1262
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 442 transition count 1262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 441 transition count 1260
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 441 transition count 1260
Applied a total of 22 rules in 154 ms. Remains 441 /452 variables (removed 11) and now considering 1260/1283 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 441/452 places, 1260/1283 transitions.
RANDOM walk for 40006 steps (8 resets) in 284 ms. (140 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 212340 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 4
Probabilistic random walk after 212340 steps, saw 130220 distinct states, run finished after 3010 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-31 21:37:07] [INFO ] Flow matrix only has 721 transitions (discarded 539 similar events)
// Phase 1: matrix 721 rows 441 cols
[2024-05-31 21:37:07] [INFO ] Computed 3 invariants in 5 ms
[2024-05-31 21:37:07] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 379/394 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 12/406 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 623/1029 variables, 350/374 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1029 variables, 82/456 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1029 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 62/1091 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1091 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 70/1161 variables, 70/527 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1161 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/1162 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1162 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1162 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1162/1162 variables, and 528 constraints, problems are : Problem set: 0 solved, 4 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 441/441 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 379/394 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 12/406 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 623/1029 variables, 350/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1029 variables, 82/460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1029 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 62/1091 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1091 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 70/1161 variables, 70/531 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1161 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/1162 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1162 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1162 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1162/1162 variables, and 532 constraints, problems are : Problem set: 0 solved, 4 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 441/441 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1254ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 1260/1260 transitions.
Applied a total of 0 rules in 52 ms. Remains 441 /441 variables (removed 0) and now considering 1260/1260 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 441/441 places, 1260/1260 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 1260/1260 transitions.
Applied a total of 0 rules in 48 ms. Remains 441 /441 variables (removed 0) and now considering 1260/1260 (removed 0) transitions.
[2024-05-31 21:37:09] [INFO ] Flow matrix only has 721 transitions (discarded 539 similar events)
[2024-05-31 21:37:09] [INFO ] Invariant cache hit.
[2024-05-31 21:37:09] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-31 21:37:09] [INFO ] Flow matrix only has 721 transitions (discarded 539 similar events)
[2024-05-31 21:37:09] [INFO ] Invariant cache hit.
[2024-05-31 21:37:09] [INFO ] State equation strengthened by 84 read => feed constraints.
[2024-05-31 21:37:10] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
[2024-05-31 21:37:10] [INFO ] Redundant transitions in 20 ms returned []
Running 1258 sub problems to find dead transitions.
[2024-05-31 21:37:10] [INFO ] Flow matrix only has 721 transitions (discarded 539 similar events)
[2024-05-31 21:37:10] [INFO ] Invariant cache hit.
[2024-05-31 21:37:10] [INFO ] State equation strengthened by 84 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1258 unsolved
[2024-05-31 21:37:25] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1258 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/1162 variables, and 4 constraints, problems are : Problem set: 0 solved, 1258 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/441 constraints, ReadFeed: 0/84 constraints, PredecessorRefiner: 1258/1258 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1258 unsolved
At refinement iteration 3 (OVERLAPS) 721/1162 variables, 441/445 constraints. Problems are: Problem set: 0 solved, 1258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1162 variables, 84/529 constraints. Problems are: Problem set: 0 solved, 1258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1162 variables, 1258/1787 constraints. Problems are: Problem set: 0 solved, 1258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1162/1162 variables, and 1787 constraints, problems are : Problem set: 0 solved, 1258 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 441/441 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 1258/1258 constraints, Known Traps: 1/1 constraints]
After SMT, in 64666ms problems are : Problem set: 0 solved, 1258 unsolved
Search for dead transitions found 0 dead transitions in 64680ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66349 ms. Remains : 441/441 places, 1260/1260 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10, 5, 542, 3, 359, 480] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:38:15] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
// Phase 1: matrix 739 rows 452 cols
[2024-05-31 21:38:15] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:38:15] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
[2024-05-31 21:38:15] [INFO ] Invariant cache hit.
[2024-05-31 21:38:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:38:15] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-31 21:38:15] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-31 21:38:15] [INFO ] [Real]Added 90 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:38:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:38:15] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:38:15] [INFO ] [Nat]Added 90 Read/Feed constraints in 25 ms returned sat
[2024-05-31 21:38:16] [INFO ] Computed and/alt/rep : 221/1346/221 causal constraints (skipped 516 transitions) in 64 ms.
[2024-05-31 21:38:16] [INFO ] Added : 17 causal constraints over 5 iterations in 305 ms. Result :sat
Minimization took 276 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 1283/1283 transitions.
Graph (complete) has 2212 edges and 452 vertex of which 449 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 449 transition count 1278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 445 transition count 1268
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 445 transition count 1268
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 441 transition count 1258
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 441 transition count 1258
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 437 transition count 1250
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 437 transition count 1250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 433 transition count 1242
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 433 transition count 1242
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 429 transition count 1234
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 429 transition count 1234
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 425 transition count 1226
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 425 transition count 1226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 423 transition count 1222
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 422 transition count 1220
Applied a total of 60 rules in 117 ms. Remains 422 /452 variables (removed 30) and now considering 1220/1283 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 422/452 places, 1220/1283 transitions.
[2024-05-31 21:38:16] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:38:16] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-31 21:38:16] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2004 ms. (498 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 584 ms. (1709 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:38:19] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:38:19] [INFO ] Invariant cache hit.
[2024-05-31 21:38:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:38:19] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-31 21:38:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:38:19] [INFO ] [Real]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-31 21:38:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:38:20] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 21:38:20] [INFO ] [Nat]Added 75 Read/Feed constraints in 29 ms returned sat
[2024-05-31 21:38:20] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 59 ms.
[2024-05-31 21:38:20] [INFO ] Deduced a trap composed of 74 places in 199 ms of which 4 ms to minimize.
[2024-05-31 21:38:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-05-31 21:38:20] [INFO ] Added : 10 causal constraints over 3 iterations in 491 ms. Result :sat
Minimization took 269 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 49 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 43 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-31 21:38:21] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:38:21] [INFO ] Invariant cache hit.
[2024-05-31 21:38:21] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-31 21:38:21] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:38:21] [INFO ] Invariant cache hit.
[2024-05-31 21:38:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:38:22] [INFO ] Implicit Places using invariants and state equation in 1239 ms returned []
Implicit Place search using SMT with State Equation took 1605 ms to find 0 implicit places.
[2024-05-31 21:38:22] [INFO ] Redundant transitions in 14 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-31 21:38:22] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-31 21:38:22] [INFO ] Invariant cache hit.
[2024-05-31 21:38:22] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-31 21:38:36] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 33970ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 33989ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35698 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-31 21:38:56] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 30167 steps (6 resets) in 122 ms. (245 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-01 in 41636 ms.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:38:57] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
// Phase 1: matrix 739 rows 452 cols
[2024-05-31 21:38:57] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:38:57] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
[2024-05-31 21:38:57] [INFO ] Invariant cache hit.
[2024-05-31 21:38:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:38:57] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-31 21:38:57] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-31 21:38:57] [INFO ] [Real]Added 90 Read/Feed constraints in 23 ms returned sat
[2024-05-31 21:38:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:38:57] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-31 21:38:57] [INFO ] [Nat]Added 90 Read/Feed constraints in 38 ms returned sat
[2024-05-31 21:38:57] [INFO ] Computed and/alt/rep : 221/1346/221 causal constraints (skipped 516 transitions) in 65 ms.
[2024-05-31 21:38:57] [INFO ] Added : 16 causal constraints over 4 iterations in 322 ms. Result :sat
Minimization took 314 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 1283/1283 transitions.
Graph (complete) has 2212 edges and 452 vertex of which 449 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 449 transition count 1278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 445 transition count 1268
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 445 transition count 1268
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 441 transition count 1260
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 441 transition count 1260
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 437 transition count 1250
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 437 transition count 1250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 433 transition count 1242
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 433 transition count 1242
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 429 transition count 1234
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 429 transition count 1234
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 425 transition count 1226
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 425 transition count 1226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 423 transition count 1222
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 421 transition count 1218
Applied a total of 62 rules in 133 ms. Remains 421 /452 variables (removed 31) and now considering 1218/1283 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 421/452 places, 1218/1283 transitions.
[2024-05-31 21:38:58] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:38:58] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-31 21:38:58] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2004 ms. (498 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 552 ms. (1808 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[488] Max Struct:[+inf]
[2024-05-31 21:39:01] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:39:01] [INFO ] Invariant cache hit.
[2024-05-31 21:39:01] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:39:01] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-31 21:39:01] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:39:01] [INFO ] [Real]Added 75 Read/Feed constraints in 38 ms returned sat
[2024-05-31 21:39:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:39:01] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-31 21:39:01] [INFO ] [Nat]Added 75 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:39:02] [INFO ] Deduced a trap composed of 113 places in 197 ms of which 2 ms to minimize.
[2024-05-31 21:39:02] [INFO ] Deduced a trap composed of 109 places in 177 ms of which 2 ms to minimize.
[2024-05-31 21:39:02] [INFO ] Deduced a trap composed of 87 places in 177 ms of which 3 ms to minimize.
[2024-05-31 21:39:02] [INFO ] Deduced a trap composed of 74 places in 182 ms of which 3 ms to minimize.
[2024-05-31 21:39:02] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 2 ms to minimize.
[2024-05-31 21:39:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1038 ms
[2024-05-31 21:39:02] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 61 ms.
[2024-05-31 21:39:03] [INFO ] Added : 10 causal constraints over 3 iterations in 238 ms. Result :sat
Minimization took 289 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[488] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[488] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 45 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 45 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 21:39:03] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:39:03] [INFO ] Invariant cache hit.
[2024-05-31 21:39:03] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-31 21:39:03] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:39:03] [INFO ] Invariant cache hit.
[2024-05-31 21:39:04] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:39:05] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
[2024-05-31 21:39:05] [INFO ] Redundant transitions in 16 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 21:39:05] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:39:05] [INFO ] Invariant cache hit.
[2024-05-31 21:39:05] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 21:39:18] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 33994ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34007ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35601 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-31 21:39:39] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[488] Max Struct:[+inf]
[2024-05-31 21:39:39] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:39:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[488] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2008 ms. (497 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 552 ms. (1808 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[488] Max Struct:[+inf]
[2024-05-31 21:39:41] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:39:41] [INFO ] Invariant cache hit.
[2024-05-31 21:39:41] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:39:42] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-31 21:39:42] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:39:42] [INFO ] [Real]Added 75 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:39:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:39:42] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-05-31 21:39:42] [INFO ] [Nat]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-31 21:39:42] [INFO ] Deduced a trap composed of 113 places in 195 ms of which 2 ms to minimize.
[2024-05-31 21:39:42] [INFO ] Deduced a trap composed of 109 places in 187 ms of which 3 ms to minimize.
[2024-05-31 21:39:43] [INFO ] Deduced a trap composed of 87 places in 187 ms of which 3 ms to minimize.
[2024-05-31 21:39:43] [INFO ] Deduced a trap composed of 74 places in 189 ms of which 3 ms to minimize.
[2024-05-31 21:39:43] [INFO ] Deduced a trap composed of 71 places in 190 ms of which 3 ms to minimize.
[2024-05-31 21:39:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1076 ms
[2024-05-31 21:39:43] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 57 ms.
[2024-05-31 21:39:43] [INFO ] Added : 10 causal constraints over 3 iterations in 215 ms. Result :sat
Minimization took 269 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[488] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[488] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 43 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 82 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 21:39:44] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:39:44] [INFO ] Invariant cache hit.
[2024-05-31 21:39:44] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-31 21:39:44] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:39:44] [INFO ] Invariant cache hit.
[2024-05-31 21:39:44] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:39:45] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 1488 ms to find 0 implicit places.
[2024-05-31 21:39:45] [INFO ] Redundant transitions in 19 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 21:39:45] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:39:45] [INFO ] Invariant cache hit.
[2024-05-31 21:39:45] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 21:39:59] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34206ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34217ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35817 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-31 21:40:19] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[488] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 541890 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 541890 steps, saw 332279 distinct states, run finished after 3002 ms. (steps per millisecond=180 ) properties seen :0
[2024-05-31 21:40:23] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:40:23] [INFO ] Invariant cache hit.
[2024-05-31 21:40:23] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 697ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2521 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 44 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 421/421 places, 1218/1218 transitions.
RANDOM walk for 40001 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 539209 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 1
Probabilistic random walk after 539209 steps, saw 330634 distinct states, run finished after 3002 ms. (steps per millisecond=179 ) properties seen :0
[2024-05-31 21:40:29] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:40:29] [INFO ] Invariant cache hit.
[2024-05-31 21:40:29] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 701ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2507 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 40 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 21:40:32] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:40:32] [INFO ] Invariant cache hit.
[2024-05-31 21:40:33] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-31 21:40:33] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:40:33] [INFO ] Invariant cache hit.
[2024-05-31 21:40:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:40:34] [INFO ] Implicit Places using invariants and state equation in 1169 ms returned []
Implicit Place search using SMT with State Equation took 1521 ms to find 0 implicit places.
[2024-05-31 21:40:34] [INFO ] Redundant transitions in 15 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 21:40:34] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:40:34] [INFO ] Invariant cache hit.
[2024-05-31 21:40:34] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 21:40:47] [INFO ] Deduced a trap composed of 131 places in 167 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34082ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34093ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35689 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 63 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-31 21:41:08] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 21:41:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:08] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:41:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:41:08] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:41:08] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:41:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:41:08] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:41:08] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:41:08] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:41:08] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 138 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[488] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-03 in 131698 ms.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:41:08] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
// Phase 1: matrix 739 rows 452 cols
[2024-05-31 21:41:08] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:41:08] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
[2024-05-31 21:41:08] [INFO ] Invariant cache hit.
[2024-05-31 21:41:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:08] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-31 21:41:08] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-31 21:41:08] [INFO ] [Real]Added 90 Read/Feed constraints in 26 ms returned sat
[2024-05-31 21:41:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:41:09] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-31 21:41:09] [INFO ] [Nat]Added 90 Read/Feed constraints in 26 ms returned sat
[2024-05-31 21:41:09] [INFO ] Computed and/alt/rep : 221/1346/221 causal constraints (skipped 516 transitions) in 67 ms.
[2024-05-31 21:41:09] [INFO ] Deduced a trap composed of 131 places in 157 ms of which 3 ms to minimize.
[2024-05-31 21:41:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2024-05-31 21:41:10] [INFO ] Added : 28 causal constraints over 9 iterations in 716 ms. Result :sat
Minimization took 285 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 1283/1283 transitions.
Graph (complete) has 2212 edges and 452 vertex of which 449 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 449 transition count 1278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 445 transition count 1268
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 445 transition count 1268
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 441 transition count 1258
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 441 transition count 1258
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 437 transition count 1248
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 437 transition count 1248
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 433 transition count 1240
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 433 transition count 1240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 429 transition count 1232
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 429 transition count 1232
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 425 transition count 1224
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 425 transition count 1224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 422 transition count 1218
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 422 transition count 1218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 420 transition count 1214
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 420 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 419 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 419 transition count 1212
Applied a total of 66 rules in 160 ms. Remains 419 /452 variables (removed 33) and now considering 1212/1283 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 419/452 places, 1212/1283 transitions.
[2024-05-31 21:41:10] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2024-05-31 21:41:10] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
// Phase 1: matrix 685 rows 419 cols
[2024-05-31 21:41:10] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2055 ms. (486 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 574 ms. (1739 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-05-31 21:41:13] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:41:13] [INFO ] Invariant cache hit.
[2024-05-31 21:41:13] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:13] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-31 21:41:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:41:13] [INFO ] [Real]Added 75 Read/Feed constraints in 34 ms returned sat
[2024-05-31 21:41:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:13] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-31 21:41:13] [INFO ] [Nat]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-31 21:41:14] [INFO ] Deduced a trap composed of 71 places in 193 ms of which 2 ms to minimize.
[2024-05-31 21:41:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2024-05-31 21:41:14] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 61 ms.
[2024-05-31 21:41:14] [INFO ] Added : 12 causal constraints over 4 iterations in 258 ms. Result :sat
Minimization took 244 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 42 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 44 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-31 21:41:14] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:41:14] [INFO ] Invariant cache hit.
[2024-05-31 21:41:15] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-31 21:41:15] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:41:15] [INFO ] Invariant cache hit.
[2024-05-31 21:41:15] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:41:16] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1499 ms to find 0 implicit places.
[2024-05-31 21:41:16] [INFO ] Redundant transitions in 20 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-31 21:41:16] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:41:16] [INFO ] Invariant cache hit.
[2024-05-31 21:41:16] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-31 21:41:29] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/423 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34086ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34096ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35673 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-31 21:41:50] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-05-31 21:41:50] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:41:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 2026 ms. (493 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 569 ms. (1754 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-05-31 21:41:53] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:41:53] [INFO ] Invariant cache hit.
[2024-05-31 21:41:53] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:41:53] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-05-31 21:41:53] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:41:53] [INFO ] [Real]Added 75 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:41:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:41:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:41:53] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:41:53] [INFO ] [Nat]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-31 21:41:54] [INFO ] Deduced a trap composed of 71 places in 188 ms of which 3 ms to minimize.
[2024-05-31 21:41:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2024-05-31 21:41:54] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 66 ms.
[2024-05-31 21:41:54] [INFO ] Added : 10 causal constraints over 3 iterations in 255 ms. Result :sat
Minimization took 248 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 44 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 44 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-31 21:41:54] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:41:54] [INFO ] Invariant cache hit.
[2024-05-31 21:41:55] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-31 21:41:55] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:41:55] [INFO ] Invariant cache hit.
[2024-05-31 21:41:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:41:56] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 1564 ms to find 0 implicit places.
[2024-05-31 21:41:56] [INFO ] Redundant transitions in 18 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-31 21:41:56] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:41:56] [INFO ] Invariant cache hit.
[2024-05-31 21:41:56] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-31 21:42:09] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/423 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 33852ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 33862ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35501 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-31 21:42:30] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 36537 steps (7 resets) in 105 ms. (344 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-05 in 81885 ms.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:42:30] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
// Phase 1: matrix 739 rows 452 cols
[2024-05-31 21:42:30] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:42:30] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
[2024-05-31 21:42:30] [INFO ] Invariant cache hit.
[2024-05-31 21:42:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:42:30] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-31 21:42:30] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-31 21:42:30] [INFO ] [Real]Added 90 Read/Feed constraints in 23 ms returned sat
[2024-05-31 21:42:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:42:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:42:31] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-31 21:42:31] [INFO ] [Nat]Added 90 Read/Feed constraints in 35 ms returned sat
[2024-05-31 21:42:31] [INFO ] Computed and/alt/rep : 221/1346/221 causal constraints (skipped 516 transitions) in 72 ms.
[2024-05-31 21:42:31] [INFO ] Added : 2 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 283 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 1283/1283 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 447 transition count 1271
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 447 transition count 1271
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 442 transition count 1259
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 442 transition count 1259
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 437 transition count 1247
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 437 transition count 1247
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 432 transition count 1237
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 432 transition count 1237
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 427 transition count 1227
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 427 transition count 1227
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 422 transition count 1217
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 422 transition count 1217
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 419 transition count 1211
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 419 transition count 1211
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 417 transition count 1207
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 417 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 416 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 416 transition count 1205
Applied a total of 72 rules in 133 ms. Remains 416 /452 variables (removed 36) and now considering 1205/1283 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 416/452 places, 1205/1283 transitions.
[2024-05-31 21:42:31] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-31 21:42:32] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2024-05-31 21:42:32] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2063 ms. (484 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 587 ms. (1700 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-31 21:42:34] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:42:34] [INFO ] Invariant cache hit.
[2024-05-31 21:42:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:42:34] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:42:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:42:35] [INFO ] [Real]Added 75 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:42:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:42:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:42:35] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:42:35] [INFO ] [Nat]Added 75 Read/Feed constraints in 41 ms returned sat
[2024-05-31 21:42:35] [INFO ] Deduced a trap composed of 69 places in 186 ms of which 3 ms to minimize.
[2024-05-31 21:42:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2024-05-31 21:42:35] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 67 ms.
[2024-05-31 21:42:35] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 2 ms to minimize.
[2024-05-31 21:42:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2024-05-31 21:42:36] [INFO ] Added : 4 causal constraints over 2 iterations in 486 ms. Result :sat
Minimization took 238 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 46 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 46 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-31 21:42:36] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:42:36] [INFO ] Invariant cache hit.
[2024-05-31 21:42:36] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-31 21:42:36] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:42:36] [INFO ] Invariant cache hit.
[2024-05-31 21:42:36] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:42:37] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
[2024-05-31 21:42:37] [INFO ] Redundant transitions in 21 ms returned []
Running 1203 sub problems to find dead transitions.
[2024-05-31 21:42:37] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:42:37] [INFO ] Invariant cache hit.
[2024-05-31 21:42:37] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2024-05-31 21:42:50] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
SMT process timed out in 34113ms, After SMT, problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 34125ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35747 ms. Remains : 416/416 places, 1205/1205 transitions.
[2024-05-31 21:43:12] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40002 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 529936 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 529936 steps, saw 324950 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
[2024-05-31 21:43:15] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:43:15] [INFO ] Invariant cache hit.
[2024-05-31 21:43:15] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 340/348 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 340/348 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/354 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 598/952 variables, 333/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 74/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1082 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1090 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1090 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1096 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 645ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 48 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 8 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-10 in 45455 ms.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:43:16] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
// Phase 1: matrix 739 rows 452 cols
[2024-05-31 21:43:16] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:43:16] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
[2024-05-31 21:43:16] [INFO ] Invariant cache hit.
[2024-05-31 21:43:16] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:43:16] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-31 21:43:16] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-31 21:43:16] [INFO ] [Real]Added 90 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:43:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:43:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:43:16] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:43:16] [INFO ] [Nat]Added 90 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:43:16] [INFO ] Computed and/alt/rep : 221/1346/221 causal constraints (skipped 516 transitions) in 62 ms.
[2024-05-31 21:43:16] [INFO ] Added : 17 causal constraints over 5 iterations in 323 ms. Result :sat
Minimization took 303 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 1283/1283 transitions.
Graph (complete) has 2212 edges and 452 vertex of which 449 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 449 transition count 1278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 445 transition count 1268
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 445 transition count 1268
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 441 transition count 1258
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 441 transition count 1258
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 437 transition count 1248
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 437 transition count 1248
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 433 transition count 1240
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 433 transition count 1240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 429 transition count 1232
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 429 transition count 1232
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 425 transition count 1224
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 425 transition count 1224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 422 transition count 1218
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 422 transition count 1218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 420 transition count 1214
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 420 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 419 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 419 transition count 1212
Applied a total of 66 rules in 142 ms. Remains 419 /452 variables (removed 33) and now considering 1212/1283 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 419/452 places, 1212/1283 transitions.
[2024-05-31 21:43:17] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:43:17] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
// Phase 1: matrix 685 rows 419 cols
[2024-05-31 21:43:17] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2072 ms. (482 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 565 ms. (1766 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:43:20] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:43:20] [INFO ] Invariant cache hit.
[2024-05-31 21:43:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:43:20] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 21:43:20] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:43:20] [INFO ] [Real]Added 75 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:43:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:43:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:43:20] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-05-31 21:43:20] [INFO ] [Nat]Added 75 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:43:20] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 59 ms.
[2024-05-31 21:43:21] [INFO ] Added : 8 causal constraints over 2 iterations in 193 ms. Result :sat
Minimization took 244 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 42 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 41 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-31 21:43:21] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:43:21] [INFO ] Invariant cache hit.
[2024-05-31 21:43:21] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-31 21:43:21] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:43:21] [INFO ] Invariant cache hit.
[2024-05-31 21:43:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:43:23] [INFO ] Implicit Places using invariants and state equation in 1225 ms returned []
Implicit Place search using SMT with State Equation took 1537 ms to find 0 implicit places.
[2024-05-31 21:43:23] [INFO ] Redundant transitions in 22 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-31 21:43:23] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:43:23] [INFO ] Invariant cache hit.
[2024-05-31 21:43:23] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-31 21:43:36] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/423 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34162ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34171ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35781 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-31 21:43:57] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31345 steps (7 resets) in 31 ms. (979 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-11 in 41579 ms.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:43:57] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
// Phase 1: matrix 739 rows 452 cols
[2024-05-31 21:43:57] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:43:57] [INFO ] Flow matrix only has 739 transitions (discarded 544 similar events)
[2024-05-31 21:43:57] [INFO ] Invariant cache hit.
[2024-05-31 21:43:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:43:57] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:43:57] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-31 21:43:57] [INFO ] [Real]Added 90 Read/Feed constraints in 25 ms returned sat
[2024-05-31 21:43:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:43:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:43:58] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:43:58] [INFO ] [Nat]Added 90 Read/Feed constraints in 35 ms returned sat
[2024-05-31 21:43:58] [INFO ] Computed and/alt/rep : 221/1346/221 causal constraints (skipped 516 transitions) in 73 ms.
[2024-05-31 21:43:58] [INFO ] Added : 32 causal constraints over 7 iterations in 417 ms. Result :sat
Minimization took 302 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 1283/1283 transitions.
Graph (complete) has 2212 edges and 452 vertex of which 449 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 449 transition count 1278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 445 transition count 1270
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 445 transition count 1270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 441 transition count 1260
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 441 transition count 1260
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 437 transition count 1250
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 437 transition count 1250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 433 transition count 1242
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 433 transition count 1242
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 429 transition count 1234
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 429 transition count 1234
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 425 transition count 1226
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 425 transition count 1226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 423 transition count 1222
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 423 transition count 1222
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 421 transition count 1218
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 421 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 420 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 420 transition count 1216
Applied a total of 64 rules in 128 ms. Remains 420 /452 variables (removed 32) and now considering 1216/1283 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 420/452 places, 1216/1283 transitions.
[2024-05-31 21:43:59] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 21:43:59] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
// Phase 1: matrix 687 rows 420 cols
[2024-05-31 21:43:59] [INFO ] Computed 3 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2078 ms. (481 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 559 ms. (1785 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 21:44:02] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:44:02] [INFO ] Invariant cache hit.
[2024-05-31 21:44:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:44:02] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-05-31 21:44:02] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:44:02] [INFO ] [Real]Added 75 Read/Feed constraints in 28 ms returned sat
[2024-05-31 21:44:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:44:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:44:02] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-05-31 21:44:02] [INFO ] [Nat]Added 75 Read/Feed constraints in 28 ms returned sat
[2024-05-31 21:44:02] [INFO ] Deduced a trap composed of 74 places in 192 ms of which 3 ms to minimize.
[2024-05-31 21:44:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2024-05-31 21:44:02] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 353 transitions) in 58 ms.
[2024-05-31 21:44:03] [INFO ] Added : 8 causal constraints over 3 iterations in 253 ms. Result :sat
Minimization took 260 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 42 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 420/420 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 43 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-31 21:44:03] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:44:03] [INFO ] Invariant cache hit.
[2024-05-31 21:44:03] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-31 21:44:03] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:44:03] [INFO ] Invariant cache hit.
[2024-05-31 21:44:03] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:44:05] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 1705 ms to find 0 implicit places.
[2024-05-31 21:44:05] [INFO ] Redundant transitions in 19 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-31 21:44:05] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:44:05] [INFO ] Invariant cache hit.
[2024-05-31 21:44:05] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-31 21:44:18] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 1.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 34080ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 34091ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35871 ms. Remains : 420/420 places, 1216/1216 transitions.
[2024-05-31 21:44:39] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 547378 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 547378 steps, saw 335645 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
[2024-05-31 21:44:42] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:44:42] [INFO ] Invariant cache hit.
[2024-05-31 21:44:42] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/372 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 605/977 variables, 337/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 74/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1039 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1039 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1107 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/372 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 605/977 variables, 337/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 74/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/977 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1039 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1039 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1107/1107 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 567ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 42 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 420/420 places, 1216/1216 transitions.
RANDOM walk for 30284 steps (6 resets) in 90 ms. (332 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-12 in 45558 ms.
[2024-05-31 21:44:43] [INFO ] Flatten gal took : 116 ms
[2024-05-31 21:44:43] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 21:44:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 452 places, 1283 transitions and 5260 arcs took 10 ms.
Total runtime 925194 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : FunctionPointer-PT-c004-UpperBounds-01
Could not compute solution for formula : FunctionPointer-PT-c004-UpperBounds-03
Could not compute solution for formula : FunctionPointer-PT-c004-UpperBounds-05
Could not compute solution for formula : FunctionPointer-PT-c004-UpperBounds-10
Could not compute solution for formula : FunctionPointer-PT-c004-UpperBounds-11
Could not compute solution for formula : FunctionPointer-PT-c004-UpperBounds-12
BK_STOP 1717191883816
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name FunctionPointer-PT-c004-UpperBounds-01
ub formula formula --maxsum=/tmp/1595/ub_0_
ub formula name FunctionPointer-PT-c004-UpperBounds-03
ub formula formula --maxsum=/tmp/1595/ub_1_
ub formula name FunctionPointer-PT-c004-UpperBounds-05
ub formula formula --maxsum=/tmp/1595/ub_2_
ub formula name FunctionPointer-PT-c004-UpperBounds-10
ub formula formula --maxsum=/tmp/1595/ub_3_
ub formula name FunctionPointer-PT-c004-UpperBounds-11
ub formula formula --maxsum=/tmp/1595/ub_4_
ub formula name FunctionPointer-PT-c004-UpperBounds-12
ub formula formula --maxsum=/tmp/1595/ub_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-c004, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640603100285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c004.tgz
mv FunctionPointer-PT-c004 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;