About the Execution of ITS-Tools for ASLink-PT-07b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.823 | 3600000.00 | 3660317.00 | 16730.20 | 1 1 1 1 1 1 1 1 1 1 1 1 ? 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813592700117.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ASLink-PT-07b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813592700117
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-07b-UpperBounds-00
FORMULA_NAME ASLink-PT-07b-UpperBounds-01
FORMULA_NAME ASLink-PT-07b-UpperBounds-02
FORMULA_NAME ASLink-PT-07b-UpperBounds-03
FORMULA_NAME ASLink-PT-07b-UpperBounds-04
FORMULA_NAME ASLink-PT-07b-UpperBounds-05
FORMULA_NAME ASLink-PT-07b-UpperBounds-06
FORMULA_NAME ASLink-PT-07b-UpperBounds-07
FORMULA_NAME ASLink-PT-07b-UpperBounds-08
FORMULA_NAME ASLink-PT-07b-UpperBounds-09
FORMULA_NAME ASLink-PT-07b-UpperBounds-10
FORMULA_NAME ASLink-PT-07b-UpperBounds-11
FORMULA_NAME ASLink-PT-07b-UpperBounds-12
FORMULA_NAME ASLink-PT-07b-UpperBounds-13
FORMULA_NAME ASLink-PT-07b-UpperBounds-14
FORMULA_NAME ASLink-PT-07b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678497736294
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-07b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-11 01:22:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 01:22:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 01:22:18] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2023-03-11 01:22:18] [INFO ] Transformed 3222 places.
[2023-03-11 01:22:18] [INFO ] Transformed 3986 transitions.
[2023-03-11 01:22:18] [INFO ] Found NUPN structural information;
[2023-03-11 01:22:18] [INFO ] Parsed PT model containing 3222 places and 3986 transitions and 12126 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3986 rows 3222 cols
[2023-03-11 01:22:19] [INFO ] Computed 316 place invariants in 156 ms
Incomplete random walk after 10000 steps, including 13 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 16) seen :8
FORMULA ASLink-PT-07b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 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 2 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 2 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 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :1
FORMULA ASLink-PT-07b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
[2023-03-11 01:22:19] [INFO ] Invariant cache hit.
[2023-03-11 01:22:20] [INFO ] [Real]Absence check using 75 positive place invariants in 79 ms returned sat
[2023-03-11 01:22:20] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 137 ms returned sat
[2023-03-11 01:22:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:22:23] [INFO ] [Real]Absence check using state equation in 2646 ms returned sat
[2023-03-11 01:22:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:22:24] [INFO ] [Nat]Absence check using 75 positive place invariants in 72 ms returned sat
[2023-03-11 01:22:24] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 112 ms returned sat
[2023-03-11 01:22:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:22:28] [INFO ] [Nat]Absence check using state equation in 4223 ms returned unknown
[2023-03-11 01:22:29] [INFO ] [Real]Absence check using 75 positive place invariants in 66 ms returned sat
[2023-03-11 01:22:29] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 208 ms returned sat
[2023-03-11 01:22:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:22:32] [INFO ] [Real]Absence check using state equation in 2830 ms returned sat
[2023-03-11 01:22:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:22:32] [INFO ] [Nat]Absence check using 75 positive place invariants in 66 ms returned sat
[2023-03-11 01:22:33] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 196 ms returned sat
[2023-03-11 01:22:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:22:37] [INFO ] [Nat]Absence check using state equation in 4233 ms returned unknown
[2023-03-11 01:22:37] [INFO ] [Real]Absence check using 75 positive place invariants in 59 ms returned sat
[2023-03-11 01:22:37] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 116 ms returned sat
[2023-03-11 01:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:22:40] [INFO ] [Real]Absence check using state equation in 2961 ms returned sat
[2023-03-11 01:22:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:22:41] [INFO ] [Nat]Absence check using 75 positive place invariants in 62 ms returned sat
[2023-03-11 01:22:41] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 96 ms returned sat
[2023-03-11 01:22:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:22:46] [INFO ] [Nat]Absence check using state equation in 4373 ms returned unknown
[2023-03-11 01:22:46] [INFO ] [Real]Absence check using 75 positive place invariants in 60 ms returned sat
[2023-03-11 01:22:46] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 146 ms returned sat
[2023-03-11 01:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:22:50] [INFO ] [Real]Absence check using state equation in 3211 ms returned sat
[2023-03-11 01:22:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:22:50] [INFO ] [Nat]Absence check using 75 positive place invariants in 65 ms returned sat
[2023-03-11 01:22:51] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 122 ms returned sat
[2023-03-11 01:22:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:22:53] [INFO ] [Nat]Absence check using state equation in 2090 ms returned sat
[2023-03-11 01:22:55] [INFO ] Deduced a trap composed of 157 places in 2182 ms of which 6 ms to minimize.
[2023-03-11 01:22:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 01:22:56] [INFO ] [Real]Absence check using 75 positive place invariants in 122 ms returned sat
[2023-03-11 01:22:56] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 126 ms returned sat
[2023-03-11 01:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:22:59] [INFO ] [Real]Absence check using state equation in 3106 ms returned sat
[2023-03-11 01:22:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:23:00] [INFO ] [Nat]Absence check using 75 positive place invariants in 63 ms returned sat
[2023-03-11 01:23:00] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 138 ms returned sat
[2023-03-11 01:23:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:23:04] [INFO ] [Nat]Absence check using state equation in 4281 ms returned unknown
[2023-03-11 01:23:05] [INFO ] [Real]Absence check using 75 positive place invariants in 62 ms returned sat
[2023-03-11 01:23:05] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 182 ms returned sat
[2023-03-11 01:23:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:23:07] [INFO ] [Real]Absence check using state equation in 2003 ms returned sat
[2023-03-11 01:23:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:23:08] [INFO ] [Nat]Absence check using 75 positive place invariants in 66 ms returned sat
[2023-03-11 01:23:08] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 142 ms returned sat
[2023-03-11 01:23:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:23:12] [INFO ] [Nat]Absence check using state equation in 4235 ms returned unknown
[2023-03-11 01:23:13] [INFO ] [Real]Absence check using 75 positive place invariants in 62 ms returned sat
[2023-03-11 01:23:13] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 106 ms returned sat
[2023-03-11 01:23:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:23:17] [INFO ] [Real]Absence check using state equation in 3720 ms returned sat
[2023-03-11 01:23:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:23:17] [INFO ] [Nat]Absence check using 75 positive place invariants in 61 ms returned sat
[2023-03-11 01:23:17] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 97 ms returned sat
[2023-03-11 01:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:23:22] [INFO ] [Nat]Absence check using state equation in 4389 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 3222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3222/3222 places, 3986/3986 transitions.
Drop transitions removed 746 transitions
Trivial Post-agglo rules discarded 746 transitions
Performed 746 trivial Post agglomeration. Transition count delta: 746
Iterating post reduction 0 with 746 rules applied. Total rules applied 746 place count 3222 transition count 3240
Reduce places removed 746 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 780 rules applied. Total rules applied 1526 place count 2476 transition count 3206
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 1536 place count 2467 transition count 3205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1537 place count 2466 transition count 3205
Performed 747 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 747 Pre rules applied. Total rules applied 1537 place count 2466 transition count 2458
Deduced a syphon composed of 747 places in 7 ms
Ensure Unique test removed 73 places
Reduce places removed 820 places and 0 transitions.
Iterating global reduction 4 with 1567 rules applied. Total rules applied 3104 place count 1646 transition count 2458
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 4 with 54 rules applied. Total rules applied 3158 place count 1638 transition count 2412
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 47 rules applied. Total rules applied 3205 place count 1592 transition count 2411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3206 place count 1591 transition count 2411
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 28 Pre rules applied. Total rules applied 3206 place count 1591 transition count 2383
Deduced a syphon composed of 28 places in 15 ms
Ensure Unique test removed 27 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 7 with 83 rules applied. Total rules applied 3289 place count 1536 transition count 2383
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 27 Pre rules applied. Total rules applied 3289 place count 1536 transition count 2356
Deduced a syphon composed of 27 places in 13 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 3343 place count 1509 transition count 2356
Discarding 103 places :
Symmetric choice reduction at 7 with 103 rule applications. Total rules 3446 place count 1406 transition count 2253
Iterating global reduction 7 with 103 rules applied. Total rules applied 3549 place count 1406 transition count 2253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3550 place count 1406 transition count 2252
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 34 Pre rules applied. Total rules applied 3550 place count 1406 transition count 2218
Deduced a syphon composed of 34 places in 12 ms
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 8 with 69 rules applied. Total rules applied 3619 place count 1371 transition count 2218
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3619 place count 1371 transition count 2217
Deduced a syphon composed of 1 places in 31 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 3622 place count 1369 transition count 2217
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 3630 place count 1361 transition count 2166
Iterating global reduction 8 with 8 rules applied. Total rules applied 3638 place count 1361 transition count 2166
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 7 Pre rules applied. Total rules applied 3638 place count 1361 transition count 2159
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 3652 place count 1354 transition count 2159
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3653 place count 1353 transition count 2151
Iterating global reduction 8 with 1 rules applied. Total rules applied 3654 place count 1353 transition count 2151
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3655 place count 1352 transition count 2143
Iterating global reduction 8 with 1 rules applied. Total rules applied 3656 place count 1352 transition count 2143
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3657 place count 1351 transition count 2135
Iterating global reduction 8 with 1 rules applied. Total rules applied 3658 place count 1351 transition count 2135
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3659 place count 1350 transition count 2127
Iterating global reduction 8 with 1 rules applied. Total rules applied 3660 place count 1350 transition count 2127
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3661 place count 1349 transition count 2119
Iterating global reduction 8 with 1 rules applied. Total rules applied 3662 place count 1349 transition count 2119
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3663 place count 1348 transition count 2111
Iterating global reduction 8 with 1 rules applied. Total rules applied 3664 place count 1348 transition count 2111
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3665 place count 1347 transition count 2103
Iterating global reduction 8 with 1 rules applied. Total rules applied 3666 place count 1347 transition count 2103
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3667 place count 1346 transition count 2095
Iterating global reduction 8 with 1 rules applied. Total rules applied 3668 place count 1346 transition count 2095
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3669 place count 1345 transition count 2087
Iterating global reduction 8 with 1 rules applied. Total rules applied 3670 place count 1345 transition count 2087
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3671 place count 1344 transition count 2079
Iterating global reduction 8 with 1 rules applied. Total rules applied 3672 place count 1344 transition count 2079
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3673 place count 1343 transition count 2071
Iterating global reduction 8 with 1 rules applied. Total rules applied 3674 place count 1343 transition count 2071
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3675 place count 1342 transition count 2063
Iterating global reduction 8 with 1 rules applied. Total rules applied 3676 place count 1342 transition count 2063
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3677 place count 1341 transition count 2055
Iterating global reduction 8 with 1 rules applied. Total rules applied 3678 place count 1341 transition count 2055
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3679 place count 1340 transition count 2047
Iterating global reduction 8 with 1 rules applied. Total rules applied 3680 place count 1340 transition count 2047
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3681 place count 1339 transition count 2039
Iterating global reduction 8 with 1 rules applied. Total rules applied 3682 place count 1339 transition count 2039
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3683 place count 1338 transition count 2031
Iterating global reduction 8 with 1 rules applied. Total rules applied 3684 place count 1338 transition count 2031
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 186
Deduced a syphon composed of 186 places in 3 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 8 with 372 rules applied. Total rules applied 4056 place count 1152 transition count 1845
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4057 place count 1151 transition count 1844
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 4059 place count 1150 transition count 1844
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4060 place count 1149 transition count 1843
Iterating global reduction 8 with 1 rules applied. Total rules applied 4061 place count 1149 transition count 1843
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 4063 place count 1149 transition count 1841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4064 place count 1148 transition count 1841
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4066 place count 1147 transition count 1850
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 4074 place count 1147 transition count 1842
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4082 place count 1139 transition count 1842
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 11 with 6 rules applied. Total rules applied 4088 place count 1139 transition count 1836
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 4094 place count 1133 transition count 1836
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4095 place count 1132 transition count 1835
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 12 with 21 rules applied. Total rules applied 4116 place count 1118 transition count 1828
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 4123 place count 1111 transition count 1828
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 20 Pre rules applied. Total rules applied 4123 place count 1111 transition count 1808
Deduced a syphon composed of 20 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 14 with 41 rules applied. Total rules applied 4164 place count 1090 transition count 1808
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 14 with 8 rules applied. Total rules applied 4172 place count 1082 transition count 1808
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 4172 place count 1082 transition count 1807
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 4174 place count 1081 transition count 1807
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 4 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 15 with 30 rules applied. Total rules applied 4204 place count 1066 transition count 1792
Discarding 7 places :
Symmetric choice reduction at 15 with 7 rule applications. Total rules 4211 place count 1059 transition count 1785
Iterating global reduction 15 with 7 rules applied. Total rules applied 4218 place count 1059 transition count 1785
Free-agglomeration rule applied 7 times.
Iterating global reduction 15 with 7 rules applied. Total rules applied 4225 place count 1059 transition count 1778
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 4232 place count 1052 transition count 1778
Applied a total of 4232 rules in 2281 ms. Remains 1052 /3222 variables (removed 2170) and now considering 1778/3986 (removed 2208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2281 ms. Remains : 1052/3222 places, 1778/3986 transitions.
// Phase 1: matrix 1778 rows 1052 cols
[2023-03-11 01:23:24] [INFO ] Computed 182 place invariants in 63 ms
Incomplete random walk after 1000000 steps, including 10912 resets, run finished after 3735 ms. (steps per millisecond=267 ) properties (out of 7) seen :4
FORMULA ASLink-PT-07b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1527 resets, run finished after 1635 ms. (steps per millisecond=611 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1528 resets, run finished after 1563 ms. (steps per millisecond=639 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1532 resets, run finished after 1532 ms. (steps per millisecond=652 ) properties (out of 3) seen :0
[2023-03-11 01:23:33] [INFO ] Invariant cache hit.
[2023-03-11 01:23:33] [INFO ] [Real]Absence check using 49 positive place invariants in 106 ms returned sat
[2023-03-11 01:23:33] [INFO ] [Real]Absence check using 49 positive and 133 generalized place invariants in 50 ms returned sat
[2023-03-11 01:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:23:34] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2023-03-11 01:23:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:23:34] [INFO ] [Nat]Absence check using 49 positive place invariants in 27 ms returned sat
[2023-03-11 01:23:34] [INFO ] [Nat]Absence check using 49 positive and 133 generalized place invariants in 116 ms returned sat
[2023-03-11 01:23:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:23:35] [INFO ] [Nat]Absence check using state equation in 1320 ms returned sat
[2023-03-11 01:23:36] [INFO ] Computed and/alt/rep : 700/2662/700 causal constraints (skipped 1041 transitions) in 145 ms.
[2023-03-11 01:23:49] [INFO ] Deduced a trap composed of 112 places in 346 ms of which 9 ms to minimize.
[2023-03-11 01:23:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 576 ms
[2023-03-11 01:23:49] [INFO ] Added : 478 causal constraints over 96 iterations in 13593 ms. Result :sat
Minimization took 923 ms.
[2023-03-11 01:23:50] [INFO ] [Real]Absence check using 49 positive place invariants in 15 ms returned sat
[2023-03-11 01:23:50] [INFO ] [Real]Absence check using 49 positive and 133 generalized place invariants in 32 ms returned sat
[2023-03-11 01:23:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:23:51] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2023-03-11 01:23:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:23:51] [INFO ] [Nat]Absence check using 49 positive place invariants in 14 ms returned sat
[2023-03-11 01:23:51] [INFO ] [Nat]Absence check using 49 positive and 133 generalized place invariants in 24 ms returned sat
[2023-03-11 01:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:23:52] [INFO ] [Nat]Absence check using state equation in 893 ms returned sat
[2023-03-11 01:23:52] [INFO ] Computed and/alt/rep : 700/2662/700 causal constraints (skipped 1041 transitions) in 130 ms.
[2023-03-11 01:24:08] [INFO ] Added : 564 causal constraints over 113 iterations in 15397 ms. Result :sat
Minimization took 671 ms.
[2023-03-11 01:24:08] [INFO ] [Real]Absence check using 49 positive place invariants in 18 ms returned sat
[2023-03-11 01:24:08] [INFO ] [Real]Absence check using 49 positive and 133 generalized place invariants in 42 ms returned sat
[2023-03-11 01:24:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:24:09] [INFO ] [Real]Absence check using state equation in 781 ms returned sat
[2023-03-11 01:24:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:24:10] [INFO ] [Nat]Absence check using 49 positive place invariants in 18 ms returned sat
[2023-03-11 01:24:10] [INFO ] [Nat]Absence check using 49 positive and 133 generalized place invariants in 25 ms returned sat
[2023-03-11 01:24:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:24:10] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2023-03-11 01:24:11] [INFO ] Computed and/alt/rep : 700/2662/700 causal constraints (skipped 1041 transitions) in 121 ms.
[2023-03-11 01:24:14] [INFO ] Added : 124 causal constraints over 25 iterations in 3656 ms. Result :sat
Minimization took 390 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 1052 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1052/1052 places, 1778/1778 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 1052 transition count 1776
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1050 transition count 1776
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 1050 transition count 1773
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 1047 transition count 1773
Applied a total of 10 rules in 54 ms. Remains 1047 /1052 variables (removed 5) and now considering 1773/1778 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1047/1052 places, 1773/1778 transitions.
// Phase 1: matrix 1773 rows 1047 cols
[2023-03-11 01:24:17] [INFO ] Computed 182 place invariants in 71 ms
Incomplete random walk after 1000000 steps, including 10782 resets, run finished after 3457 ms. (steps per millisecond=289 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1519 resets, run finished after 1337 ms. (steps per millisecond=747 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1516 resets, run finished after 1572 ms. (steps per millisecond=636 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1531 resets, run finished after 1533 ms. (steps per millisecond=652 ) properties (out of 3) seen :0
[2023-03-11 01:24:24] [INFO ] Invariant cache hit.
[2023-03-11 01:24:25] [INFO ] [Real]Absence check using 49 positive place invariants in 13 ms returned sat
[2023-03-11 01:24:25] [INFO ] [Real]Absence check using 49 positive and 133 generalized place invariants in 187 ms returned sat
[2023-03-11 01:24:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:24:26] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2023-03-11 01:24:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:24:26] [INFO ] [Nat]Absence check using 49 positive place invariants in 19 ms returned sat
[2023-03-11 01:24:26] [INFO ] [Nat]Absence check using 49 positive and 133 generalized place invariants in 194 ms returned sat
[2023-03-11 01:24:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:24:27] [INFO ] [Nat]Absence check using state equation in 1028 ms returned sat
[2023-03-11 01:24:27] [INFO ] Computed and/alt/rep : 695/2657/695 causal constraints (skipped 1041 transitions) in 97 ms.
[2023-03-11 01:24:44] [INFO ] Added : 587 causal constraints over 118 iterations in 16740 ms. Result :sat
Minimization took 972 ms.
[2023-03-11 01:24:45] [INFO ] [Real]Absence check using 49 positive place invariants in 17 ms returned sat
[2023-03-11 01:24:45] [INFO ] [Real]Absence check using 49 positive and 133 generalized place invariants in 135 ms returned sat
[2023-03-11 01:24:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:24:46] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2023-03-11 01:24:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:24:46] [INFO ] [Nat]Absence check using 49 positive place invariants in 15 ms returned sat
[2023-03-11 01:24:46] [INFO ] [Nat]Absence check using 49 positive and 133 generalized place invariants in 47 ms returned sat
[2023-03-11 01:24:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:24:47] [INFO ] [Nat]Absence check using state equation in 807 ms returned sat
[2023-03-11 01:24:47] [INFO ] Computed and/alt/rep : 695/2657/695 causal constraints (skipped 1041 transitions) in 125 ms.
[2023-03-11 01:24:57] [INFO ] Added : 155 causal constraints over 31 iterations in 10402 ms. Result :unknown
[2023-03-11 01:24:58] [INFO ] [Real]Absence check using 49 positive place invariants in 27 ms returned sat
[2023-03-11 01:24:58] [INFO ] [Real]Absence check using 49 positive and 133 generalized place invariants in 104 ms returned sat
[2023-03-11 01:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:24:58] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2023-03-11 01:24:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:24:59] [INFO ] [Nat]Absence check using 49 positive place invariants in 43 ms returned sat
[2023-03-11 01:24:59] [INFO ] [Nat]Absence check using 49 positive and 133 generalized place invariants in 32 ms returned sat
[2023-03-11 01:24:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:25:00] [INFO ] [Nat]Absence check using state equation in 1112 ms returned sat
[2023-03-11 01:25:00] [INFO ] Computed and/alt/rep : 695/2657/695 causal constraints (skipped 1041 transitions) in 132 ms.
[2023-03-11 01:25:12] [INFO ] Added : 484 causal constraints over 97 iterations in 12494 ms. Result :sat
Minimization took 679 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 1047 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1047/1047 places, 1773/1773 transitions.
Applied a total of 0 rules in 32 ms. Remains 1047 /1047 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1047/1047 places, 1773/1773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1047/1047 places, 1773/1773 transitions.
Applied a total of 0 rules in 30 ms. Remains 1047 /1047 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
[2023-03-11 01:25:16] [INFO ] Invariant cache hit.
[2023-03-11 01:25:17] [INFO ] Implicit Places using invariants in 980 ms returned [1, 18, 19, 31, 48, 66, 136, 140, 149, 150, 152, 169, 187, 262, 263, 274, 275, 277, 294, 312, 381, 385, 386, 397, 398, 400, 417, 435, 504, 508, 509, 520, 521, 523, 540, 558, 627, 631, 632, 643, 644, 646, 663, 681, 750, 754, 755, 766, 767, 769, 786, 804, 873, 877, 878, 881, 892, 893, 894, 912, 914, 918, 936, 937, 938, 939, 951, 957, 963, 969, 975, 981, 987, 993, 999, 1005, 1011]
Discarding 77 places :
Implicit Place search using SMT only with invariants took 984 ms to find 77 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 970/1047 places, 1773/1773 transitions.
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 970 transition count 1632
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 148 rules applied. Total rules applied 289 place count 829 transition count 1625
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 289 place count 829 transition count 1590
Deduced a syphon composed of 35 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 71 rules applied. Total rules applied 360 place count 793 transition count 1590
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 372 place count 789 transition count 1582
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 380 place count 781 transition count 1582
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 395 place count 766 transition count 1567
Iterating global reduction 4 with 15 rules applied. Total rules applied 410 place count 766 transition count 1567
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 413 place count 766 transition count 1564
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 413 place count 766 transition count 1563
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 415 place count 765 transition count 1563
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 418 place count 762 transition count 1557
Iterating global reduction 5 with 3 rules applied. Total rules applied 421 place count 762 transition count 1557
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 422 place count 761 transition count 1556
Iterating global reduction 5 with 1 rules applied. Total rules applied 423 place count 761 transition count 1556
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 424 place count 760 transition count 1554
Iterating global reduction 5 with 1 rules applied. Total rules applied 425 place count 760 transition count 1554
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 2 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 529 place count 708 transition count 1502
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 535 place count 702 transition count 1496
Iterating global reduction 5 with 6 rules applied. Total rules applied 541 place count 702 transition count 1496
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 547 place count 702 transition count 1490
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 551 place count 700 transition count 1491
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 6 with 16 rules applied. Total rules applied 567 place count 700 transition count 1475
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 584 place count 683 transition count 1475
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 7 with 21 rules applied. Total rules applied 605 place count 683 transition count 1475
Applied a total of 605 rules in 312 ms. Remains 683 /970 variables (removed 287) and now considering 1475/1773 (removed 298) transitions.
// Phase 1: matrix 1475 rows 683 cols
[2023-03-11 01:25:17] [INFO ] Computed 99 place invariants in 9 ms
[2023-03-11 01:25:18] [INFO ] Implicit Places using invariants in 856 ms returned [72, 91, 97, 100, 102, 105, 106, 175, 181, 184, 186, 189, 194, 195, 247, 264, 270, 273, 275, 280, 281, 333, 350, 356, 359, 361, 366, 367, 419, 436, 442, 445, 447, 452, 453, 505, 522, 528, 531, 533, 538, 539, 591, 608, 614, 617, 619]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 859 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 636/1047 places, 1475/1773 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 614 transition count 1453
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 614 transition count 1453
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 607 transition count 1446
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 607 transition count 1446
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 84 place count 594 transition count 1433
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 85 place count 594 transition count 1432
Free-agglomeration rule applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 106 place count 594 transition count 1411
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 127 place count 573 transition count 1411
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 133 place count 573 transition count 1405
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 139 place count 567 transition count 1405
Applied a total of 139 rules in 161 ms. Remains 567 /636 variables (removed 69) and now considering 1405/1475 (removed 70) transitions.
// Phase 1: matrix 1405 rows 567 cols
[2023-03-11 01:25:18] [INFO ] Computed 52 place invariants in 10 ms
[2023-03-11 01:25:19] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-03-11 01:25:19] [INFO ] Invariant cache hit.
[2023-03-11 01:25:20] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 567/1047 places, 1405/1773 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4097 ms. Remains : 567/1047 places, 1405/1773 transitions.
Successfully produced net in file /tmp/petri1000_11051099413952506866.dot
Successfully produced net in file /tmp/petri1001_8941654113241928613.dot
Successfully produced net in file /tmp/petri1002_13808748400677781078.dot
Successfully produced net in file /tmp/petri1003_3519420292573149980.dot
Successfully produced net in file /tmp/petri1004_2093952722880661406.dot
Successfully produced net in file /tmp/petri1005_4939315541522591083.dot
Successfully produced net in file /tmp/petri1006_12451793592491246803.dot
Drop transitions removed 7 transitions
Dominated transitions for bounds rules discarded 7 transitions
// Phase 1: matrix 1398 rows 567 cols
[2023-03-11 01:25:20] [INFO ] Computed 52 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 17367 resets, run finished after 2510 ms. (steps per millisecond=398 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3267 resets, run finished after 811 ms. (steps per millisecond=1233 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3266 resets, run finished after 905 ms. (steps per millisecond=1104 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3198 resets, run finished after 814 ms. (steps per millisecond=1228 ) properties (out of 3) seen :0
[2023-03-11 01:25:25] [INFO ] Invariant cache hit.
[2023-03-11 01:25:25] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-11 01:25:25] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 51 ms returned sat
[2023-03-11 01:25:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:25:26] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2023-03-11 01:25:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:25:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 30 ms returned sat
[2023-03-11 01:25:26] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 35 ms returned sat
[2023-03-11 01:25:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:25:26] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2023-03-11 01:25:27] [INFO ] Computed and/alt/rep : 322/1457/322 causal constraints (skipped 1039 transitions) in 83 ms.
[2023-03-11 01:25:28] [INFO ] Added : 29 causal constraints over 6 iterations in 1044 ms. Result :sat
Minimization took 197 ms.
[2023-03-11 01:25:28] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-11 01:25:28] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 19 ms returned sat
[2023-03-11 01:25:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:25:29] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2023-03-11 01:25:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:25:29] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-11 01:25:29] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 12 ms returned sat
[2023-03-11 01:25:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:25:29] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2023-03-11 01:25:29] [INFO ] Computed and/alt/rep : 322/1457/322 causal constraints (skipped 1039 transitions) in 103 ms.
[2023-03-11 01:25:31] [INFO ] Added : 50 causal constraints over 12 iterations in 1795 ms. Result :sat
Minimization took 275 ms.
[2023-03-11 01:25:32] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-11 01:25:32] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 13 ms returned sat
[2023-03-11 01:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:25:32] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2023-03-11 01:25:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:25:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-11 01:25:32] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 17 ms returned sat
[2023-03-11 01:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:25:33] [INFO ] [Nat]Absence check using state equation in 743 ms returned sat
[2023-03-11 01:25:33] [INFO ] Computed and/alt/rep : 322/1457/322 causal constraints (skipped 1039 transitions) in 106 ms.
[2023-03-11 01:25:34] [INFO ] Added : 34 causal constraints over 8 iterations in 1029 ms. Result :sat
Minimization took 428 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA ASLink-PT-07b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-07b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 567/567 places, 1398/1398 transitions.
Graph (complete) has 3449 edges and 567 vertex of which 560 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 560 transition count 1397
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 559 transition count 1397
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 559 transition count 1397
Applied a total of 10 rules in 47 ms. Remains 559 /567 variables (removed 8) and now considering 1397/1398 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 559/567 places, 1397/1398 transitions.
// Phase 1: matrix 1397 rows 559 cols
[2023-03-11 01:25:36] [INFO ] Computed 52 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 17178 resets, run finished after 2319 ms. (steps per millisecond=431 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3199 resets, run finished after 763 ms. (steps per millisecond=1310 ) properties (out of 1) seen :0
[2023-03-11 01:25:39] [INFO ] Invariant cache hit.
[2023-03-11 01:25:39] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-11 01:25:39] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 40 ms returned sat
[2023-03-11 01:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:25:40] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2023-03-11 01:25:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:25:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-11 01:25:40] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 26 ms returned sat
[2023-03-11 01:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:25:41] [INFO ] [Nat]Absence check using state equation in 679 ms returned sat
[2023-03-11 01:25:41] [INFO ] Computed and/alt/rep : 321/1454/321 causal constraints (skipped 1039 transitions) in 109 ms.
[2023-03-11 01:25:42] [INFO ] Added : 38 causal constraints over 9 iterations in 1105 ms. Result :sat
Minimization took 302 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 559/559 places, 1397/1397 transitions.
Applied a total of 0 rules in 20 ms. Remains 559 /559 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 559/559 places, 1397/1397 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 559/559 places, 1397/1397 transitions.
Applied a total of 0 rules in 19 ms. Remains 559 /559 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-11 01:25:43] [INFO ] Invariant cache hit.
[2023-03-11 01:25:43] [INFO ] Implicit Places using invariants in 675 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 677 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 558/559 places, 1397/1397 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 557 transition count 1396
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 557 transition count 1395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 556 transition count 1395
Applied a total of 4 rules in 63 ms. Remains 556 /558 variables (removed 2) and now considering 1395/1397 (removed 2) transitions.
// Phase 1: matrix 1395 rows 556 cols
[2023-03-11 01:25:43] [INFO ] Computed 51 place invariants in 10 ms
[2023-03-11 01:25:44] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-11 01:25:44] [INFO ] Invariant cache hit.
[2023-03-11 01:25:45] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 556/559 places, 1395/1397 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2771 ms. Remains : 556/559 places, 1395/1397 transitions.
[2023-03-11 01:25:45] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 17202 resets, run finished after 2142 ms. (steps per millisecond=466 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3238 resets, run finished after 927 ms. (steps per millisecond=1078 ) properties (out of 1) seen :0
[2023-03-11 01:25:48] [INFO ] Invariant cache hit.
[2023-03-11 01:25:49] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-11 01:25:49] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 11 ms returned sat
[2023-03-11 01:25:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:25:49] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2023-03-11 01:25:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:25:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-11 01:25:49] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 11 ms returned sat
[2023-03-11 01:25:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:25:50] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2023-03-11 01:25:50] [INFO ] Computed and/alt/rep : 312/1381/312 causal constraints (skipped 1046 transitions) in 137 ms.
[2023-03-11 01:25:51] [INFO ] Added : 19 causal constraints over 4 iterations in 787 ms. Result :sat
Minimization took 238 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1395/1395 transitions.
Applied a total of 0 rules in 19 ms. Remains 556 /556 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 556/556 places, 1395/1395 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1395/1395 transitions.
Applied a total of 0 rules in 18 ms. Remains 556 /556 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
[2023-03-11 01:25:51] [INFO ] Invariant cache hit.
[2023-03-11 01:25:52] [INFO ] Implicit Places using invariants in 688 ms returned []
[2023-03-11 01:25:52] [INFO ] Invariant cache hit.
[2023-03-11 01:25:53] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 2115 ms to find 0 implicit places.
[2023-03-11 01:25:54] [INFO ] Redundant transitions in 109 ms returned []
[2023-03-11 01:25:54] [INFO ] Invariant cache hit.
[2023-03-11 01:25:54] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2791 ms. Remains : 556/556 places, 1395/1395 transitions.
Starting property specific reduction for ASLink-PT-07b-UpperBounds-12
[2023-03-11 01:25:54] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 184 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-11 01:25:54] [INFO ] Invariant cache hit.
[2023-03-11 01:25:54] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-11 01:25:54] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 30 ms returned sat
[2023-03-11 01:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:25:55] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2023-03-11 01:25:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:25:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-11 01:25:55] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 13 ms returned sat
[2023-03-11 01:25:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:25:55] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2023-03-11 01:25:56] [INFO ] Computed and/alt/rep : 312/1381/312 causal constraints (skipped 1046 transitions) in 125 ms.
[2023-03-11 01:25:56] [INFO ] Added : 19 causal constraints over 4 iterations in 775 ms. Result :sat
Minimization took 260 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1395/1395 transitions.
Applied a total of 0 rules in 18 ms. Remains 556 /556 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 556/556 places, 1395/1395 transitions.
[2023-03-11 01:25:57] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 17388 resets, run finished after 2104 ms. (steps per millisecond=475 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3203 resets, run finished after 778 ms. (steps per millisecond=1285 ) properties (out of 1) seen :0
[2023-03-11 01:26:00] [INFO ] Invariant cache hit.
[2023-03-11 01:26:00] [INFO ] [Real]Absence check using 12 positive place invariants in 68 ms returned sat
[2023-03-11 01:26:00] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 40 ms returned sat
[2023-03-11 01:26:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 01:26:00] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2023-03-11 01:26:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 01:26:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-11 01:26:01] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 94 ms returned sat
[2023-03-11 01:26:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 01:26:01] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2023-03-11 01:26:02] [INFO ] Computed and/alt/rep : 312/1381/312 causal constraints (skipped 1046 transitions) in 88 ms.
[2023-03-11 01:26:02] [INFO ] Added : 19 causal constraints over 4 iterations in 672 ms. Result :sat
Minimization took 272 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1395/1395 transitions.
Applied a total of 0 rules in 34 ms. Remains 556 /556 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 556/556 places, 1395/1395 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1395/1395 transitions.
Applied a total of 0 rules in 22 ms. Remains 556 /556 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
[2023-03-11 01:26:03] [INFO ] Invariant cache hit.
[2023-03-11 01:26:03] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-11 01:26:03] [INFO ] Invariant cache hit.
[2023-03-11 01:26:04] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1613 ms to find 0 implicit places.
[2023-03-11 01:26:04] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-11 01:26:04] [INFO ] Invariant cache hit.
[2023-03-11 01:26:05] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2285 ms. Remains : 556/556 places, 1395/1395 transitions.
Ending property specific reduction for ASLink-PT-07b-UpperBounds-12 in 10930 ms.
[2023-03-11 01:26:05] [INFO ] Flatten gal took : 151 ms
[2023-03-11 01:26:05] [INFO ] Applying decomposition
[2023-03-11 01:26:05] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph3261423951710858329.txt' '-o' '/tmp/graph3261423951710858329.bin' '-w' '/tmp/graph3261423951710858329.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3261423951710858329.bin' '-l' '-1' '-v' '-w' '/tmp/graph3261423951710858329.weights' '-q' '0' '-e' '0.001'
[2023-03-11 01:26:06] [INFO ] Decomposing Gal with order
[2023-03-11 01:26:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 01:26:06] [INFO ] Removed a total of 2771 redundant transitions.
[2023-03-11 01:26:06] [INFO ] Flatten gal took : 165 ms
[2023-03-11 01:26:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 27 ms.
[2023-03-11 01:26:06] [INFO ] Time to serialize gal into /tmp/UpperBounds10957201777654858960.gal : 20 ms
[2023-03-11 01:26:06] [INFO ] Time to serialize properties into /tmp/UpperBounds14969995725249141691.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10957201777654858960.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14969995725249141691.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds14969995725249141691.prop.
Detected timeout of ITS tools.
[2023-03-11 01:47:29] [INFO ] Applying decomposition
[2023-03-11 01:47:29] [INFO ] Flatten gal took : 761 ms
[2023-03-11 01:47:30] [INFO ] Decomposing Gal with order
[2023-03-11 01:47:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 01:47:31] [INFO ] Removed a total of 2646 redundant transitions.
[2023-03-11 01:47:31] [INFO ] Flatten gal took : 875 ms
[2023-03-11 01:47:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 1098 labels/synchronizations in 228 ms.
[2023-03-11 01:47:32] [INFO ] Time to serialize gal into /tmp/UpperBounds11877728367136967426.gal : 35 ms
[2023-03-11 01:47:32] [INFO ] Time to serialize properties into /tmp/UpperBounds7495158375274675147.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11877728367136967426.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7495158375274675147.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds7495158375274675147.prop.
Detected timeout of ITS tools.
[2023-03-11 02:08:47] [INFO ] Flatten gal took : 379 ms
[2023-03-11 02:08:51] [INFO ] Input system was already deterministic with 1395 transitions.
[2023-03-11 02:08:51] [INFO ] Transformed 556 places.
[2023-03-11 02:08:51] [INFO ] Transformed 1395 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2023-03-11 02:08:52] [INFO ] Time to serialize gal into /tmp/UpperBounds3169125540071671173.gal : 16 ms
[2023-03-11 02:08:52] [INFO ] Time to serialize properties into /tmp/UpperBounds601720822543413605.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3169125540071671173.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds601720822543413605.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...348
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds601720822543413605.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 167292 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16233776 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-07b"
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-5348"
echo " Executing tool itstools"
echo " Input is ASLink-PT-07b, 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 r005-oct2-167813592700117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-07b.tgz
mv ASLink-PT-07b 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 ;