About the Execution of Marcie+red for DoubleExponent-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5943.212 | 3600000.00 | 3649839.00 | 9891.40 | ? ? ? ? ? 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/mcc2023-input.r138-smll-167819420900493.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DoubleExponent-PT-100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819420900493
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.8K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:22 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 DoubleExponent-PT-100-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678890295109
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-15 14:24:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 14:24:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 14:24:59] [INFO ] Load time of PNML (sax parser for PT used): 495 ms
[2023-03-15 14:24:59] [INFO ] Transformed 5304 places.
[2023-03-15 14:24:59] [INFO ] Transformed 4998 transitions.
[2023-03-15 14:24:59] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 780 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 4998 rows 5304 cols
[2023-03-15 14:25:00] [INFO ] Invariants computation overflowed in 366 ms
Incomplete random walk after 10000 steps, including 331 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 282 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 268 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 282 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :1
// Phase 1: matrix 4998 rows 5304 cols
[2023-03-15 14:25:01] [INFO ] Invariants computation overflowed in 377 ms
[2023-03-15 14:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:25:07] [INFO ] [Real]Absence check using state equation in 3552 ms returned unknown
[2023-03-15 14:25:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:25:12] [INFO ] [Real]Absence check using state equation in 3936 ms returned unknown
[2023-03-15 14:25:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:25:17] [INFO ] [Real]Absence check using state equation in 4283 ms returned unknown
[2023-03-15 14:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:25:22] [INFO ] [Real]Absence check using state equation in 4092 ms returned unknown
[2023-03-15 14:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:25:27] [INFO ] [Real]Absence check using state equation in 4134 ms returned unknown
[2023-03-15 14:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:25:32] [INFO ] [Real]Absence check using state equation in 4118 ms returned unknown
[2023-03-15 14:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:25:37] [INFO ] [Real]Absence check using state equation in 4267 ms returned unknown
[2023-03-15 14:25:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:25:42] [INFO ] [Real]Absence check using state equation in 4150 ms returned unknown
[2023-03-15 14:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:25:47] [INFO ] [Real]Absence check using state equation in 4317 ms returned unknown
[2023-03-15 14:25:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:25:52] [INFO ] [Real]Absence check using state equation in 4130 ms returned unknown
[2023-03-15 14:25:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:25:57] [INFO ] [Real]Absence check using state equation in 4285 ms returned unknown
[2023-03-15 14:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:26:02] [INFO ] [Real]Absence check using state equation in 4121 ms returned unknown
[2023-03-15 14:26:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:26:07] [INFO ] [Real]Absence check using state equation in 4046 ms returned unknown
[2023-03-15 14:26:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:26:12] [INFO ] [Real]Absence check using state equation in 4132 ms returned unknown
[2023-03-15 14:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:26:17] [INFO ] [Real]Absence check using state equation in 4100 ms returned unknown
[2023-03-15 14:26:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:26:22] [INFO ] [Real]Absence check using state equation in 4132 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 5304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Graph (complete) has 9096 edges and 5304 vertex of which 5298 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.17 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1182 transitions
Trivial Post-agglo rules discarded 1182 transitions
Performed 1182 trivial Post agglomeration. Transition count delta: 1182
Iterating post reduction 0 with 1185 rules applied. Total rules applied 1186 place count 5297 transition count 3814
Reduce places removed 1182 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 1192 rules applied. Total rules applied 2378 place count 4115 transition count 3804
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 2388 place count 4105 transition count 3804
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2388 place count 4105 transition count 3604
Deduced a syphon composed of 200 places in 402 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2788 place count 3905 transition count 3604
Performed 896 Post agglomeration using F-continuation condition.Transition count delta: 896
Deduced a syphon composed of 896 places in 184 ms
Reduce places removed 896 places and 0 transitions.
Iterating global reduction 3 with 1792 rules applied. Total rules applied 4580 place count 3009 transition count 2708
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 90 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4782 place count 2908 transition count 2708
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 84 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 4968 place count 2815 transition count 2708
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4969 place count 2815 transition count 2707
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4970 place count 2814 transition count 2707
Free-agglomeration rule (complex) applied 404 times.
Iterating global reduction 4 with 404 rules applied. Total rules applied 5374 place count 2814 transition count 2303
Reduce places removed 404 places and 0 transitions.
Iterating post reduction 4 with 404 rules applied. Total rules applied 5778 place count 2410 transition count 2303
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 5 with 398 rules applied. Total rules applied 6176 place count 2410 transition count 2303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 6177 place count 2409 transition count 2302
Applied a total of 6177 rules in 4385 ms. Remains 2409 /5304 variables (removed 2895) and now considering 2302/4998 (removed 2696) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4389 ms. Remains : 2409/5304 places, 2302/4998 transitions.
// Phase 1: matrix 2302 rows 2409 cols
[2023-03-15 14:26:26] [INFO ] Invariants computation overflowed in 51 ms
Incomplete random walk after 1000000 steps, including 127574 resets, run finished after 2972 ms. (steps per millisecond=336 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 83473 resets, run finished after 1634 ms. (steps per millisecond=611 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000001 steps, including 83332 resets, run finished after 1635 ms. (steps per millisecond=611 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 83332 resets, run finished after 1693 ms. (steps per millisecond=590 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 83469 resets, run finished after 1805 ms. (steps per millisecond=554 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 83295 resets, run finished after 1701 ms. (steps per millisecond=587 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 87070 resets, run finished after 1612 ms. (steps per millisecond=620 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 83464 resets, run finished after 1732 ms. (steps per millisecond=577 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 83384 resets, run finished after 1872 ms. (steps per millisecond=534 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 83132 resets, run finished after 1635 ms. (steps per millisecond=611 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 83512 resets, run finished after 1642 ms. (steps per millisecond=609 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 83186 resets, run finished after 1641 ms. (steps per millisecond=609 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000001 steps, including 83683 resets, run finished after 1623 ms. (steps per millisecond=616 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 83375 resets, run finished after 1622 ms. (steps per millisecond=616 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000001 steps, including 83548 resets, run finished after 1619 ms. (steps per millisecond=617 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 83472 resets, run finished after 1626 ms. (steps per millisecond=615 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000001 steps, including 83593 resets, run finished after 1619 ms. (steps per millisecond=617 ) properties (out of 16) seen :1
// Phase 1: matrix 2302 rows 2409 cols
[2023-03-15 14:26:56] [INFO ] Invariants computation overflowed in 69 ms
[2023-03-15 14:26:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:27:01] [INFO ] [Real]Absence check using state equation in 4046 ms returned sat
[2023-03-15 14:27:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:27:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:27:06] [INFO ] [Nat]Absence check using state equation in 4133 ms returned sat
[2023-03-15 14:27:06] [INFO ] State equation strengthened by 393 read => feed constraints.
[2023-03-15 14:27:09] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 14:27:12] [INFO ] [Nat]Added 393 Read/Feed constraints in 6089 ms returned unknown
[2023-03-15 14:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:27:57] [INFO ] [Real]Absence check using state equation in 44701 ms returned unknown
[2023-03-15 14:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:28:02] [INFO ] [Real]Absence check using state equation in 4271 ms returned sat
[2023-03-15 14:28:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:28:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:28:06] [INFO ] [Nat]Absence check using state equation in 3558 ms returned sat
[2023-03-15 14:28:09] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 14:28:12] [INFO ] [Nat]Added 393 Read/Feed constraints in 6442 ms returned unknown
[2023-03-15 14:28:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:28:57] [INFO ] [Real]Absence check using state equation in 44587 ms returned unknown
[2023-03-15 14:28:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:29:12] [INFO ] [Real]Absence check using state equation in 14569 ms returned unknown
[2023-03-15 14:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:29:37] [INFO ] [Real]Absence check using state equation in 24895 ms returned sat
[2023-03-15 14:29:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:29:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:29:59] [INFO ] [Nat]Absence check using state equation in 21061 ms returned unsat
[2023-03-15 14:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:30:44] [INFO ] [Real]Absence check using state equation in 44584 ms returned unknown
[2023-03-15 14:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:31:29] [INFO ] [Real]Absence check using state equation in 44571 ms returned unknown
[2023-03-15 14:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:31:45] [INFO ] [Real]Absence check using state equation in 16102 ms returned unknown
[2023-03-15 14:31:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:31:57] [INFO ] [Real]Absence check using state equation in 11059 ms returned sat
[2023-03-15 14:31:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:31:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:32:12] [INFO ] [Nat]Absence check using state equation in 14659 ms returned sat
[2023-03-15 14:32:14] [INFO ] [Nat]Added 393 Read/Feed constraints in 2253 ms returned sat
[2023-03-15 14:32:15] [INFO ] Computed and/alt/rep : 1821/11291/1821 causal constraints (skipped 480 transitions) in 689 ms.
[2023-03-15 14:32:37] [INFO ] Deduced a trap composed of 12 places in 6764 ms of which 18 ms to minimize.
[2023-03-15 14:32:43] [INFO ] Deduced a trap composed of 4 places in 5807 ms of which 5 ms to minimize.
[2023-03-15 14:32:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 14:32:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:33:28] [INFO ] [Real]Absence check using state equation in 44693 ms returned unknown
[2023-03-15 14:33:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:33:36] [INFO ] [Real]Absence check using state equation in 8401 ms returned sat
[2023-03-15 14:33:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:33:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:34:22] [INFO ] [Nat]Absence check using state equation in 44683 ms returned unknown
[2023-03-15 14:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:35:07] [INFO ] [Real]Absence check using state equation in 44694 ms returned unknown
[2023-03-15 14:35:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:35:14] [INFO ] [Real]Absence check using state equation in 7066 ms returned unknown
[2023-03-15 14:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:35:59] [INFO ] [Real]Absence check using state equation in 44611 ms returned unknown
[2023-03-15 14:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:36:05] [INFO ] [Real]Absence check using state equation in 5590 ms returned sat
[2023-03-15 14:36:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:36:11] [INFO ] [Nat]Absence check using state equation in 6070 ms returned sat
[2023-03-15 14:36:15] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 14:36:18] [INFO ] [Nat]Added 393 Read/Feed constraints in 6103 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DoubleExponent-PT-100-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 15 out of 2409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2409/2409 places, 2302/2302 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2409 transition count 2301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2408 transition count 2301
Applied a total of 2 rules in 787 ms. Remains 2408 /2409 variables (removed 1) and now considering 2301/2302 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 787 ms. Remains : 2408/2409 places, 2301/2302 transitions.
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:36:19] [INFO ] Invariants computation overflowed in 45 ms
Incomplete random walk after 1000000 steps, including 127982 resets, run finished after 3007 ms. (steps per millisecond=332 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84358 resets, run finished after 1843 ms. (steps per millisecond=542 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84498 resets, run finished after 1895 ms. (steps per millisecond=527 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84414 resets, run finished after 1710 ms. (steps per millisecond=584 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000001 steps, including 83997 resets, run finished after 2034 ms. (steps per millisecond=491 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84255 resets, run finished after 1966 ms. (steps per millisecond=508 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84501 resets, run finished after 1878 ms. (steps per millisecond=532 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84177 resets, run finished after 2199 ms. (steps per millisecond=454 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84499 resets, run finished after 1946 ms. (steps per millisecond=513 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84350 resets, run finished after 1863 ms. (steps per millisecond=536 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84518 resets, run finished after 1699 ms. (steps per millisecond=588 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84646 resets, run finished after 1653 ms. (steps per millisecond=604 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84273 resets, run finished after 1654 ms. (steps per millisecond=604 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84529 resets, run finished after 1654 ms. (steps per millisecond=604 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84598 resets, run finished after 1656 ms. (steps per millisecond=603 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84408 resets, run finished after 1650 ms. (steps per millisecond=606 ) properties (out of 15) seen :0
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:36:49] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 14:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:36:54] [INFO ] [Real]Absence check using state equation in 5181 ms returned sat
[2023-03-15 14:36:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:36:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:36:59] [INFO ] [Nat]Absence check using state equation in 3731 ms returned sat
[2023-03-15 14:36:59] [INFO ] State equation strengthened by 394 read => feed constraints.
[2023-03-15 14:37:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 14:37:05] [INFO ] [Nat]Added 394 Read/Feed constraints in 6121 ms returned unknown
[2023-03-15 14:37:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:37:16] [INFO ] [Real]Absence check using state equation in 10270 ms returned sat
[2023-03-15 14:37:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:37:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:38:01] [INFO ] [Nat]Absence check using state equation in 44695 ms returned unknown
[2023-03-15 14:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:38:05] [INFO ] [Real]Absence check using state equation in 3813 ms returned sat
[2023-03-15 14:38:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:38:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:38:13] [INFO ] [Nat]Absence check using state equation in 7333 ms returned unknown
[2023-03-15 14:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:38:27] [INFO ] [Real]Absence check using state equation in 13819 ms returned sat
[2023-03-15 14:38:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:38:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:39:12] [INFO ] [Nat]Absence check using state equation in 44688 ms returned unknown
[2023-03-15 14:39:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:39:57] [INFO ] [Real]Absence check using state equation in 44703 ms returned unknown
[2023-03-15 14:39:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:40:42] [INFO ] [Real]Absence check using state equation in 44692 ms returned unknown
[2023-03-15 14:40:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:41:14] [INFO ] [Real]Absence check using state equation in 31693 ms returned sat
[2023-03-15 14:41:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:41:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:41:46] [INFO ] [Nat]Absence check using state equation in 31660 ms returned sat
[2023-03-15 14:41:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 14:41:53] [INFO ] [Nat]Added 394 Read/Feed constraints in 6743 ms returned unknown
[2023-03-15 14:41:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:41:58] [INFO ] [Real]Absence check using state equation in 5020 ms returned sat
[2023-03-15 14:41:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:41:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:42:04] [INFO ] [Nat]Absence check using state equation in 5099 ms returned sat
[2023-03-15 14:42:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 14:42:10] [INFO ] [Nat]Added 394 Read/Feed constraints in 6050 ms returned unknown
[2023-03-15 14:42:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:42:27] [INFO ] [Real]Absence check using state equation in 16623 ms returned unknown
[2023-03-15 14:42:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:42:32] [INFO ] [Real]Absence check using state equation in 4821 ms returned sat
[2023-03-15 14:42:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:42:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:43:08] [INFO ] [Nat]Absence check using state equation in 35684 ms returned sat
[2023-03-15 14:43:13] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 14:43:17] [INFO ] [Nat]Added 394 Read/Feed constraints in 8999 ms returned unknown
[2023-03-15 14:43:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:43:20] [INFO ] [Real]Absence check using state equation in 2111 ms returned sat
[2023-03-15 14:43:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:43:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:43:31] [INFO ] [Nat]Absence check using state equation in 11014 ms returned unknown
[2023-03-15 14:43:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:44:16] [INFO ] [Real]Absence check using state equation in 44709 ms returned unknown
[2023-03-15 14:44:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:44:24] [INFO ] [Real]Absence check using state equation in 7874 ms returned unknown
[2023-03-15 14:44:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:45:09] [INFO ] [Real]Absence check using state equation in 44558 ms returned unknown
[2023-03-15 14:45:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:45:54] [INFO ] [Real]Absence check using state equation in 44699 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 15 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Applied a total of 0 rules in 276 ms. Remains 2408 /2408 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 2408/2408 places, 2301/2301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Applied a total of 0 rules in 273 ms. Remains 2408 /2408 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:45:55] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 14:46:25] [INFO ] Performed 1637/2408 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 14:46:36] [INFO ] Implicit Places using invariants in 40920 ms returned []
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:46:36] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-15 14:46:37] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned []
Implicit Place search using SMT with State Equation took 42020 ms to find 0 implicit places.
[2023-03-15 14:46:37] [INFO ] Redundant transitions in 409 ms returned []
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:46:37] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-15 14:46:41] [INFO ] Dead Transitions using invariants and state equation in 3723 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46434 ms. Remains : 2408/2408 places, 2301/2301 transitions.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-00
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:46:41] [INFO ] Invariants computation overflowed in 63 ms
Incomplete random walk after 10000 steps, including 1294 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:46:42] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-15 14:46:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:46:47] [INFO ] [Real]Absence check using state equation in 4512 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 111 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 2398 transition count 2291
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 191 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 2396 transition count 2292
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 2396 transition count 2291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 26 place count 2395 transition count 2291
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 2395 transition count 2289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 2393 transition count 2289
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 2393 transition count 2289
Applied a total of 32 rules in 1917 ms. Remains 2393 /2408 variables (removed 15) and now considering 2289/2301 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1920 ms. Remains : 2393/2408 places, 2289/2301 transitions.
// Phase 1: matrix 2289 rows 2393 cols
[2023-03-15 14:46:49] [INFO ] Invariants computation overflowed in 44 ms
Incomplete random walk after 1000000 steps, including 127699 resets, run finished after 2161 ms. (steps per millisecond=462 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84408 resets, run finished after 1590 ms. (steps per millisecond=628 ) properties (out of 1) seen :0
// Phase 1: matrix 2289 rows 2393 cols
[2023-03-15 14:46:52] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 14:46:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:46:56] [INFO ] [Real]Absence check using state equation in 3555 ms returned sat
[2023-03-15 14:46:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:47:03] [INFO ] [Nat]Absence check using state equation in 6220 ms returned sat
[2023-03-15 14:47:03] [INFO ] State equation strengthened by 401 read => feed constraints.
[2023-03-15 14:47:06] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 14:47:09] [INFO ] [Nat]Added 401 Read/Feed constraints in 6214 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2393/2393 places, 2289/2289 transitions.
Applied a total of 0 rules in 276 ms. Remains 2393 /2393 variables (removed 0) and now considering 2289/2289 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 2393/2393 places, 2289/2289 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2393/2393 places, 2289/2289 transitions.
Applied a total of 0 rules in 274 ms. Remains 2393 /2393 variables (removed 0) and now considering 2289/2289 (removed 0) transitions.
// Phase 1: matrix 2289 rows 2393 cols
[2023-03-15 14:47:10] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-15 14:47:40] [INFO ] Performed 1683/2393 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 14:47:48] [INFO ] Implicit Places using invariants in 37744 ms returned []
// Phase 1: matrix 2289 rows 2393 cols
[2023-03-15 14:47:48] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 14:48:19] [INFO ] Performed 2027/2393 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 14:48:25] [INFO ] Implicit Places using invariants and state equation in 37251 ms returned []
Implicit Place search using SMT with State Equation took 74997 ms to find 0 implicit places.
[2023-03-15 14:48:25] [INFO ] Redundant transitions in 314 ms returned []
// Phase 1: matrix 2289 rows 2393 cols
[2023-03-15 14:48:25] [INFO ] Invariants computation overflowed in 66 ms
[2023-03-15 14:48:29] [INFO ] Dead Transitions using invariants and state equation in 3349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78946 ms. Remains : 2393/2393 places, 2289/2289 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-00 in 107420 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-01
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:48:29] [INFO ] Invariants computation overflowed in 66 ms
Incomplete random walk after 10000 steps, including 1281 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:48:29] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-15 14:48:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:48:34] [INFO ] [Real]Absence check using state equation in 4563 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 118 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 2400 transition count 2293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 123 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 2399 transition count 2293
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 2399 transition count 2292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 2398 transition count 2292
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 2398 transition count 2290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 2396 transition count 2290
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 2396 transition count 2290
Applied a total of 26 rules in 1507 ms. Remains 2396 /2408 variables (removed 12) and now considering 2290/2301 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1508 ms. Remains : 2396/2408 places, 2290/2301 transitions.
// Phase 1: matrix 2290 rows 2396 cols
[2023-03-15 14:48:36] [INFO ] Invariants computation overflowed in 48 ms
Incomplete random walk after 1000000 steps, including 127358 resets, run finished after 2269 ms. (steps per millisecond=440 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84263 resets, run finished after 1714 ms. (steps per millisecond=583 ) properties (out of 1) seen :0
// Phase 1: matrix 2290 rows 2396 cols
[2023-03-15 14:48:40] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-15 14:48:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:48:58] [INFO ] [Real]Absence check using state equation in 18100 ms returned sat
[2023-03-15 14:48:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:48:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:49:43] [INFO ] [Nat]Absence check using state equation in 44713 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2396/2396 places, 2290/2290 transitions.
Applied a total of 0 rules in 360 ms. Remains 2396 /2396 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 361 ms. Remains : 2396/2396 places, 2290/2290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2396/2396 places, 2290/2290 transitions.
Applied a total of 0 rules in 374 ms. Remains 2396 /2396 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
// Phase 1: matrix 2290 rows 2396 cols
[2023-03-15 14:49:44] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-15 14:50:14] [INFO ] Performed 1710/2396 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 14:50:24] [INFO ] Implicit Places using invariants in 40018 ms returned []
// Phase 1: matrix 2290 rows 2396 cols
[2023-03-15 14:50:24] [INFO ] Invariants computation overflowed in 88 ms
[2023-03-15 14:50:55] [INFO ] Performed 1630/2396 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 14:51:05] [INFO ] Implicit Places using invariants and state equation in 41494 ms returned []
Implicit Place search using SMT with State Equation took 81519 ms to find 0 implicit places.
[2023-03-15 14:51:06] [INFO ] Redundant transitions in 193 ms returned []
// Phase 1: matrix 2290 rows 2396 cols
[2023-03-15 14:51:06] [INFO ] Invariants computation overflowed in 83 ms
[2023-03-15 14:51:09] [INFO ] Dead Transitions using invariants and state equation in 3289 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85388 ms. Remains : 2396/2396 places, 2290/2290 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-01 in 160423 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-02
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:51:09] [INFO ] Invariants computation overflowed in 62 ms
Incomplete random walk after 10000 steps, including 1268 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 835 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:51:09] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-15 14:51:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:51:14] [INFO ] [Real]Absence check using state equation in 3958 ms returned sat
[2023-03-15 14:51:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:51:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:51:19] [INFO ] [Nat]Absence check using state equation in 4687 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 113 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 2399 transition count 2292
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 192 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 2397 transition count 2293
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 2397 transition count 2292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 2396 transition count 2292
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 2396 transition count 2290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 2394 transition count 2290
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 2394 transition count 2290
Applied a total of 30 rules in 1704 ms. Remains 2394 /2408 variables (removed 14) and now considering 2290/2301 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1705 ms. Remains : 2394/2408 places, 2290/2301 transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:51:21] [INFO ] Invariants computation overflowed in 72 ms
Incomplete random walk after 1000000 steps, including 127330 resets, run finished after 2210 ms. (steps per millisecond=452 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84520 resets, run finished after 1560 ms. (steps per millisecond=641 ) properties (out of 1) seen :0
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:51:25] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-15 14:51:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:51:30] [INFO ] [Real]Absence check using state equation in 4984 ms returned sat
[2023-03-15 14:51:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:51:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:51:41] [INFO ] [Nat]Absence check using state equation in 10120 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 271 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 352 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:51:42] [INFO ] Invariants computation overflowed in 118 ms
[2023-03-15 14:52:12] [INFO ] Performed 1815/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 14:52:20] [INFO ] Implicit Places using invariants in 38539 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:52:20] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-15 14:52:21] [INFO ] Implicit Places using invariants and state equation in 983 ms returned []
Implicit Place search using SMT with State Equation took 39523 ms to find 0 implicit places.
[2023-03-15 14:52:21] [INFO ] Redundant transitions in 177 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:52:21] [INFO ] Invariants computation overflowed in 112 ms
[2023-03-15 14:52:25] [INFO ] Dead Transitions using invariants and state equation in 3496 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43559 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-02 in 75806 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-03
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:52:25] [INFO ] Invariants computation overflowed in 71 ms
Incomplete random walk after 10000 steps, including 1275 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:52:25] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-15 14:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:52:30] [INFO ] [Real]Absence check using state equation in 4491 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 157 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 2398 transition count 2291
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 196 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 2396 transition count 2292
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 2396 transition count 2291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 26 place count 2395 transition count 2291
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 2395 transition count 2289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 2393 transition count 2289
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 2393 transition count 2289
Applied a total of 31 rules in 1899 ms. Remains 2393 /2408 variables (removed 15) and now considering 2289/2301 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1900 ms. Remains : 2393/2408 places, 2289/2301 transitions.
// Phase 1: matrix 2289 rows 2393 cols
[2023-03-15 14:52:32] [INFO ] Invariants computation overflowed in 43 ms
Incomplete random walk after 1000000 steps, including 127503 resets, run finished after 2407 ms. (steps per millisecond=415 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84281 resets, run finished after 1485 ms. (steps per millisecond=673 ) properties (out of 1) seen :0
// Phase 1: matrix 2289 rows 2393 cols
[2023-03-15 14:52:36] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 14:52:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:52:48] [INFO ] [Real]Absence check using state equation in 10934 ms returned sat
[2023-03-15 14:52:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:52:59] [INFO ] [Nat]Absence check using state equation in 11003 ms returned sat
[2023-03-15 14:52:59] [INFO ] State equation strengthened by 401 read => feed constraints.
[2023-03-15 14:53:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 14:53:10] [INFO ] [Nat]Added 401 Read/Feed constraints in 10584 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2393/2393 places, 2289/2289 transitions.
Applied a total of 0 rules in 309 ms. Remains 2393 /2393 variables (removed 0) and now considering 2289/2289 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 2393/2393 places, 2289/2289 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2393/2393 places, 2289/2289 transitions.
Applied a total of 0 rules in 430 ms. Remains 2393 /2393 variables (removed 0) and now considering 2289/2289 (removed 0) transitions.
// Phase 1: matrix 2289 rows 2393 cols
[2023-03-15 14:53:10] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 14:53:41] [INFO ] Performed 1656/2393 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 14:53:49] [INFO ] Implicit Places using invariants in 38772 ms returned []
// Phase 1: matrix 2289 rows 2393 cols
[2023-03-15 14:53:49] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-15 14:54:20] [INFO ] Performed 1627/2393 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 14:54:31] [INFO ] Implicit Places using invariants and state equation in 42079 ms returned []
Implicit Place search using SMT with State Equation took 80861 ms to find 0 implicit places.
[2023-03-15 14:54:31] [INFO ] Redundant transitions in 191 ms returned []
// Phase 1: matrix 2289 rows 2393 cols
[2023-03-15 14:54:32] [INFO ] Invariants computation overflowed in 70 ms
[2023-03-15 14:54:34] [INFO ] Dead Transitions using invariants and state equation in 2925 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84423 ms. Remains : 2393/2393 places, 2289/2289 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-03 in 129536 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-04
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:54:35] [INFO ] Invariants computation overflowed in 43 ms
Incomplete random walk after 10000 steps, including 1253 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:54:35] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 14:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:54:40] [INFO ] [Real]Absence check using state equation in 4623 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 127 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 2398 transition count 2291
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 191 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 2396 transition count 2292
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 2396 transition count 2291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 26 place count 2395 transition count 2291
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2395 transition count 2290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 2394 transition count 2290
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 2394 transition count 2290
Applied a total of 30 rules in 1691 ms. Remains 2394 /2408 variables (removed 14) and now considering 2290/2301 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1693 ms. Remains : 2394/2408 places, 2290/2301 transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:54:42] [INFO ] Invariants computation overflowed in 65 ms
Incomplete random walk after 1000000 steps, including 127782 resets, run finished after 2267 ms. (steps per millisecond=441 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84231 resets, run finished after 1479 ms. (steps per millisecond=676 ) properties (out of 1) seen :0
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:54:45] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-15 14:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:54:48] [INFO ] [Real]Absence check using state equation in 1874 ms returned sat
[2023-03-15 14:54:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 14:54:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 14:54:51] [INFO ] [Nat]Absence check using state equation in 2461 ms returned sat
[2023-03-15 14:54:51] [INFO ] State equation strengthened by 401 read => feed constraints.
[2023-03-15 14:54:54] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 14:54:57] [INFO ] [Nat]Added 401 Read/Feed constraints in 6053 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 294 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 294 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 441 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:54:57] [INFO ] Invariants computation overflowed in 64 ms
[2023-03-15 14:55:28] [INFO ] Performed 1809/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 14:55:36] [INFO ] Implicit Places using invariants in 38892 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:55:36] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-15 14:55:37] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 39875 ms to find 0 implicit places.
[2023-03-15 14:55:37] [INFO ] Redundant transitions in 183 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:55:38] [INFO ] Invariants computation overflowed in 105 ms
[2023-03-15 14:55:41] [INFO ] Dead Transitions using invariants and state equation in 3351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43860 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-04 in 66427 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-06
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:55:41] [INFO ] Invariants computation overflowed in 66 ms
Incomplete random walk after 10000 steps, including 1263 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:55:41] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-15 14:55:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:55:46] [INFO ] [Real]Absence check using state equation in 4515 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 116 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 2398 transition count 2291
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 190 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 2396 transition count 2292
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 2396 transition count 2291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 26 place count 2395 transition count 2291
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2395 transition count 2290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 2394 transition count 2290
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 2394 transition count 2290
Applied a total of 30 rules in 1684 ms. Remains 2394 /2408 variables (removed 14) and now considering 2290/2301 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1684 ms. Remains : 2394/2408 places, 2290/2301 transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:55:48] [INFO ] Invariants computation overflowed in 61 ms
Incomplete random walk after 1000000 steps, including 127247 resets, run finished after 2272 ms. (steps per millisecond=440 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84441 resets, run finished after 1478 ms. (steps per millisecond=676 ) properties (out of 1) seen :0
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:55:52] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-15 14:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:56:37] [INFO ] [Real]Absence check using state equation in 44664 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 267 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 272 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:56:37] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-15 14:57:08] [INFO ] Performed 1651/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 14:57:18] [INFO ] Implicit Places using invariants in 40165 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:57:18] [INFO ] Invariants computation overflowed in 102 ms
[2023-03-15 14:57:49] [INFO ] Performed 1595/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 14:58:00] [INFO ] Implicit Places using invariants and state equation in 42468 ms returned []
Implicit Place search using SMT with State Equation took 82636 ms to find 0 implicit places.
[2023-03-15 14:58:00] [INFO ] Redundant transitions in 192 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:58:00] [INFO ] Invariants computation overflowed in 102 ms
[2023-03-15 14:58:04] [INFO ] Dead Transitions using invariants and state equation in 4101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87211 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-06 in 143592 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-07
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:58:05] [INFO ] Invariants computation overflowed in 65 ms
Incomplete random walk after 10000 steps, including 1279 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 14:58:05] [INFO ] Invariants computation overflowed in 66 ms
[2023-03-15 14:58:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:58:10] [INFO ] [Real]Absence check using state equation in 4507 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 116 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 2399 transition count 2292
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 116 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 2397 transition count 2293
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 2397 transition count 2292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 2396 transition count 2292
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 2396 transition count 2290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 2394 transition count 2290
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 2394 transition count 2290
Applied a total of 30 rules in 1702 ms. Remains 2394 /2408 variables (removed 14) and now considering 2290/2301 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1702 ms. Remains : 2394/2408 places, 2290/2301 transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:58:12] [INFO ] Invariants computation overflowed in 58 ms
Incomplete random walk after 1000000 steps, including 127524 resets, run finished after 2299 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84411 resets, run finished after 1619 ms. (steps per millisecond=617 ) properties (out of 1) seen :0
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:58:16] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-15 14:58:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 14:59:01] [INFO ] [Real]Absence check using state equation in 44647 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 299 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 445 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:59:01] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-15 14:59:32] [INFO ] Performed 1601/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 14:59:43] [INFO ] Implicit Places using invariants in 41326 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 14:59:43] [INFO ] Invariants computation overflowed in 95 ms
[2023-03-15 15:00:14] [INFO ] Performed 1600/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 15:00:25] [INFO ] Implicit Places using invariants and state equation in 42299 ms returned []
Implicit Place search using SMT with State Equation took 83627 ms to find 0 implicit places.
[2023-03-15 15:00:25] [INFO ] Redundant transitions in 197 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:00:25] [INFO ] Invariants computation overflowed in 96 ms
[2023-03-15 15:00:29] [INFO ] Dead Transitions using invariants and state equation in 3857 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88137 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-07 in 144739 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-08
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 15:00:29] [INFO ] Invariants computation overflowed in 70 ms
Incomplete random walk after 10000 steps, including 1284 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 15:00:29] [INFO ] Invariants computation overflowed in 70 ms
[2023-03-15 15:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:00:34] [INFO ] [Real]Absence check using state equation in 4494 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 111 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 2400 transition count 2293
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 153 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 2398 transition count 2294
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 2398 transition count 2293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 2397 transition count 2293
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 2397 transition count 2291
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 2395 transition count 2291
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 2395 transition count 2291
Applied a total of 28 rules in 1669 ms. Remains 2395 /2408 variables (removed 13) and now considering 2291/2301 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1671 ms. Remains : 2395/2408 places, 2291/2301 transitions.
// Phase 1: matrix 2291 rows 2395 cols
[2023-03-15 15:00:36] [INFO ] Invariants computation overflowed in 41 ms
Incomplete random walk after 1000000 steps, including 127630 resets, run finished after 2028 ms. (steps per millisecond=493 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84244 resets, run finished after 1418 ms. (steps per millisecond=705 ) properties (out of 1) seen :0
// Phase 1: matrix 2291 rows 2395 cols
[2023-03-15 15:00:40] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 15:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:01:09] [INFO ] [Real]Absence check using state equation in 28983 ms returned sat
[2023-03-15 15:01:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 15:01:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 15:01:35] [INFO ] [Nat]Absence check using state equation in 25465 ms returned sat
[2023-03-15 15:01:35] [INFO ] State equation strengthened by 399 read => feed constraints.
[2023-03-15 15:01:38] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 15:01:41] [INFO ] [Nat]Added 399 Read/Feed constraints in 5787 ms returned sat
[2023-03-15 15:01:43] [INFO ] Computed and/alt/rep : 1802/11362/1802 causal constraints (skipped 488 transitions) in 1536 ms.
[2023-03-15 15:01:49] [INFO ] Added : 40 causal constraints over 8 iterations in 8289 ms. Result :sat
Minimization took 3003 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2395/2395 places, 2291/2291 transitions.
Applied a total of 0 rules in 379 ms. Remains 2395 /2395 variables (removed 0) and now considering 2291/2291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 2395/2395 places, 2291/2291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2395/2395 places, 2291/2291 transitions.
Applied a total of 0 rules in 331 ms. Remains 2395 /2395 variables (removed 0) and now considering 2291/2291 (removed 0) transitions.
// Phase 1: matrix 2291 rows 2395 cols
[2023-03-15 15:01:53] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 15:02:23] [INFO ] Performed 1617/2395 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 15:02:34] [INFO ] Implicit Places using invariants in 41269 ms returned []
// Phase 1: matrix 2291 rows 2395 cols
[2023-03-15 15:02:34] [INFO ] Invariants computation overflowed in 73 ms
[2023-03-15 15:02:35] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 42320 ms to find 0 implicit places.
[2023-03-15 15:02:36] [INFO ] Redundant transitions in 167 ms returned []
// Phase 1: matrix 2291 rows 2395 cols
[2023-03-15 15:02:36] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-15 15:02:39] [INFO ] Dead Transitions using invariants and state equation in 3366 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46194 ms. Remains : 2395/2395 places, 2291/2291 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-08 in 129730 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-09
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 15:02:39] [INFO ] Invariants computation overflowed in 45 ms
Incomplete random walk after 10000 steps, including 1279 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 15:02:39] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 15:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:02:44] [INFO ] [Real]Absence check using state equation in 4615 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 125 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 2399 transition count 2292
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 143 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 2397 transition count 2293
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 2397 transition count 2292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 2396 transition count 2292
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 2396 transition count 2290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 2394 transition count 2290
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 2394 transition count 2290
Applied a total of 30 rules in 1733 ms. Remains 2394 /2408 variables (removed 14) and now considering 2290/2301 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1734 ms. Remains : 2394/2408 places, 2290/2301 transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:02:46] [INFO ] Invariants computation overflowed in 43 ms
Incomplete random walk after 1000000 steps, including 127499 resets, run finished after 2655 ms. (steps per millisecond=376 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84267 resets, run finished after 1508 ms. (steps per millisecond=663 ) properties (out of 1) seen :0
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:02:50] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-15 15:02:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:03:10] [INFO ] [Real]Absence check using state equation in 19395 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 288 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 447 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:03:11] [INFO ] Invariants computation overflowed in 64 ms
[2023-03-15 15:03:41] [INFO ] Performed 1622/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 15:03:51] [INFO ] Implicit Places using invariants in 40314 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:03:51] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-15 15:04:22] [INFO ] Performed 1808/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 15:04:31] [INFO ] Implicit Places using invariants and state equation in 39845 ms returned []
Implicit Place search using SMT with State Equation took 80161 ms to find 0 implicit places.
[2023-03-15 15:04:31] [INFO ] Redundant transitions in 193 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:04:31] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-15 15:04:35] [INFO ] Dead Transitions using invariants and state equation in 3683 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84493 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-09 in 116020 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-10
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 15:04:35] [INFO ] Invariants computation overflowed in 42 ms
Incomplete random walk after 10000 steps, including 1296 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 819 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 15:04:35] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 15:04:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:04:40] [INFO ] [Real]Absence check using state equation in 4612 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 138 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 2398 transition count 2291
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 191 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 2396 transition count 2292
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 2396 transition count 2290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 2394 transition count 2290
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 2394 transition count 2290
Applied a total of 30 rules in 1430 ms. Remains 2394 /2408 variables (removed 14) and now considering 2290/2301 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1431 ms. Remains : 2394/2408 places, 2290/2301 transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:04:42] [INFO ] Invariants computation overflowed in 61 ms
Incomplete random walk after 1000000 steps, including 127778 resets, run finished after 2270 ms. (steps per millisecond=440 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84378 resets, run finished after 1626 ms. (steps per millisecond=615 ) properties (out of 1) seen :0
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:04:46] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-15 15:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:05:22] [INFO ] [Real]Absence check using state equation in 35997 ms returned sat
[2023-03-15 15:05:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 15:05:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 15:06:07] [INFO ] [Nat]Absence check using state equation in 44537 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 267 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 268 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:06:08] [INFO ] Invariants computation overflowed in 64 ms
[2023-03-15 15:06:38] [INFO ] Performed 1750/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 15:06:47] [INFO ] Implicit Places using invariants in 39622 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:06:48] [INFO ] Invariants computation overflowed in 100 ms
[2023-03-15 15:07:19] [INFO ] Performed 1629/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 15:07:29] [INFO ] Implicit Places using invariants and state equation in 41731 ms returned []
Implicit Place search using SMT with State Equation took 81358 ms to find 0 implicit places.
[2023-03-15 15:07:29] [INFO ] Redundant transitions in 194 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:07:30] [INFO ] Invariants computation overflowed in 101 ms
[2023-03-15 15:07:33] [INFO ] Dead Transitions using invariants and state equation in 3458 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85291 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-10 in 178004 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-11
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 15:07:33] [INFO ] Invariants computation overflowed in 43 ms
Incomplete random walk after 10000 steps, including 1247 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 811 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 15:07:33] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 15:07:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:07:36] [INFO ] [Real]Absence check using state equation in 2668 ms returned sat
[2023-03-15 15:07:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 15:07:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 15:07:41] [INFO ] [Nat]Absence check using state equation in 4618 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 118 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 2399 transition count 2292
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 113 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 2397 transition count 2293
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 2397 transition count 2292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 2396 transition count 2292
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 2396 transition count 2290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 2394 transition count 2290
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 2394 transition count 2290
Applied a total of 30 rules in 1485 ms. Remains 2394 /2408 variables (removed 14) and now considering 2290/2301 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1486 ms. Remains : 2394/2408 places, 2290/2301 transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:07:43] [INFO ] Invariants computation overflowed in 63 ms
Incomplete random walk after 1000000 steps, including 127922 resets, run finished after 2137 ms. (steps per millisecond=467 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84418 resets, run finished after 1471 ms. (steps per millisecond=679 ) properties (out of 1) seen :0
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:07:47] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-15 15:07:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:07:57] [INFO ] [Real]Absence check using state equation in 9753 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 268 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 317 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:07:58] [INFO ] Invariants computation overflowed in 80 ms
[2023-03-15 15:08:28] [INFO ] Performed 1893/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 15:08:35] [INFO ] Implicit Places using invariants in 37433 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:08:35] [INFO ] Invariants computation overflowed in 104 ms
[2023-03-15 15:09:06] [INFO ] Performed 1835/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 15:09:14] [INFO ] Implicit Places using invariants and state equation in 39453 ms returned []
Implicit Place search using SMT with State Equation took 76888 ms to find 0 implicit places.
[2023-03-15 15:09:15] [INFO ] Redundant transitions in 192 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:09:15] [INFO ] Invariants computation overflowed in 104 ms
[2023-03-15 15:09:18] [INFO ] Dead Transitions using invariants and state equation in 3398 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80802 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-11 in 105206 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-12
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 15:09:18] [INFO ] Invariants computation overflowed in 60 ms
Incomplete random walk after 10000 steps, including 1252 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 15:09:18] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 15:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:09:23] [INFO ] [Real]Absence check using state equation in 4503 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 112 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 2398 transition count 2291
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 112 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 2396 transition count 2292
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 2396 transition count 2291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 26 place count 2395 transition count 2291
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 2395 transition count 2289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 2393 transition count 2289
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 2393 transition count 2289
Applied a total of 31 rules in 1561 ms. Remains 2393 /2408 variables (removed 15) and now considering 2289/2301 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1562 ms. Remains : 2393/2408 places, 2289/2301 transitions.
// Phase 1: matrix 2289 rows 2393 cols
[2023-03-15 15:09:25] [INFO ] Invariants computation overflowed in 44 ms
Incomplete random walk after 1000000 steps, including 127483 resets, run finished after 2451 ms. (steps per millisecond=407 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84436 resets, run finished after 1473 ms. (steps per millisecond=678 ) properties (out of 1) seen :0
// Phase 1: matrix 2289 rows 2393 cols
[2023-03-15 15:09:29] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 15:09:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:10:14] [INFO ] [Real]Absence check using state equation in 44589 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2393/2393 places, 2289/2289 transitions.
Applied a total of 0 rules in 328 ms. Remains 2393 /2393 variables (removed 0) and now considering 2289/2289 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 2393/2393 places, 2289/2289 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2393/2393 places, 2289/2289 transitions.
Applied a total of 0 rules in 370 ms. Remains 2393 /2393 variables (removed 0) and now considering 2289/2289 (removed 0) transitions.
// Phase 1: matrix 2289 rows 2393 cols
[2023-03-15 15:10:15] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 15:10:45] [INFO ] Performed 1707/2393 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 15:10:53] [INFO ] Implicit Places using invariants in 38042 ms returned []
// Phase 1: matrix 2289 rows 2393 cols
[2023-03-15 15:10:53] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-15 15:11:24] [INFO ] Performed 1808/2393 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 15:11:32] [INFO ] Implicit Places using invariants and state equation in 38764 ms returned []
Implicit Place search using SMT with State Equation took 76812 ms to find 0 implicit places.
[2023-03-15 15:11:32] [INFO ] Redundant transitions in 193 ms returned []
// Phase 1: matrix 2289 rows 2393 cols
[2023-03-15 15:11:32] [INFO ] Invariants computation overflowed in 70 ms
[2023-03-15 15:11:35] [INFO ] Dead Transitions using invariants and state equation in 3277 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80662 ms. Remains : 2393/2393 places, 2289/2289 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-12 in 137100 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-13
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 15:11:35] [INFO ] Invariants computation overflowed in 50 ms
Incomplete random walk after 10000 steps, including 1279 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 15:11:35] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-15 15:11:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:11:40] [INFO ] [Real]Absence check using state equation in 4608 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 117 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 2399 transition count 2292
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 191 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 2397 transition count 2293
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 2397 transition count 2292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 2396 transition count 2292
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 2396 transition count 2290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 2394 transition count 2290
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 2394 transition count 2290
Applied a total of 30 rules in 1905 ms. Remains 2394 /2408 variables (removed 14) and now considering 2290/2301 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1905 ms. Remains : 2394/2408 places, 2290/2301 transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:11:43] [INFO ] Invariants computation overflowed in 72 ms
Incomplete random walk after 1000000 steps, including 127565 resets, run finished after 2280 ms. (steps per millisecond=438 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84409 resets, run finished after 1732 ms. (steps per millisecond=577 ) properties (out of 1) seen :0
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:11:47] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-15 15:11:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:11:51] [INFO ] [Real]Absence check using state equation in 4082 ms returned sat
[2023-03-15 15:11:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 15:11:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 15:12:09] [INFO ] [Nat]Absence check using state equation in 17707 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 268 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 267 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:12:10] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-15 15:12:40] [INFO ] Performed 1761/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 15:12:50] [INFO ] Implicit Places using invariants in 39854 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:12:50] [INFO ] Invariants computation overflowed in 119 ms
[2023-03-15 15:13:21] [INFO ] Performed 1651/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 15:13:31] [INFO ] Implicit Places using invariants and state equation in 41409 ms returned []
Implicit Place search using SMT with State Equation took 81274 ms to find 0 implicit places.
[2023-03-15 15:13:31] [INFO ] Redundant transitions in 126 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:13:31] [INFO ] Invariants computation overflowed in 85 ms
[2023-03-15 15:13:35] [INFO ] Dead Transitions using invariants and state equation in 3241 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84916 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-13 in 119530 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-14
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 15:13:35] [INFO ] Invariants computation overflowed in 74 ms
Incomplete random walk after 10000 steps, including 1280 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 864 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 15:13:35] [INFO ] Invariants computation overflowed in 78 ms
[2023-03-15 15:13:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:13:40] [INFO ] [Real]Absence check using state equation in 4499 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 114 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 2399 transition count 2292
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 196 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 2397 transition count 2293
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 2397 transition count 2292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 2396 transition count 2292
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 2396 transition count 2290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 2394 transition count 2290
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 2394 transition count 2290
Applied a total of 30 rules in 1886 ms. Remains 2394 /2408 variables (removed 14) and now considering 2290/2301 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1886 ms. Remains : 2394/2408 places, 2290/2301 transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:13:42] [INFO ] Invariants computation overflowed in 46 ms
Incomplete random walk after 1000000 steps, including 127374 resets, run finished after 2482 ms. (steps per millisecond=402 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84586 resets, run finished after 1698 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:13:46] [INFO ] Invariants computation overflowed in 69 ms
[2023-03-15 15:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:14:31] [INFO ] [Real]Absence check using state equation in 44538 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 267 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2290/2290 transitions.
Applied a total of 0 rules in 359 ms. Remains 2394 /2394 variables (removed 0) and now considering 2290/2290 (removed 0) transitions.
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:14:32] [INFO ] Invariants computation overflowed in 77 ms
[2023-03-15 15:15:03] [INFO ] Performed 1729/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 15:15:12] [INFO ] Implicit Places using invariants in 39936 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:15:12] [INFO ] Invariants computation overflowed in 77 ms
[2023-03-15 15:15:43] [INFO ] Performed 1673/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 15:15:53] [INFO ] Implicit Places using invariants and state equation in 40725 ms returned []
Implicit Place search using SMT with State Equation took 80663 ms to find 0 implicit places.
[2023-03-15 15:15:53] [INFO ] Redundant transitions in 192 ms returned []
// Phase 1: matrix 2290 rows 2394 cols
[2023-03-15 15:15:53] [INFO ] Invariants computation overflowed in 77 ms
[2023-03-15 15:15:56] [INFO ] Dead Transitions using invariants and state equation in 3447 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84671 ms. Remains : 2394/2394 places, 2290/2290 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-14 in 141686 ms.
Starting property specific reduction for DoubleExponent-PT-100-UpperBounds-15
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 15:15:57] [INFO ] Invariants computation overflowed in 61 ms
Incomplete random walk after 10000 steps, including 1250 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 815 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
// Phase 1: matrix 2301 rows 2408 cols
[2023-03-15 15:15:57] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-15 15:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:16:02] [INFO ] [Real]Absence check using state equation in 4501 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2408/2408 places, 2301/2301 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 137 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 2398 transition count 2291
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 137 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 2397 transition count 2292
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 2397 transition count 2291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 2396 transition count 2291
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 2396 transition count 2289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 2394 transition count 2289
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 2394 transition count 2289
Applied a total of 30 rules in 1588 ms. Remains 2394 /2408 variables (removed 14) and now considering 2289/2301 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1588 ms. Remains : 2394/2408 places, 2289/2301 transitions.
// Phase 1: matrix 2289 rows 2394 cols
[2023-03-15 15:16:04] [INFO ] Invariants computation overflowed in 83 ms
Incomplete random walk after 1000000 steps, including 127562 resets, run finished after 2448 ms. (steps per millisecond=408 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84432 resets, run finished after 1777 ms. (steps per millisecond=562 ) properties (out of 1) seen :0
// Phase 1: matrix 2289 rows 2394 cols
[2023-03-15 15:16:08] [INFO ] Invariants computation overflowed in 116 ms
[2023-03-15 15:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 15:16:53] [INFO ] [Real]Absence check using state equation in 44508 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 2394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2289/2289 transitions.
Applied a total of 0 rules in 269 ms. Remains 2394 /2394 variables (removed 0) and now considering 2289/2289 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 2394/2394 places, 2289/2289 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2394/2394 places, 2289/2289 transitions.
Applied a total of 0 rules in 297 ms. Remains 2394 /2394 variables (removed 0) and now considering 2289/2289 (removed 0) transitions.
// Phase 1: matrix 2289 rows 2394 cols
[2023-03-15 15:16:54] [INFO ] Invariants computation overflowed in 82 ms
[2023-03-15 15:17:24] [INFO ] Performed 1678/2394 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 15:17:34] [INFO ] Implicit Places using invariants in 40216 ms returned []
// Phase 1: matrix 2289 rows 2394 cols
[2023-03-15 15:17:34] [INFO ] Invariants computation overflowed in 115 ms
[2023-03-15 15:17:35] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 41311 ms to find 0 implicit places.
[2023-03-15 15:17:35] [INFO ] Redundant transitions in 167 ms returned []
// Phase 1: matrix 2289 rows 2394 cols
[2023-03-15 15:17:35] [INFO ] Invariants computation overflowed in 98 ms
[2023-03-15 15:17:38] [INFO ] Dead Transitions using invariants and state equation in 2773 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44558 ms. Remains : 2394/2394 places, 2289/2289 transitions.
Ending property specific reduction for DoubleExponent-PT-100-UpperBounds-15 in 101385 ms.
[2023-03-15 15:17:40] [INFO ] Flatten gal took : 1804 ms
[2023-03-15 15:17:40] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-15 15:17:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2408 places, 2301 transitions and 59747 arcs took 64 ms.
Total runtime 3162590 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: DoubleExponent_PT_100
(NrP: 2408 NrTr: 2301 NrArc: 59747)
parse formulas
formulas created successfully
place and transition orderings generation:0m 4.421sec
net check time: 0m 0.019sec
init dd package: 0m 3.306sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10193924 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16090804 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.104sec
23124 34291 45340 54021 60208 68826 77076 86948 93084 101678 109633
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="DoubleExponent-PT-100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is DoubleExponent-PT-100, 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 r138-smll-167819420900493"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 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 ;