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.r532-smll-171683810800133.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 SieveSingleMsgMbox-PT-d2m64, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810800133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 12 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 12 19:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 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 SieveSingleMsgMbox-PT-d2m64-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m64-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717250049953

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m64
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:54:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 13:54:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:54:13] [INFO ] Load time of PNML (sax parser for PT used): 475 ms
[2024-06-01 13:54:13] [INFO ] Transformed 2398 places.
[2024-06-01 13:54:13] [INFO ] Transformed 1954 transitions.
[2024-06-01 13:54:13] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 744 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
Deduced a syphon composed of 1984 places in 39 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 1954 rows 414 cols
[2024-06-01 13:54:13] [INFO ] Computed 6 invariants in 112 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 115, 12]
RANDOM walk for 10000 steps (2183 resets) in 432 ms. (23 steps per ms)
BEST_FIRST walk for 30000 steps (2882 resets) in 249 ms. (120 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 115, 12]
[2024-06-01 13:54:14] [INFO ] Invariant cache hit.
[2024-06-01 13:54:14] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2024-06-01 13:54:14] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-06-01 13:54:15] [INFO ] [Real]Absence check using state equation in 720 ms returned sat
[2024-06-01 13:54:15] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2024-06-01 13:54:16] [INFO ] [Real]Added 1674 Read/Feed constraints in 802 ms returned sat
[2024-06-01 13:54:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:54:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-06-01 13:54:16] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 13:54:17] [INFO ] [Nat]Absence check using state equation in 617 ms returned sat
[2024-06-01 13:54:17] [INFO ] [Nat]Added 1674 Read/Feed constraints in 563 ms returned sat
[2024-06-01 13:54:18] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 457 ms.
[2024-06-01 13:54:18] [INFO ] Added : 5 causal constraints over 1 iterations in 825 ms. Result :sat
Minimization took 566 ms.
[2024-06-01 13:54:19] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-06-01 13:54:19] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 11 ms returned sat
[2024-06-01 13:54:20] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2024-06-01 13:54:20] [INFO ] [Real]Added 1674 Read/Feed constraints in 716 ms returned sat
[2024-06-01 13:54:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:54:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-06-01 13:54:21] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2024-06-01 13:54:22] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2024-06-01 13:54:22] [INFO ] [Nat]Added 1674 Read/Feed constraints in 825 ms returned sat
[2024-06-01 13:54:23] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 311 ms.
[2024-06-01 13:54:24] [INFO ] Added : 23 causal constraints over 5 iterations in 1537 ms. Result :sat
Minimization took 548 ms.
[2024-06-01 13:54:25] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-06-01 13:54:25] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-06-01 13:54:25] [INFO ] [Real]Absence check using state equation in 785 ms returned sat
[2024-06-01 13:54:26] [INFO ] [Real]Added 1674 Read/Feed constraints in 605 ms returned sat
[2024-06-01 13:54:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:54:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-06-01 13:54:26] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 13:54:27] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2024-06-01 13:54:28] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 13:54:28] [INFO ] [Nat]Added 1674 Read/Feed constraints in 1040 ms returned sat
[2024-06-01 13:54:28] [INFO ] Deduced a trap composed of 44 places in 392 ms of which 49 ms to minimize.
[2024-06-01 13:54:29] [INFO ] Deduced a trap composed of 45 places in 375 ms of which 5 ms to minimize.
[2024-06-01 13:54:29] [INFO ] Deduced a trap composed of 155 places in 329 ms of which 5 ms to minimize.
[2024-06-01 13:54:30] [INFO ] Deduced a trap composed of 155 places in 476 ms of which 7 ms to minimize.
[2024-06-01 13:54:31] [INFO ] Deduced a trap composed of 243 places in 479 ms of which 7 ms to minimize.
[2024-06-01 13:54:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2969 ms
[2024-06-01 13:54:31] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 345 ms.
[2024-06-01 13:54:31] [INFO ] Added : 0 causal constraints over 0 iterations in 347 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 115, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 115, 12]
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.14 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 949 place count 270 transition count 389
Iterating global reduction 1 with 118 rules applied. Total rules applied 1067 place count 270 transition count 389
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1077 place count 270 transition count 379
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 1169 place count 178 transition count 287
Iterating global reduction 2 with 92 rules applied. Total rules applied 1261 place count 178 transition count 287
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1296 place count 178 transition count 252
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1333 place count 141 transition count 202
Iterating global reduction 3 with 37 rules applied. Total rules applied 1370 place count 141 transition count 202
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 1396 place count 141 transition count 176
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1405 place count 132 transition count 162
Iterating global reduction 4 with 9 rules applied. Total rules applied 1414 place count 132 transition count 162
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1422 place count 124 transition count 154
Iterating global reduction 4 with 8 rules applied. Total rules applied 1430 place count 124 transition count 154
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1434 place count 120 transition count 150
Iterating global reduction 4 with 4 rules applied. Total rules applied 1438 place count 120 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1440 place count 120 transition count 148
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1444 place count 116 transition count 144
Iterating global reduction 5 with 4 rules applied. Total rules applied 1448 place count 116 transition count 144
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1451 place count 113 transition count 141
Iterating global reduction 5 with 3 rules applied. Total rules applied 1454 place count 113 transition count 141
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1455 place count 112 transition count 138
Iterating global reduction 5 with 1 rules applied. Total rules applied 1456 place count 112 transition count 138
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1457 place count 111 transition count 137
Iterating global reduction 5 with 1 rules applied. Total rules applied 1458 place count 111 transition count 137
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1459 place count 110 transition count 136
Iterating global reduction 5 with 1 rules applied. Total rules applied 1460 place count 110 transition count 136
Applied a total of 1460 rules in 277 ms. Remains 110 /414 variables (removed 304) and now considering 136/1954 (removed 1818) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 110/414 places, 136/1954 transitions.
// Phase 1: matrix 136 rows 110 cols
[2024-06-01 13:54:32] [INFO ] Computed 4 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 64, 12]
RANDOM walk for 1000000 steps (224656 resets) in 1442 ms. (693 steps per ms)
BEST_FIRST walk for 3000002 steps (309493 resets) in 2129 ms. (1408 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 64, 12]
[2024-06-01 13:54:36] [INFO ] Invariant cache hit.
[2024-06-01 13:54:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 13:54:36] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 13:54:36] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-06-01 13:54:36] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 13:54:36] [INFO ] [Real]Added 58 Read/Feed constraints in 19 ms returned sat
[2024-06-01 13:54:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:54:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:54:36] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 13:54:36] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-01 13:54:36] [INFO ] [Nat]Added 58 Read/Feed constraints in 22 ms returned sat
[2024-06-01 13:54:36] [INFO ] Computed and/alt/rep : 29/79/29 causal constraints (skipped 106 transitions) in 12 ms.
[2024-06-01 13:54:36] [INFO ] Added : 8 causal constraints over 2 iterations in 51 ms. Result :sat
Minimization took 89 ms.
[2024-06-01 13:54:36] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:54:36] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:54:36] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-01 13:54:36] [INFO ] [Real]Added 58 Read/Feed constraints in 15 ms returned sat
[2024-06-01 13:54:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:54:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:54:36] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:54:36] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-01 13:54:37] [INFO ] [Nat]Added 58 Read/Feed constraints in 16 ms returned sat
[2024-06-01 13:54:37] [INFO ] Computed and/alt/rep : 29/79/29 causal constraints (skipped 106 transitions) in 11 ms.
[2024-06-01 13:54:37] [INFO ] Added : 13 causal constraints over 3 iterations in 68 ms. Result :sat
Minimization took 165 ms.
[2024-06-01 13:54:37] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:54:37] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:54:37] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-01 13:54:37] [INFO ] [Real]Added 58 Read/Feed constraints in 20 ms returned sat
[2024-06-01 13:54:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:54:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 13:54:37] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:54:37] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-01 13:54:37] [INFO ] [Nat]Added 58 Read/Feed constraints in 22 ms returned sat
[2024-06-01 13:54:37] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-06-01 13:54:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-06-01 13:54:37] [INFO ] Computed and/alt/rep : 29/79/29 causal constraints (skipped 106 transitions) in 11 ms.
[2024-06-01 13:54:37] [INFO ] Added : 21 causal constraints over 5 iterations in 92 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 64, 12]
FORMULA SieveSingleMsgMbox-PT-d2m64-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[64, 12]
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 136/136 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 108 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 108 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 106 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 106 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 105 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 105 transition count 130
Applied a total of 10 rules in 26 ms. Remains 105 /110 variables (removed 5) and now considering 130/136 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 105/110 places, 130/136 transitions.
// Phase 1: matrix 130 rows 105 cols
[2024-06-01 13:54:37] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[64, 12]
RANDOM walk for 1000000 steps (224450 resets) in 1218 ms. (820 steps per ms)
BEST_FIRST walk for 2000002 steps (207198 resets) in 1268 ms. (1576 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[64, 12]
[2024-06-01 13:54:40] [INFO ] Invariant cache hit.
[2024-06-01 13:54:40] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:54:40] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:54:40] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-01 13:54:40] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 13:54:40] [INFO ] [Real]Added 56 Read/Feed constraints in 17 ms returned sat
[2024-06-01 13:54:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:54:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:54:40] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:54:40] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-01 13:54:40] [INFO ] [Nat]Added 56 Read/Feed constraints in 16 ms returned sat
[2024-06-01 13:54:40] [INFO ] Computed and/alt/rep : 27/76/27 causal constraints (skipped 102 transitions) in 9 ms.
[2024-06-01 13:54:40] [INFO ] Added : 14 causal constraints over 4 iterations in 73 ms. Result :sat
Minimization took 138 ms.
[2024-06-01 13:54:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 13:54:40] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 13:54:40] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-01 13:54:40] [INFO ] [Real]Added 56 Read/Feed constraints in 20 ms returned sat
[2024-06-01 13:54:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:54:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:54:40] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 13:54:41] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-01 13:54:41] [INFO ] [Nat]Added 56 Read/Feed constraints in 20 ms returned sat
[2024-06-01 13:54:41] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-06-01 13:54:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-06-01 13:54:41] [INFO ] Computed and/alt/rep : 27/76/27 causal constraints (skipped 102 transitions) in 9 ms.
[2024-06-01 13:54:41] [INFO ] Added : 21 causal constraints over 5 iterations in 107 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[64, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[64, 12]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 130/130 transitions.
Applied a total of 0 rules in 11 ms. Remains 105 /105 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 105/105 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 130/130 transitions.
Applied a total of 0 rules in 9 ms. Remains 105 /105 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-06-01 13:54:41] [INFO ] Invariant cache hit.
[2024-06-01 13:54:41] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 13:54:41] [INFO ] Invariant cache hit.
[2024-06-01 13:54:41] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 13:54:41] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-06-01 13:54:41] [INFO ] Redundant transitions in 3 ms returned []
Running 129 sub problems to find dead transitions.
[2024-06-01 13:54:41] [INFO ] Invariant cache hit.
[2024-06-01 13:54:41] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 130/235 variables, 105/109 constraints. Problems are: Problem set: 0 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 56/165 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/235 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 165 constraints, problems are : Problem set: 0 solved, 129 unsolved in 4563 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 130/235 variables, 105/109 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 56/165 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 129/294 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-06-01 13:54:49] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD118 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 1/295 constraints. Problems are: Problem set: 3 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 0/295 constraints. Problems are: Problem set: 3 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/235 variables, 0/295 constraints. Problems are: Problem set: 3 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 295 constraints, problems are : Problem set: 3 solved, 126 unsolved in 11541 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints]
After SMT, in 16474ms problems are : Problem set: 3 solved, 126 unsolved
Search for dead transitions found 3 dead transitions in 16487ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 105/105 places, 127/130 transitions.
Graph (complete) has 303 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 102 /105 variables (removed 3) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 102 cols
[2024-06-01 13:54:58] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 13:54:58] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-01 13:54:58] [INFO ] Invariant cache hit.
[2024-06-01 13:54:58] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 13:54:58] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 102/105 places, 127/130 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17397 ms. Remains : 102/105 places, 127/130 transitions.
[2024-06-01 13:54:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[64, 12]
RANDOM walk for 1000000 steps (224104 resets) in 1220 ms. (819 steps per ms)
BEST_FIRST walk for 2000000 steps (206966 resets) in 1249 ms. (1600 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[64, 12]
[2024-06-01 13:55:01] [INFO ] Invariant cache hit.
[2024-06-01 13:55:01] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:55:01] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-06-01 13:55:01] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 13:55:01] [INFO ] [Real]Added 55 Read/Feed constraints in 12 ms returned sat
[2024-06-01 13:55:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:55:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 13:55:01] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-01 13:55:01] [INFO ] [Nat]Added 55 Read/Feed constraints in 20 ms returned sat
[2024-06-01 13:55:01] [INFO ] Computed and/alt/rep : 26/72/26 causal constraints (skipped 100 transitions) in 9 ms.
[2024-06-01 13:55:01] [INFO ] Added : 15 causal constraints over 3 iterations in 64 ms. Result :sat
Minimization took 235 ms.
[2024-06-01 13:55:01] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:55:01] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-06-01 13:55:01] [INFO ] [Real]Added 55 Read/Feed constraints in 19 ms returned sat
[2024-06-01 13:55:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:55:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 13:55:02] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 13:55:02] [INFO ] [Nat]Added 55 Read/Feed constraints in 17 ms returned sat
[2024-06-01 13:55:02] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:55:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-06-01 13:55:02] [INFO ] Computed and/alt/rep : 26/72/26 causal constraints (skipped 100 transitions) in 10 ms.
[2024-06-01 13:55:02] [INFO ] Added : 20 causal constraints over 4 iterations in 80 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[64, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[64, 12]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 127/127 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 102/102 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 127/127 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-06-01 13:55:02] [INFO ] Invariant cache hit.
[2024-06-01 13:55:02] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 13:55:02] [INFO ] Invariant cache hit.
[2024-06-01 13:55:02] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 13:55:02] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-06-01 13:55:02] [INFO ] Redundant transitions in 3 ms returned []
Running 126 sub problems to find dead transitions.
[2024-06-01 13:55:02] [INFO ] Invariant cache hit.
[2024-06-01 13:55:02] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD113 is UNSAT
At refinement iteration 4 (OVERLAPS) 127/229 variables, 102/105 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 55/160 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 160 constraints, problems are : Problem set: 3 solved, 123 unsolved in 3813 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 126/225 variables, 99/102 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 54/156 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 14/170 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 4/229 variables, 3/173 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 1/174 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 109/283 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/283 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 0/229 variables, 0/283 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 283 constraints, problems are : Problem set: 3 solved, 123 unsolved in 13598 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 102/102 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 123/126 constraints, Known Traps: 0/0 constraints]
After SMT, in 17619ms problems are : Problem set: 3 solved, 123 unsolved
Search for dead transitions found 3 dead transitions in 17621ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 102/102 places, 124/127 transitions.
Graph (complete) has 294 edges and 102 vertex of which 99 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 99 /102 variables (removed 3) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 99 cols
[2024-06-01 13:55:20] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 13:55:20] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 13:55:20] [INFO ] Invariant cache hit.
[2024-06-01 13:55:20] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 13:55:20] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 99/102 places, 124/127 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18513 ms. Remains : 99/102 places, 124/127 transitions.
[2024-06-01 13:55:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[64, 12]
RANDOM walk for 1000000 steps (224379 resets) in 1455 ms. (686 steps per ms)
BEST_FIRST walk for 2000001 steps (206870 resets) in 1153 ms. (1733 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[64, 12]
[2024-06-01 13:55:23] [INFO ] Invariant cache hit.
[2024-06-01 13:55:23] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:55:23] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-06-01 13:55:23] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 13:55:23] [INFO ] [Real]Added 54 Read/Feed constraints in 16 ms returned sat
[2024-06-01 13:55:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:55:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:55:23] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-06-01 13:55:23] [INFO ] [Nat]Added 54 Read/Feed constraints in 22 ms returned sat
[2024-06-01 13:55:23] [INFO ] Computed and/alt/rep : 25/67/25 causal constraints (skipped 98 transitions) in 15 ms.
[2024-06-01 13:55:23] [INFO ] Added : 13 causal constraints over 3 iterations in 89 ms. Result :sat
Minimization took 155 ms.
[2024-06-01 13:55:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:55:24] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-06-01 13:55:24] [INFO ] [Real]Added 54 Read/Feed constraints in 33 ms returned sat
[2024-06-01 13:55:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:55:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:55:24] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-01 13:55:24] [INFO ] [Nat]Added 54 Read/Feed constraints in 38 ms returned sat
[2024-06-01 13:55:24] [INFO ] Computed and/alt/rep : 25/67/25 causal constraints (skipped 98 transitions) in 14 ms.
[2024-06-01 13:55:24] [INFO ] Added : 20 causal constraints over 4 iterations in 114 ms. Result :sat
Minimization took 103 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[64, 12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[64, 12]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 124/124 transitions.
Applied a total of 0 rules in 11 ms. Remains 99 /99 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 99/99 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 124/124 transitions.
Applied a total of 0 rules in 8 ms. Remains 99 /99 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-06-01 13:55:24] [INFO ] Invariant cache hit.
[2024-06-01 13:55:24] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 13:55:24] [INFO ] Invariant cache hit.
[2024-06-01 13:55:24] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 13:55:25] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-06-01 13:55:25] [INFO ] Redundant transitions in 5 ms returned []
Running 123 sub problems to find dead transitions.
[2024-06-01 13:55:25] [INFO ] Invariant cache hit.
[2024-06-01 13:55:25] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/223 variables, 99/102 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 54/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 156 constraints, problems are : Problem set: 0 solved, 123 unsolved in 5612 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/223 variables, 99/102 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 54/156 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 123/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/223 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 279 constraints, problems are : Problem set: 0 solved, 123 unsolved in 8964 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 14854ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 14858ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15434 ms. Remains : 99/99 places, 124/124 transitions.
RANDOM walk for 40000 steps (8984 resets) in 1425 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4128 resets) in 732 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4033 resets) in 359 ms. (111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4054 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4156 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 641169 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :1 out of 4
Probabilistic random walk after 641169 steps, saw 275365 distinct states, run finished after 3011 ms. (steps per millisecond=212 ) properties seen :1
[2024-06-01 13:55:44] [INFO ] Invariant cache hit.
[2024-06-01 13:55:44] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 47/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/57 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 85/142 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 67/209 variables, 31/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 51/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem MAX1 is UNSAT
At refinement iteration 10 (OVERLAPS) 14/223 variables, 11/153 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 3/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 13:55:44] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 1/157 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 0/157 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/223 variables, 0/157 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 157 constraints, problems are : Problem set: 2 solved, 1 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/111 variables, 14/15 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 26/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 1/42 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 106/217 variables, 78/120 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 1/121 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 28/149 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 1/150 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/223 variables, 2/152 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 6/158 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/223 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 158 constraints, problems are : Problem set: 2 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 465ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 124/124 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 98 transition count 121
Applied a total of 3 rules in 19 ms. Remains 98 /99 variables (removed 1) and now considering 121/124 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 98/99 places, 121/124 transitions.
RANDOM walk for 40000 steps (8995 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4113 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2391522 steps, run timeout after 3001 ms. (steps per millisecond=796 ) properties seen :0 out of 1
Probabilistic random walk after 2391522 steps, saw 1003595 distinct states, run finished after 3001 ms. (steps per millisecond=796 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2024-06-01 13:55:47] [INFO ] Computed 3 invariants in 7 ms
[2024-06-01 13:55:47] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
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) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/109 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 104/213 variables, 77/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 27/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 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) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/109 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 104/213 variables, 77/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 27/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 373ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 13:55:48] [INFO ] Invariant cache hit.
[2024-06-01 13:55:48] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 13:55:48] [INFO ] Invariant cache hit.
[2024-06-01 13:55:48] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 13:55:48] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2024-06-01 13:55:48] [INFO ] Redundant transitions in 16 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 13:55:48] [INFO ] Invariant cache hit.
[2024-06-01 13:55:48] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4846 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 10104 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 15097ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 15099ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15643 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 113
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 92 transition count 113
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 14 place count 92 transition count 98
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 44 place count 77 transition count 98
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 71 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 70 transition count 101
Applied a total of 58 rules in 30 ms. Remains 70 /98 variables (removed 28) and now considering 101/121 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 70 cols
[2024-06-01 13:56:03] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:56:03] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:56:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 13:56:03] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:56:03] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:56:04] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 2 ms to minimize.
[2024-06-01 13:56:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
TRAPS : Iteration 1
[2024-06-01 13:56:04] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:56:04] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 305 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[64, 12]
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m64-UpperBounds-02
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:[64]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[64]
// Phase 1: matrix 124 rows 99 cols
[2024-06-01 13:56:04] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 10000 steps (2215 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10000 steps (1062 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[64]
[2024-06-01 13:56:04] [INFO ] Invariant cache hit.
[2024-06-01 13:56:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:56:04] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-06-01 13:56:04] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 13:56:04] [INFO ] [Real]Added 54 Read/Feed constraints in 25 ms returned sat
[2024-06-01 13:56:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:56:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:56:04] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-06-01 13:56:04] [INFO ] [Nat]Added 54 Read/Feed constraints in 23 ms returned sat
[2024-06-01 13:56:04] [INFO ] Computed and/alt/rep : 25/67/25 causal constraints (skipped 98 transitions) in 17 ms.
[2024-06-01 13:56:04] [INFO ] Added : 13 causal constraints over 3 iterations in 96 ms. Result :sat
Minimization took 153 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[64]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 124/124 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 97 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 97 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 97 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 96 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 96 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 96 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 95 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 95 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 94 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 94 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 93 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 93 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 93 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 92 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 92 transition count 102
Applied a total of 17 rules in 34 ms. Remains 92 /99 variables (removed 7) and now considering 102/124 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 92/99 places, 102/124 transitions.
// Phase 1: matrix 102 rows 92 cols
[2024-06-01 13:56:04] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 1000000 steps (224418 resets) in 1522 ms. (656 steps per ms)
BEST_FIRST walk for 1000000 steps (103167 resets) in 637 ms. (1567 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[64]
[2024-06-01 13:56:06] [INFO ] Invariant cache hit.
[2024-06-01 13:56:06] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 13:56:06] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:56:07] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-01 13:56:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-01 13:56:07] [INFO ] [Real]Added 38 Read/Feed constraints in 15 ms returned sat
[2024-06-01 13:56:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:56:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 13:56:07] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 13:56:07] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-06-01 13:56:07] [INFO ] [Nat]Added 38 Read/Feed constraints in 14 ms returned sat
[2024-06-01 13:56:07] [INFO ] Computed and/alt/rep : 23/58/23 causal constraints (skipped 78 transitions) in 12 ms.
[2024-06-01 13:56:07] [INFO ] Added : 14 causal constraints over 3 iterations in 75 ms. Result :sat
Minimization took 126 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[64]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 92/92 places, 102/102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 92 /92 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-06-01 13:56:07] [INFO ] Invariant cache hit.
[2024-06-01 13:56:07] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-01 13:56:07] [INFO ] Invariant cache hit.
[2024-06-01 13:56:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-01 13:56:07] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2024-06-01 13:56:07] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2024-06-01 13:56:07] [INFO ] Invariant cache hit.
[2024-06-01 13:56:07] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/194 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 38/133 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 133 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4472 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/194 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 38/133 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 101/234 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/194 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 234 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6602 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints]
After SMT, in 11251ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 11257ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11770 ms. Remains : 92/92 places, 102/102 transitions.
RANDOM walk for 40000 steps (8993 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4245 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4147 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2293195 steps, run timeout after 3001 ms. (steps per millisecond=764 ) properties seen :1 out of 2
Probabilistic random walk after 2293195 steps, saw 1068783 distinct states, run finished after 3001 ms. (steps per millisecond=764 ) properties seen :1
[2024-06-01 13:56:22] [INFO ] Invariant cache hit.
[2024-06-01 13:56:22] [INFO ] State equation strengthened by 38 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) 45/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 66/120 variables, 54/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/158 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 23/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:56:22] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:56:22] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 158/194 variables, and 99 constraints, problems are : Problem set: 1 solved, 0 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/92 constraints, ReadFeed: 23/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 270ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[64]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m64-UpperBounds-02 in 18481 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m64-UpperBounds-07
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:[12]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[12]
// Phase 1: matrix 124 rows 99 cols
[2024-06-01 13:56:22] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 10000 steps (2236 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10000 steps (1016 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2024-06-01 13:56:22] [INFO ] Invariant cache hit.
[2024-06-01 13:56:22] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:56:22] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-06-01 13:56:22] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-01 13:56:22] [INFO ] [Real]Added 54 Read/Feed constraints in 33 ms returned sat
[2024-06-01 13:56:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:56:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:56:22] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-06-01 13:56:22] [INFO ] [Nat]Added 54 Read/Feed constraints in 38 ms returned sat
[2024-06-01 13:56:22] [INFO ] Computed and/alt/rep : 25/67/25 causal constraints (skipped 98 transitions) in 16 ms.
[2024-06-01 13:56:23] [INFO ] Added : 20 causal constraints over 4 iterations in 126 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 124/124 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 98 transition count 121
Applied a total of 3 rules in 11 ms. Remains 98 /99 variables (removed 1) and now considering 121/124 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 98/99 places, 121/124 transitions.
// Phase 1: matrix 121 rows 98 cols
[2024-06-01 13:56:23] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[12]
RANDOM walk for 1000000 steps (224735 resets) in 1238 ms. (807 steps per ms)
BEST_FIRST walk for 1000001 steps (103461 resets) in 562 ms. (1776 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[12]
[2024-06-01 13:56:25] [INFO ] Invariant cache hit.
[2024-06-01 13:56:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 13:56:25] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-01 13:56:25] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 13:56:25] [INFO ] [Real]Added 53 Read/Feed constraints in 27 ms returned sat
[2024-06-01 13:56:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 13:56:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:56:25] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-01 13:56:25] [INFO ] [Nat]Added 53 Read/Feed constraints in 21 ms returned sat
[2024-06-01 13:56:25] [INFO ] Computed and/alt/rep : 25/65/25 causal constraints (skipped 95 transitions) in 11 ms.
[2024-06-01 13:56:25] [INFO ] Added : 18 causal constraints over 4 iterations in 93 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[12]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[12]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 13:56:25] [INFO ] Invariant cache hit.
[2024-06-01 13:56:25] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-01 13:56:25] [INFO ] Invariant cache hit.
[2024-06-01 13:56:25] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 13:56:26] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2024-06-01 13:56:26] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 13:56:26] [INFO ] Invariant cache hit.
[2024-06-01 13:56:26] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5463 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 10095 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 15689ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 15691ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16178 ms. Remains : 98/98 places, 121/121 transitions.
RANDOM walk for 40000 steps (9045 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4123 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4142 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 654241 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :0 out of 2
Probabilistic random walk after 654241 steps, saw 280917 distinct states, run finished after 3005 ms. (steps per millisecond=217 ) properties seen :0
[2024-06-01 13:56:44] [INFO ] Invariant cache hit.
[2024-06-01 13:56:44] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 95/109 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 104/213 variables, 77/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 27/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 10 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 1 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/14 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/109 variables, 14/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 26/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 104/213 variables, 77/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 27/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 1 solved, 1 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 330ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 10 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 98/98 places, 121/121 transitions.
RANDOM walk for 40000 steps (8963 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4082 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2335215 steps, run timeout after 3001 ms. (steps per millisecond=778 ) properties seen :0 out of 1
Probabilistic random walk after 2335215 steps, saw 980527 distinct states, run finished after 3001 ms. (steps per millisecond=778 ) properties seen :0
[2024-06-01 13:56:48] [INFO ] Invariant cache hit.
[2024-06-01 13:56:48] [INFO ] State equation strengthened by 53 read => feed constraints.
All remaining problems are real, not stopping.
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) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/109 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 104/213 variables, 77/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 27/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 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) 13/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 95/109 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 104/213 variables, 77/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 27/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 270ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 13:56:48] [INFO ] Invariant cache hit.
[2024-06-01 13:56:48] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-01 13:56:48] [INFO ] Invariant cache hit.
[2024-06-01 13:56:48] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 13:56:49] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2024-06-01 13:56:49] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 13:56:49] [INFO ] Invariant cache hit.
[2024-06-01 13:56:49] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 10035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 15264ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 15266ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15792 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 113
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 92 transition count 113
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 14 place count 92 transition count 98
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 44 place count 77 transition count 98
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 71 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 70 transition count 101
Applied a total of 58 rules in 19 ms. Remains 70 /98 variables (removed 28) and now considering 101/121 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 70 cols
[2024-06-01 13:57:04] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:57:04] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:57:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 13:57:04] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 13:57:04] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:57:04] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:57:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
TRAPS : Iteration 1
[2024-06-01 13:57:04] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:57:04] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 192 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[12]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m64-UpperBounds-07 in 42020 ms.
[2024-06-01 13:57:04] [INFO ] Flatten gal took : 87 ms
[2024-06-01 13:57:04] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 9 ms.
[2024-06-01 13:57:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 99 places, 124 transitions and 491 arcs took 10 ms.
Total runtime 172467 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-UpperBounds-02
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m64-UpperBounds-07

BK_STOP 1717250225353

--------------------
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 SieveSingleMsgMbox-PT-d2m64-UpperBounds-02
ub formula formula --maxsum=/tmp/857/ub_0_
ub formula name SieveSingleMsgMbox-PT-d2m64-UpperBounds-07
ub formula formula --maxsum=/tmp/857/ub_1_
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="SieveSingleMsgMbox-PT-d2m64"
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 SieveSingleMsgMbox-PT-d2m64, 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 r532-smll-171683810800133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m64.tgz
mv SieveSingleMsgMbox-PT-d2m64 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;