About the Execution of ITS-Tools for DES-PT-20b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 539.348 | 53434.00 | 70698.00 | 825.70 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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/mcc2021-input.r064-tall-162038396700091.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DES-PT-20b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038396700091
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 91K May 5 16:51 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 DES-PT-20b-UpperBounds-00
FORMULA_NAME DES-PT-20b-UpperBounds-01
FORMULA_NAME DES-PT-20b-UpperBounds-02
FORMULA_NAME DES-PT-20b-UpperBounds-03
FORMULA_NAME DES-PT-20b-UpperBounds-04
FORMULA_NAME DES-PT-20b-UpperBounds-05
FORMULA_NAME DES-PT-20b-UpperBounds-06
FORMULA_NAME DES-PT-20b-UpperBounds-07
FORMULA_NAME DES-PT-20b-UpperBounds-08
FORMULA_NAME DES-PT-20b-UpperBounds-09
FORMULA_NAME DES-PT-20b-UpperBounds-10
FORMULA_NAME DES-PT-20b-UpperBounds-11
FORMULA_NAME DES-PT-20b-UpperBounds-12
FORMULA_NAME DES-PT-20b-UpperBounds-13
FORMULA_NAME DES-PT-20b-UpperBounds-14
FORMULA_NAME DES-PT-20b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1620470002211
Running Version 0
[2021-05-08 10:33:23] [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]
[2021-05-08 10:33:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 10:33:24] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2021-05-08 10:33:24] [INFO ] Transformed 360 places.
[2021-05-08 10:33:24] [INFO ] Transformed 311 transitions.
[2021-05-08 10:33:24] [INFO ] Found NUPN structural information;
[2021-05-08 10:33:24] [INFO ] Parsed PT model containing 360 places and 311 transitions in 110 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 311 rows 360 cols
[2021-05-08 10:33:24] [INFO ] Computed 65 place invariants in 31 ms
Incomplete random walk after 10000 steps, including 85 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :13
FORMULA DES-PT-20b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
// Phase 1: matrix 311 rows 360 cols
[2021-05-08 10:33:24] [INFO ] Computed 65 place invariants in 7 ms
[2021-05-08 10:33:24] [INFO ] [Real]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 10:33:24] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 12 ms returned sat
[2021-05-08 10:33:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:24] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-08 10:33:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:33:24] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2021-05-08 10:33:24] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 11 ms returned sat
[2021-05-08 10:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:25] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2021-05-08 10:33:25] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 3 ms to minimize.
[2021-05-08 10:33:25] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2021-05-08 10:33:25] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2021-05-08 10:33:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 463 ms
[2021-05-08 10:33:25] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 23 ms.
[2021-05-08 10:33:26] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2021-05-08 10:33:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2021-05-08 10:33:26] [INFO ] Added : 234 causal constraints over 47 iterations in 1437 ms. Result :sat
Minimization took 120 ms.
[2021-05-08 10:33:27] [INFO ] [Real]Absence check using 39 positive place invariants in 17 ms returned sat
[2021-05-08 10:33:27] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 11 ms returned sat
[2021-05-08 10:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:27] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-08 10:33:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:33:27] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2021-05-08 10:33:27] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2021-05-08 10:33:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:27] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-08 10:33:27] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2021-05-08 10:33:27] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2021-05-08 10:33:27] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 0 ms to minimize.
[2021-05-08 10:33:27] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2021-05-08 10:33:28] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2021-05-08 10:33:28] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2021-05-08 10:33:28] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2021-05-08 10:33:28] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2021-05-08 10:33:28] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2021-05-08 10:33:28] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2021-05-08 10:33:28] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2021-05-08 10:33:28] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2021-05-08 10:33:28] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2021-05-08 10:33:28] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2021-05-08 10:33:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1256 ms
[2021-05-08 10:33:28] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 18 ms.
[2021-05-08 10:33:30] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2021-05-08 10:33:30] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2021-05-08 10:33:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2021-05-08 10:33:30] [INFO ] Added : 289 causal constraints over 58 iterations in 1480 ms. Result :sat
Minimization took 141 ms.
[2021-05-08 10:33:30] [INFO ] [Real]Absence check using 39 positive place invariants in 11 ms returned sat
[2021-05-08 10:33:30] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 10 ms returned sat
[2021-05-08 10:33:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:30] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-08 10:33:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:33:30] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2021-05-08 10:33:30] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 34 ms returned sat
[2021-05-08 10:33:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:30] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2021-05-08 10:33:31] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2021-05-08 10:33:31] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2021-05-08 10:33:31] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2021-05-08 10:33:31] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2021-05-08 10:33:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 306 ms
[2021-05-08 10:33:31] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 17 ms.
[2021-05-08 10:33:32] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2021-05-08 10:33:32] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2021-05-08 10:33:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 212 ms
[2021-05-08 10:33:32] [INFO ] Added : 258 causal constraints over 52 iterations in 1519 ms. Result :sat
Minimization took 183 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 253600 steps, including 2579 resets, run finished after 764 ms. (steps per millisecond=331 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 290500 steps, including 3158 resets, run finished after 806 ms. (steps per millisecond=360 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 74300 steps, including 951 resets, run finished after 230 ms. (steps per millisecond=323 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 353 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 353 transition count 284
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 332 transition count 284
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 332 transition count 275
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 323 transition count 275
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 304 transition count 256
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 304 transition count 256
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 304 transition count 255
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 303 transition count 255
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 288 transition count 240
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 288 transition count 240
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 288 transition count 225
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 286 transition count 224
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 286 transition count 221
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 283 transition count 221
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 206 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 204 transition count 146
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 204 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 203 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 202 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 201 transition count 144
Applied a total of 319 rules in 198 ms. Remains 201 /360 variables (removed 159) and now considering 144/311 (removed 167) transitions.
Finished structural reductions, in 1 iterations. Remains : 201/360 places, 144/311 transitions.
// Phase 1: matrix 144 rows 201 cols
[2021-05-08 10:33:35] [INFO ] Computed 63 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 47765 resets, run finished after 2936 ms. (steps per millisecond=340 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9213 resets, run finished after 1070 ms. (steps per millisecond=934 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9171 resets, run finished after 1036 ms. (steps per millisecond=965 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9197 resets, run finished after 1070 ms. (steps per millisecond=934 ) properties (out of 3) seen :0
// Phase 1: matrix 144 rows 201 cols
[2021-05-08 10:33:41] [INFO ] Computed 63 place invariants in 5 ms
[2021-05-08 10:33:41] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:33:41] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 8 ms returned sat
[2021-05-08 10:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:41] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-08 10:33:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:33:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-08 10:33:41] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 8 ms returned sat
[2021-05-08 10:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:41] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-08 10:33:41] [INFO ] Computed and/alt/rep : 130/265/130 causal constraints (skipped 11 transitions) in 28 ms.
[2021-05-08 10:33:41] [INFO ] Added : 65 causal constraints over 13 iterations in 170 ms. Result :sat
Minimization took 30 ms.
[2021-05-08 10:33:41] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2021-05-08 10:33:41] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 8 ms returned sat
[2021-05-08 10:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:41] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-08 10:33:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:33:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2021-05-08 10:33:41] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 8 ms returned sat
[2021-05-08 10:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:41] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-08 10:33:41] [INFO ] Computed and/alt/rep : 130/265/130 causal constraints (skipped 11 transitions) in 23 ms.
[2021-05-08 10:33:42] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2021-05-08 10:33:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2021-05-08 10:33:42] [INFO ] Added : 113 causal constraints over 23 iterations in 302 ms. Result :sat
Minimization took 40 ms.
[2021-05-08 10:33:42] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:33:42] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 8 ms returned sat
[2021-05-08 10:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:42] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-08 10:33:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:33:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2021-05-08 10:33:42] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 7 ms returned sat
[2021-05-08 10:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:42] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-08 10:33:42] [INFO ] Computed and/alt/rep : 130/265/130 causal constraints (skipped 11 transitions) in 8 ms.
[2021-05-08 10:33:42] [INFO ] Added : 89 causal constraints over 18 iterations in 169 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 59200 steps, including 3532 resets, run finished after 191 ms. (steps per millisecond=309 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 103400 steps, including 7539 resets, run finished after 288 ms. (steps per millisecond=359 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 16900 steps, including 1005 resets, run finished after 51 ms. (steps per millisecond=331 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 201/201 places, 144/144 transitions.
Applied a total of 0 rules in 8 ms. Remains 201 /201 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 201/201 places, 144/144 transitions.
Starting structural reductions, iteration 0 : 201/201 places, 144/144 transitions.
Applied a total of 0 rules in 7 ms. Remains 201 /201 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 201 cols
[2021-05-08 10:33:43] [INFO ] Computed 63 place invariants in 4 ms
[2021-05-08 10:33:43] [INFO ] Implicit Places using invariants in 180 ms returned []
// Phase 1: matrix 144 rows 201 cols
[2021-05-08 10:33:43] [INFO ] Computed 63 place invariants in 4 ms
[2021-05-08 10:33:43] [INFO ] Implicit Places using invariants and state equation in 357 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 539 ms to find 1 implicit places.
[2021-05-08 10:33:43] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:33:43] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:33:43] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Starting structural reductions, iteration 1 : 200/201 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2021-05-08 10:33:43] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:33:43] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:33:43] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Finished structural reductions, in 2 iterations. Remains : 200/201 places, 144/144 transitions.
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:33:43] [INFO ] Computed 62 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 47698 resets, run finished after 2717 ms. (steps per millisecond=368 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9244 resets, run finished after 1026 ms. (steps per millisecond=974 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9133 resets, run finished after 1023 ms. (steps per millisecond=977 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9175 resets, run finished after 1031 ms. (steps per millisecond=969 ) properties (out of 3) seen :0
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:33:49] [INFO ] Computed 62 place invariants in 1 ms
[2021-05-08 10:33:49] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:33:49] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 9 ms returned sat
[2021-05-08 10:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:49] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-08 10:33:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:33:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2021-05-08 10:33:49] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 83 ms returned sat
[2021-05-08 10:33:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:49] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-08 10:33:49] [INFO ] Computed and/alt/rep : 130/264/130 causal constraints (skipped 11 transitions) in 8 ms.
[2021-05-08 10:33:50] [INFO ] Deduced a trap composed of 6 places in 8 ms of which 1 ms to minimize.
[2021-05-08 10:33:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2021-05-08 10:33:50] [INFO ] Added : 66 causal constraints over 14 iterations in 189 ms. Result :sat
Minimization took 33 ms.
[2021-05-08 10:33:50] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:33:50] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 9 ms returned sat
[2021-05-08 10:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:50] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-08 10:33:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:33:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:33:50] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 81 ms returned sat
[2021-05-08 10:33:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:50] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-08 10:33:50] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2021-05-08 10:33:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-08 10:33:50] [INFO ] Computed and/alt/rep : 130/264/130 causal constraints (skipped 11 transitions) in 8 ms.
[2021-05-08 10:33:50] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2021-05-08 10:33:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-08 10:33:50] [INFO ] Added : 112 causal constraints over 23 iterations in 278 ms. Result :sat
Minimization took 36 ms.
[2021-05-08 10:33:50] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:33:50] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 9 ms returned sat
[2021-05-08 10:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:50] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-08 10:33:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:33:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:33:50] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 14 ms returned sat
[2021-05-08 10:33:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:50] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-08 10:33:50] [INFO ] Computed and/alt/rep : 130/264/130 causal constraints (skipped 11 transitions) in 8 ms.
[2021-05-08 10:33:51] [INFO ] Added : 90 causal constraints over 18 iterations in 171 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 62600 steps, including 4262 resets, run finished after 174 ms. (steps per millisecond=359 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 106000 steps, including 7480 resets, run finished after 296 ms. (steps per millisecond=358 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 17100 steps, including 995 resets, run finished after 50 ms. (steps per millisecond=342 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 200 /200 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 144/144 transitions.
Starting structural reductions, iteration 0 : 200/200 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 200 /200 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:33:51] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:33:51] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:33:51] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:33:51] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2021-05-08 10:33:51] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:33:51] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:33:52] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 144/144 transitions.
Starting property specific reduction for DES-PT-20b-UpperBounds-02
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:33:52] [INFO ] Computed 62 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 470 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:33:52] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:33:52] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:33:52] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 9 ms returned sat
[2021-05-08 10:33:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:52] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-08 10:33:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:33:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:33:52] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 84 ms returned sat
[2021-05-08 10:33:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:52] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-08 10:33:52] [INFO ] Computed and/alt/rep : 130/264/130 causal constraints (skipped 11 transitions) in 8 ms.
[2021-05-08 10:33:52] [INFO ] Deduced a trap composed of 6 places in 7 ms of which 0 ms to minimize.
[2021-05-08 10:33:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2021-05-08 10:33:52] [INFO ] Added : 66 causal constraints over 14 iterations in 187 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 17100 steps, including 959 resets, run finished after 50 ms. (steps per millisecond=342 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 144/144 transitions.
Graph (complete) has 656 edges and 200 vertex of which 197 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 143
Applied a total of 2 rules in 11 ms. Remains 197 /200 variables (removed 3) and now considering 143/144 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/200 places, 143/144 transitions.
// Phase 1: matrix 143 rows 197 cols
[2021-05-08 10:33:52] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 47907 resets, run finished after 2681 ms. (steps per millisecond=372 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9034 resets, run finished after 1019 ms. (steps per millisecond=981 ) properties (out of 1) seen :0
// Phase 1: matrix 143 rows 197 cols
[2021-05-08 10:33:56] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:33:56] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2021-05-08 10:33:56] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2021-05-08 10:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:56] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-08 10:33:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:33:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 10:33:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2021-05-08 10:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:56] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-08 10:33:56] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 8 ms.
[2021-05-08 10:33:56] [INFO ] Added : 66 causal constraints over 14 iterations in 169 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 70300 steps, including 4059 resets, run finished after 198 ms. (steps per millisecond=355 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 197 cols
[2021-05-08 10:33:57] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:33:57] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2021-05-08 10:33:57] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:33:57] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2021-05-08 10:33:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2021-05-08 10:33:57] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:33:57] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-02 in 5349 ms.
Starting property specific reduction for DES-PT-20b-UpperBounds-03
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:33:57] [INFO ] Computed 62 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 476 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:33:57] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:33:57] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:33:57] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 9 ms returned sat
[2021-05-08 10:33:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:57] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-08 10:33:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:33:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:33:57] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 80 ms returned sat
[2021-05-08 10:33:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:33:57] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-08 10:33:57] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2021-05-08 10:33:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2021-05-08 10:33:57] [INFO ] Computed and/alt/rep : 130/264/130 causal constraints (skipped 11 transitions) in 7 ms.
[2021-05-08 10:33:57] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2021-05-08 10:33:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-08 10:33:58] [INFO ] Added : 112 causal constraints over 23 iterations in 273 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 106000 steps, including 7508 resets, run finished after 290 ms. (steps per millisecond=365 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 144/144 transitions.
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:33:58] [INFO ] Computed 62 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 48120 resets, run finished after 2687 ms. (steps per millisecond=372 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9161 resets, run finished after 1022 ms. (steps per millisecond=978 ) properties (out of 1) seen :0
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:34:02] [INFO ] Computed 62 place invariants in 4 ms
[2021-05-08 10:34:02] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:34:02] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 8 ms returned sat
[2021-05-08 10:34:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:34:02] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-08 10:34:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:34:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2021-05-08 10:34:02] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 80 ms returned sat
[2021-05-08 10:34:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:34:02] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-08 10:34:02] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2021-05-08 10:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2021-05-08 10:34:02] [INFO ] Computed and/alt/rep : 130/264/130 causal constraints (skipped 11 transitions) in 7 ms.
[2021-05-08 10:34:02] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2021-05-08 10:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2021-05-08 10:34:02] [INFO ] Added : 112 causal constraints over 23 iterations in 284 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 106000 steps, including 7638 resets, run finished after 289 ms. (steps per millisecond=366 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 144/144 transitions.
Starting structural reductions, iteration 0 : 200/200 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:34:02] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:34:03] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:34:03] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:34:03] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2021-05-08 10:34:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:34:03] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:34:03] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 144/144 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-03 in 5954 ms.
Starting property specific reduction for DES-PT-20b-UpperBounds-08
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:34:03] [INFO ] Computed 62 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 497 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 144 rows 200 cols
[2021-05-08 10:34:03] [INFO ] Computed 62 place invariants in 2 ms
[2021-05-08 10:34:03] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:34:03] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 9 ms returned sat
[2021-05-08 10:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:34:03] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-08 10:34:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:34:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2021-05-08 10:34:03] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 9 ms returned sat
[2021-05-08 10:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:34:03] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2021-05-08 10:34:03] [INFO ] Computed and/alt/rep : 130/264/130 causal constraints (skipped 11 transitions) in 5 ms.
[2021-05-08 10:34:03] [INFO ] Added : 90 causal constraints over 18 iterations in 167 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 62600 steps, including 4316 resets, run finished after 171 ms. (steps per millisecond=366 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 200 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 200/200 places, 144/144 transitions.
Graph (complete) has 656 edges and 200 vertex of which 197 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 143
Applied a total of 2 rules in 11 ms. Remains 197 /200 variables (removed 3) and now considering 143/144 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/200 places, 143/144 transitions.
// Phase 1: matrix 143 rows 197 cols
[2021-05-08 10:34:04] [INFO ] Computed 60 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 48145 resets, run finished after 2699 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9044 resets, run finished after 1027 ms. (steps per millisecond=973 ) properties (out of 1) seen :0
// Phase 1: matrix 143 rows 197 cols
[2021-05-08 10:34:07] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:34:07] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2021-05-08 10:34:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2021-05-08 10:34:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:34:07] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-08 10:34:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:34:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2021-05-08 10:34:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2021-05-08 10:34:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:34:07] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2021-05-08 10:34:08] [INFO ] Deduced a trap composed of 6 places in 10 ms of which 0 ms to minimize.
[2021-05-08 10:34:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2021-05-08 10:34:08] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 7 ms.
[2021-05-08 10:34:08] [INFO ] Added : 116 causal constraints over 24 iterations in 239 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 89700 steps, including 5468 resets, run finished after 252 ms. (steps per millisecond=355 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 197 cols
[2021-05-08 10:34:08] [INFO ] Computed 60 place invariants in 1 ms
[2021-05-08 10:34:08] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2021-05-08 10:34:08] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:34:08] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2021-05-08 10:34:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2021-05-08 10:34:08] [INFO ] Computed 60 place invariants in 2 ms
[2021-05-08 10:34:08] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-08 in 5593 ms.
[2021-05-08 10:34:09] [INFO ] Flatten gal took : 52 ms
[2021-05-08 10:34:09] [INFO ] Applying decomposition
[2021-05-08 10:34:09] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14732204808119883393.txt, -o, /tmp/graph14732204808119883393.bin, -w, /tmp/graph14732204808119883393.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14732204808119883393.bin, -l, -1, -v, -w, /tmp/graph14732204808119883393.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 10:34:09] [INFO ] Decomposing Gal with order
[2021-05-08 10:34:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 10:34:09] [INFO ] Removed a total of 46 redundant transitions.
[2021-05-08 10:34:09] [INFO ] Flatten gal took : 87 ms
[2021-05-08 10:34:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 18 ms.
[2021-05-08 10:34:09] [INFO ] Time to serialize gal into /tmp/UpperBounds8127116874899607641.gal : 24 ms
[2021-05-08 10:34:09] [INFO ] Time to serialize properties into /tmp/UpperBounds17042153101004706269.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds8127116874899607641.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17042153101004706269.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds8127116874899607641.gal -t CGAL -reachable-file /tmp/UpperBounds17042153101004706269.prop --nowitness
Loading property file /tmp/UpperBounds17042153101004706269.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,9.89866e+12,3.93685,142276,30772,1862,436109,3855,305,249644,213,32118,0
Total reachable state count : 9898658580966
Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20b-UpperBounds-02 :0 <= u49.p42 <= 1
FORMULA DES-PT-20b-UpperBounds-02 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
DES-PT-20b-UpperBounds-02,0,4.27784,142276,1,0,436109,9740,487,249644,255,97706,2288
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20b-UpperBounds-03 :0 <= u14.p6 <= 1
FORMULA DES-PT-20b-UpperBounds-03 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
DES-PT-20b-UpperBounds-03,0,4.33669,142276,1,0,436109,10179,518,249644,307,103161,2736
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20b-UpperBounds-08 :0 <= u2.p74 <= 1
FORMULA DES-PT-20b-UpperBounds-08 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
DES-PT-20b-UpperBounds-08,0,4.33775,142276,1,0,436109,10198,556,249644,346,103287,2776
BK_STOP 1620470055645
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-20b"
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 DES-PT-20b, 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 r064-tall-162038396700091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b 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 ;