About the Execution of 2022-gold for DoubleExponent-PT-200
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3291.539 | 3600000.00 | 3718349.00 | 9733.10 | [undef] | Time out reached |
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.r159-smll-167819445200063.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 gold2022
Input is DoubleExponent-PT-200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-smll-167819445200063
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.8K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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 3.5M 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-200-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-200-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678473147844
Running Version 202205111006
[2023-03-10 18:32:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 18:32:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 18:32:31] [INFO ] Load time of PNML (sax parser for PT used): 711 ms
[2023-03-10 18:32:31] [INFO ] Transformed 10604 places.
[2023-03-10 18:32:31] [INFO ] Transformed 9998 transitions.
[2023-03-10 18:32:31] [INFO ] Parsed PT model containing 10604 places and 9998 transitions in 950 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 135 ms.
// Phase 1: matrix 9998 rows 10604 cols
[2023-03-10 18:32:36] [INFO ] Invariants computation overflowed in 781 ms
Incomplete random walk after 10000 steps, including 337 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 274 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 275 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :0
// Phase 1: matrix 9998 rows 10604 cols
[2023-03-10 18:32:38] [INFO ] Invariants computation overflowed in 319 ms
[2023-03-10 18:32:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18: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: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-10 18:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:32:48] [INFO ] [Real]Absence check using state equation in 3071 ms returned unknown
[2023-03-10 18:32:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:32:53] [INFO ] [Real]Absence check using state equation in 3115 ms returned unknown
[2023-03-10 18:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:32:58] [INFO ] [Real]Absence check using state equation in 3244 ms returned unknown
[2023-03-10 18:33:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:33:03] [INFO ] [Real]Absence check using state equation in 3091 ms returned unknown
[2023-03-10 18:33:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:33:08] [INFO ] [Real]Absence check using state equation in 3235 ms returned unknown
[2023-03-10 18:33:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:33:13] [INFO ] [Real]Absence check using state equation in 3242 ms returned unknown
[2023-03-10 18:33:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:33:18] [INFO ] [Real]Absence check using state equation in 3241 ms returned unknown
[2023-03-10 18:33:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:33:23] [INFO ] [Real]Absence check using state equation in 3254 ms returned unknown
[2023-03-10 18:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:33:28] [INFO ] [Real]Absence check using state equation in 3172 ms returned unknown
[2023-03-10 18:33:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:33:33] [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: Broken pipe ... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-10 18:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:33:38] [INFO ] [Real]Absence check using state equation in 3240 ms returned unknown
[2023-03-10 18:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:33:43] [INFO ] [Real]Absence check using state equation in 3201 ms returned unknown
[2023-03-10 18:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:33:48] [INFO ] [Real]Absence check using state equation in 3234 ms returned unknown
[2023-03-10 18:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:33:53] [INFO ] [Real]Absence check using state equation in 3049 ms returned unknown
[2023-03-10 18:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:33:58] [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: Broken pipe ... while checking expression at index 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 10604 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10604/10604 places, 9998/9998 transitions.
Graph (complete) has 18196 edges and 10604 vertex of which 10598 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.40 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 2378 transitions
Trivial Post-agglo rules discarded 2378 transitions
Performed 2378 trivial Post agglomeration. Transition count delta: 2378
Iterating post reduction 0 with 2381 rules applied. Total rules applied 2382 place count 10597 transition count 7618
Reduce places removed 2378 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 2387 rules applied. Total rules applied 4769 place count 8219 transition count 7609
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 4778 place count 8210 transition count 7609
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 402 Pre rules applied. Total rules applied 4778 place count 8210 transition count 7207
Deduced a syphon composed of 402 places in 1079 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 3 with 804 rules applied. Total rules applied 5582 place count 7808 transition count 7207
Performed 1799 Post agglomeration using F-continuation condition.Transition count delta: 1799
Deduced a syphon composed of 1799 places in 878 ms
Reduce places removed 1799 places and 0 transitions.
Iterating global reduction 3 with 3598 rules applied. Total rules applied 9180 place count 6009 transition count 5408
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 304 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9382 place count 5908 transition count 5408
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 307 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9584 place count 5807 transition count 5408
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 288 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9786 place count 5706 transition count 5408
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 392 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 9976 place count 5611 transition count 5408
Free-agglomeration rule (complex) applied 802 times.
Iterating global reduction 3 with 802 rules applied. Total rules applied 10778 place count 5611 transition count 4606
Reduce places removed 802 places and 0 transitions.
Iterating post reduction 3 with 802 rules applied. Total rules applied 11580 place count 4809 transition count 4606
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 800 times.
Drop transitions removed 800 transitions
Iterating global reduction 4 with 800 rules applied. Total rules applied 12380 place count 4809 transition count 4606
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 12381 place count 4808 transition count 4605
Applied a total of 12381 rules in 14589 ms. Remains 4808 /10604 variables (removed 5796) and now considering 4605/9998 (removed 5393) transitions.
Finished structural reductions, in 1 iterations. Remains : 4808/10604 places, 4605/9998 transitions.
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 18:34:14] [INFO ] Invariants computation overflowed in 159 ms
Incomplete random walk after 1000000 steps, including 128328 resets, run finished after 4316 ms. (steps per millisecond=231 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84617 resets, run finished after 2401 ms. (steps per millisecond=416 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84760 resets, run finished after 2471 ms. (steps per millisecond=404 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84643 resets, run finished after 2259 ms. (steps per millisecond=442 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84792 resets, run finished after 2251 ms. (steps per millisecond=444 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84735 resets, run finished after 2258 ms. (steps per millisecond=442 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84609 resets, run finished after 2323 ms. (steps per millisecond=430 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84842 resets, run finished after 2373 ms. (steps per millisecond=421 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84787 resets, run finished after 2368 ms. (steps per millisecond=422 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84684 resets, run finished after 2368 ms. (steps per millisecond=422 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84597 resets, run finished after 2386 ms. (steps per millisecond=419 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84645 resets, run finished after 2423 ms. (steps per millisecond=412 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 85028 resets, run finished after 2376 ms. (steps per millisecond=420 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84880 resets, run finished after 2383 ms. (steps per millisecond=419 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84304 resets, run finished after 2422 ms. (steps per millisecond=412 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84882 resets, run finished after 2425 ms. (steps per millisecond=412 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84526 resets, run finished after 2407 ms. (steps per millisecond=415 ) properties (out of 16) seen :1
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 18:34:56] [INFO ] Invariants computation overflowed in 299 ms
[2023-03-10 18:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:35:23] [INFO ] [Real]Absence check using state equation in 25980 ms returned sat
[2023-03-10 18:35:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:35:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:35:47] [INFO ] [Nat]Absence check using state equation in 22618 ms returned sat
[2023-03-10 18:35:47] [INFO ] State equation strengthened by 795 read => feed constraints.
[2023-03-10 18:35:50] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:35:53] [INFO ] [Nat]Added 795 Read/Feed constraints in 6220 ms returned unknown
[2023-03-10 18:35:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:36:38] [INFO ] [Real]Absence check using state equation in 44243 ms returned unknown
[2023-03-10 18:36:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:37:14] [INFO ] [Real]Absence check using state equation in 34438 ms returned sat
[2023-03-10 18:37:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:37:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:37:52] [INFO ] [Nat]Absence check using state equation in 37647 ms returned unknown
[2023-03-10 18:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:38:37] [INFO ] [Real]Absence check using state equation in 44212 ms returned unknown
[2023-03-10 18:38:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:39:22] [INFO ] [Real]Absence check using state equation in 44245 ms returned unknown
[2023-03-10 18:39:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:40:07] [INFO ] [Real]Absence check using state equation in 44381 ms returned unknown
[2023-03-10 18:40:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:40:30] [INFO ] [Real]Absence check using state equation in 21706 ms returned sat
[2023-03-10 18:40:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:40:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:41:07] [INFO ] [Nat]Absence check using state equation in 35304 ms returned sat
[2023-03-10 18:41:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:41:16] [INFO ] [Nat]Added 795 Read/Feed constraints in 8882 ms returned unknown
[2023-03-10 18:41:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:41:27] [INFO ] [Real]Absence check using state equation in 10559 ms returned sat
[2023-03-10 18:41:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:41:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:41:39] [INFO ] [Nat]Absence check using state equation in 11056 ms returned sat
[2023-03-10 18:41:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:41:45] [INFO ] [Nat]Added 795 Read/Feed constraints in 6142 ms returned unknown
[2023-03-10 18:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:42:30] [INFO ] [Real]Absence check using state equation in 44375 ms returned unknown
[2023-03-10 18:42:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:43:15] [INFO ] [Real]Absence check using state equation in 44391 ms returned unknown
[2023-03-10 18:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:44:00] [INFO ] [Real]Absence check using state equation in 44383 ms returned unknown
[2023-03-10 18:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:44:45] [INFO ] [Real]Absence check using state equation in 44403 ms returned unknown
[2023-03-10 18:44:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:45:31] [INFO ] [Real]Absence check using state equation in 44412 ms returned unknown
[2023-03-10 18:45:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:45:39] [INFO ] [Real]Absence check using state equation in 8289 ms returned sat
[2023-03-10 18:45:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:45:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:45:49] [INFO ] [Nat]Absence check using state equation in 8545 ms returned sat
[2023-03-10 18:45:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:46:12] [INFO ] [Nat]Added 795 Read/Feed constraints in 23382 ms returned unknown
[2023-03-10 18:46:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:46:55] [INFO ] [Real]Absence check using state equation in 42277 ms returned sat
[2023-03-10 18:46:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:46:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:47:41] [INFO ] [Nat]Absence check using state equation in 44182 ms returned unknown
[2023-03-10 18:47:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:48:06] [INFO ] [Real]Absence check using state equation in 24410 ms returned sat
[2023-03-10 18:48:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:48:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:48:14] [INFO ] [Nat]Absence check using state equation in 6686 ms returned sat
[2023-03-10 18:48:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:48:20] [INFO ] [Nat]Added 795 Read/Feed constraints in 6128 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, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
Support contains 16 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4808/4808 places, 4605/4605 transitions.
Applied a total of 0 rules in 1410 ms. Remains 4808 /4808 variables (removed 0) and now considering 4605/4605 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4808/4808 places, 4605/4605 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4808/4808 places, 4605/4605 transitions.
Applied a total of 0 rules in 1353 ms. Remains 4808 /4808 variables (removed 0) and now considering 4605/4605 (removed 0) transitions.
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 18:48:23] [INFO ] Invariants computation overflowed in 165 ms
[2023-03-10 18:48:54] [INFO ] Performed 804/4808 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-10 18:49:24] [INFO ] Performed 1428/4808 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-10 18:49:54] [INFO ] Performed 2170/4808 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-10 18:50:25] [INFO ] Performed 2914/4808 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2023-03-10 18:50:25] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2023-03-10 18:50:25] [INFO ] Implicit Places using invariants in 121611 ms returned []
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 18:50:25] [INFO ] Invariants computation overflowed in 208 ms
[2023-03-10 18:50:26] [INFO ] Implicit Places using invariants and state equation in 1722 ms returned []
Implicit Place search using SMT with State Equation took 123340 ms to find 0 implicit places.
[2023-03-10 18:50:27] [INFO ] Redundant transitions in 933 ms returned []
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 18:50:27] [INFO ] Invariants computation overflowed in 136 ms
[2023-03-10 18:50:28] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4808/4808 places, 4605/4605 transitions.
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 18:50:29] [INFO ] Invariants computation overflowed in 208 ms
Incomplete random walk after 1000000 steps, including 128283 resets, run finished after 3794 ms. (steps per millisecond=263 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84988 resets, run finished after 2523 ms. (steps per millisecond=396 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84842 resets, run finished after 2434 ms. (steps per millisecond=410 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84514 resets, run finished after 2433 ms. (steps per millisecond=411 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84811 resets, run finished after 2491 ms. (steps per millisecond=401 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84694 resets, run finished after 2537 ms. (steps per millisecond=394 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84705 resets, run finished after 2546 ms. (steps per millisecond=392 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84801 resets, run finished after 2545 ms. (steps per millisecond=392 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84680 resets, run finished after 2357 ms. (steps per millisecond=424 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84677 resets, run finished after 2172 ms. (steps per millisecond=460 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84614 resets, run finished after 2443 ms. (steps per millisecond=409 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84739 resets, run finished after 2369 ms. (steps per millisecond=422 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84372 resets, run finished after 2258 ms. (steps per millisecond=442 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84826 resets, run finished after 2147 ms. (steps per millisecond=465 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000001 steps, including 85011 resets, run finished after 2156 ms. (steps per millisecond=463 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84846 resets, run finished after 2378 ms. (steps per millisecond=420 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000001 steps, including 85003 resets, run finished after 2454 ms. (steps per millisecond=407 ) properties (out of 16) seen :1
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 18:51:11] [INFO ] Invariants computation overflowed in 140 ms
[2023-03-10 18:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:51:40] [INFO ] [Real]Absence check using state equation in 28232 ms returned sat
[2023-03-10 18:51:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:51:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:52:06] [INFO ] [Nat]Absence check using state equation in 23996 ms returned sat
[2023-03-10 18:52:06] [INFO ] State equation strengthened by 795 read => feed constraints.
[2023-03-10 18:52:09] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:52:12] [INFO ] [Nat]Added 795 Read/Feed constraints in 6196 ms returned unknown
[2023-03-10 18:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:52:57] [INFO ] [Real]Absence check using state equation in 44048 ms returned unknown
[2023-03-10 18:52:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:53:33] [INFO ] [Real]Absence check using state equation in 34643 ms returned sat
[2023-03-10 18:53:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:53:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:54:12] [INFO ] [Nat]Absence check using state equation in 37925 ms returned unknown
[2023-03-10 18:54:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:54:57] [INFO ] [Real]Absence check using state equation in 44316 ms returned unknown
[2023-03-10 18:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:55:42] [INFO ] [Real]Absence check using state equation in 44195 ms returned unknown
[2023-03-10 18:55:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:56:27] [INFO ] [Real]Absence check using state equation in 44033 ms returned unknown
[2023-03-10 18:56:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:56:53] [INFO ] [Real]Absence check using state equation in 24893 ms returned sat
[2023-03-10 18:56:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:56:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:57:33] [INFO ] [Nat]Absence check using state equation in 38235 ms returned sat
[2023-03-10 18:57:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:57:39] [INFO ] [Nat]Added 795 Read/Feed constraints in 5902 ms returned unknown
[2023-03-10 18:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:57:51] [INFO ] [Real]Absence check using state equation in 11562 ms returned sat
[2023-03-10 18:57:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:57:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:58:04] [INFO ] [Nat]Absence check using state equation in 11281 ms returned sat
[2023-03-10 18:58:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:58:10] [INFO ] [Nat]Added 795 Read/Feed constraints in 6066 ms returned unknown
[2023-03-10 18:58:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:58:55] [INFO ] [Real]Absence check using state equation in 44383 ms returned unknown
[2023-03-10 18:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:59:40] [INFO ] [Real]Absence check using state equation in 44201 ms returned unknown
[2023-03-10 18:59:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:00:25] [INFO ] [Real]Absence check using state equation in 44252 ms returned unknown
[2023-03-10 19:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:01:10] [INFO ] [Real]Absence check using state equation in 44172 ms returned unknown
[2023-03-10 19:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:01:55] [INFO ] [Real]Absence check using state equation in 44183 ms returned unknown
[2023-03-10 19:01:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:02:04] [INFO ] [Real]Absence check using state equation in 8491 ms returned sat
[2023-03-10 19:02:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:02:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:02:14] [INFO ] [Nat]Absence check using state equation in 8689 ms returned sat
[2023-03-10 19:02:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:02:27] [INFO ] [Nat]Added 795 Read/Feed constraints in 12766 ms returned unknown
[2023-03-10 19:02:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:03:12] [INFO ] [Real]Absence check using state equation in 44232 ms returned unknown
[2023-03-10 19:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:03:37] [INFO ] [Real]Absence check using state equation in 24645 ms returned sat
[2023-03-10 19:03:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:03:46] [INFO ] [Nat]Absence check using state equation in 7166 ms returned sat
[2023-03-10 19:03:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:03:52] [INFO ] [Nat]Added 795 Read/Feed constraints in 6125 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, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
Support contains 16 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4808/4808 places, 4605/4605 transitions.
Applied a total of 0 rules in 1713 ms. Remains 4808 /4808 variables (removed 0) and now considering 4605/4605 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4808/4808 places, 4605/4605 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4808/4808 places, 4605/4605 transitions.
Applied a total of 0 rules in 1557 ms. Remains 4808 /4808 variables (removed 0) and now considering 4605/4605 (removed 0) transitions.
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:03:55] [INFO ] Invariants computation overflowed in 137 ms
[2023-03-10 19:04:26] [INFO ] Performed 777/4808 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-10 19:04:56] [INFO ] Performed 1342/4808 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-10 19:05:26] [INFO ] Performed 1978/4808 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-10 19:05:57] [INFO ] Performed 2706/4808 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2023-03-10 19:05:57] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2023-03-10 19:05:57] [INFO ] Implicit Places using invariants in 121772 ms returned []
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:05:57] [INFO ] Invariants computation overflowed in 209 ms
[2023-03-10 19:05:59] [INFO ] Implicit Places using invariants and state equation in 1730 ms returned []
Implicit Place search using SMT with State Equation took 123504 ms to find 0 implicit places.
[2023-03-10 19:05:59] [INFO ] Redundant transitions in 785 ms returned []
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:06:00] [INFO ] Invariants computation overflowed in 147 ms
[2023-03-10 19:06:00] [INFO ] Dead Transitions using invariants and state equation in 937 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4808/4808 places, 4605/4605 transitions.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-00
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:06:01] [INFO ] Invariants computation overflowed in 132 ms
Incomplete random walk after 10000 steps, including 1267 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 860 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:06:02] [INFO ] Invariants computation overflowed in 154 ms
[2023-03-10 19:06:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:06:07] [INFO ] [Real]Absence check using state equation in 4102 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4808/4808 places, 4605/4605 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4808 transition count 4604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4807 transition count 4604
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 693 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 4803 transition count 4600
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 708 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 4800 transition count 4600
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 4800 transition count 4596
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 4796 transition count 4596
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 29 place count 4796 transition count 4596
Applied a total of 29 rules in 7142 ms. Remains 4796 /4808 variables (removed 12) and now considering 4596/4605 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4808 places, 4596/4605 transitions.
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:06:15] [INFO ] Invariants computation overflowed in 108 ms
Incomplete random walk after 1000000 steps, including 128169 resets, run finished after 4565 ms. (steps per millisecond=219 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84568 resets, run finished after 2935 ms. (steps per millisecond=340 ) properties (out of 1) seen :0
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:06:22] [INFO ] Invariants computation overflowed in 136 ms
[2023-03-10 19:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:06:32] [INFO ] [Real]Absence check using state equation in 8619 ms returned sat
[2023-03-10 19:06:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:06:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:07:14] [INFO ] [Nat]Absence check using state equation in 40606 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4796 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4596/4596 transitions.
Applied a total of 0 rules in 1747 ms. Remains 4796 /4796 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4596/4596 transitions.
Applied a total of 0 rules in 1618 ms. Remains 4796 /4796 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:07:17] [INFO ] Invariants computation overflowed in 97 ms
[2023-03-10 19:07:18] [INFO ] Implicit Places using invariants in 931 ms returned []
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:07:18] [INFO ] Invariants computation overflowed in 94 ms
[2023-03-10 19:07:20] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned []
Implicit Place search using SMT with State Equation took 2533 ms to find 0 implicit places.
[2023-03-10 19:07:21] [INFO ] Redundant transitions in 995 ms returned []
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:07:21] [INFO ] Invariants computation overflowed in 93 ms
[2023-03-10 19:07:30] [INFO ] Dead Transitions using invariants and state equation in 9220 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4596/4596 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-00 in 89504 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-01
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:07:31] [INFO ] Invariants computation overflowed in 152 ms
Incomplete random walk after 10000 steps, including 1260 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:07:31] [INFO ] Invariants computation overflowed in 209 ms
[2023-03-10 19:07:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:07:36] [INFO ] [Real]Absence check using state equation in 4109 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4808/4808 places, 4605/4605 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4808 transition count 4604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4807 transition count 4604
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 934 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 4802 transition count 4599
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 872 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 4799 transition count 4599
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 4799 transition count 4595
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 4795 transition count 4595
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 4795 transition count 4595
Applied a total of 30 rules in 7933 ms. Remains 4795 /4808 variables (removed 13) and now considering 4595/4605 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4808 places, 4595/4605 transitions.
// Phase 1: matrix 4595 rows 4795 cols
[2023-03-10 19:07:45] [INFO ] Invariants computation overflowed in 162 ms
Incomplete random walk after 1000000 steps, including 128862 resets, run finished after 3742 ms. (steps per millisecond=267 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84804 resets, run finished after 2647 ms. (steps per millisecond=377 ) properties (out of 1) seen :0
// Phase 1: matrix 4595 rows 4795 cols
[2023-03-10 19:07:52] [INFO ] Invariants computation overflowed in 162 ms
[2023-03-10 19:07:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:08:37] [INFO ] [Real]Absence check using state equation in 44114 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4795 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4595/4595 transitions.
Applied a total of 0 rules in 1705 ms. Remains 4795 /4795 variables (removed 0) and now considering 4595/4595 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4595/4595 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4595/4595 transitions.
Applied a total of 0 rules in 1787 ms. Remains 4795 /4795 variables (removed 0) and now considering 4595/4595 (removed 0) transitions.
// Phase 1: matrix 4595 rows 4795 cols
[2023-03-10 19:08:40] [INFO ] Invariants computation overflowed in 163 ms
[2023-03-10 19:08:41] [INFO ] Implicit Places using invariants in 1142 ms returned []
// Phase 1: matrix 4595 rows 4795 cols
[2023-03-10 19:08:41] [INFO ] Invariants computation overflowed in 161 ms
[2023-03-10 19:08:43] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2968 ms to find 0 implicit places.
[2023-03-10 19:08:44] [INFO ] Redundant transitions in 976 ms returned []
// Phase 1: matrix 4595 rows 4795 cols
[2023-03-10 19:08:44] [INFO ] Invariants computation overflowed in 160 ms
[2023-03-10 19:08:52] [INFO ] Dead Transitions using invariants and state equation in 7645 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4595/4595 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-01 in 81771 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-02
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:08:53] [INFO ] Invariants computation overflowed in 134 ms
Incomplete random walk after 10000 steps, including 1258 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 854 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:08:53] [INFO ] Invariants computation overflowed in 128 ms
[2023-03-10 19:08:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:08:58] [INFO ] [Real]Absence check using state equation in 4167 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4808/4808 places, 4605/4605 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4808 transition count 4604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4807 transition count 4604
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 669 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 4802 transition count 4599
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 662 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 4799 transition count 4599
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 4799 transition count 4596
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 4796 transition count 4596
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 29 place count 4796 transition count 4596
Applied a total of 29 rules in 6605 ms. Remains 4796 /4808 variables (removed 12) and now considering 4596/4605 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4808 places, 4596/4605 transitions.
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:09:05] [INFO ] Invariants computation overflowed in 101 ms
Incomplete random walk after 1000000 steps, including 128057 resets, run finished after 3628 ms. (steps per millisecond=275 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84740 resets, run finished after 2458 ms. (steps per millisecond=406 ) properties (out of 1) seen :0
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:09:12] [INFO ] Invariants computation overflowed in 100 ms
[2023-03-10 19:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:09:31] [INFO ] [Real]Absence check using state equation in 18088 ms returned sat
[2023-03-10 19:09:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:09:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:09:38] [INFO ] [Nat]Absence check using state equation in 6180 ms returned sat
[2023-03-10 19:09:38] [INFO ] State equation strengthened by 804 read => feed constraints.
[2023-03-10 19:09:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:09:44] [INFO ] [Nat]Added 804 Read/Feed constraints in 6287 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4796 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4596/4596 transitions.
Applied a total of 0 rules in 1914 ms. Remains 4796 /4796 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4596/4596 transitions.
Applied a total of 0 rules in 1431 ms. Remains 4796 /4796 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:09:48] [INFO ] Invariants computation overflowed in 157 ms
[2023-03-10 19:10:19] [INFO ] Performed 780/4796 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-10 19:10:49] [INFO ] Performed 1416/4796 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-10 19:11:19] [INFO ] Performed 2027/4796 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-10 19:11:50] [INFO ] Performed 2561/4796 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2023-03-10 19:11:50] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2023-03-10 19:11:50] [INFO ] Implicit Places using invariants in 122136 ms returned []
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:11:50] [INFO ] Invariants computation overflowed in 155 ms
[2023-03-10 19:11:52] [INFO ] Implicit Places using invariants and state equation in 1883 ms returned []
Implicit Place search using SMT with State Equation took 124025 ms to find 0 implicit places.
[2023-03-10 19:11:53] [INFO ] Redundant transitions in 1089 ms returned []
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:11:53] [INFO ] Invariants computation overflowed in 125 ms
[2023-03-10 19:12:03] [INFO ] Dead Transitions using invariants and state equation in 10117 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4596/4596 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-02 in 191457 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-03
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:12:04] [INFO ] Invariants computation overflowed in 205 ms
Incomplete random walk after 10000 steps, including 1284 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:12:05] [INFO ] Invariants computation overflowed in 205 ms
[2023-03-10 19:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:12:10] [INFO ] [Real]Absence check using state equation in 4234 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4808/4808 places, 4605/4605 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4808 transition count 4604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4807 transition count 4604
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 666 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 4803 transition count 4600
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 656 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 4800 transition count 4600
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 4800 transition count 4596
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 4796 transition count 4596
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 29 place count 4796 transition count 4596
Applied a total of 29 rules in 6881 ms. Remains 4796 /4808 variables (removed 12) and now considering 4596/4605 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4808 places, 4596/4605 transitions.
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:12:17] [INFO ] Invariants computation overflowed in 105 ms
Incomplete random walk after 1000000 steps, including 128357 resets, run finished after 3893 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84867 resets, run finished after 2307 ms. (steps per millisecond=433 ) properties (out of 1) seen :0
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:12:24] [INFO ] Invariants computation overflowed in 153 ms
[2023-03-10 19:12:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:13:09] [INFO ] [Real]Absence check using state equation in 44062 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4796 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4596/4596 transitions.
Applied a total of 0 rules in 1596 ms. Remains 4796 /4796 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4596/4596 transitions.
Applied a total of 0 rules in 1422 ms. Remains 4796 /4796 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:13:12] [INFO ] Invariants computation overflowed in 101 ms
[2023-03-10 19:13:43] [INFO ] Performed 669/4796 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-10 19:14:13] [INFO ] Performed 1127/4796 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-10 19:14:44] [INFO ] Performed 1632/4796 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2023-03-10 19:15:14] [INFO ] Performed 2209/4796 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2023-03-10 19:15:14] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2023-03-10 19:15:14] [INFO ] Implicit Places using invariants in 121902 ms returned []
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:15:14] [INFO ] Invariants computation overflowed in 99 ms
[2023-03-10 19:15:15] [INFO ] Implicit Places using invariants and state equation in 1656 ms returned []
Implicit Place search using SMT with State Equation took 123568 ms to find 0 implicit places.
[2023-03-10 19:15:16] [INFO ] Redundant transitions in 1026 ms returned []
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:15:16] [INFO ] Invariants computation overflowed in 110 ms
[2023-03-10 19:15:17] [INFO ] Dead Transitions using invariants and state equation in 904 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4596/4596 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-03 in 194322 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-04
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:15:19] [INFO ] Invariants computation overflowed in 208 ms
Incomplete random walk after 10000 steps, including 1293 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 850 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:15:19] [INFO ] Invariants computation overflowed in 154 ms
[2023-03-10 19:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:15:24] [INFO ] [Real]Absence check using state equation in 4201 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4808/4808 places, 4605/4605 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4808 transition count 4604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4807 transition count 4604
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 678 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 4803 transition count 4600
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 839 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 4800 transition count 4600
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 4800 transition count 4596
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 4796 transition count 4596
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 4796 transition count 4596
Applied a total of 28 rules in 7009 ms. Remains 4796 /4808 variables (removed 12) and now considering 4596/4605 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4808 places, 4596/4605 transitions.
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:15:32] [INFO ] Invariants computation overflowed in 151 ms
Incomplete random walk after 1000000 steps, including 128503 resets, run finished after 3633 ms. (steps per millisecond=275 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84538 resets, run finished after 2305 ms. (steps per millisecond=433 ) properties (out of 1) seen :0
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:15:38] [INFO ] Invariants computation overflowed in 113 ms
[2023-03-10 19:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:16:17] [INFO ] [Real]Absence check using state equation in 38181 ms returned sat
[2023-03-10 19:16:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:16:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:16:58] [INFO ] [Nat]Absence check using state equation in 40587 ms returned sat
[2023-03-10 19:16:58] [INFO ] State equation strengthened by 803 read => feed constraints.
[2023-03-10 19:17:02] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:17:02] [INFO ] [Nat]Added 803 Read/Feed constraints in 3746 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4796 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4596/4596 transitions.
Applied a total of 0 rules in 1683 ms. Remains 4796 /4796 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4596/4596 transitions.
Applied a total of 0 rules in 1639 ms. Remains 4796 /4796 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:17:06] [INFO ] Invariants computation overflowed in 151 ms
[2023-03-10 19:17:37] [INFO ] Performed 728/4796 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-10 19:18:07] [INFO ] Performed 1201/4796 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-10 19:18:37] [INFO ] Performed 1787/4796 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-10 19:19:07] [INFO ] Performed 2340/4796 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2023-03-10 19:19:07] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2023-03-10 19:19:07] [INFO ] Implicit Places using invariants in 121238 ms returned []
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:19:07] [INFO ] Invariants computation overflowed in 146 ms
[2023-03-10 19:19:09] [INFO ] Implicit Places using invariants and state equation in 1818 ms returned []
Implicit Place search using SMT with State Equation took 123058 ms to find 0 implicit places.
[2023-03-10 19:19:09] [INFO ] Redundant transitions in 883 ms returned []
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:19:10] [INFO ] Invariants computation overflowed in 155 ms
[2023-03-10 19:19:10] [INFO ] Dead Transitions using invariants and state equation in 987 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4596/4596 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-04 in 232890 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-05
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:19:11] [INFO ] Invariants computation overflowed in 209 ms
Incomplete random walk after 10000 steps, including 1329 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:19:12] [INFO ] Invariants computation overflowed in 211 ms
[2023-03-10 19:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:19:17] [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: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4808/4808 places, 4605/4605 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4808 transition count 4604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4807 transition count 4604
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 671 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 4802 transition count 4599
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 851 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 4799 transition count 4599
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 4799 transition count 4597
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 4797 transition count 4597
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 27 place count 4797 transition count 4597
Applied a total of 27 rules in 7029 ms. Remains 4797 /4808 variables (removed 11) and now considering 4597/4605 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 4797/4808 places, 4597/4605 transitions.
// Phase 1: matrix 4597 rows 4797 cols
[2023-03-10 19:19:25] [INFO ] Invariants computation overflowed in 164 ms
Incomplete random walk after 1000000 steps, including 128386 resets, run finished after 4050 ms. (steps per millisecond=246 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84852 resets, run finished after 2336 ms. (steps per millisecond=428 ) properties (out of 1) seen :0
// Phase 1: matrix 4597 rows 4797 cols
[2023-03-10 19:19:31] [INFO ] Invariants computation overflowed in 165 ms
[2023-03-10 19:19:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:19:47] [INFO ] [Real]Absence check using state equation in 14646 ms returned sat
[2023-03-10 19:19:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:19:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:20:03] [INFO ] [Nat]Absence check using state equation in 15059 ms returned sat
[2023-03-10 19:20:03] [INFO ] State equation strengthened by 804 read => feed constraints.
[2023-03-10 19:20:06] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:20:10] [INFO ] [Nat]Added 804 Read/Feed constraints in 7116 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4797 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4797/4797 places, 4597/4597 transitions.
Applied a total of 0 rules in 1546 ms. Remains 4797 /4797 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4797/4797 places, 4597/4597 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4797/4797 places, 4597/4597 transitions.
Applied a total of 0 rules in 2014 ms. Remains 4797 /4797 variables (removed 0) and now considering 4597/4597 (removed 0) transitions.
// Phase 1: matrix 4597 rows 4797 cols
[2023-03-10 19:20:14] [INFO ] Invariants computation overflowed in 112 ms
[2023-03-10 19:20:15] [INFO ] Implicit Places using invariants in 934 ms returned []
// Phase 1: matrix 4597 rows 4797 cols
[2023-03-10 19:20:15] [INFO ] Invariants computation overflowed in 158 ms
[2023-03-10 19:20:17] [INFO ] Implicit Places using invariants and state equation in 1839 ms returned []
Implicit Place search using SMT with State Equation took 2789 ms to find 0 implicit places.
[2023-03-10 19:20:17] [INFO ] Redundant transitions in 786 ms returned []
// Phase 1: matrix 4597 rows 4797 cols
[2023-03-10 19:20:18] [INFO ] Invariants computation overflowed in 124 ms
[2023-03-10 19:20:26] [INFO ] Dead Transitions using invariants and state equation in 8523 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4797/4797 places, 4597/4597 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-05 in 75601 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-06
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:20:27] [INFO ] Invariants computation overflowed in 212 ms
Incomplete random walk after 10000 steps, including 1268 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 839 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:20:27] [INFO ] Invariants computation overflowed in 208 ms
[2023-03-10 19:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:20:32] [INFO ] [Real]Absence check using state equation in 4217 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4808/4808 places, 4605/4605 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4808 transition count 4604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4807 transition count 4604
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 879 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 4802 transition count 4599
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 675 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 4800 transition count 4599
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 4800 transition count 4595
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 4796 transition count 4595
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 29 place count 4796 transition count 4595
Applied a total of 29 rules in 7266 ms. Remains 4796 /4808 variables (removed 12) and now considering 4595/4605 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4808 places, 4595/4605 transitions.
// Phase 1: matrix 4595 rows 4796 cols
[2023-03-10 19:20:40] [INFO ] Invariants computation overflowed in 99 ms
Incomplete random walk after 1000000 steps, including 128130 resets, run finished after 3957 ms. (steps per millisecond=252 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84481 resets, run finished after 2695 ms. (steps per millisecond=371 ) properties (out of 1) seen :0
// Phase 1: matrix 4595 rows 4796 cols
[2023-03-10 19:20:47] [INFO ] Invariants computation overflowed in 113 ms
[2023-03-10 19:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:21:00] [INFO ] [Real]Absence check using state equation in 12364 ms returned sat
[2023-03-10 19:21:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:21:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:21:13] [INFO ] [Nat]Absence check using state equation in 11495 ms returned sat
[2023-03-10 19:21:13] [INFO ] State equation strengthened by 802 read => feed constraints.
[2023-03-10 19:21:16] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:21:20] [INFO ] [Nat]Added 802 Read/Feed constraints in 6609 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4796 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4595/4595 transitions.
Applied a total of 0 rules in 1442 ms. Remains 4796 /4796 variables (removed 0) and now considering 4595/4595 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4595/4595 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4595/4595 transitions.
Applied a total of 0 rules in 1400 ms. Remains 4796 /4796 variables (removed 0) and now considering 4595/4595 (removed 0) transitions.
// Phase 1: matrix 4595 rows 4796 cols
[2023-03-10 19:21:23] [INFO ] Invariants computation overflowed in 100 ms
[2023-03-10 19:21:54] [INFO ] Performed 701/4796 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-10 19:22:25] [INFO ] Performed 1200/4796 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2023-03-10 19:22:55] [INFO ] Performed 1791/4796 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2023-03-10 19:23:25] [INFO ] Performed 2375/4796 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2023-03-10 19:23:25] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2023-03-10 19:23:25] [INFO ] Implicit Places using invariants in 122555 ms returned []
// Phase 1: matrix 4595 rows 4796 cols
[2023-03-10 19:23:25] [INFO ] Invariants computation overflowed in 161 ms
[2023-03-10 19:23:27] [INFO ] Implicit Places using invariants and state equation in 1797 ms returned []
Implicit Place search using SMT with State Equation took 124361 ms to find 0 implicit places.
[2023-03-10 19:23:28] [INFO ] Redundant transitions in 768 ms returned []
// Phase 1: matrix 4595 rows 4796 cols
[2023-03-10 19:23:28] [INFO ] Invariants computation overflowed in 162 ms
[2023-03-10 19:23:29] [INFO ] Dead Transitions using invariants and state equation in 974 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4595/4595 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-06 in 183126 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-07
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:23:30] [INFO ] Invariants computation overflowed in 123 ms
Incomplete random walk after 10000 steps, including 1292 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 855 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:23:30] [INFO ] Invariants computation overflowed in 137 ms
[2023-03-10 19:23:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:23:35] [INFO ] [Real]Absence check using state equation in 4169 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4808/4808 places, 4605/4605 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4808 transition count 4604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4807 transition count 4604
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1008 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 4803 transition count 4600
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 655 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 4800 transition count 4600
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 4800 transition count 4596
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 4796 transition count 4596
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 29 place count 4796 transition count 4596
Applied a total of 29 rules in 6835 ms. Remains 4796 /4808 variables (removed 12) and now considering 4596/4605 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4808 places, 4596/4605 transitions.
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:23:43] [INFO ] Invariants computation overflowed in 101 ms
Incomplete random walk after 1000000 steps, including 128401 resets, run finished after 3757 ms. (steps per millisecond=266 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84421 resets, run finished after 2317 ms. (steps per millisecond=431 ) properties (out of 1) seen :0
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:23:49] [INFO ] Invariants computation overflowed in 98 ms
[2023-03-10 19:23:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:23:57] [INFO ] [Real]Absence check using state equation in 6818 ms returned sat
[2023-03-10 19:23:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:23:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:24:35] [INFO ] [Nat]Absence check using state equation in 36789 ms returned sat
[2023-03-10 19:24:35] [INFO ] State equation strengthened by 803 read => feed constraints.
[2023-03-10 19:24:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 19:24:42] [INFO ] [Nat]Added 803 Read/Feed constraints in 7305 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4796 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4596/4596 transitions.
Applied a total of 0 rules in 1601 ms. Remains 4796 /4796 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4596/4596 transitions.
Applied a total of 0 rules in 1597 ms. Remains 4796 /4796 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:24:46] [INFO ] Invariants computation overflowed in 90 ms
[2023-03-10 19:24:46] [INFO ] Implicit Places using invariants in 915 ms returned []
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:24:46] [INFO ] Invariants computation overflowed in 140 ms
[2023-03-10 19:24:48] [INFO ] Implicit Places using invariants and state equation in 1686 ms returned []
Implicit Place search using SMT with State Equation took 2615 ms to find 0 implicit places.
[2023-03-10 19:24:49] [INFO ] Redundant transitions in 1090 ms returned []
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:24:49] [INFO ] Invariants computation overflowed in 149 ms
[2023-03-10 19:24:58] [INFO ] Dead Transitions using invariants and state equation in 9189 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4596/4596 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-07 in 89358 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-08
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:24:59] [INFO ] Invariants computation overflowed in 190 ms
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 850 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:25:00] [INFO ] Invariants computation overflowed in 204 ms
[2023-03-10 19:25:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:25:05] [INFO ] [Real]Absence check using state equation in 4142 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4808/4808 places, 4605/4605 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1086 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 4803 transition count 4600
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 652 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 4801 transition count 4600
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 4801 transition count 4596
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 4797 transition count 4596
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 4797 transition count 4596
Applied a total of 27 rules in 6894 ms. Remains 4797 /4808 variables (removed 11) and now considering 4596/4605 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 4797/4808 places, 4596/4605 transitions.
// Phase 1: matrix 4596 rows 4797 cols
[2023-03-10 19:25:13] [INFO ] Invariants computation overflowed in 101 ms
Incomplete random walk after 1000000 steps, including 128289 resets, run finished after 3500 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84907 resets, run finished after 2478 ms. (steps per millisecond=403 ) properties (out of 1) seen :0
// Phase 1: matrix 4596 rows 4797 cols
[2023-03-10 19:25:19] [INFO ] Invariants computation overflowed in 154 ms
[2023-03-10 19:25:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:26:04] [INFO ] [Real]Absence check using state equation in 44126 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4797 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4797/4797 places, 4596/4596 transitions.
Applied a total of 0 rules in 1389 ms. Remains 4797 /4797 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4797/4797 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4797/4797 places, 4596/4596 transitions.
Applied a total of 0 rules in 1393 ms. Remains 4797 /4797 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4797 cols
[2023-03-10 19:26:07] [INFO ] Invariants computation overflowed in 100 ms
[2023-03-10 19:26:07] [INFO ] Implicit Places using invariants in 773 ms returned []
// Phase 1: matrix 4596 rows 4797 cols
[2023-03-10 19:26:07] [INFO ] Invariants computation overflowed in 121 ms
[2023-03-10 19:26:09] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 2245 ms to find 0 implicit places.
[2023-03-10 19:26:10] [INFO ] Redundant transitions in 971 ms returned []
// Phase 1: matrix 4596 rows 4797 cols
[2023-03-10 19:26:10] [INFO ] Invariants computation overflowed in 100 ms
[2023-03-10 19:26:17] [INFO ] Dead Transitions using invariants and state equation in 7581 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4797/4797 places, 4596/4596 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-08 in 78974 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-09
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:26:18] [INFO ] Invariants computation overflowed in 134 ms
Incomplete random walk after 10000 steps, including 1267 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 860 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:26:19] [INFO ] Invariants computation overflowed in 143 ms
[2023-03-10 19:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:26:24] [INFO ] [Real]Absence check using state equation in 4187 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4808/4808 places, 4605/4605 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4808 transition count 4604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4807 transition count 4604
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 666 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 4802 transition count 4599
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 672 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 4799 transition count 4599
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 4799 transition count 4595
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 4795 transition count 4595
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 4795 transition count 4595
Applied a total of 30 rules in 6848 ms. Remains 4795 /4808 variables (removed 13) and now considering 4595/4605 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4808 places, 4595/4605 transitions.
// Phase 1: matrix 4595 rows 4795 cols
[2023-03-10 19:26:31] [INFO ] Invariants computation overflowed in 105 ms
Incomplete random walk after 1000000 steps, including 128292 resets, run finished after 3826 ms. (steps per millisecond=261 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84638 resets, run finished after 2586 ms. (steps per millisecond=386 ) properties (out of 1) seen :0
// Phase 1: matrix 4595 rows 4795 cols
[2023-03-10 19:26:38] [INFO ] Invariants computation overflowed in 102 ms
[2023-03-10 19:26:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:27:23] [INFO ] [Real]Absence check using state equation in 44299 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4795 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4595/4595 transitions.
Applied a total of 0 rules in 1464 ms. Remains 4795 /4795 variables (removed 0) and now considering 4595/4595 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4595/4595 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4795/4795 places, 4595/4595 transitions.
Applied a total of 0 rules in 1463 ms. Remains 4795 /4795 variables (removed 0) and now considering 4595/4595 (removed 0) transitions.
// Phase 1: matrix 4595 rows 4795 cols
[2023-03-10 19:27:26] [INFO ] Invariants computation overflowed in 104 ms
[2023-03-10 19:27:27] [INFO ] Implicit Places using invariants in 907 ms returned []
// Phase 1: matrix 4595 rows 4795 cols
[2023-03-10 19:27:27] [INFO ] Invariants computation overflowed in 120 ms
[2023-03-10 19:27:28] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 2407 ms to find 0 implicit places.
[2023-03-10 19:27:29] [INFO ] Redundant transitions in 784 ms returned []
// Phase 1: matrix 4595 rows 4795 cols
[2023-03-10 19:27:29] [INFO ] Invariants computation overflowed in 105 ms
[2023-03-10 19:27:37] [INFO ] Dead Transitions using invariants and state equation in 8336 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4795 places, 4595/4595 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-09 in 79839 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-10
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:27:38] [INFO ] Invariants computation overflowed in 127 ms
Incomplete random walk after 10000 steps, including 1283 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 860 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:27:38] [INFO ] Invariants computation overflowed in 144 ms
[2023-03-10 19:27:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:27:43] [INFO ] [Real]Absence check using state equation in 4134 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4808/4808 places, 4605/4605 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4808 transition count 4604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4807 transition count 4604
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 709 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 4802 transition count 4599
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 679 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 4799 transition count 4599
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 4799 transition count 4596
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 4796 transition count 4596
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 4796 transition count 4596
Applied a total of 28 rules in 6580 ms. Remains 4796 /4808 variables (removed 12) and now considering 4596/4605 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4808 places, 4596/4605 transitions.
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:27:51] [INFO ] Invariants computation overflowed in 110 ms
Incomplete random walk after 1000000 steps, including 128350 resets, run finished after 2969 ms. (steps per millisecond=336 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84773 resets, run finished after 1984 ms. (steps per millisecond=504 ) properties (out of 1) seen :0
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:27:56] [INFO ] Invariants computation overflowed in 111 ms
[2023-03-10 19:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:28:30] [INFO ] [Real]Absence check using state equation in 33056 ms returned sat
[2023-03-10 19:28:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 19:28:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 19:29:15] [INFO ] [Nat]Absence check using state equation in 44341 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 4796 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4596/4596 transitions.
Applied a total of 0 rules in 1549 ms. Remains 4796 /4796 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4596/4596 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4796/4796 places, 4596/4596 transitions.
Applied a total of 0 rules in 1522 ms. Remains 4796 /4796 variables (removed 0) and now considering 4596/4596 (removed 0) transitions.
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:29:18] [INFO ] Invariants computation overflowed in 112 ms
[2023-03-10 19:29:49] [INFO ] Performed 865/4796 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-10 19:30:19] [INFO ] Performed 1466/4796 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-10 19:30:49] [INFO ] Performed 2131/4796 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-10 19:31:19] [INFO ] Performed 2887/4796 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2023-03-10 19:31:19] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2023-03-10 19:31:19] [INFO ] Implicit Places using invariants in 121028 ms returned []
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:31:20] [INFO ] Invariants computation overflowed in 181 ms
[2023-03-10 19:31:21] [INFO ] Implicit Places using invariants and state equation in 1927 ms returned []
Implicit Place search using SMT with State Equation took 122973 ms to find 0 implicit places.
[2023-03-10 19:31:22] [INFO ] Redundant transitions in 820 ms returned []
// Phase 1: matrix 4596 rows 4796 cols
[2023-03-10 19:31:22] [INFO ] Invariants computation overflowed in 108 ms
[2023-03-10 19:31:30] [INFO ] Dead Transitions using invariants and state equation in 7896 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4796/4796 places, 4596/4596 transitions.
Ending property specific reduction for DoubleExponent-PT-200-UpperBounds-10 in 232583 ms.
Starting property specific reduction for DoubleExponent-PT-200-UpperBounds-11
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:31:31] [INFO ] Invariants computation overflowed in 130 ms
Incomplete random walk after 10000 steps, including 1252 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :1
// Phase 1: matrix 4605 rows 4808 cols
[2023-03-10 19:31:31] [INFO ] Invariants computation overflowed in 210 ms
[2023-03-10 19:31:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 19:31:36] [INFO ] [Real]Absence check using state equation in 4090 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 4808 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4808/4808 places, 4605/4605 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 4808 transition count 4604
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 4807 transition count 4604
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 670 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 4802 transition count 4599
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 753 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 4799 transition count 4599
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 4799 transition count 4595
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 4795 transition count 4595
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 4795 transition count 4595
Applied a total of 30 rules in 7423 ms. Remains 4795 /4808 variables (removed 13) and now considering 4595/4605 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 4795/4808 places, 4595/4605 transitions.
// Phase 1: matrix 4595 rows 4795 cols
[2023-03-10 19:31:44] [INFO ] Invariants computation overflowed in 156 ms
Incomplete random walk after 1000000 steps, including 128026 resets, run finished after 3536 ms. (steps per millisecond=282 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84481 resets, run finished after 2348 ms. (steps per millisecond=425 ) properties (out of 1) seen :1
// Phase 1: matrix 4595 rows 4795 cols
[2023-03-10 19:31:50] [INFO ] Invariants computation overflowed in 101 ms
[2023-03-10 19:31:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is DoubleExponent-PT-200, 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 r159-smll-167819445200063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-200.tgz
mv DoubleExponent-PT-200 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 ;