About the Execution of 2022-gold for SieveSingleMsgMbox-PT-d2m18
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2697.792 | 509702.00 | 535636.00 | 155.40 | 1 0 0 0 0 0 0 0 0 0 0 1 1 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 '/mnt/tpsp/fkordon/mcc2023-input.r447-tajo-167905989500059.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is SieveSingleMsgMbox-PT-d2m18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r447-tajo-167905989500059
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 10:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 10:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 10:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:23 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-d2m18-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679573616607
Running Version 202205111006
[2023-03-23 12:13:37] [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]
[2023-03-23 12:13:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 12:13:38] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2023-03-23 12:13:38] [INFO ] Transformed 2398 places.
[2023-03-23 12:13:38] [INFO ] Transformed 1954 transitions.
[2023-03-23 12:13:38] [INFO ] Parsed PT model containing 2398 places and 1954 transitions in 298 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1984 places in 17 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1954 rows 414 cols
[2023-03-23 12:13:38] [INFO ] Computed 6 place invariants in 63 ms
Incomplete random walk after 10000 steps, including 2171 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 955 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 947 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
// Phase 1: matrix 1954 rows 414 cols
[2023-03-23 12:13:38] [INFO ] Computed 6 place invariants in 29 ms
[2023-03-23 12:13:38] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-23 12:13:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-23 12:13:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:39] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2023-03-23 12:13:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 12:13:39] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-23 12:13:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:40] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2023-03-23 12:13:40] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2023-03-23 12:13:40] [INFO ] [Nat]Added 1674 Read/Feed constraints in 562 ms returned sat
[2023-03-23 12:13:41] [INFO ] Deduced a trap composed of 115 places in 198 ms of which 3 ms to minimize.
[2023-03-23 12:13:41] [INFO ] Deduced a trap composed of 135 places in 240 ms of which 2 ms to minimize.
[2023-03-23 12:13:41] [INFO ] Deduced a trap composed of 105 places in 223 ms of which 1 ms to minimize.
[2023-03-23 12:13:41] [INFO ] Deduced a trap composed of 125 places in 95 ms of which 1 ms to minimize.
[2023-03-23 12:13:41] [INFO ] Deduced a trap composed of 141 places in 104 ms of which 1 ms to minimize.
[2023-03-23 12:13:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1367 ms
[2023-03-23 12:13:42] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 323 ms.
[2023-03-23 12:13:43] [INFO ] Added : 24 causal constraints over 5 iterations in 1089 ms. Result :sat
Minimization took 546 ms.
[2023-03-23 12:13:43] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 12:13:44] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-23 12:13:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:44] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2023-03-23 12:13:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 12:13:44] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-23 12:13:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:44] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2023-03-23 12:13:45] [INFO ] [Nat]Added 1674 Read/Feed constraints in 525 ms returned sat
[2023-03-23 12:13:45] [INFO ] Deduced a trap composed of 90 places in 259 ms of which 1 ms to minimize.
[2023-03-23 12:13:45] [INFO ] Deduced a trap composed of 98 places in 223 ms of which 1 ms to minimize.
[2023-03-23 12:13:46] [INFO ] Deduced a trap composed of 197 places in 196 ms of which 1 ms to minimize.
[2023-03-23 12:13:46] [INFO ] Deduced a trap composed of 244 places in 215 ms of which 0 ms to minimize.
[2023-03-23 12:13:46] [INFO ] Deduced a trap composed of 231 places in 207 ms of which 1 ms to minimize.
[2023-03-23 12:13:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1685 ms
[2023-03-23 12:13:47] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 310 ms.
[2023-03-23 12:13:48] [INFO ] Added : 12 causal constraints over 3 iterations in 983 ms. Result :sat
Minimization took 690 ms.
[2023-03-23 12:13:48] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 12:13:48] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-23 12:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:49] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2023-03-23 12:13:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-23 12:13:49] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-23 12:13:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:50] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2023-03-23 12:13:50] [INFO ] [Nat]Added 1674 Read/Feed constraints in 595 ms returned sat
[2023-03-23 12:13:51] [INFO ] Deduced a trap composed of 113 places in 328 ms of which 1 ms to minimize.
[2023-03-23 12:13:51] [INFO ] Deduced a trap composed of 112 places in 160 ms of which 1 ms to minimize.
[2023-03-23 12:13:51] [INFO ] Deduced a trap composed of 103 places in 277 ms of which 1 ms to minimize.
[2023-03-23 12:13:51] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 1 ms to minimize.
[2023-03-23 12:13:52] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 0 ms to minimize.
[2023-03-23 12:13:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1671 ms
[2023-03-23 12:13:52] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 287 ms.
[2023-03-23 12:13:53] [INFO ] Added : 18 causal constraints over 4 iterations in 1177 ms. Result :sat
Minimization took 575 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 12] Max seen :[0, 0, 0]
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 389 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.11 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 792 transitions
Reduce isomorphic transitions removed 794 transitions.
Iterating post reduction 0 with 794 rules applied. Total rules applied 795 place count 389 transition count 1160
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 913 place count 271 transition count 374
Iterating global reduction 1 with 118 rules applied. Total rules applied 1031 place count 271 transition count 374
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1040 place count 271 transition count 365
Discarding 93 places :
Symmetric choice reduction at 2 with 93 rule applications. Total rules 1133 place count 178 transition count 272
Iterating global reduction 2 with 93 rules applied. Total rules applied 1226 place count 178 transition count 272
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1262 place count 178 transition count 236
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 1301 place count 139 transition count 182
Iterating global reduction 3 with 39 rules applied. Total rules applied 1340 place count 139 transition count 182
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 1364 place count 139 transition count 158
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1373 place count 130 transition count 145
Iterating global reduction 4 with 9 rules applied. Total rules applied 1382 place count 130 transition count 145
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1391 place count 121 transition count 136
Iterating global reduction 4 with 9 rules applied. Total rules applied 1400 place count 121 transition count 136
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1405 place count 116 transition count 130
Iterating global reduction 4 with 5 rules applied. Total rules applied 1410 place count 116 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1412 place count 116 transition count 128
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1417 place count 111 transition count 123
Iterating global reduction 5 with 5 rules applied. Total rules applied 1422 place count 111 transition count 123
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1424 place count 109 transition count 121
Iterating global reduction 5 with 2 rules applied. Total rules applied 1426 place count 109 transition count 121
Applied a total of 1426 rules in 159 ms. Remains 109 /414 variables (removed 305) and now considering 121/1954 (removed 1833) transitions.
Finished structural reductions, in 1 iterations. Remains : 109/414 places, 121/1954 transitions.
// Phase 1: matrix 121 rows 109 cols
[2023-03-23 12:13:54] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224783 resets, run finished after 1234 ms. (steps per millisecond=810 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103245 resets, run finished after 590 ms. (steps per millisecond=1694 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 102963 resets, run finished after 489 ms. (steps per millisecond=2044 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103386 resets, run finished after 432 ms. (steps per millisecond=2314 ) properties (out of 3) seen :0
// Phase 1: matrix 121 rows 109 cols
[2023-03-23 12:13:57] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-23 12:13:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:57] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:57] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-23 12:13:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:57] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:57] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 12:13:57] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-23 12:13:57] [INFO ] [Nat]Added 47 Read/Feed constraints in 9 ms returned sat
[2023-03-23 12:13:57] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 9 ms.
[2023-03-23 12:13:57] [INFO ] Added : 18 causal constraints over 4 iterations in 67 ms. Result :sat
Minimization took 37 ms.
[2023-03-23 12:13:57] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-23 12:13:57] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-23 12:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:57] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-23 12:13:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:57] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:57] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-23 12:13:57] [INFO ] [Nat]Added 47 Read/Feed constraints in 9 ms returned sat
[2023-03-23 12:13:57] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 10 ms.
[2023-03-23 12:13:57] [INFO ] Added : 14 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 21 ms.
[2023-03-23 12:13:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:57] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:57] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-23 12:13:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 12:13:58] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:58] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-23 12:13:58] [INFO ] [Nat]Added 47 Read/Feed constraints in 9 ms returned sat
[2023-03-23 12:13:58] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2023-03-23 12:13:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-23 12:13:58] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 13 ms.
[2023-03-23 12:13:58] [INFO ] Added : 17 causal constraints over 4 iterations in 68 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 12] Max seen :[0, 0, 0]
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 109/109 places, 121/121 transitions.
Applied a total of 0 rules in 11 ms. Remains 109 /109 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 109/109 places, 121/121 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 109/109 places, 121/121 transitions.
Applied a total of 0 rules in 10 ms. Remains 109 /109 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 109 cols
[2023-03-23 12:13:58] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-23 12:13:58] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 121 rows 109 cols
[2023-03-23 12:13:58] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:58] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-23 12:13:58] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-23 12:13:58] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 121 rows 109 cols
[2023-03-23 12:13:58] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-23 12:13:58] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/109 places, 121/121 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-00
// Phase 1: matrix 121 rows 109 cols
[2023-03-23 12:13:58] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2217 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1060 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 121 rows 109 cols
[2023-03-23 12:13:58] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:13:58] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:58] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:58] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-23 12:13:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 12:13:58] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-23 12:13:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:58] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-23 12:13:58] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-23 12:13:58] [INFO ] [Nat]Added 47 Read/Feed constraints in 24 ms returned sat
[2023-03-23 12:13:58] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 10 ms.
[2023-03-23 12:13:58] [INFO ] Added : 18 causal constraints over 4 iterations in 64 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[0]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 109/109 places, 121/121 transitions.
Graph (complete) has 308 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 107 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 107 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 107 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 106 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 106 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 105 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 105 transition count 116
Applied a total of 9 rules in 24 ms. Remains 105 /109 variables (removed 4) and now considering 116/121 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 105/109 places, 116/121 transitions.
// Phase 1: matrix 116 rows 105 cols
[2023-03-23 12:13:59] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224404 resets, run finished after 1102 ms. (steps per millisecond=907 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103899 resets, run finished after 515 ms. (steps per millisecond=1941 ) properties (out of 1) seen :0
// Phase 1: matrix 116 rows 105 cols
[2023-03-23 12:14:00] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-23 12:14:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:14:00] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:14:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:14:00] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-23 12:14:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:14:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 12:14:00] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:14:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:14:00] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-23 12:14:00] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-23 12:14:00] [INFO ] [Nat]Added 43 Read/Feed constraints in 8 ms returned sat
[2023-03-23 12:14:00] [INFO ] Computed and/alt/rep : 28/73/28 causal constraints (skipped 87 transitions) in 8 ms.
[2023-03-23 12:14:00] [INFO ] Added : 18 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [18] Max seen :[0]
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 105/105 places, 116/116 transitions.
Applied a total of 0 rules in 12 ms. Remains 105 /105 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 116/116 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 105/105 places, 116/116 transitions.
Applied a total of 0 rules in 11 ms. Remains 105 /105 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 105 cols
[2023-03-23 12:14:01] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-23 12:14:01] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 116 rows 105 cols
[2023-03-23 12:14:01] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:14:01] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-23 12:14:01] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-23 12:14:01] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 116 rows 105 cols
[2023-03-23 12:14:01] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:14:01] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 116/116 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-00 in 2653 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-11
// Phase 1: matrix 121 rows 109 cols
[2023-03-23 12:14:01] [INFO ] Computed 4 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 2245 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1046 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 121 rows 109 cols
[2023-03-23 12:14:01] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:14:01] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-23 12:14:01] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:14:01] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-23 12:14:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:14:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 12:14:01] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:14:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:14:01] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-23 12:14:01] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-23 12:14:01] [INFO ] [Nat]Added 47 Read/Feed constraints in 16 ms returned sat
[2023-03-23 12:14:01] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 11 ms.
[2023-03-23 12:14:01] [INFO ] Added : 14 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 109/109 places, 121/121 transitions.
Graph (complete) has 308 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 107 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 107 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 106 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 106 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 105 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 105 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 104 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 104 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 103 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 103 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 102 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 102 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 101 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 101 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 100 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 100 transition count 109
Applied a total of 18 rules in 27 ms. Remains 100 /109 variables (removed 9) and now considering 109/121 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/109 places, 109/121 transitions.
// Phase 1: matrix 109 rows 100 cols
[2023-03-23 12:14:01] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224533 resets, run finished after 902 ms. (steps per millisecond=1108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103100 resets, run finished after 388 ms. (steps per millisecond=2577 ) properties (out of 1) seen :0
// Phase 1: matrix 109 rows 100 cols
[2023-03-23 12:14:03] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-23 12:14:03] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-23 12:14:03] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-23 12:14:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:14:03] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-23 12:14:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:14:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:14:03] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:14:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:14:03] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-23 12:14:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-23 12:14:03] [INFO ] [Nat]Added 42 Read/Feed constraints in 7 ms returned sat
[2023-03-23 12:14:03] [INFO ] Computed and/alt/rep : 26/65/26 causal constraints (skipped 82 transitions) in 6 ms.
[2023-03-23 12:14:03] [INFO ] Added : 11 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 100/100 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 109/109 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 100/100 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 109/109 (removed 0) transitions.
// Phase 1: matrix 109 rows 100 cols
[2023-03-23 12:14:03] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-23 12:14:03] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 109 rows 100 cols
[2023-03-23 12:14:03] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:14:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-23 12:14:03] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-23 12:14:03] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 109 rows 100 cols
[2023-03-23 12:14:03] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:14:03] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 109/109 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-11 in 2221 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-12
// Phase 1: matrix 121 rows 109 cols
[2023-03-23 12:14:03] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2241 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1000 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 121 rows 109 cols
[2023-03-23 12:14:03] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:14:03] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:14:03] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:14:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:14:03] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-23 12:14:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:14:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:14:03] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:14:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:14:03] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-23 12:14:03] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-23 12:14:03] [INFO ] [Nat]Added 47 Read/Feed constraints in 9 ms returned sat
[2023-03-23 12:14:03] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2023-03-23 12:14:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-23 12:14:03] [INFO ] Computed and/alt/rep : 29/73/29 causal constraints (skipped 91 transitions) in 8 ms.
[2023-03-23 12:14:03] [INFO ] Added : 17 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 109/109 places, 121/121 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 118
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 107 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 105 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 105 transition count 115
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 103 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 103 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 102 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 102 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 101 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 101 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 100 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 100 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 99 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 99 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 98 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 98 transition count 106
Applied a total of 23 rules in 18 ms. Remains 98 /109 variables (removed 11) and now considering 106/121 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/109 places, 106/121 transitions.
// Phase 1: matrix 106 rows 98 cols
[2023-03-23 12:14:03] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 224436 resets, run finished after 775 ms. (steps per millisecond=1290 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103714 resets, run finished after 367 ms. (steps per millisecond=2724 ) properties (out of 1) seen :0
// Phase 1: matrix 106 rows 98 cols
[2023-03-23 12:14:05] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-23 12:14:05] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:14:05] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:14:05] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-23 12:14:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:14:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:14:05] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 12:14:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:14:05] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-23 12:14:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 12:14:05] [INFO ] [Nat]Added 40 Read/Feed constraints in 12 ms returned sat
[2023-03-23 12:14:05] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2023-03-23 12:14:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-23 12:14:05] [INFO ] Computed and/alt/rep : 25/65/25 causal constraints (skipped 80 transitions) in 6 ms.
[2023-03-23 12:14:05] [INFO ] Added : 18 causal constraints over 4 iterations in 43 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 98/98 places, 106/106 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 106/106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 98/98 places, 106/106 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 98 cols
[2023-03-23 12:14:05] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:14:05] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 106 rows 98 cols
[2023-03-23 12:14:05] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:14:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 12:14:05] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-23 12:14:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 106 rows 98 cols
[2023-03-23 12:14:05] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 12:14:05] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 106/106 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m18-UpperBounds-12 in 2091 ms.
[2023-03-23 12:14:05] [INFO ] Flatten gal took : 39 ms
[2023-03-23 12:14:05] [INFO ] Applying decomposition
[2023-03-23 12:14:05] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4744600944946260194.txt' '-o' '/tmp/graph4744600944946260194.bin' '-w' '/tmp/graph4744600944946260194.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4744600944946260194.bin' '-l' '-1' '-v' '-w' '/tmp/graph4744600944946260194.weights' '-q' '0' '-e' '0.001'
[2023-03-23 12:14:05] [INFO ] Decomposing Gal with order
[2023-03-23 12:14:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 12:14:05] [INFO ] Removed a total of 111 redundant transitions.
[2023-03-23 12:14:06] [INFO ] Flatten gal took : 46 ms
[2023-03-23 12:14:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 8 ms.
[2023-03-23 12:14:06] [INFO ] Time to serialize gal into /tmp/UpperBounds847022137870222816.gal : 5 ms
[2023-03-23 12:14:06] [INFO ] Time to serialize properties into /tmp/UpperBounds15990645072624982961.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds847022137870222816.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15990645072624982961.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds15990645072624982961.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\_mod\_flat,1.34954e+10,475.388,2257320,6664,1398,1.67321e+06,843452,348,1.72996e+07,115,6.76888e+06,0
Total reachable state count : 13495396472
Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m18-UpperBounds-00 :0 <= i4.u9.l247 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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-d2m18-UpperBounds-00,0,479.498,2257320,1,0,1.67321e+06,843452,476,1.72996e+07,136,6.76888e+06,2625
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m18-UpperBounds-11 :0 <= i5.u20.l514 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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-d2m18-UpperBounds-11,0,479.658,2257320,1,0,1.67321e+06,843452,505,1.72996e+07,141,6.76888e+06,2899
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d2m18-UpperBounds-12 :0 <= u24.l1814 <= 1
FORMULA SieveSingleMsgMbox-PT-d2m18-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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-d2m18-UpperBounds-12,0,479.678,2257320,1,0,1.67321e+06,843452,521,1.72996e+07,146,6.76888e+06,3043
Total runtime 508350 ms.
BK_STOP 1679574126309
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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-d2m18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is SieveSingleMsgMbox-PT-d2m18, 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 r447-tajo-167905989500059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m18.tgz
mv SieveSingleMsgMbox-PT-d2m18 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 ;