About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d1m18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10168.060 | 926385.00 | 950912.00 | 2209.40 | 1 1 0 0 0 1 0 1 0 0 0 1 0 0 0 1 | 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.r312-tall-165472282900909.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 itstools
Input is SieveSingleMsgMbox-PT-d1m18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282900909
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 7.0K Jun 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 7 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 16K 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.4K Jun 7 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Jun 7 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Jun 7 17:02 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-d1m18-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1654951292734
Running Version 202205111006
[2022-06-11 12:41:33] [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-11 12:41:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 12:41:34] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2022-06-11 12:41:34] [INFO ] Transformed 1295 places.
[2022-06-11 12:41:34] [INFO ] Transformed 749 transitions.
[2022-06-11 12:41:34] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 240 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-d1m18-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2022-06-11 12:41:34] [INFO ] Computed 6 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 2213 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 967 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 957 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 981 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 939 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 979 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
// Phase 1: matrix 749 rows 259 cols
[2022-06-11 12:41:34] [INFO ] Computed 6 place invariants in 12 ms
[2022-06-11 12:41:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-11 12:41:34] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 13 ms returned sat
[2022-06-11 12:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:34] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2022-06-11 12:41:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 12:41:34] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:41:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:35] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-06-11 12:41:35] [INFO ] State equation strengthened by 587 read => feed constraints.
[2022-06-11 12:41:35] [INFO ] [Nat]Added 587 Read/Feed constraints in 128 ms returned sat
[2022-06-11 12:41:35] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 3 ms to minimize.
[2022-06-11 12:41:35] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 1 ms to minimize.
[2022-06-11 12:41:35] [INFO ] Deduced a trap composed of 153 places in 99 ms of which 0 ms to minimize.
[2022-06-11 12:41:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 507 ms
[2022-06-11 12:41:35] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 118 ms.
[2022-06-11 12:41:36] [INFO ] Added : 20 causal constraints over 4 iterations in 375 ms. Result :sat
Minimization took 123 ms.
[2022-06-11 12:41:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 12:41:36] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:41:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:36] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2022-06-11 12:41:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 12:41:36] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:36] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2022-06-11 12:41:36] [INFO ] [Nat]Added 587 Read/Feed constraints in 83 ms returned sat
[2022-06-11 12:41:36] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2022-06-11 12:41:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2022-06-11 12:41:37] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 77 ms.
[2022-06-11 12:41:37] [INFO ] Added : 19 causal constraints over 4 iterations in 335 ms. Result :sat
Minimization took 99 ms.
[2022-06-11 12:41:37] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 12:41:37] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:41:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:37] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2022-06-11 12:41:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 12:41:37] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:41:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:37] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2022-06-11 12:41:37] [INFO ] [Nat]Added 587 Read/Feed constraints in 74 ms returned sat
[2022-06-11 12:41:37] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 54 ms.
[2022-06-11 12:41:37] [INFO ] Added : 5 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 55 ms.
[2022-06-11 12:41:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 12:41:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:38] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2022-06-11 12:41:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 12:41:38] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:41:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:38] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-06-11 12:41:38] [INFO ] [Nat]Added 587 Read/Feed constraints in 98 ms returned sat
[2022-06-11 12:41:38] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2022-06-11 12:41:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2022-06-11 12:41:38] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 59 ms.
[2022-06-11 12:41:38] [INFO ] Added : 17 causal constraints over 4 iterations in 322 ms. Result :sat
Minimization took 151 ms.
[2022-06-11 12:41:39] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 12:41:39] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:39] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2022-06-11 12:41:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 12:41:39] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-11 12:41:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:39] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2022-06-11 12:41:39] [INFO ] [Nat]Added 587 Read/Feed constraints in 90 ms returned sat
[2022-06-11 12:41:39] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 1 ms to minimize.
[2022-06-11 12:41:39] [INFO ] Deduced a trap composed of 123 places in 107 ms of which 1 ms to minimize.
[2022-06-11 12:41:39] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 1 ms to minimize.
[2022-06-11 12:41:40] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 1 ms to minimize.
[2022-06-11 12:41:40] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 0 ms to minimize.
[2022-06-11 12:41:40] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 1 ms to minimize.
[2022-06-11 12:41:40] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 0 ms to minimize.
[2022-06-11 12:41:40] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2022-06-11 12:41:40] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 1 ms to minimize.
[2022-06-11 12:41:40] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 1 ms to minimize.
[2022-06-11 12:41:41] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 1 ms to minimize.
[2022-06-11 12:41:41] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 1 ms to minimize.
[2022-06-11 12:41:41] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 0 ms to minimize.
[2022-06-11 12:41:41] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 1 ms to minimize.
[2022-06-11 12:41:41] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 1 ms to minimize.
[2022-06-11 12:41:41] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 0 ms to minimize.
[2022-06-11 12:41:41] [INFO ] Deduced a trap composed of 160 places in 107 ms of which 1 ms to minimize.
[2022-06-11 12:41:42] [INFO ] Deduced a trap composed of 148 places in 99 ms of which 0 ms to minimize.
[2022-06-11 12:41:42] [INFO ] Deduced a trap composed of 150 places in 99 ms of which 0 ms to minimize.
[2022-06-11 12:41:42] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 3 ms to minimize.
[2022-06-11 12:41:42] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 0 ms to minimize.
[2022-06-11 12:41:42] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 0 ms to minimize.
[2022-06-11 12:41:42] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3044 ms
[2022-06-11 12:41:42] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 54 ms.
[2022-06-11 12:41:43] [INFO ] Added : 35 causal constraints over 8 iterations in 465 ms. Result :sat
Minimization took 176 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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.8 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 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 302 place count 182 transition count 232
Iterating global reduction 1 with 59 rules applied. Total rules applied 361 place count 182 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 367 place count 182 transition count 226
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 409 place count 140 transition count 184
Iterating global reduction 2 with 42 rules applied. Total rules applied 451 place count 140 transition count 184
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 465 place count 140 transition count 170
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 491 place count 114 transition count 142
Iterating global reduction 3 with 26 rules applied. Total rules applied 517 place count 114 transition count 142
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 533 place count 114 transition count 126
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 538 place count 109 transition count 120
Iterating global reduction 4 with 5 rules applied. Total rules applied 543 place count 109 transition count 120
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 548 place count 104 transition count 115
Iterating global reduction 4 with 5 rules applied. Total rules applied 553 place count 104 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 555 place count 102 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 557 place count 102 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 559 place count 102 transition count 111
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 561 place count 100 transition count 109
Iterating global reduction 5 with 2 rules applied. Total rules applied 563 place count 100 transition count 109
Applied a total of 563 rules in 76 ms. Remains 100 /259 variables (removed 159) and now considering 109/749 (removed 640) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/259 places, 109/749 transitions.
// Phase 1: matrix 109 rows 100 cols
[2022-06-11 12:41:43] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224378 resets, run finished after 915 ms. (steps per millisecond=1092 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103690 resets, run finished after 485 ms. (steps per millisecond=2061 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103679 resets, run finished after 442 ms. (steps per millisecond=2262 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103159 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103296 resets, run finished after 425 ms. (steps per millisecond=2352 ) properties (out of 4) seen :0
// Phase 1: matrix 109 rows 100 cols
[2022-06-11 12:41:46] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 12:41:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:46] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-11 12:41:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:41:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:46] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-11 12:41:46] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-11 12:41:46] [INFO ] [Nat]Added 43 Read/Feed constraints in 14 ms returned sat
[2022-06-11 12:41:46] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2022-06-11 12:41:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-06-11 12:41:46] [INFO ] Computed and/alt/rep : 28/63/28 causal constraints (skipped 80 transitions) in 7 ms.
[2022-06-11 12:41:46] [INFO ] Added : 20 causal constraints over 5 iterations in 57 ms. Result :sat
Minimization took 23 ms.
[2022-06-11 12:41:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 12:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:46] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-11 12:41:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:46] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-11 12:41:46] [INFO ] [Nat]Added 43 Read/Feed constraints in 6 ms returned sat
[2022-06-11 12:41:46] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2022-06-11 12:41:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-06-11 12:41:46] [INFO ] Computed and/alt/rep : 28/63/28 causal constraints (skipped 80 transitions) in 7 ms.
[2022-06-11 12:41:46] [INFO ] Added : 12 causal constraints over 4 iterations in 41 ms. Result :sat
Minimization took 18 ms.
[2022-06-11 12:41:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:41:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:46] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-11 12:41:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 12:41:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:46] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-11 12:41:47] [INFO ] [Nat]Added 43 Read/Feed constraints in 8 ms returned sat
[2022-06-11 12:41:47] [INFO ] Computed and/alt/rep : 28/63/28 causal constraints (skipped 80 transitions) in 7 ms.
[2022-06-11 12:41:47] [INFO ] Added : 18 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 19 ms.
[2022-06-11 12:41:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:47] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:47] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-11 12:41:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:41:47] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:47] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-06-11 12:41:47] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2022-06-11 12:41:47] [INFO ] Computed and/alt/rep : 28/63/28 causal constraints (skipped 80 transitions) in 6 ms.
[2022-06-11 12:41:47] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
[2022-06-11 12:41:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-06-11 12:41:47] [INFO ] Added : 15 causal constraints over 4 iterations in 103 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 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 13 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 6 ms. Remains 100 /100 variables (removed 0) and now considering 109/109 (removed 0) transitions.
// Phase 1: matrix 109 rows 100 cols
[2022-06-11 12:41:47] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-11 12:41:47] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 109 rows 100 cols
[2022-06-11 12:41:47] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-11 12:41:47] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2022-06-11 12:41:47] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 109 rows 100 cols
[2022-06-11 12:41:47] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:47] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 109/109 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-00
// Phase 1: matrix 109 rows 100 cols
[2022-06-11 12:41:47] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2224 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 1025 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 109 rows 100 cols
[2022-06-11 12:41:47] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:47] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 12:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:47] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-11 12:41:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:41:47] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 12:41:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:47] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-11 12:41:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-11 12:41:47] [INFO ] [Nat]Added 43 Read/Feed constraints in 6 ms returned sat
[2022-06-11 12:41:47] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2022-06-11 12:41:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2022-06-11 12:41:47] [INFO ] Computed and/alt/rep : 28/63/28 causal constraints (skipped 80 transitions) in 6 ms.
[2022-06-11 12:41:48] [INFO ] Added : 20 causal constraints over 5 iterations in 50 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [17] 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.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 97 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 97 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 97 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 95 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 95 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 93 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 93 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 91 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 91 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 89 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 89 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 87 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 87 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 86 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 86 transition count 92
Applied a total of 29 rules in 23 ms. Remains 86 /100 variables (removed 14) and now considering 92/109 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/100 places, 92/109 transitions.
// Phase 1: matrix 92 rows 86 cols
[2022-06-11 12:41:48] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224114 resets, run finished after 731 ms. (steps per millisecond=1367 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103179 resets, run finished after 379 ms. (steps per millisecond=2638 ) properties (out of 1) seen :0
// Phase 1: matrix 92 rows 86 cols
[2022-06-11 12:41:49] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 12:41:49] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:49] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-06-11 12:41:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 12:41:49] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:49] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-11 12:41:49] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-11 12:41:49] [INFO ] [Nat]Added 35 Read/Feed constraints in 6 ms returned sat
[2022-06-11 12:41:49] [INFO ] Computed and/alt/rep : 24/52/24 causal constraints (skipped 67 transitions) in 6 ms.
[2022-06-11 12:41:49] [INFO ] Added : 19 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 92/92 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 92/92 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 86 cols
[2022-06-11 12:41:49] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 12:41:49] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 92 rows 86 cols
[2022-06-11 12:41:49] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:49] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-11 12:41:49] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2022-06-11 12:41:49] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 92 rows 86 cols
[2022-06-11 12:41:49] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:49] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 92/92 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-00 in 1941 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-01
// Phase 1: matrix 109 rows 100 cols
[2022-06-11 12:41:49] [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 1041 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 109 rows 100 cols
[2022-06-11 12:41:49] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:49] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:49] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-11 12:41:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:49] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:49] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-06-11 12:41:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-11 12:41:49] [INFO ] [Nat]Added 43 Read/Feed constraints in 6 ms returned sat
[2022-06-11 12:41:49] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2022-06-11 12:41:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2022-06-11 12:41:49] [INFO ] Computed and/alt/rep : 28/63/28 causal constraints (skipped 80 transitions) in 8 ms.
[2022-06-11 12:41:49] [INFO ] Added : 12 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [17] 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.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 97 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 97 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 97 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 94 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 94 transition count 101
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 94 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 91 transition count 96
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 91 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 23 place count 88 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 88 transition count 93
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 85 transition count 89
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 85 transition count 89
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 82 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 82 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 80 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 80 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 79 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 79 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 78 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 78 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 77 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 77 transition count 80
Applied a total of 48 rules in 20 ms. Remains 77 /100 variables (removed 23) and now considering 80/109 (removed 29) transitions.
Finished structural reductions, in 1 iterations. Remains : 77/100 places, 80/109 transitions.
// Phase 1: matrix 80 rows 77 cols
[2022-06-11 12:41:49] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224443 resets, run finished after 670 ms. (steps per millisecond=1492 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103328 resets, run finished after 352 ms. (steps per millisecond=2840 ) properties (out of 1) seen :0
// Phase 1: matrix 80 rows 77 cols
[2022-06-11 12:41:50] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-11 12:41:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:51] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-06-11 12:41:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:51] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:51] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-11 12:41:51] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-11 12:41:51] [INFO ] [Nat]Added 31 Read/Feed constraints in 11 ms returned sat
[2022-06-11 12:41:51] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 59 transitions) in 4 ms.
[2022-06-11 12:41:51] [INFO ] Added : 16 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 77/77 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 77/77 places, 80/80 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 77/77 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 77 cols
[2022-06-11 12:41:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:51] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 80 rows 77 cols
[2022-06-11 12:41:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:51] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-11 12:41:51] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2022-06-11 12:41:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 77 cols
[2022-06-11 12:41:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:51] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 77/77 places, 80/80 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-01 in 1732 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-07
// Phase 1: matrix 109 rows 100 cols
[2022-06-11 12:41:51] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2246 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 1045 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 109 rows 100 cols
[2022-06-11 12:41:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-11 12:41:51] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 12:41:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:51] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-11 12:41:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:51] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-11 12:41:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:51] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-11 12:41:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-11 12:41:51] [INFO ] [Nat]Added 43 Read/Feed constraints in 12 ms returned sat
[2022-06-11 12:41:51] [INFO ] Computed and/alt/rep : 28/63/28 causal constraints (skipped 80 transitions) in 8 ms.
[2022-06-11 12:41:51] [INFO ] Added : 18 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [17] 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.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 97 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 97 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 95 transition count 104
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 95 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 95 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 93 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 93 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 91 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 91 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 89 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 89 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 87 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 87 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 85 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 85 transition count 91
Applied a total of 31 rules in 23 ms. Remains 85 /100 variables (removed 15) and now considering 91/109 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/100 places, 91/109 transitions.
// Phase 1: matrix 91 rows 85 cols
[2022-06-11 12:41:51] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224494 resets, run finished after 706 ms. (steps per millisecond=1416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103833 resets, run finished after 371 ms. (steps per millisecond=2695 ) properties (out of 1) seen :0
// Phase 1: matrix 91 rows 85 cols
[2022-06-11 12:41:52] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 12:41:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:52] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-11 12:41:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-11 12:41:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-11 12:41:52] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-11 12:41:52] [INFO ] [Nat]Added 35 Read/Feed constraints in 4 ms returned sat
[2022-06-11 12:41:52] [INFO ] Computed and/alt/rep : 23/52/23 causal constraints (skipped 67 transitions) in 12 ms.
[2022-06-11 12:41:52] [INFO ] Added : 19 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [17] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 91/91 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 91/91 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 85 cols
[2022-06-11 12:41:52] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:53] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 91 rows 85 cols
[2022-06-11 12:41:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-06-11 12:41:53] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2022-06-11 12:41:53] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 91 rows 85 cols
[2022-06-11 12:41:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:53] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 91/91 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-07 in 1797 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-15
// Phase 1: matrix 109 rows 100 cols
[2022-06-11 12:41:53] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2211 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 993 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 109 rows 100 cols
[2022-06-11 12:41:53] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:53] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-11 12:41:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:53] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 5 ms returned sat
[2022-06-11 12:41:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:53] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-06-11 12:41:53] [INFO ] State equation strengthened by 43 read => feed constraints.
[2022-06-11 12:41:53] [INFO ] [Nat]Added 43 Read/Feed constraints in 7 ms returned sat
[2022-06-11 12:41:53] [INFO ] Computed and/alt/rep : 28/63/28 causal constraints (skipped 80 transitions) in 5 ms.
[2022-06-11 12:41:53] [INFO ] Deduced a trap composed of 41 places in 27 ms of which 1 ms to minimize.
[2022-06-11 12:41:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-06-11 12:41:53] [INFO ] Added : 15 causal constraints over 4 iterations in 89 ms. Result :sat
Minimization took 17 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.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 97 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 97 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 97 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 95 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 95 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 12 place count 95 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 93 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 93 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 91 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 91 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 89 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 89 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 87 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 87 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 86 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 86 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 85 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 85 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 84 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 84 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 83 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 83 transition count 87
Applied a total of 36 rules in 19 ms. Remains 83 /100 variables (removed 17) and now considering 87/109 (removed 22) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/100 places, 87/109 transitions.
// Phase 1: matrix 87 rows 83 cols
[2022-06-11 12:41:53] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224288 resets, run finished after 678 ms. (steps per millisecond=1474 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103867 resets, run finished after 369 ms. (steps per millisecond=2710 ) properties (out of 1) seen :0
// Phase 1: matrix 87 rows 83 cols
[2022-06-11 12:41:54] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-11 12:41:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-11 12:41:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 12:41:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-11 12:41:54] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 12:41:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 12:41:54] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-06-11 12:41:54] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-11 12:41:54] [INFO ] [Nat]Added 33 Read/Feed constraints in 6 ms returned sat
[2022-06-11 12:41:54] [INFO ] Computed and/alt/rep : 22/49/22 causal constraints (skipped 64 transitions) in 5 ms.
[2022-06-11 12:41:54] [INFO ] Added : 8 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 in SAFETY mode, 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-11 12:41:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 12:41:54] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 87 rows 83 cols
[2022-06-11 12:41:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-11 12:41:54] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-06-11 12:41:54] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2022-06-11 12:41:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 87 rows 83 cols
[2022-06-11 12:41:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-11 12:41:54] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 87/87 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m18-UpperBounds-15 in 1714 ms.
[2022-06-11 12:41:55] [INFO ] Flatten gal took : 36 ms
[2022-06-11 12:41:55] [INFO ] Applying decomposition
[2022-06-11 12:41:55] [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/graph10188250276035837432.txt' '-o' '/tmp/graph10188250276035837432.bin' '-w' '/tmp/graph10188250276035837432.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10188250276035837432.bin' '-l' '-1' '-v' '-w' '/tmp/graph10188250276035837432.weights' '-q' '0' '-e' '0.001'
[2022-06-11 12:41:55] [INFO ] Decomposing Gal with order
[2022-06-11 12:41:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 12:41:55] [INFO ] Removed a total of 108 redundant transitions.
[2022-06-11 12:41:55] [INFO ] Flatten gal took : 45 ms
[2022-06-11 12:41:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 9 ms.
[2022-06-11 12:41:55] [INFO ] Time to serialize gal into /tmp/UpperBounds4581837477917275378.gal : 6 ms
[2022-06-11 12:41:55] [INFO ] Time to serialize properties into /tmp/UpperBounds17207082629256005453.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/UpperBounds4581837477917275378.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17207082629256005453.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...275
Loading property file /tmp/UpperBounds17207082629256005453.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,4.68969e+09,897.789,9752180,8108,889,5.76746e+06,54188,351,8.41207e+07,83,936866,0
Total reachable state count : 4689691557
Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m18-UpperBounds-00 :0 <= i3.u9.p31 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m18-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-d1m18-UpperBounds-00,0,902.155,9752180,1,0,5.76746e+06,54188,471,8.41207e+07,103,936866,3363
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m18-UpperBounds-01 :0 <= i1.u4.l34 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-01 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-d1m18-UpperBounds-01,0,902.193,9752180,1,0,5.76746e+06,54188,491,8.41207e+07,108,936866,3402
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m18-UpperBounds-07 :0 <= i3.u10.l122 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-07 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-d1m18-UpperBounds-07,0,902.194,9752180,1,0,5.76746e+06,54188,507,8.41207e+07,125,936866,3439
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m18-UpperBounds-15 :0 <= i5.i1.u17.p41 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m18-UpperBounds-15 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-d1m18-UpperBounds-15,0,902.219,9752180,1,0,5.76746e+06,54188,530,8.41207e+07,125,936866,3674
Total runtime 925214 ms.
BK_STOP 1654952219119
--------------------
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-d1m18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m18, 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 r312-tall-165472282900909"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m18.tgz
mv SieveSingleMsgMbox-PT-d1m18 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 ;