About the Execution of ITS-Tools for ASLink-PT-04a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9785.388 | 3600000.00 | 3677892.00 | 6642.30 | ? 1 1 1 1 1 1 1 1 1 ? 1 1 1 1 ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245688800061.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-04a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245688800061
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.6K Apr 30 07:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 07:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 07:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 07:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K May 9 06:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 9 06:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 06:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 06:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 06:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 06:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 436K May 10 09:33 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 ASLink-PT-04a-UpperBounds-00
FORMULA_NAME ASLink-PT-04a-UpperBounds-01
FORMULA_NAME ASLink-PT-04a-UpperBounds-02
FORMULA_NAME ASLink-PT-04a-UpperBounds-03
FORMULA_NAME ASLink-PT-04a-UpperBounds-04
FORMULA_NAME ASLink-PT-04a-UpperBounds-05
FORMULA_NAME ASLink-PT-04a-UpperBounds-06
FORMULA_NAME ASLink-PT-04a-UpperBounds-07
FORMULA_NAME ASLink-PT-04a-UpperBounds-08
FORMULA_NAME ASLink-PT-04a-UpperBounds-09
FORMULA_NAME ASLink-PT-04a-UpperBounds-10
FORMULA_NAME ASLink-PT-04a-UpperBounds-11
FORMULA_NAME ASLink-PT-04a-UpperBounds-12
FORMULA_NAME ASLink-PT-04a-UpperBounds-13
FORMULA_NAME ASLink-PT-04a-UpperBounds-14
FORMULA_NAME ASLink-PT-04a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652645577763
Running Version 202205111006
[2022-05-15 20:12:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 20:12:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:12:59] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2022-05-15 20:12:59] [INFO ] Transformed 1016 places.
[2022-05-15 20:12:59] [INFO ] Transformed 1554 transitions.
[2022-05-15 20:12:59] [INFO ] Found NUPN structural information;
[2022-05-15 20:12:59] [INFO ] Parsed PT model containing 1016 places and 1554 transitions in 280 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
// Phase 1: matrix 1538 rows 1016 cols
[2022-05-15 20:12:59] [INFO ] Computed 194 place invariants in 143 ms
Incomplete random walk after 10000 steps, including 68 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 16) seen :8
FORMULA ASLink-PT-04a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
// Phase 1: matrix 1538 rows 1016 cols
[2022-05-15 20:13:00] [INFO ] Computed 194 place invariants in 101 ms
[2022-05-15 20:13:00] [INFO ] [Real]Absence check using 46 positive place invariants in 21 ms returned sat
[2022-05-15 20:13:00] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 72 ms returned sat
[2022-05-15 20:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:01] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2022-05-15 20:13:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:13:01] [INFO ] [Nat]Absence check using 46 positive place invariants in 18 ms returned sat
[2022-05-15 20:13:01] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 28 ms returned sat
[2022-05-15 20:13:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:01] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2022-05-15 20:13:02] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 3 ms to minimize.
[2022-05-15 20:13:02] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 1 ms to minimize.
[2022-05-15 20:13:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 628 ms
[2022-05-15 20:13:02] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 158 ms.
[2022-05-15 20:13:06] [INFO ] Added : 10 causal constraints over 2 iterations in 3717 ms. Result :unknown
[2022-05-15 20:13:06] [INFO ] [Real]Absence check using 46 positive place invariants in 34 ms returned sat
[2022-05-15 20:13:06] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 36 ms returned sat
[2022-05-15 20:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:07] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2022-05-15 20:13:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:13:07] [INFO ] [Nat]Absence check using 46 positive place invariants in 17 ms returned sat
[2022-05-15 20:13:07] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 26 ms returned sat
[2022-05-15 20:13:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:12] [INFO ] [Nat]Absence check using state equation in 4828 ms returned unknown
[2022-05-15 20:13:12] [INFO ] [Real]Absence check using 46 positive place invariants in 21 ms returned sat
[2022-05-15 20:13:12] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 37 ms returned sat
[2022-05-15 20:13:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:13] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2022-05-15 20:13:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:13:13] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2022-05-15 20:13:13] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 36 ms returned sat
[2022-05-15 20:13:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:14] [INFO ] [Nat]Absence check using state equation in 717 ms returned sat
[2022-05-15 20:13:14] [INFO ] Deduced a trap composed of 80 places in 453 ms of which 14 ms to minimize.
[2022-05-15 20:13:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 560 ms
[2022-05-15 20:13:14] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 155 ms.
[2022-05-15 20:13:18] [INFO ] Added : 5 causal constraints over 1 iterations in 3482 ms. Result :unknown
[2022-05-15 20:13:18] [INFO ] [Real]Absence check using 46 positive place invariants in 39 ms returned sat
[2022-05-15 20:13:19] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 978 ms returned sat
[2022-05-15 20:13:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:23] [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 3
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)
[2022-05-15 20:13:23] [INFO ] [Real]Absence check using 46 positive place invariants in 21 ms returned sat
[2022-05-15 20:13:23] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 53 ms returned sat
[2022-05-15 20:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:23] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2022-05-15 20:13:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:13:24] [INFO ] [Nat]Absence check using 46 positive place invariants in 22 ms returned sat
[2022-05-15 20:13:24] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 36 ms returned sat
[2022-05-15 20:13:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:27] [INFO ] [Nat]Absence check using state equation in 3714 ms returned sat
[2022-05-15 20:13:28] [INFO ] Deduced a trap composed of 45 places in 229 ms of which 2 ms to minimize.
[2022-05-15 20:13:28] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 2 ms to minimize.
[2022-05-15 20:13:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 672 ms
[2022-05-15 20:13:28] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 153 ms.
[2022-05-15 20:13:29] [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 4
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.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
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)
[2022-05-15 20:13:29] [INFO ] [Real]Absence check using 46 positive place invariants in 37 ms returned sat
[2022-05-15 20:13:29] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 71 ms returned sat
[2022-05-15 20:13:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:30] [INFO ] [Real]Absence check using state equation in 806 ms returned sat
[2022-05-15 20:13:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:13:30] [INFO ] [Nat]Absence check using 46 positive place invariants in 23 ms returned sat
[2022-05-15 20:13:30] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 36 ms returned sat
[2022-05-15 20:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:35] [INFO ] [Nat]Absence check using state equation in 4758 ms returned unknown
[2022-05-15 20:13:35] [INFO ] [Real]Absence check using 46 positive place invariants in 19 ms returned sat
[2022-05-15 20:13:35] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 34 ms returned sat
[2022-05-15 20:13:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:36] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2022-05-15 20:13:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:13:36] [INFO ] [Nat]Absence check using 46 positive place invariants in 24 ms returned sat
[2022-05-15 20:13:36] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 37 ms returned sat
[2022-05-15 20:13:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:37] [INFO ] [Nat]Absence check using state equation in 1334 ms returned sat
[2022-05-15 20:13:37] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 1 ms to minimize.
[2022-05-15 20:13:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2022-05-15 20:13:38] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 131 ms.
[2022-05-15 20:13:41] [INFO ] Added : 5 causal constraints over 1 iterations in 3151 ms. Result :unknown
[2022-05-15 20:13:41] [INFO ] [Real]Absence check using 46 positive place invariants in 22 ms returned sat
[2022-05-15 20:13:41] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 38 ms returned sat
[2022-05-15 20:13:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:41] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2022-05-15 20:13:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:13:42] [INFO ] [Nat]Absence check using 46 positive place invariants in 17 ms returned sat
[2022-05-15 20:13:42] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 28 ms returned sat
[2022-05-15 20:13:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:46] [INFO ] [Nat]Absence check using state equation in 4816 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-04a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 1016 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 992 transition count 1450
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 200 place count 904 transition count 1450
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 200 place count 904 transition count 1361
Deduced a syphon composed of 89 places in 2 ms
Ensure Unique test removed 34 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 412 place count 781 transition count 1361
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 413 place count 781 transition count 1360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 414 place count 780 transition count 1360
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 421 place count 773 transition count 1325
Ensure Unique test removed 1 places
Iterating global reduction 4 with 8 rules applied. Total rules applied 429 place count 772 transition count 1325
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 435 place count 771 transition count 1320
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 438 place count 768 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 439 place count 767 transition count 1312
Iterating global reduction 6 with 1 rules applied. Total rules applied 440 place count 767 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 441 place count 766 transition count 1304
Iterating global reduction 6 with 1 rules applied. Total rules applied 442 place count 766 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 443 place count 765 transition count 1296
Iterating global reduction 6 with 1 rules applied. Total rules applied 444 place count 765 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 445 place count 764 transition count 1288
Iterating global reduction 6 with 1 rules applied. Total rules applied 446 place count 764 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 447 place count 763 transition count 1280
Iterating global reduction 6 with 1 rules applied. Total rules applied 448 place count 763 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 449 place count 762 transition count 1272
Iterating global reduction 6 with 1 rules applied. Total rules applied 450 place count 762 transition count 1272
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 451 place count 761 transition count 1264
Iterating global reduction 6 with 1 rules applied. Total rules applied 452 place count 761 transition count 1264
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 453 place count 760 transition count 1256
Iterating global reduction 6 with 1 rules applied. Total rules applied 454 place count 760 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 455 place count 759 transition count 1248
Iterating global reduction 6 with 1 rules applied. Total rules applied 456 place count 759 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 457 place count 758 transition count 1240
Iterating global reduction 6 with 1 rules applied. Total rules applied 458 place count 758 transition count 1240
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 459 place count 757 transition count 1232
Iterating global reduction 6 with 1 rules applied. Total rules applied 460 place count 757 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 461 place count 756 transition count 1224
Iterating global reduction 6 with 1 rules applied. Total rules applied 462 place count 756 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 463 place count 755 transition count 1216
Iterating global reduction 6 with 1 rules applied. Total rules applied 464 place count 755 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 465 place count 754 transition count 1208
Iterating global reduction 6 with 1 rules applied. Total rules applied 466 place count 754 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 467 place count 753 transition count 1200
Iterating global reduction 6 with 1 rules applied. Total rules applied 468 place count 753 transition count 1200
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 469 place count 752 transition count 1192
Iterating global reduction 6 with 1 rules applied. Total rules applied 470 place count 752 transition count 1192
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 526 place count 724 transition count 1164
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 529 place count 724 transition count 1161
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 532 place count 721 transition count 1161
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 537 place count 721 transition count 1161
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 538 place count 720 transition count 1160
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 546 place count 712 transition count 1160
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 16 Pre rules applied. Total rules applied 546 place count 712 transition count 1144
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 33 rules applied. Total rules applied 579 place count 695 transition count 1144
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 8 with 5 rules applied. Total rules applied 584 place count 690 transition count 1144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 584 place count 690 transition count 1143
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 586 place count 689 transition count 1143
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 596 place count 684 transition count 1138
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 600 place count 680 transition count 1134
Iterating global reduction 9 with 4 rules applied. Total rules applied 604 place count 680 transition count 1134
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 608 place count 680 transition count 1130
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 612 place count 676 transition count 1130
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 616 place count 676 transition count 1130
Applied a total of 616 rules in 1269 ms. Remains 676 /1016 variables (removed 340) and now considering 1130/1538 (removed 408) transitions.
Finished structural reductions, in 1 iterations. Remains : 676/1016 places, 1130/1538 transitions.
// Phase 1: matrix 1130 rows 676 cols
[2022-05-15 20:13:50] [INFO ] Computed 120 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 12814 resets, run finished after 1986 ms. (steps per millisecond=503 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2920 resets, run finished after 934 ms. (steps per millisecond=1070 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2907 resets, run finished after 927 ms. (steps per millisecond=1078 ) properties (out of 7) seen :2
FORMULA ASLink-PT-04a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2929 resets, run finished after 1026 ms. (steps per millisecond=974 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2936 resets, run finished after 1293 ms. (steps per millisecond=773 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2938 resets, run finished after 1215 ms. (steps per millisecond=823 ) properties (out of 5) seen :0
// Phase 1: matrix 1130 rows 676 cols
[2022-05-15 20:13:57] [INFO ] Computed 120 place invariants in 24 ms
[2022-05-15 20:13:57] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-15 20:13:57] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 31 ms returned sat
[2022-05-15 20:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:57] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2022-05-15 20:13:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:13:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2022-05-15 20:13:58] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 37 ms returned sat
[2022-05-15 20:13:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:13:58] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2022-05-15 20:13:58] [INFO ] Computed and/alt/rep : 438/1694/438 causal constraints (skipped 667 transitions) in 93 ms.
[2022-05-15 20:14:03] [INFO ] Added : 296 causal constraints over 60 iterations in 4910 ms. Result :sat
Minimization took 423 ms.
[2022-05-15 20:14:04] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-15 20:14:04] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 19 ms returned sat
[2022-05-15 20:14:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:05] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2022-05-15 20:14:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:14:05] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2022-05-15 20:14:05] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 14 ms returned sat
[2022-05-15 20:14:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:05] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2022-05-15 20:14:05] [INFO ] Computed and/alt/rep : 438/1694/438 causal constraints (skipped 667 transitions) in 69 ms.
[2022-05-15 20:14:07] [INFO ] Added : 119 causal constraints over 24 iterations in 2161 ms. Result :sat
Minimization took 372 ms.
[2022-05-15 20:14:08] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2022-05-15 20:14:08] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 16 ms returned sat
[2022-05-15 20:14:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:08] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2022-05-15 20:14:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:14:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-15 20:14:08] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 29 ms returned sat
[2022-05-15 20:14:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:09] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2022-05-15 20:14:09] [INFO ] Computed and/alt/rep : 438/1694/438 causal constraints (skipped 667 transitions) in 82 ms.
[2022-05-15 20:14:14] [INFO ] Added : 310 causal constraints over 62 iterations in 5343 ms. Result :sat
Minimization took 364 ms.
[2022-05-15 20:14:15] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-15 20:14:15] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 31 ms returned sat
[2022-05-15 20:14:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:15] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2022-05-15 20:14:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:14:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-15 20:14:15] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 19 ms returned sat
[2022-05-15 20:14:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:16] [INFO ] [Nat]Absence check using state equation in 713 ms returned sat
[2022-05-15 20:14:16] [INFO ] Deduced a trap composed of 142 places in 279 ms of which 1 ms to minimize.
[2022-05-15 20:14:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2022-05-15 20:14:16] [INFO ] Computed and/alt/rep : 438/1694/438 causal constraints (skipped 667 transitions) in 62 ms.
[2022-05-15 20:14:19] [INFO ] Added : 140 causal constraints over 28 iterations in 2702 ms. Result :sat
Minimization took 337 ms.
[2022-05-15 20:14:19] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-05-15 20:14:20] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 24 ms returned sat
[2022-05-15 20:14:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:20] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2022-05-15 20:14:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:14:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-15 20:14:20] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 20 ms returned sat
[2022-05-15 20:14:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:21] [INFO ] [Nat]Absence check using state equation in 517 ms returned sat
[2022-05-15 20:14:21] [INFO ] Computed and/alt/rep : 438/1694/438 causal constraints (skipped 667 transitions) in 80 ms.
[2022-05-15 20:14:23] [INFO ] Added : 100 causal constraints over 20 iterations in 1987 ms. Result :sat
Minimization took 388 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 676 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 676/676 places, 1130/1130 transitions.
Applied a total of 0 rules in 65 ms. Remains 676 /676 variables (removed 0) and now considering 1130/1130 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 676/676 places, 1130/1130 transitions.
// Phase 1: matrix 1130 rows 676 cols
[2022-05-15 20:14:25] [INFO ] Computed 120 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 12870 resets, run finished after 2397 ms. (steps per millisecond=417 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2898 resets, run finished after 1040 ms. (steps per millisecond=961 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2920 resets, run finished after 1017 ms. (steps per millisecond=983 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2915 resets, run finished after 1035 ms. (steps per millisecond=966 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2944 resets, run finished after 987 ms. (steps per millisecond=1013 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2911 resets, run finished after 1027 ms. (steps per millisecond=973 ) properties (out of 5) seen :0
// Phase 1: matrix 1130 rows 676 cols
[2022-05-15 20:14:32] [INFO ] Computed 120 place invariants in 7 ms
[2022-05-15 20:14:32] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-15 20:14:32] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 21 ms returned sat
[2022-05-15 20:14:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:32] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2022-05-15 20:14:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:14:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-15 20:14:33] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 21 ms returned sat
[2022-05-15 20:14:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:33] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2022-05-15 20:14:33] [INFO ] Computed and/alt/rep : 438/1694/438 causal constraints (skipped 667 transitions) in 94 ms.
[2022-05-15 20:14:39] [INFO ] Added : 296 causal constraints over 60 iterations in 6028 ms. Result :sat
Minimization took 377 ms.
[2022-05-15 20:14:40] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-15 20:14:40] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 20 ms returned sat
[2022-05-15 20:14:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:40] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2022-05-15 20:14:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:14:40] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2022-05-15 20:14:40] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 15 ms returned sat
[2022-05-15 20:14:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:41] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2022-05-15 20:14:41] [INFO ] Computed and/alt/rep : 438/1694/438 causal constraints (skipped 667 transitions) in 81 ms.
[2022-05-15 20:14:44] [INFO ] Added : 119 causal constraints over 24 iterations in 3116 ms. Result :sat
Minimization took 412 ms.
[2022-05-15 20:14:45] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-15 20:14:45] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 22 ms returned sat
[2022-05-15 20:14:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:45] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2022-05-15 20:14:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:14:45] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2022-05-15 20:14:45] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 22 ms returned sat
[2022-05-15 20:14:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:46] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2022-05-15 20:14:46] [INFO ] Computed and/alt/rep : 438/1694/438 causal constraints (skipped 667 transitions) in 74 ms.
[2022-05-15 20:14:51] [INFO ] Added : 310 causal constraints over 62 iterations in 5466 ms. Result :sat
Minimization took 389 ms.
[2022-05-15 20:14:52] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-15 20:14:52] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 20 ms returned sat
[2022-05-15 20:14:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:52] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2022-05-15 20:14:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:14:52] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2022-05-15 20:14:52] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 20 ms returned sat
[2022-05-15 20:14:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:53] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2022-05-15 20:14:53] [INFO ] Deduced a trap composed of 142 places in 284 ms of which 2 ms to minimize.
[2022-05-15 20:14:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 360 ms
[2022-05-15 20:14:53] [INFO ] Computed and/alt/rep : 438/1694/438 causal constraints (skipped 667 transitions) in 66 ms.
[2022-05-15 20:14:57] [INFO ] Added : 140 causal constraints over 28 iterations in 3219 ms. Result :sat
Minimization took 336 ms.
[2022-05-15 20:14:57] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2022-05-15 20:14:57] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 20 ms returned sat
[2022-05-15 20:14:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:58] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2022-05-15 20:14:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:14:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 11 ms returned sat
[2022-05-15 20:14:58] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 19 ms returned sat
[2022-05-15 20:14:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:14:58] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2022-05-15 20:14:58] [INFO ] Computed and/alt/rep : 438/1694/438 causal constraints (skipped 667 transitions) in 80 ms.
[2022-05-15 20:15:00] [INFO ] Added : 100 causal constraints over 20 iterations in 2344 ms. Result :sat
Minimization took 349 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 676 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 676/676 places, 1130/1130 transitions.
Applied a total of 0 rules in 17 ms. Remains 676 /676 variables (removed 0) and now considering 1130/1130 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 676/676 places, 1130/1130 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 676/676 places, 1130/1130 transitions.
Applied a total of 0 rules in 17 ms. Remains 676 /676 variables (removed 0) and now considering 1130/1130 (removed 0) transitions.
// Phase 1: matrix 1130 rows 676 cols
[2022-05-15 20:15:02] [INFO ] Computed 120 place invariants in 27 ms
[2022-05-15 20:15:03] [INFO ] Implicit Places using invariants in 548 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 223, 257, 261, 262, 273, 274, 275, 293, 311, 380, 384, 385, 396, 397, 398, 416, 434, 503, 507, 508, 511, 522, 523, 524, 542, 544, 547, 565, 566, 567, 568, 580, 586, 592, 598, 604, 610, 616, 622, 628, 634, 640]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 555 ms to find 55 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 621/676 places, 1130/1130 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 621 transition count 1041
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 178 place count 532 transition count 1041
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 178 place count 532 transition count 1018
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 225 place count 508 transition count 1018
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 237 place count 504 transition count 1010
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 245 place count 496 transition count 1010
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 260 place count 481 transition count 995
Iterating global reduction 4 with 15 rules applied. Total rules applied 275 place count 481 transition count 995
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 278 place count 481 transition count 992
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 278 place count 481 transition count 991
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 280 place count 480 transition count 991
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 283 place count 477 transition count 988
Iterating global reduction 5 with 3 rules applied. Total rules applied 286 place count 477 transition count 988
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 287 place count 476 transition count 987
Iterating global reduction 5 with 1 rules applied. Total rules applied 288 place count 476 transition count 987
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 289 place count 475 transition count 986
Iterating global reduction 5 with 1 rules applied. Total rules applied 290 place count 475 transition count 986
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 366 place count 437 transition count 948
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 369 place count 437 transition count 945
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 373 place count 433 transition count 941
Iterating global reduction 6 with 4 rules applied. Total rules applied 377 place count 433 transition count 941
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 380 place count 433 transition count 938
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 382 place count 433 transition count 936
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 391 place count 433 transition count 927
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 401 place count 423 transition count 927
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 414 place count 423 transition count 927
Applied a total of 414 rules in 296 ms. Remains 423 /621 variables (removed 198) and now considering 927/1130 (removed 203) transitions.
// Phase 1: matrix 927 rows 423 cols
[2022-05-15 20:15:03] [INFO ] Computed 59 place invariants in 8 ms
[2022-05-15 20:15:07] [INFO ] Implicit Places using invariants in 4255 ms returned [72, 89, 95, 98, 100, 104, 105, 157, 177, 183, 186, 188, 193, 194, 246, 263, 269, 272, 274, 279, 280, 332, 349, 355, 358, 360]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 4261 ms to find 26 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 397/676 places, 927/1130 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 385 transition count 915
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 385 transition count 915
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 381 transition count 911
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 381 transition count 911
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 48 place count 373 transition count 903
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 373 transition count 891
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 72 place count 361 transition count 891
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 361 transition count 888
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 358 transition count 888
Applied a total of 78 rules in 79 ms. Remains 358 /397 variables (removed 39) and now considering 888/927 (removed 39) transitions.
// Phase 1: matrix 888 rows 358 cols
[2022-05-15 20:15:07] [INFO ] Computed 33 place invariants in 9 ms
[2022-05-15 20:15:08] [INFO ] Implicit Places using invariants in 232 ms returned []
// Phase 1: matrix 888 rows 358 cols
[2022-05-15 20:15:08] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-15 20:15:08] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 358/676 places, 888/1130 transitions.
Finished structural reductions, in 3 iterations. Remains : 358/676 places, 888/1130 transitions.
Successfully produced net in file /tmp/petri1000_2814083983885662036.dot
Successfully produced net in file /tmp/petri1001_11494362144413243511.dot
Successfully produced net in file /tmp/petri1002_12804159864908322058.dot
Successfully produced net in file /tmp/petri1003_10135277304227802517.dot
Drop transitions removed 4 transitions
Dominated transitions for bounds rules discarded 4 transitions
// Phase 1: matrix 884 rows 358 cols
[2022-05-15 20:15:08] [INFO ] Computed 33 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 19499 resets, run finished after 1931 ms. (steps per millisecond=517 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5690 resets, run finished after 735 ms. (steps per millisecond=1360 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5755 resets, run finished after 734 ms. (steps per millisecond=1362 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5818 resets, run finished after 728 ms. (steps per millisecond=1373 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5803 resets, run finished after 739 ms. (steps per millisecond=1353 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5721 resets, run finished after 859 ms. (steps per millisecond=1164 ) properties (out of 5) seen :0
// Phase 1: matrix 884 rows 358 cols
[2022-05-15 20:15:14] [INFO ] Computed 33 place invariants in 15 ms
[2022-05-15 20:15:14] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-15 20:15:14] [INFO ] [Real]Absence check using 11 positive and 22 generalized place invariants in 9 ms returned sat
[2022-05-15 20:15:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:14] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2022-05-15 20:15:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-15 20:15:14] [INFO ] [Nat]Absence check using 11 positive and 22 generalized place invariants in 7 ms returned sat
[2022-05-15 20:15:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:15] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2022-05-15 20:15:15] [INFO ] Computed and/alt/rep : 188/908/188 causal constraints (skipped 674 transitions) in 61 ms.
[2022-05-15 20:15:15] [INFO ] Added : 35 causal constraints over 8 iterations in 541 ms. Result :sat
Minimization took 140 ms.
[2022-05-15 20:15:16] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-15 20:15:16] [INFO ] [Real]Absence check using 11 positive and 22 generalized place invariants in 7 ms returned sat
[2022-05-15 20:15:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:16] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2022-05-15 20:15:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-15 20:15:16] [INFO ] [Nat]Absence check using 11 positive and 22 generalized place invariants in 5 ms returned sat
[2022-05-15 20:15:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:16] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2022-05-15 20:15:16] [INFO ] Computed and/alt/rep : 188/908/188 causal constraints (skipped 674 transitions) in 60 ms.
[2022-05-15 20:15:16] [INFO ] Added : 44 causal constraints over 9 iterations in 446 ms. Result :sat
Minimization took 171 ms.
[2022-05-15 20:15:17] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-05-15 20:15:17] [INFO ] [Real]Absence check using 11 positive and 22 generalized place invariants in 17 ms returned sat
[2022-05-15 20:15:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:17] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2022-05-15 20:15:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-15 20:15:17] [INFO ] [Nat]Absence check using 11 positive and 22 generalized place invariants in 7 ms returned sat
[2022-05-15 20:15:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:17] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-05-15 20:15:17] [INFO ] Computed and/alt/rep : 188/908/188 causal constraints (skipped 674 transitions) in 54 ms.
[2022-05-15 20:15:18] [INFO ] Added : 40 causal constraints over 8 iterations in 479 ms. Result :sat
Minimization took 179 ms.
[2022-05-15 20:15:18] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-15 20:15:18] [INFO ] [Real]Absence check using 11 positive and 22 generalized place invariants in 10 ms returned sat
[2022-05-15 20:15:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:18] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2022-05-15 20:15:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-15 20:15:19] [INFO ] [Nat]Absence check using 11 positive and 22 generalized place invariants in 7 ms returned sat
[2022-05-15 20:15:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:19] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2022-05-15 20:15:19] [INFO ] Computed and/alt/rep : 188/908/188 causal constraints (skipped 674 transitions) in 59 ms.
[2022-05-15 20:15:20] [INFO ] Deduced a trap composed of 53 places in 220 ms of which 0 ms to minimize.
[2022-05-15 20:15:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2022-05-15 20:15:20] [INFO ] Added : 42 causal constraints over 9 iterations in 1153 ms. Result :sat
Minimization took 175 ms.
[2022-05-15 20:15:20] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-15 20:15:20] [INFO ] [Real]Absence check using 11 positive and 22 generalized place invariants in 8 ms returned sat
[2022-05-15 20:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:21] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2022-05-15 20:15:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-15 20:15:21] [INFO ] [Nat]Absence check using 11 positive and 22 generalized place invariants in 6 ms returned sat
[2022-05-15 20:15:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:21] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2022-05-15 20:15:21] [INFO ] Computed and/alt/rep : 188/908/188 causal constraints (skipped 674 transitions) in 69 ms.
[2022-05-15 20:15:21] [INFO ] Added : 41 causal constraints over 9 iterations in 547 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA ASLink-PT-04a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 358 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 358/358 places, 884/884 transitions.
Graph (complete) has 2184 edges and 358 vertex of which 354 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.15 ms
Discarding 4 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 354 transition count 884
Applied a total of 5 rules in 61 ms. Remains 354 /358 variables (removed 4) and now considering 884/884 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 354/358 places, 884/884 transitions.
// Phase 1: matrix 884 rows 354 cols
[2022-05-15 20:15:23] [INFO ] Computed 33 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 19365 resets, run finished after 2086 ms. (steps per millisecond=479 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5770 resets, run finished after 730 ms. (steps per millisecond=1369 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5719 resets, run finished after 757 ms. (steps per millisecond=1321 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5835 resets, run finished after 771 ms. (steps per millisecond=1297 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5776 resets, run finished after 744 ms. (steps per millisecond=1344 ) properties (out of 4) seen :0
// Phase 1: matrix 884 rows 354 cols
[2022-05-15 20:15:28] [INFO ] Computed 33 place invariants in 13 ms
[2022-05-15 20:15:28] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-15 20:15:28] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-15 20:15:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:28] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2022-05-15 20:15:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:28] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-15 20:15:28] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 17 ms returned sat
[2022-05-15 20:15:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:28] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2022-05-15 20:15:28] [INFO ] Computed and/alt/rep : 188/906/188 causal constraints (skipped 674 transitions) in 76 ms.
[2022-05-15 20:15:29] [INFO ] Added : 36 causal constraints over 9 iterations in 680 ms. Result :sat
Minimization took 154 ms.
[2022-05-15 20:15:29] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-15 20:15:29] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 7 ms returned sat
[2022-05-15 20:15:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:29] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2022-05-15 20:15:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-05-15 20:15:30] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 6 ms returned sat
[2022-05-15 20:15:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:30] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2022-05-15 20:15:30] [INFO ] Computed and/alt/rep : 188/906/188 causal constraints (skipped 674 transitions) in 67 ms.
[2022-05-15 20:15:31] [INFO ] Added : 37 causal constraints over 9 iterations in 545 ms. Result :sat
Minimization took 145 ms.
[2022-05-15 20:15:31] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-05-15 20:15:31] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 13 ms returned sat
[2022-05-15 20:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:31] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2022-05-15 20:15:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-05-15 20:15:31] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 7 ms returned sat
[2022-05-15 20:15:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:31] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2022-05-15 20:15:31] [INFO ] Computed and/alt/rep : 188/906/188 causal constraints (skipped 674 transitions) in 59 ms.
[2022-05-15 20:15:32] [INFO ] Added : 24 causal constraints over 6 iterations in 443 ms. Result :sat
Minimization took 128 ms.
[2022-05-15 20:15:32] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-15 20:15:32] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 7 ms returned sat
[2022-05-15 20:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:32] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2022-05-15 20:15:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-15 20:15:32] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-15 20:15:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:33] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2022-05-15 20:15:33] [INFO ] Computed and/alt/rep : 188/906/188 causal constraints (skipped 674 transitions) in 71 ms.
[2022-05-15 20:15:33] [INFO ] Added : 18 causal constraints over 4 iterations in 379 ms. Result :sat
Minimization took 254 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 354 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 354/354 places, 884/884 transitions.
Applied a total of 0 rules in 13 ms. Remains 354 /354 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 354/354 places, 884/884 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 354/354 places, 884/884 transitions.
Applied a total of 0 rules in 12 ms. Remains 354 /354 variables (removed 0) and now considering 884/884 (removed 0) transitions.
// Phase 1: matrix 884 rows 354 cols
[2022-05-15 20:15:34] [INFO ] Computed 33 place invariants in 12 ms
[2022-05-15 20:15:34] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 884 rows 354 cols
[2022-05-15 20:15:34] [INFO ] Computed 33 place invariants in 6 ms
[2022-05-15 20:15:35] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
[2022-05-15 20:15:35] [INFO ] Redundant transitions in 62 ms returned []
// Phase 1: matrix 884 rows 354 cols
[2022-05-15 20:15:35] [INFO ] Computed 33 place invariants in 13 ms
[2022-05-15 20:15:35] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 354/354 places, 884/884 transitions.
Starting property specific reduction for ASLink-PT-04a-UpperBounds-00
// Phase 1: matrix 884 rows 354 cols
[2022-05-15 20:15:35] [INFO ] Computed 33 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 198 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 884 rows 354 cols
[2022-05-15 20:15:35] [INFO ] Computed 33 place invariants in 9 ms
[2022-05-15 20:15:35] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-15 20:15:35] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 7 ms returned sat
[2022-05-15 20:15:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:36] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2022-05-15 20:15:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-15 20:15:36] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 7 ms returned sat
[2022-05-15 20:15:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:36] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2022-05-15 20:15:36] [INFO ] Computed and/alt/rep : 188/906/188 causal constraints (skipped 674 transitions) in 59 ms.
[2022-05-15 20:15:37] [INFO ] Added : 36 causal constraints over 9 iterations in 525 ms. Result :sat
Minimization took 108 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 354 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 354/354 places, 884/884 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 882
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 352 transition count 882
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 352 transition count 881
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 351 transition count 881
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 351 transition count 880
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 350 transition count 880
Applied a total of 8 rules in 36 ms. Remains 350 /354 variables (removed 4) and now considering 880/884 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 350/354 places, 880/884 transitions.
// Phase 1: matrix 880 rows 350 cols
[2022-05-15 20:15:37] [INFO ] Computed 33 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 19634 resets, run finished after 1913 ms. (steps per millisecond=522 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5708 resets, run finished after 670 ms. (steps per millisecond=1492 ) properties (out of 1) seen :0
// Phase 1: matrix 880 rows 350 cols
[2022-05-15 20:15:40] [INFO ] Computed 33 place invariants in 15 ms
[2022-05-15 20:15:40] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-15 20:15:40] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-15 20:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:40] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2022-05-15 20:15:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-15 20:15:40] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 7 ms returned sat
[2022-05-15 20:15:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:40] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2022-05-15 20:15:40] [INFO ] Computed and/alt/rep : 177/839/177 causal constraints (skipped 681 transitions) in 54 ms.
[2022-05-15 20:15:41] [INFO ] Added : 28 causal constraints over 7 iterations in 404 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 350 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 350/350 places, 880/880 transitions.
Applied a total of 0 rules in 9 ms. Remains 350 /350 variables (removed 0) and now considering 880/880 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 350/350 places, 880/880 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 350/350 places, 880/880 transitions.
Applied a total of 0 rules in 9 ms. Remains 350 /350 variables (removed 0) and now considering 880/880 (removed 0) transitions.
// Phase 1: matrix 880 rows 350 cols
[2022-05-15 20:15:41] [INFO ] Computed 33 place invariants in 15 ms
[2022-05-15 20:15:41] [INFO ] Implicit Places using invariants in 267 ms returned []
// Phase 1: matrix 880 rows 350 cols
[2022-05-15 20:15:41] [INFO ] Computed 33 place invariants in 13 ms
[2022-05-15 20:15:42] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
[2022-05-15 20:15:42] [INFO ] Redundant transitions in 88 ms returned []
// Phase 1: matrix 880 rows 350 cols
[2022-05-15 20:15:42] [INFO ] Computed 33 place invariants in 6 ms
[2022-05-15 20:15:42] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 350/350 places, 880/880 transitions.
Ending property specific reduction for ASLink-PT-04a-UpperBounds-00 in 6958 ms.
Starting property specific reduction for ASLink-PT-04a-UpperBounds-02
// Phase 1: matrix 884 rows 354 cols
[2022-05-15 20:15:42] [INFO ] Computed 33 place invariants in 16 ms
Incomplete random walk after 10000 steps, including 204 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 884 rows 354 cols
[2022-05-15 20:15:42] [INFO ] Computed 33 place invariants in 6 ms
[2022-05-15 20:15:42] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-05-15 20:15:42] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 6 ms returned sat
[2022-05-15 20:15:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:43] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2022-05-15 20:15:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-15 20:15:43] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 5 ms returned sat
[2022-05-15 20:15:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:43] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2022-05-15 20:15:43] [INFO ] Computed and/alt/rep : 188/906/188 causal constraints (skipped 674 transitions) in 60 ms.
[2022-05-15 20:15:43] [INFO ] Added : 37 causal constraints over 9 iterations in 439 ms. Result :sat
Minimization took 144 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 354 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 354/354 places, 884/884 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 354 transition count 881
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 351 transition count 881
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 351 transition count 880
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 350 transition count 880
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 350 transition count 879
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 349 transition count 879
Applied a total of 10 rules in 26 ms. Remains 349 /354 variables (removed 5) and now considering 879/884 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 349/354 places, 879/884 transitions.
// Phase 1: matrix 879 rows 349 cols
[2022-05-15 20:15:44] [INFO ] Computed 33 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 19637 resets, run finished after 1499 ms. (steps per millisecond=667 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5717 resets, run finished after 647 ms. (steps per millisecond=1545 ) properties (out of 1) seen :0
// Phase 1: matrix 879 rows 349 cols
[2022-05-15 20:15:46] [INFO ] Computed 33 place invariants in 14 ms
[2022-05-15 20:15:46] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-15 20:15:46] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-15 20:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:46] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2022-05-15 20:15:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-15 20:15:46] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 5 ms returned sat
[2022-05-15 20:15:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:47] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2022-05-15 20:15:47] [INFO ] Computed and/alt/rep : 176/838/176 causal constraints (skipped 681 transitions) in 57 ms.
[2022-05-15 20:15:47] [INFO ] Added : 10 causal constraints over 2 iterations in 229 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 349 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 349/349 places, 879/879 transitions.
Applied a total of 0 rules in 12 ms. Remains 349 /349 variables (removed 0) and now considering 879/879 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 349/349 places, 879/879 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 349/349 places, 879/879 transitions.
Applied a total of 0 rules in 12 ms. Remains 349 /349 variables (removed 0) and now considering 879/879 (removed 0) transitions.
// Phase 1: matrix 879 rows 349 cols
[2022-05-15 20:15:47] [INFO ] Computed 33 place invariants in 11 ms
[2022-05-15 20:15:48] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 879 rows 349 cols
[2022-05-15 20:15:48] [INFO ] Computed 33 place invariants in 6 ms
[2022-05-15 20:15:48] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
[2022-05-15 20:15:48] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 879 rows 349 cols
[2022-05-15 20:15:48] [INFO ] Computed 33 place invariants in 7 ms
[2022-05-15 20:15:49] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 349/349 places, 879/879 transitions.
// Phase 1: matrix 879 rows 349 cols
[2022-05-15 20:15:49] [INFO ] Computed 33 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 19685 resets, run finished after 1535 ms. (steps per millisecond=651 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5774 resets, run finished after 661 ms. (steps per millisecond=1512 ) properties (out of 1) seen :0
// Phase 1: matrix 879 rows 349 cols
[2022-05-15 20:15:51] [INFO ] Computed 33 place invariants in 13 ms
[2022-05-15 20:15:51] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-15 20:15:51] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA ASLink-PT-04a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for ASLink-PT-04a-UpperBounds-02 in 8661 ms.
Starting property specific reduction for ASLink-PT-04a-UpperBounds-10
// Phase 1: matrix 884 rows 354 cols
[2022-05-15 20:15:51] [INFO ] Computed 33 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 188 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
// Phase 1: matrix 884 rows 354 cols
[2022-05-15 20:15:51] [INFO ] Computed 33 place invariants in 11 ms
[2022-05-15 20:15:51] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-15 20:15:51] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 8 ms returned sat
[2022-05-15 20:15:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:51] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2022-05-15 20:15:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-15 20:15:51] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 7 ms returned sat
[2022-05-15 20:15:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:52] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2022-05-15 20:15:52] [INFO ] Computed and/alt/rep : 188/906/188 causal constraints (skipped 674 transitions) in 70 ms.
[2022-05-15 20:15:52] [INFO ] Added : 24 causal constraints over 6 iterations in 459 ms. Result :sat
Minimization took 134 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 354 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 354/354 places, 884/884 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 882
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 352 transition count 882
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 352 transition count 881
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 351 transition count 881
Applied a total of 6 rules in 20 ms. Remains 351 /354 variables (removed 3) and now considering 881/884 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/354 places, 881/884 transitions.
// Phase 1: matrix 881 rows 351 cols
[2022-05-15 20:15:53] [INFO ] Computed 33 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 19473 resets, run finished after 1669 ms. (steps per millisecond=599 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5807 resets, run finished after 775 ms. (steps per millisecond=1290 ) properties (out of 1) seen :0
// Phase 1: matrix 881 rows 351 cols
[2022-05-15 20:15:55] [INFO ] Computed 33 place invariants in 13 ms
[2022-05-15 20:15:55] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-15 20:15:55] [INFO ] [Real]Absence check using 11 positive and 22 generalized place invariants in 8 ms returned sat
[2022-05-15 20:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:55] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2022-05-15 20:15:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-15 20:15:56] [INFO ] [Nat]Absence check using 11 positive and 22 generalized place invariants in 6 ms returned sat
[2022-05-15 20:15:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:56] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2022-05-15 20:15:56] [INFO ] Computed and/alt/rep : 185/903/185 causal constraints (skipped 674 transitions) in 57 ms.
[2022-05-15 20:15:56] [INFO ] Added : 9 causal constraints over 2 iterations in 235 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 881/881 transitions.
Applied a total of 0 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 881/881 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 881/881 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 881/881 transitions.
Applied a total of 0 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 881/881 (removed 0) transitions.
// Phase 1: matrix 881 rows 351 cols
[2022-05-15 20:15:56] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-15 20:15:57] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 881 rows 351 cols
[2022-05-15 20:15:57] [INFO ] Computed 33 place invariants in 7 ms
[2022-05-15 20:15:57] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
[2022-05-15 20:15:57] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 881 rows 351 cols
[2022-05-15 20:15:57] [INFO ] Computed 33 place invariants in 5 ms
[2022-05-15 20:15:58] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 881/881 transitions.
Ending property specific reduction for ASLink-PT-04a-UpperBounds-10 in 6890 ms.
Starting property specific reduction for ASLink-PT-04a-UpperBounds-15
// Phase 1: matrix 884 rows 354 cols
[2022-05-15 20:15:58] [INFO ] Computed 33 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 203 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 884 rows 354 cols
[2022-05-15 20:15:58] [INFO ] Computed 33 place invariants in 5 ms
[2022-05-15 20:15:58] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-15 20:15:58] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 6 ms returned sat
[2022-05-15 20:15:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:58] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2022-05-15 20:15:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:15:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-15 20:15:58] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 13 ms returned sat
[2022-05-15 20:15:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:15:59] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2022-05-15 20:15:59] [INFO ] Computed and/alt/rep : 188/906/188 causal constraints (skipped 674 transitions) in 66 ms.
[2022-05-15 20:15:59] [INFO ] Added : 18 causal constraints over 4 iterations in 380 ms. Result :sat
Minimization took 174 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 354 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 354/354 places, 884/884 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 882
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 352 transition count 882
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 352 transition count 881
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 351 transition count 881
Applied a total of 6 rules in 37 ms. Remains 351 /354 variables (removed 3) and now considering 881/884 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/354 places, 881/884 transitions.
// Phase 1: matrix 881 rows 351 cols
[2022-05-15 20:15:59] [INFO ] Computed 33 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 19692 resets, run finished after 1871 ms. (steps per millisecond=534 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5736 resets, run finished after 887 ms. (steps per millisecond=1127 ) properties (out of 1) seen :0
// Phase 1: matrix 881 rows 351 cols
[2022-05-15 20:16:02] [INFO ] Computed 33 place invariants in 16 ms
[2022-05-15 20:16:02] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-15 20:16:02] [INFO ] [Real]Absence check using 11 positive and 22 generalized place invariants in 8 ms returned sat
[2022-05-15 20:16:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:03] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2022-05-15 20:16:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:16:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-15 20:16:03] [INFO ] [Nat]Absence check using 11 positive and 22 generalized place invariants in 15 ms returned sat
[2022-05-15 20:16:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:16:03] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2022-05-15 20:16:03] [INFO ] Computed and/alt/rep : 178/840/178 causal constraints (skipped 681 transitions) in 75 ms.
[2022-05-15 20:16:03] [INFO ] Added : 25 causal constraints over 5 iterations in 458 ms. Result :sat
Minimization took 251 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 881/881 transitions.
Applied a total of 0 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 881/881 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 881/881 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 351/351 places, 881/881 transitions.
Applied a total of 0 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 881/881 (removed 0) transitions.
// Phase 1: matrix 881 rows 351 cols
[2022-05-15 20:16:04] [INFO ] Computed 33 place invariants in 9 ms
[2022-05-15 20:16:04] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 881 rows 351 cols
[2022-05-15 20:16:04] [INFO ] Computed 33 place invariants in 7 ms
[2022-05-15 20:16:05] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
[2022-05-15 20:16:05] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 881 rows 351 cols
[2022-05-15 20:16:05] [INFO ] Computed 33 place invariants in 7 ms
[2022-05-15 20:16:05] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 881/881 transitions.
Ending property specific reduction for ASLink-PT-04a-UpperBounds-15 in 7308 ms.
[2022-05-15 20:16:05] [INFO ] Flatten gal took : 131 ms
[2022-05-15 20:16:06] [INFO ] Applying decomposition
[2022-05-15 20:16:06] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2306373130006436253.txt' '-o' '/tmp/graph2306373130006436253.bin' '-w' '/tmp/graph2306373130006436253.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2306373130006436253.bin' '-l' '-1' '-v' '-w' '/tmp/graph2306373130006436253.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:16:06] [INFO ] Decomposing Gal with order
[2022-05-15 20:16:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:16:06] [INFO ] Removed a total of 1834 redundant transitions.
[2022-05-15 20:16:06] [INFO ] Flatten gal took : 138 ms
[2022-05-15 20:16:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 39 ms.
[2022-05-15 20:16:06] [INFO ] Time to serialize gal into /tmp/UpperBounds13136709611337851166.gal : 21 ms
[2022-05-15 20:16:06] [INFO ] Time to serialize properties into /tmp/UpperBounds10355991195184969771.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13136709611337851166.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10355991195184969771.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds10355991195184969771.prop.
Detected timeout of ITS tools.
[2022-05-15 20:37:08] [INFO ] Applying decomposition
[2022-05-15 20:37:09] [INFO ] Flatten gal took : 82 ms
[2022-05-15 20:37:09] [INFO ] Decomposing Gal with order
[2022-05-15 20:37:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:37:09] [INFO ] Removed a total of 1623 redundant transitions.
[2022-05-15 20:37:09] [INFO ] Flatten gal took : 124 ms
[2022-05-15 20:37:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 314 labels/synchronizations in 20 ms.
[2022-05-15 20:37:09] [INFO ] Time to serialize gal into /tmp/UpperBounds16924634164099719954.gal : 4 ms
[2022-05-15 20:37:09] [INFO ] Time to serialize properties into /tmp/UpperBounds16827727244699094534.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16924634164099719954.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16827727244699094534.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds16827727244699094534.prop.
Detected timeout of ITS tools.
[2022-05-15 20:58:11] [INFO ] Flatten gal took : 72 ms
[2022-05-15 20:58:11] [INFO ] Input system was already deterministic with 884 transitions.
[2022-05-15 20:58:11] [INFO ] Transformed 354 places.
[2022-05-15 20:58:11] [INFO ] Transformed 884 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 20:58:11] [INFO ] Time to serialize gal into /tmp/UpperBounds9963620229707829001.gal : 8 ms
[2022-05-15 20:58:11] [INFO ] Time to serialize properties into /tmp/UpperBounds16199615537450839524.prop : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9963620229707829001.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16199615537450839524.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds16199615537450839524.prop.
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="ASLink-PT-04a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-04a, 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 r006-tajo-165245688800061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04a.tgz
mv ASLink-PT-04a 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 ;