About the Execution of 2021-gold for SieveSingleMsgMbox-PT-d1m64
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12586.552 | 2318556.00 | 2359575.00 | 14114.20 | 0 0 0 1 1 0 1 0 1 1 0 0 0 0 0 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r323-tall-165472293000346.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is SieveSingleMsgMbox-PT-d1m64, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472293000346
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 6.6K Jun 7 17:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 7 17:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Jun 7 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 7 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.8K Jun 7 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 7 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 7 17:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 7 17:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 450K Jun 6 12:11 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-d1m64-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m64-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1654794624547
Running Version 0
[2022-06-09 17:10:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 17:10:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 17:10:26] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2022-06-09 17:10:26] [INFO ] Transformed 1295 places.
[2022-06-09 17:10:26] [INFO ] Transformed 749 transitions.
[2022-06-09 17:10:26] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 148 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2022-06-09 17:10:26] [INFO ] Computed 6 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 2224 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 6) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 1003 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 986 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 965 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 982 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 945 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
// Phase 1: matrix 749 rows 259 cols
[2022-06-09 17:10:26] [INFO ] Computed 6 place invariants in 16 ms
[2022-06-09 17:10:27] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 17:10:27] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:10:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:27] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-06-09 17:10:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:10:27] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:10:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:27] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2022-06-09 17:10:27] [INFO ] State equation strengthened by 587 read => feed constraints.
[2022-06-09 17:10:28] [INFO ] [Nat]Added 587 Read/Feed constraints in 409 ms returned sat
[2022-06-09 17:10:28] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 2 ms to minimize.
[2022-06-09 17:10:28] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2022-06-09 17:10:28] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2022-06-09 17:10:29] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2022-06-09 17:10:29] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 0 ms to minimize.
[2022-06-09 17:10:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 844 ms
[2022-06-09 17:10:29] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 115 ms.
[2022-06-09 17:10:30] [INFO ] Added : 64 causal constraints over 13 iterations in 794 ms. Result :sat
Minimization took 549 ms.
[2022-06-09 17:10:30] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:10:30] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:10:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:30] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2022-06-09 17:10:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:10:30] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:10:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:30] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2022-06-09 17:10:31] [INFO ] [Nat]Added 587 Read/Feed constraints in 582 ms returned sat
[2022-06-09 17:10:31] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2022-06-09 17:10:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-06-09 17:10:31] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 64 ms.
[2022-06-09 17:10:32] [INFO ] Added : 66 causal constraints over 14 iterations in 677 ms. Result :sat
Minimization took 517 ms.
[2022-06-09 17:10:32] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:10:32] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-06-09 17:10:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:33] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2022-06-09 17:10:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:10:33] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:10:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:33] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-06-09 17:10:33] [INFO ] [Nat]Added 587 Read/Feed constraints in 643 ms returned sat
[2022-06-09 17:10:34] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2022-06-09 17:10:34] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2022-06-09 17:10:34] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2022-06-09 17:10:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 393 ms
[2022-06-09 17:10:34] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 51 ms.
[2022-06-09 17:10:34] [INFO ] Added : 66 causal constraints over 14 iterations in 632 ms. Result :sat
Minimization took 534 ms.
[2022-06-09 17:10:35] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:10:35] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:35] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-06-09 17:10:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:10:35] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:10:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:35] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2022-06-09 17:10:36] [INFO ] [Nat]Added 587 Read/Feed constraints in 553 ms returned sat
[2022-06-09 17:10:36] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2022-06-09 17:10:36] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 0 ms to minimize.
[2022-06-09 17:10:36] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 0 ms to minimize.
[2022-06-09 17:10:36] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 0 ms to minimize.
[2022-06-09 17:10:37] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 0 ms to minimize.
[2022-06-09 17:10:37] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 1 ms to minimize.
[2022-06-09 17:10:37] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 0 ms to minimize.
[2022-06-09 17:10:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 916 ms
[2022-06-09 17:10:37] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 56 ms.
[2022-06-09 17:10:38] [INFO ] Added : 66 causal constraints over 14 iterations in 630 ms. Result :sat
Minimization took 468 ms.
[2022-06-09 17:10:38] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:10:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:10:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:38] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2022-06-09 17:10:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:10:38] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:10:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:38] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2022-06-09 17:10:39] [INFO ] [Nat]Added 587 Read/Feed constraints in 436 ms returned sat
[2022-06-09 17:10:39] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 0 ms to minimize.
[2022-06-09 17:10:39] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2022-06-09 17:10:39] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 0 ms to minimize.
[2022-06-09 17:10:39] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 0 ms to minimize.
[2022-06-09 17:10:39] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2022-06-09 17:10:40] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 1 ms to minimize.
[2022-06-09 17:10:40] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 1 ms to minimize.
[2022-06-09 17:10:40] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 1 ms to minimize.
[2022-06-09 17:10:40] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 0 ms to minimize.
[2022-06-09 17:10:40] [INFO ] Deduced a trap composed of 116 places in 82 ms of which 1 ms to minimize.
[2022-06-09 17:10:40] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 0 ms to minimize.
[2022-06-09 17:10:40] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 0 ms to minimize.
[2022-06-09 17:10:41] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 0 ms to minimize.
[2022-06-09 17:10:41] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 0 ms to minimize.
[2022-06-09 17:10:41] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 1 ms to minimize.
[2022-06-09 17:10:41] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2022-06-09 17:10:41] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 0 ms to minimize.
[2022-06-09 17:10:41] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 1 ms to minimize.
[2022-06-09 17:10:41] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 7 ms to minimize.
[2022-06-09 17:10:41] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 0 ms to minimize.
[2022-06-09 17:10:41] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2656 ms
[2022-06-09 17:10:42] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 54 ms.
[2022-06-09 17:10:42] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 0 ms to minimize.
[2022-06-09 17:10:42] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 0 ms to minimize.
[2022-06-09 17:10:42] [INFO ] Deduced a trap composed of 95 places in 85 ms of which 0 ms to minimize.
[2022-06-09 17:10:43] [INFO ] Deduced a trap composed of 114 places in 79 ms of which 0 ms to minimize.
[2022-06-09 17:10:43] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 0 ms to minimize.
[2022-06-09 17:10:43] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 1 ms to minimize.
[2022-06-09 17:10:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 785 ms
[2022-06-09 17:10:43] [INFO ] Added : 65 causal constraints over 13 iterations in 1500 ms. Result :sat
Minimization took 260 ms.
Current structural bounds on expressions (after SMT) : [1, 29, 29, 10, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 43900 steps, including 7798 resets, run finished after 199 ms. (steps per millisecond=220 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 90200 steps, including 17167 resets, run finished after 390 ms. (steps per millisecond=231 ) properties (out of 5) seen :1 could not realise parikh vector
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 97200 steps, including 17842 resets, run finished after 423 ms. (steps per millisecond=229 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 65900 steps, including 12468 resets, run finished after 274 ms. (steps per millisecond=240 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.9 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 303 place count 181 transition count 243
Iterating global reduction 1 with 60 rules applied. Total rules applied 363 place count 181 transition count 243
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 369 place count 181 transition count 237
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 410 place count 140 transition count 196
Iterating global reduction 2 with 41 rules applied. Total rules applied 451 place count 140 transition count 196
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 464 place count 140 transition count 183
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 487 place count 117 transition count 158
Iterating global reduction 3 with 23 rules applied. Total rules applied 510 place count 117 transition count 158
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 528 place count 117 transition count 140
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 533 place count 112 transition count 132
Iterating global reduction 4 with 5 rules applied. Total rules applied 538 place count 112 transition count 132
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 543 place count 107 transition count 127
Iterating global reduction 4 with 5 rules applied. Total rules applied 548 place count 107 transition count 127
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 550 place count 105 transition count 125
Iterating global reduction 4 with 2 rules applied. Total rules applied 552 place count 105 transition count 125
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 554 place count 103 transition count 123
Iterating global reduction 4 with 2 rules applied. Total rules applied 556 place count 103 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 558 place count 101 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 560 place count 101 transition count 121
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 561 place count 100 transition count 119
Iterating global reduction 4 with 1 rules applied. Total rules applied 562 place count 100 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 563 place count 99 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 564 place count 99 transition count 118
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 565 place count 98 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 566 place count 98 transition count 117
Applied a total of 566 rules in 105 ms. Remains 98 /259 variables (removed 161) and now considering 117/749 (removed 632) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/259 places, 117/749 transitions.
// Phase 1: matrix 117 rows 98 cols
[2022-06-09 17:10:45] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224242 resets, run finished after 928 ms. (steps per millisecond=1077 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103521 resets, run finished after 470 ms. (steps per millisecond=2127 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103214 resets, run finished after 420 ms. (steps per millisecond=2380 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103640 resets, run finished after 425 ms. (steps per millisecond=2352 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103685 resets, run finished after 407 ms. (steps per millisecond=2457 ) properties (out of 4) seen :0
// Phase 1: matrix 117 rows 98 cols
[2022-06-09 17:10:47] [INFO ] Computed 4 place invariants in 7 ms
[2022-06-09 17:10:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:47] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:10:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:47] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:10:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:47] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:10:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:47] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-06-09 17:10:47] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-09 17:10:47] [INFO ] [Nat]Added 50 Read/Feed constraints in 13 ms returned sat
[2022-06-09 17:10:47] [INFO ] Computed and/alt/rep : 27/70/27 causal constraints (skipped 89 transitions) in 8 ms.
[2022-06-09 17:10:47] [INFO ] Added : 25 causal constraints over 5 iterations in 66 ms. Result :sat
Minimization took 27 ms.
[2022-06-09 17:10:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:48] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:10:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:48] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 17:10:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:10:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:48] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-06-09 17:10:48] [INFO ] [Nat]Added 50 Read/Feed constraints in 8 ms returned sat
[2022-06-09 17:10:48] [INFO ] Computed and/alt/rep : 27/70/27 causal constraints (skipped 89 transitions) in 6 ms.
[2022-06-09 17:10:48] [INFO ] Added : 25 causal constraints over 5 iterations in 58 ms. Result :sat
Minimization took 26 ms.
[2022-06-09 17:10:48] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-09 17:10:48] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:10:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:48] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-09 17:10:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:10:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:10:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:48] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 17:10:48] [INFO ] [Nat]Added 50 Read/Feed constraints in 7 ms returned sat
[2022-06-09 17:10:48] [INFO ] Computed and/alt/rep : 27/70/27 causal constraints (skipped 89 transitions) in 7 ms.
[2022-06-09 17:10:48] [INFO ] Added : 23 causal constraints over 5 iterations in 63 ms. Result :sat
Minimization took 26 ms.
[2022-06-09 17:10:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:48] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:10:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:48] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 17:10:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:10:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:48] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-09 17:10:48] [INFO ] [Nat]Added 50 Read/Feed constraints in 8 ms returned sat
[2022-06-09 17:10:48] [INFO ] Deduced a trap composed of 46 places in 20 ms of which 1 ms to minimize.
[2022-06-09 17:10:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-06-09 17:10:48] [INFO ] Computed and/alt/rep : 27/70/27 causal constraints (skipped 89 transitions) in 7 ms.
[2022-06-09 17:10:48] [INFO ] Deduced a trap composed of 51 places in 24 ms of which 0 ms to minimize.
[2022-06-09 17:10:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-06-09 17:10:48] [INFO ] Added : 25 causal constraints over 5 iterations in 106 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [29, 29, 10, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 14300 steps, including 2244 resets, run finished after 28 ms. (steps per millisecond=510 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 40200 steps, including 7116 resets, run finished after 62 ms. (steps per millisecond=648 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 14800 steps, including 2281 resets, run finished after 24 ms. (steps per millisecond=616 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 14800 steps, including 2242 resets, run finished after 24 ms. (steps per millisecond=616 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 117/117 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 117/117 transitions.
Starting structural reductions, iteration 0 : 98/98 places, 117/117 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 98 cols
[2022-06-09 17:10:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:10:48] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 117 rows 98 cols
[2022-06-09 17:10:48] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:10:49] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-09 17:10:49] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2022-06-09 17:10:49] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 117 rows 98 cols
[2022-06-09 17:10:49] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:10:49] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 117/117 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-06
// Phase 1: matrix 117 rows 98 cols
[2022-06-09 17:10:49] [INFO ] Computed 4 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1020 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 117 rows 98 cols
[2022-06-09 17:10:49] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:10:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:10:49] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:10:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:49] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:10:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:49] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:10:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:49] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-09 17:10:49] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-09 17:10:49] [INFO ] [Nat]Added 50 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:10:49] [INFO ] Computed and/alt/rep : 27/70/27 causal constraints (skipped 89 transitions) in 7 ms.
[2022-06-09 17:10:49] [INFO ] Added : 25 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 14800 steps, including 2263 resets, run finished after 23 ms. (steps per millisecond=643 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 117/117 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 95 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 95 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 95 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 92 transition count 102
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 92 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 92 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 90 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 90 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 90 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 21 place count 88 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 88 transition count 96
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 86 transition count 93
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 86 transition count 93
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 29 place count 84 transition count 91
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 84 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 84 transition count 90
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 34 place count 82 transition count 88
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 82 transition count 88
Applied a total of 36 rules in 22 ms. Remains 82 /98 variables (removed 16) and now considering 88/117 (removed 29) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/98 places, 88/117 transitions.
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:10:49] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 224294 resets, run finished after 672 ms. (steps per millisecond=1488 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103848 resets, run finished after 343 ms. (steps per millisecond=2915 ) properties (out of 1) seen :0
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:10:50] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:10:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:10:50] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:10:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:50] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-06-09 17:10:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:10:50] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:10:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:50] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-09 17:10:50] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-09 17:10:50] [INFO ] [Nat]Added 34 Read/Feed constraints in 21 ms returned sat
[2022-06-09 17:10:50] [INFO ] Computed and/alt/rep : 22/52/22 causal constraints (skipped 65 transitions) in 6 ms.
[2022-06-09 17:10:50] [INFO ] Added : 20 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 4300 steps, including 424 resets, run finished after 4 ms. (steps per millisecond=1075 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 11 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 88/88 transitions.
Starting structural reductions, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:10:50] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:10:50] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:10:50] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:10:50] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-09 17:10:50] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2022-06-09 17:10:51] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:10:51] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:10:51] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 88/88 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-06 in 1849 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-08
// Phase 1: matrix 117 rows 98 cols
[2022-06-09 17:10:51] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2216 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1013 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 117 rows 98 cols
[2022-06-09 17:10:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:10:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:51] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:10:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:51] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-06-09 17:10:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:10:51] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:10:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:51] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 17:10:51] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-09 17:10:51] [INFO ] [Nat]Added 50 Read/Feed constraints in 9 ms returned sat
[2022-06-09 17:10:51] [INFO ] Computed and/alt/rep : 27/70/27 causal constraints (skipped 89 transitions) in 6 ms.
[2022-06-09 17:10:51] [INFO ] Added : 25 causal constraints over 5 iterations in 68 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 14800 steps, including 2282 resets, run finished after 17 ms. (steps per millisecond=870 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 117/117 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 95 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 95 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 95 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 92 transition count 102
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 92 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 92 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 90 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 90 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 90 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 21 place count 88 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 88 transition count 96
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 86 transition count 93
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 86 transition count 93
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 29 place count 84 transition count 91
Iterating global reduction 3 with 2 rules applied. Total rules applied 31 place count 84 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 84 transition count 90
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 34 place count 82 transition count 88
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 82 transition count 88
Applied a total of 36 rules in 25 ms. Remains 82 /98 variables (removed 16) and now considering 88/117 (removed 29) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/98 places, 88/117 transitions.
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:10:51] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 224027 resets, run finished after 625 ms. (steps per millisecond=1600 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102871 resets, run finished after 325 ms. (steps per millisecond=3076 ) properties (out of 1) seen :0
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:10:52] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:10:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:52] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:52] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-09 17:10:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:52] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:10:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:52] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-06-09 17:10:52] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-09 17:10:52] [INFO ] [Nat]Added 34 Read/Feed constraints in 53 ms returned sat
[2022-06-09 17:10:52] [INFO ] Computed and/alt/rep : 22/52/22 causal constraints (skipped 65 transitions) in 8 ms.
[2022-06-09 17:10:52] [INFO ] Added : 20 causal constraints over 4 iterations in 106 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 4300 steps, including 435 resets, run finished after 8 ms. (steps per millisecond=537 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 88/88 transitions.
Starting structural reductions, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:10:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:10:52] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:10:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:10:52] [INFO ] State equation strengthened by 34 read => feed constraints.
[2022-06-09 17:10:52] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2022-06-09 17:10:52] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:10:52] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 17:10:52] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 82/82 places, 88/88 transitions.
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:10:52] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224722 resets, run finished after 624 ms. (steps per millisecond=1602 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103351 resets, run finished after 324 ms. (steps per millisecond=3086 ) properties (out of 1) seen :0
// Phase 1: matrix 88 rows 82 cols
[2022-06-09 17:10:53] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:10:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:53] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:53] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-08 in 2755 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-09
// Phase 1: matrix 117 rows 98 cols
[2022-06-09 17:10:53] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2244 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1030 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 117 rows 98 cols
[2022-06-09 17:10:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:10:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:53] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:53] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-06-09 17:10:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:53] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:53] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 17:10:53] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-09 17:10:53] [INFO ] [Nat]Added 50 Read/Feed constraints in 6 ms returned sat
[2022-06-09 17:10:53] [INFO ] Computed and/alt/rep : 27/70/27 causal constraints (skipped 89 transitions) in 6 ms.
[2022-06-09 17:10:53] [INFO ] Added : 23 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 40200 steps, including 7161 resets, run finished after 41 ms. (steps per millisecond=980 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 117/117 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 95 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 95 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 95 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 92 transition count 109
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 92 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 92 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 90 transition count 106
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 90 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 88 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 88 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 86 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 86 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 86 transition count 99
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 31 place count 84 transition count 97
Iterating global reduction 3 with 2 rules applied. Total rules applied 33 place count 84 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 83 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 83 transition count 96
Applied a total of 35 rules in 18 ms. Remains 83 /98 variables (removed 15) and now considering 96/117 (removed 21) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/98 places, 96/117 transitions.
// Phase 1: matrix 96 rows 83 cols
[2022-06-09 17:10:54] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 224573 resets, run finished after 674 ms. (steps per millisecond=1483 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103382 resets, run finished after 345 ms. (steps per millisecond=2898 ) properties (out of 1) seen :0
// Phase 1: matrix 96 rows 83 cols
[2022-06-09 17:10:55] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:10:55] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:10:55] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:10:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:55] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-09 17:10:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:55] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:10:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:55] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 17:10:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-09 17:10:55] [INFO ] [Nat]Added 42 Read/Feed constraints in 5 ms returned sat
[2022-06-09 17:10:55] [INFO ] Computed and/alt/rep : 22/51/22 causal constraints (skipped 73 transitions) in 5 ms.
[2022-06-09 17:10:55] [INFO ] Added : 21 causal constraints over 5 iterations in 50 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 39500 steps, including 7042 resets, run finished after 37 ms. (steps per millisecond=1067 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 96/96 transitions.
Starting structural reductions, iteration 0 : 83/83 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 83 cols
[2022-06-09 17:10:55] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:10:55] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 96 rows 83 cols
[2022-06-09 17:10:55] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:10:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-09 17:10:55] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2022-06-09 17:10:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 96 rows 83 cols
[2022-06-09 17:10:55] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:10:55] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 96/96 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-09 in 1750 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-11
// Phase 1: matrix 117 rows 98 cols
[2022-06-09 17:10:55] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2194 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1027 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 117 rows 98 cols
[2022-06-09 17:10:55] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:10:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:55] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:10:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:55] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-09 17:10:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:55] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:10:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:55] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 17:10:55] [INFO ] State equation strengthened by 50 read => feed constraints.
[2022-06-09 17:10:55] [INFO ] [Nat]Added 50 Read/Feed constraints in 8 ms returned sat
[2022-06-09 17:10:55] [INFO ] Deduced a trap composed of 46 places in 21 ms of which 0 ms to minimize.
[2022-06-09 17:10:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-06-09 17:10:55] [INFO ] Computed and/alt/rep : 27/70/27 causal constraints (skipped 89 transitions) in 8 ms.
[2022-06-09 17:10:55] [INFO ] Deduced a trap composed of 51 places in 17 ms of which 0 ms to minimize.
[2022-06-09 17:10:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-06-09 17:10:55] [INFO ] Added : 25 causal constraints over 5 iterations in 100 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 14300 steps, including 2243 resets, run finished after 20 ms. (steps per millisecond=715 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 98/98 places, 117/117 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 95 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 95 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 95 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 92 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 92 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 92 transition count 99
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 90 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 90 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 90 transition count 96
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 88 transition count 94
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 88 transition count 94
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 27 place count 86 transition count 92
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 86 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 30 place count 86 transition count 91
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 32 place count 84 transition count 89
Iterating global reduction 4 with 2 rules applied. Total rules applied 34 place count 84 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 35 place count 84 transition count 88
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 36 place count 83 transition count 87
Iterating global reduction 5 with 1 rules applied. Total rules applied 37 place count 83 transition count 87
Applied a total of 37 rules in 13 ms. Remains 83 /98 variables (removed 15) and now considering 87/117 (removed 30) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/98 places, 87/117 transitions.
// Phase 1: matrix 87 rows 83 cols
[2022-06-09 17:10:55] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 224063 resets, run finished after 622 ms. (steps per millisecond=1607 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103172 resets, run finished after 323 ms. (steps per millisecond=3095 ) properties (out of 1) seen :0
// Phase 1: matrix 87 rows 83 cols
[2022-06-09 17:10:56] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 17:10:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 17:10:56] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 17:10:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:56] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-06-09 17:10:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:10:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 17:10:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 17:10:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:10:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-09 17:10:56] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 17:10:56] [INFO ] [Nat]Added 33 Read/Feed constraints in 6 ms returned sat
[2022-06-09 17:10:56] [INFO ] Deduced a trap composed of 39 places in 26 ms of which 0 ms to minimize.
[2022-06-09 17:10:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-06-09 17:10:56] [INFO ] Computed and/alt/rep : 22/50/22 causal constraints (skipped 64 transitions) in 4 ms.
[2022-06-09 17:10:56] [INFO ] Added : 20 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 14500 steps, including 2234 resets, run finished after 16 ms. (steps per millisecond=906 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 87/87 transitions.
Starting structural reductions, iteration 0 : 83/83 places, 87/87 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 83 cols
[2022-06-09 17:10:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:10:57] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 87 rows 83 cols
[2022-06-09 17:10:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:10:57] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-09 17:10:57] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2022-06-09 17:10:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 87 rows 83 cols
[2022-06-09 17:10:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:10:57] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 87/87 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m64-UpperBounds-11 in 1674 ms.
[2022-06-09 17:10:57] [INFO ] Flatten gal took : 49 ms
[2022-06-09 17:10:57] [INFO ] Applying decomposition
[2022-06-09 17:10:57] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6184988226083316260.txt, -o, /tmp/graph6184988226083316260.bin, -w, /tmp/graph6184988226083316260.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6184988226083316260.bin, -l, -1, -v, -w, /tmp/graph6184988226083316260.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 17:10:57] [INFO ] Decomposing Gal with order
[2022-06-09 17:10:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 17:10:57] [INFO ] Removed a total of 115 redundant transitions.
[2022-06-09 17:10:57] [INFO ] Flatten gal took : 92 ms
[2022-06-09 17:10:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 12 ms.
[2022-06-09 17:10:57] [INFO ] Time to serialize gal into /tmp/UpperBounds16950829961670131381.gal : 18 ms
[2022-06-09 17:10:57] [INFO ] Time to serialize properties into /tmp/UpperBounds17368330525715921958.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds16950829961670131381.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17368330525715921958.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds16950829961670131381.gal -t CGAL -reachable-file /tmp/UpperBounds17368330525715921958.prop --nowitness
Loading property file /tmp/UpperBounds17368330525715921958.prop.
Detected timeout of ITS tools.
[2022-06-09 17:31:08] [INFO ] Flatten gal took : 8 ms
[2022-06-09 17:31:08] [INFO ] Time to serialize gal into /tmp/UpperBounds4781141801534104162.gal : 2 ms
[2022-06-09 17:31:08] [INFO ] Time to serialize properties into /tmp/UpperBounds2479922739091449383.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds4781141801534104162.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds2479922739091449383.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds4781141801534104162.gal -t CGAL -reachable-file /tmp/UpperBounds2479922739091449383.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds2479922739091449383.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,7.0864e+18,1073.24,11862676,2,54967,5,5.71517e+07,6,0,511,4.35976e+07,0
Total reachable state count : 7086403924490039195
Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m64-UpperBounds-06 :0 <= p60 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m64-UpperBounds-06,0,1073.25,11862676,1,0,7,5.71517e+07,9,1,670,4.35976e+07,4
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m64-UpperBounds-09 :0 <= l1199 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m64-UpperBounds-09,0,1073.25,11862676,1,0,8,5.71517e+07,10,1,687,4.35976e+07,5
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property SieveSingleMsgMbox-PT-d1m64-UpperBounds-11 :0 <= p39 <= 0
FORMULA SieveSingleMsgMbox-PT-d1m64-UpperBounds-11 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m64-UpperBounds-11,0,1073.54,11862676,1,0,8,5.71517e+07,11,1,797,4.35976e+07,6
BK_STOP 1654796943103
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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-d1m64"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is SieveSingleMsgMbox-PT-d1m64, 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 r323-tall-165472293000346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m64.tgz
mv SieveSingleMsgMbox-PT-d1m64 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;