About the Execution of LTSMin+red for ASLink-PT-08a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2970.104 | 3600000.00 | 13239103.00 | 93.80 | 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.r009-oct2-167813597500125.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 ltsminxred
Input is ASLink-PT-08a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597500125
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 13:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 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 757K 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-08a-UpperBounds-00
FORMULA_NAME ASLink-PT-08a-UpperBounds-01
FORMULA_NAME ASLink-PT-08a-UpperBounds-02
FORMULA_NAME ASLink-PT-08a-UpperBounds-03
FORMULA_NAME ASLink-PT-08a-UpperBounds-04
FORMULA_NAME ASLink-PT-08a-UpperBounds-05
FORMULA_NAME ASLink-PT-08a-UpperBounds-06
FORMULA_NAME ASLink-PT-08a-UpperBounds-07
FORMULA_NAME ASLink-PT-08a-UpperBounds-08
FORMULA_NAME ASLink-PT-08a-UpperBounds-09
FORMULA_NAME ASLink-PT-08a-UpperBounds-10
FORMULA_NAME ASLink-PT-08a-UpperBounds-11
FORMULA_NAME ASLink-PT-08a-UpperBounds-12
FORMULA_NAME ASLink-PT-08a-UpperBounds-13
FORMULA_NAME ASLink-PT-08a-UpperBounds-14
FORMULA_NAME ASLink-PT-08a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678614022236
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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 09:40:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 09:40:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 09:40:25] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2023-03-12 09:40:25] [INFO ] Transformed 1796 places.
[2023-03-12 09:40:25] [INFO ] Transformed 2646 transitions.
[2023-03-12 09:40:25] [INFO ] Found NUPN structural information;
[2023-03-12 09:40:25] [INFO ] Parsed PT model containing 1796 places and 2646 transitions and 9934 arcs in 322 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
// Phase 1: matrix 2618 rows 1796 cols
[2023-03-12 09:40:25] [INFO ] Computed 346 place invariants in 216 ms
Incomplete random walk after 10000 steps, including 47 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 16) seen :8
FORMULA ASLink-PT-08a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :1
FORMULA ASLink-PT-08a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
[2023-03-12 09:40:25] [INFO ] Invariant cache hit.
[2023-03-12 09:40:26] [INFO ] [Real]Absence check using 85 positive place invariants in 67 ms returned sat
[2023-03-12 09:40:27] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 491 ms returned sat
[2023-03-12 09:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:29] [INFO ] [Real]Absence check using state equation in 2285 ms returned sat
[2023-03-12 09:40:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:40:30] [INFO ] [Nat]Absence check using 85 positive place invariants in 52 ms returned sat
[2023-03-12 09:40:30] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 77 ms returned sat
[2023-03-12 09:40:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:34] [INFO ] [Nat]Absence check using state equation in 4229 ms returned unknown
[2023-03-12 09:40:35] [INFO ] [Real]Absence check using 85 positive place invariants in 79 ms returned sat
[2023-03-12 09:40:35] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 86 ms returned sat
[2023-03-12 09:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:36] [INFO ] [Real]Absence check using state equation in 1644 ms returned sat
[2023-03-12 09:40:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:40:37] [INFO ] [Nat]Absence check using 85 positive place invariants in 88 ms returned sat
[2023-03-12 09:40:37] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 112 ms returned sat
[2023-03-12 09:40:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:42] [INFO ] [Nat]Absence check using state equation in 4469 ms returned unknown
[2023-03-12 09:40:42] [INFO ] [Real]Absence check using 85 positive place invariants in 158 ms returned sat
[2023-03-12 09:40:42] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 238 ms returned sat
[2023-03-12 09:40:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:45] [INFO ] [Real]Absence check using state equation in 2584 ms returned sat
[2023-03-12 09:40:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:40:46] [INFO ] [Nat]Absence check using 85 positive place invariants in 40 ms returned sat
[2023-03-12 09:40:46] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 89 ms returned sat
[2023-03-12 09:40:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:50] [INFO ] [Nat]Absence check using state equation in 4626 ms returned sat
[2023-03-12 09:40:52] [INFO ] Deduced a trap composed of 4 places in 1315 ms of which 8 ms to minimize.
[2023-03-12 09:40:52] [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 2
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-12 09:40:52] [INFO ] [Real]Absence check using 85 positive place invariants in 52 ms returned sat
[2023-03-12 09:40:52] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 98 ms returned sat
[2023-03-12 09:40:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:54] [INFO ] [Real]Absence check using state equation in 2070 ms returned sat
[2023-03-12 09:40:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:40:55] [INFO ] [Nat]Absence check using 85 positive place invariants in 47 ms returned sat
[2023-03-12 09:40:55] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 118 ms returned sat
[2023-03-12 09:40:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:40:59] [INFO ] [Nat]Absence check using state equation in 4561 ms returned unknown
[2023-03-12 09:41:00] [INFO ] [Real]Absence check using 85 positive place invariants in 44 ms returned sat
[2023-03-12 09:41:00] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 123 ms returned sat
[2023-03-12 09:41:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:41:01] [INFO ] [Real]Absence check using state equation in 1668 ms returned sat
[2023-03-12 09:41:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:41:02] [INFO ] [Nat]Absence check using 85 positive place invariants in 44 ms returned sat
[2023-03-12 09:41:02] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 154 ms returned sat
[2023-03-12 09:41:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:41:07] [INFO ] [Nat]Absence check using state equation in 4539 ms returned unknown
[2023-03-12 09:41:07] [INFO ] [Real]Absence check using 85 positive place invariants in 83 ms returned sat
[2023-03-12 09:41:07] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 171 ms returned sat
[2023-03-12 09:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:41:08] [INFO ] [Real]Absence check using state equation in 1319 ms returned sat
[2023-03-12 09:41:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:41:09] [INFO ] [Nat]Absence check using 85 positive place invariants in 64 ms returned sat
[2023-03-12 09:41:09] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 123 ms returned sat
[2023-03-12 09:41:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:41:13] [INFO ] [Nat]Absence check using state equation in 4548 ms returned unknown
[2023-03-12 09:41:14] [INFO ] [Real]Absence check using 85 positive place invariants in 54 ms returned sat
[2023-03-12 09:41:14] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 116 ms returned sat
[2023-03-12 09:41:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:41:15] [INFO ] [Real]Absence check using state equation in 1293 ms returned sat
[2023-03-12 09:41:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:41:16] [INFO ] [Nat]Absence check using 85 positive place invariants in 36 ms returned sat
[2023-03-12 09:41:16] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 108 ms returned sat
[2023-03-12 09:41:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:41:20] [INFO ] [Nat]Absence check using state equation in 4607 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 1796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1796/1796 places, 2618/2618 transitions.
Ensure Unique test removed 32 places
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1748 transition count 2456
Reduce places removed 162 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 164 rules applied. Total rules applied 374 place count 1586 transition count 2454
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 376 place count 1584 transition count 2454
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 168 Pre rules applied. Total rules applied 376 place count 1584 transition count 2286
Deduced a syphon composed of 168 places in 3 ms
Ensure Unique test removed 66 places
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 778 place count 1350 transition count 2286
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 779 place count 1350 transition count 2285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 780 place count 1349 transition count 2285
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 791 place count 1338 transition count 2226
Ensure Unique test removed 1 places
Iterating global reduction 5 with 12 rules applied. Total rules applied 803 place count 1337 transition count 2226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 809 place count 1336 transition count 2221
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 812 place count 1333 transition count 2221
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 813 place count 1332 transition count 2213
Iterating global reduction 7 with 1 rules applied. Total rules applied 814 place count 1332 transition count 2213
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 815 place count 1331 transition count 2205
Iterating global reduction 7 with 1 rules applied. Total rules applied 816 place count 1331 transition count 2205
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 817 place count 1330 transition count 2197
Iterating global reduction 7 with 1 rules applied. Total rules applied 818 place count 1330 transition count 2197
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 819 place count 1329 transition count 2189
Iterating global reduction 7 with 1 rules applied. Total rules applied 820 place count 1329 transition count 2189
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 821 place count 1328 transition count 2181
Iterating global reduction 7 with 1 rules applied. Total rules applied 822 place count 1328 transition count 2181
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 823 place count 1327 transition count 2173
Iterating global reduction 7 with 1 rules applied. Total rules applied 824 place count 1327 transition count 2173
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 825 place count 1326 transition count 2165
Iterating global reduction 7 with 1 rules applied. Total rules applied 826 place count 1326 transition count 2165
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 827 place count 1325 transition count 2157
Iterating global reduction 7 with 1 rules applied. Total rules applied 828 place count 1325 transition count 2157
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 829 place count 1324 transition count 2149
Iterating global reduction 7 with 1 rules applied. Total rules applied 830 place count 1324 transition count 2149
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 831 place count 1323 transition count 2141
Iterating global reduction 7 with 1 rules applied. Total rules applied 832 place count 1323 transition count 2141
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 833 place count 1322 transition count 2133
Iterating global reduction 7 with 1 rules applied. Total rules applied 834 place count 1322 transition count 2133
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 835 place count 1321 transition count 2125
Iterating global reduction 7 with 1 rules applied. Total rules applied 836 place count 1321 transition count 2125
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 837 place count 1320 transition count 2117
Iterating global reduction 7 with 1 rules applied. Total rules applied 838 place count 1320 transition count 2117
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 839 place count 1319 transition count 2109
Iterating global reduction 7 with 1 rules applied. Total rules applied 840 place count 1319 transition count 2109
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 841 place count 1318 transition count 2101
Iterating global reduction 7 with 1 rules applied. Total rules applied 842 place count 1318 transition count 2101
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 843 place count 1317 transition count 2093
Iterating global reduction 7 with 1 rules applied. Total rules applied 844 place count 1317 transition count 2093
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 7 with 112 rules applied. Total rules applied 956 place count 1261 transition count 2037
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 964 place count 1261 transition count 2029
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 972 place count 1253 transition count 2029
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 980 place count 1253 transition count 2029
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 981 place count 1252 transition count 2028
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 997 place count 1236 transition count 2028
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 30 Pre rules applied. Total rules applied 997 place count 1236 transition count 1998
Deduced a syphon composed of 30 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 9 with 61 rules applied. Total rules applied 1058 place count 1205 transition count 1998
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 9 with 9 rules applied. Total rules applied 1067 place count 1196 transition count 1998
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1067 place count 1196 transition count 1997
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1069 place count 1195 transition count 1997
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 1087 place count 1186 transition count 1988
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1095 place count 1178 transition count 1980
Iterating global reduction 10 with 8 rules applied. Total rules applied 1103 place count 1178 transition count 1980
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1111 place count 1178 transition count 1972
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1119 place count 1170 transition count 1972
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 1127 place count 1170 transition count 1972
Applied a total of 1127 rules in 2288 ms. Remains 1170 /1796 variables (removed 626) and now considering 1972/2618 (removed 646) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2301 ms. Remains : 1170/1796 places, 1972/2618 transitions.
// Phase 1: matrix 1972 rows 1170 cols
[2023-03-12 09:41:23] [INFO ] Computed 204 place invariants in 36 ms
Incomplete random walk after 1000000 steps, including 10281 resets, run finished after 3477 ms. (steps per millisecond=287 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1275 resets, run finished after 1369 ms. (steps per millisecond=730 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1283 resets, run finished after 1400 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1280 resets, run finished after 1447 ms. (steps per millisecond=691 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1277 resets, run finished after 1394 ms. (steps per millisecond=717 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1281 resets, run finished after 1410 ms. (steps per millisecond=709 ) properties (out of 7) seen :1
FORMULA ASLink-PT-08a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 1276 resets, run finished after 1446 ms. (steps per millisecond=691 ) properties (out of 6) seen :0
[2023-03-12 09:41:35] [INFO ] Invariant cache hit.
[2023-03-12 09:41:35] [INFO ] [Real]Absence check using 52 positive place invariants in 15 ms returned sat
[2023-03-12 09:41:35] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 51 ms returned sat
[2023-03-12 09:41:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:41:35] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2023-03-12 09:41:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:41:36] [INFO ] [Nat]Absence check using 52 positive place invariants in 29 ms returned sat
[2023-03-12 09:41:36] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 31 ms returned sat
[2023-03-12 09:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:41:37] [INFO ] [Nat]Absence check using state equation in 787 ms returned sat
[2023-03-12 09:41:37] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 147 ms.
[2023-03-12 09:41:55] [INFO ] Added : 604 causal constraints over 121 iterations in 18552 ms. Result :sat
Minimization took 810 ms.
[2023-03-12 09:41:56] [INFO ] [Real]Absence check using 52 positive place invariants in 66 ms returned sat
[2023-03-12 09:41:56] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 73 ms returned sat
[2023-03-12 09:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:41:57] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2023-03-12 09:41:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:41:57] [INFO ] [Nat]Absence check using 52 positive place invariants in 26 ms returned sat
[2023-03-12 09:41:57] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 37 ms returned sat
[2023-03-12 09:41:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:41:58] [INFO ] [Nat]Absence check using state equation in 772 ms returned sat
[2023-03-12 09:41:58] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 157 ms.
[2023-03-12 09:42:16] [INFO ] Added : 620 causal constraints over 124 iterations in 18042 ms. Result :sat
Minimization took 647 ms.
[2023-03-12 09:42:17] [INFO ] [Real]Absence check using 52 positive place invariants in 27 ms returned sat
[2023-03-12 09:42:17] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 88 ms returned sat
[2023-03-12 09:42:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:42:18] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2023-03-12 09:42:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:42:18] [INFO ] [Nat]Absence check using 52 positive place invariants in 16 ms returned sat
[2023-03-12 09:42:19] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 131 ms returned sat
[2023-03-12 09:42:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:42:20] [INFO ] [Nat]Absence check using state equation in 1542 ms returned sat
[2023-03-12 09:42:20] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 207 ms.
[2023-03-12 09:42:34] [INFO ] Added : 569 causal constraints over 114 iterations in 13726 ms. Result :sat
Minimization took 598 ms.
[2023-03-12 09:42:35] [INFO ] [Real]Absence check using 52 positive place invariants in 45 ms returned sat
[2023-03-12 09:42:35] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 45 ms returned sat
[2023-03-12 09:42:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:42:36] [INFO ] [Real]Absence check using state equation in 903 ms returned sat
[2023-03-12 09:42:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:42:36] [INFO ] [Nat]Absence check using 52 positive place invariants in 16 ms returned sat
[2023-03-12 09:42:36] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 31 ms returned sat
[2023-03-12 09:42:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:42:37] [INFO ] [Nat]Absence check using state equation in 962 ms returned sat
[2023-03-12 09:42:37] [INFO ] Deduced a trap composed of 182 places in 312 ms of which 1 ms to minimize.
[2023-03-12 09:42:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 416 ms
[2023-03-12 09:42:38] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 237 ms.
[2023-03-12 09:42:54] [INFO ] Added : 598 causal constraints over 120 iterations in 16282 ms. Result :sat
Minimization took 3003 ms.
[2023-03-12 09:42:57] [INFO ] [Real]Absence check using 52 positive place invariants in 40 ms returned sat
[2023-03-12 09:42:57] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 127 ms returned sat
[2023-03-12 09:42:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:42:58] [INFO ] [Real]Absence check using state equation in 891 ms returned sat
[2023-03-12 09:42:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:42:58] [INFO ] [Nat]Absence check using 52 positive place invariants in 44 ms returned sat
[2023-03-12 09:42:58] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 72 ms returned sat
[2023-03-12 09:42:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:42:59] [INFO ] [Nat]Absence check using state equation in 1107 ms returned sat
[2023-03-12 09:42:59] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 92 ms.
[2023-03-12 09:43:12] [INFO ] Added : 588 causal constraints over 118 iterations in 12682 ms. Result :sat
Minimization took 653 ms.
[2023-03-12 09:43:13] [INFO ] [Real]Absence check using 52 positive place invariants in 60 ms returned sat
[2023-03-12 09:43:13] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 39 ms returned sat
[2023-03-12 09:43:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:43:14] [INFO ] [Real]Absence check using state equation in 733 ms returned sat
[2023-03-12 09:43:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:43:14] [INFO ] [Nat]Absence check using 52 positive place invariants in 44 ms returned sat
[2023-03-12 09:43:14] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 33 ms returned sat
[2023-03-12 09:43:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:43:15] [INFO ] [Nat]Absence check using state equation in 1072 ms returned sat
[2023-03-12 09:43:15] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 84 ms.
[2023-03-12 09:43:28] [INFO ] Added : 549 causal constraints over 110 iterations in 12747 ms. Result :sat
Minimization took 640 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 1170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1170/1170 places, 1972/1972 transitions.
Applied a total of 0 rules in 35 ms. Remains 1170 /1170 variables (removed 0) and now considering 1972/1972 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1170/1170 places, 1972/1972 transitions.
[2023-03-12 09:43:33] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 10394 resets, run finished after 3543 ms. (steps per millisecond=282 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1287 resets, run finished after 1541 ms. (steps per millisecond=648 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1273 resets, run finished after 1367 ms. (steps per millisecond=731 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1273 resets, run finished after 1370 ms. (steps per millisecond=729 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1288 resets, run finished after 1408 ms. (steps per millisecond=710 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1282 resets, run finished after 1411 ms. (steps per millisecond=708 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1290 resets, run finished after 1425 ms. (steps per millisecond=701 ) properties (out of 6) seen :0
[2023-03-12 09:43:45] [INFO ] Invariant cache hit.
[2023-03-12 09:43:45] [INFO ] [Real]Absence check using 52 positive place invariants in 43 ms returned sat
[2023-03-12 09:43:45] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 117 ms returned sat
[2023-03-12 09:43:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:43:46] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2023-03-12 09:43:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:43:46] [INFO ] [Nat]Absence check using 52 positive place invariants in 52 ms returned sat
[2023-03-12 09:43:46] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 57 ms returned sat
[2023-03-12 09:43:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:43:47] [INFO ] [Nat]Absence check using state equation in 990 ms returned sat
[2023-03-12 09:43:47] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 92 ms.
[2023-03-12 09:44:03] [INFO ] Added : 604 causal constraints over 121 iterations in 16227 ms. Result :sat
Minimization took 793 ms.
[2023-03-12 09:44:04] [INFO ] [Real]Absence check using 52 positive place invariants in 43 ms returned sat
[2023-03-12 09:44:04] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 39 ms returned sat
[2023-03-12 09:44:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:44:05] [INFO ] [Real]Absence check using state equation in 779 ms returned sat
[2023-03-12 09:44:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:44:05] [INFO ] [Nat]Absence check using 52 positive place invariants in 18 ms returned sat
[2023-03-12 09:44:05] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 26 ms returned sat
[2023-03-12 09:44:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:44:06] [INFO ] [Nat]Absence check using state equation in 643 ms returned sat
[2023-03-12 09:44:06] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 88 ms.
[2023-03-12 09:44:23] [INFO ] Added : 620 causal constraints over 124 iterations in 16719 ms. Result :sat
Minimization took 607 ms.
[2023-03-12 09:44:23] [INFO ] [Real]Absence check using 52 positive place invariants in 16 ms returned sat
[2023-03-12 09:44:24] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 70 ms returned sat
[2023-03-12 09:44:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:44:25] [INFO ] [Real]Absence check using state equation in 1324 ms returned sat
[2023-03-12 09:44:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:44:25] [INFO ] [Nat]Absence check using 52 positive place invariants in 26 ms returned sat
[2023-03-12 09:44:25] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 34 ms returned sat
[2023-03-12 09:44:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:44:27] [INFO ] [Nat]Absence check using state equation in 1444 ms returned sat
[2023-03-12 09:44:27] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 83 ms.
[2023-03-12 09:44:40] [INFO ] Added : 569 causal constraints over 114 iterations in 13179 ms. Result :sat
Minimization took 604 ms.
[2023-03-12 09:44:41] [INFO ] [Real]Absence check using 52 positive place invariants in 27 ms returned sat
[2023-03-12 09:44:41] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 53 ms returned sat
[2023-03-12 09:44:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:44:41] [INFO ] [Real]Absence check using state equation in 698 ms returned sat
[2023-03-12 09:44:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:44:42] [INFO ] [Nat]Absence check using 52 positive place invariants in 13 ms returned sat
[2023-03-12 09:44:42] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 56 ms returned sat
[2023-03-12 09:44:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:44:43] [INFO ] [Nat]Absence check using state equation in 904 ms returned sat
[2023-03-12 09:44:43] [INFO ] Deduced a trap composed of 182 places in 247 ms of which 2 ms to minimize.
[2023-03-12 09:44:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2023-03-12 09:44:43] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 86 ms.
[2023-03-12 09:44:58] [INFO ] Added : 598 causal constraints over 120 iterations in 14936 ms. Result :sat
Minimization took 3008 ms.
[2023-03-12 09:45:01] [INFO ] [Real]Absence check using 52 positive place invariants in 44 ms returned sat
[2023-03-12 09:45:01] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 99 ms returned sat
[2023-03-12 09:45:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:45:02] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2023-03-12 09:45:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:45:02] [INFO ] [Nat]Absence check using 52 positive place invariants in 14 ms returned sat
[2023-03-12 09:45:02] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 59 ms returned sat
[2023-03-12 09:45:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:45:03] [INFO ] [Nat]Absence check using state equation in 875 ms returned sat
[2023-03-12 09:45:03] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 89 ms.
[2023-03-12 09:45:20] [INFO ] Added : 588 causal constraints over 118 iterations in 16796 ms. Result :sat
Minimization took 737 ms.
[2023-03-12 09:45:21] [INFO ] [Real]Absence check using 52 positive place invariants in 16 ms returned sat
[2023-03-12 09:45:21] [INFO ] [Real]Absence check using 52 positive and 152 generalized place invariants in 64 ms returned sat
[2023-03-12 09:45:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:45:22] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2023-03-12 09:45:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:45:22] [INFO ] [Nat]Absence check using 52 positive place invariants in 16 ms returned sat
[2023-03-12 09:45:22] [INFO ] [Nat]Absence check using 52 positive and 152 generalized place invariants in 34 ms returned sat
[2023-03-12 09:45:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:45:23] [INFO ] [Nat]Absence check using state equation in 1110 ms returned sat
[2023-03-12 09:45:24] [INFO ] Computed and/alt/rep : 784/2959/784 causal constraints (skipped 1147 transitions) in 120 ms.
[2023-03-12 09:45:38] [INFO ] Added : 549 causal constraints over 110 iterations in 14736 ms. Result :sat
Minimization took 686 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 1170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1170/1170 places, 1972/1972 transitions.
Applied a total of 0 rules in 53 ms. Remains 1170 /1170 variables (removed 0) and now considering 1972/1972 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1170/1170 places, 1972/1972 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1170/1170 places, 1972/1972 transitions.
Applied a total of 0 rules in 36 ms. Remains 1170 /1170 variables (removed 0) and now considering 1972/1972 (removed 0) transitions.
[2023-03-12 09:45:43] [INFO ] Invariant cache hit.
[2023-03-12 09:45:44] [INFO ] Implicit Places using invariants in 860 ms returned [0, 18, 19, 30, 48, 66, 103, 137, 141, 150, 151, 152, 170, 188, 262, 263, 274, 275, 276, 294, 312, 381, 385, 386, 397, 398, 399, 417, 435, 504, 508, 509, 520, 521, 522, 540, 558, 627, 631, 632, 643, 644, 645, 663, 681, 755, 756, 767, 768, 769, 787, 805, 874, 878, 879, 890, 891, 892, 910, 928, 997, 1001, 1002, 1005, 1016, 1017, 1018, 1036, 1038, 1041, 1059, 1060, 1061, 1062, 1074, 1080, 1086, 1092, 1098, 1104, 1110, 1116, 1122, 1128, 1134]
Discarding 85 places :
Implicit Place search using SMT only with invariants took 878 ms to find 85 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1085/1170 places, 1972/1972 transitions.
Drop transitions removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 1085 transition count 1826
Reduce places removed 146 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 147 rules applied. Total rules applied 293 place count 939 transition count 1825
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 294 place count 938 transition count 1825
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 294 place count 938 transition count 1787
Deduced a syphon composed of 38 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 77 rules applied. Total rules applied 371 place count 899 transition count 1787
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 3 with 12 rules applied. Total rules applied 383 place count 895 transition count 1779
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 391 place count 887 transition count 1779
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 406 place count 872 transition count 1764
Iterating global reduction 5 with 15 rules applied. Total rules applied 421 place count 872 transition count 1764
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 424 place count 872 transition count 1761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 424 place count 872 transition count 1760
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 426 place count 871 transition count 1760
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 429 place count 868 transition count 1757
Iterating global reduction 6 with 3 rules applied. Total rules applied 432 place count 868 transition count 1757
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 433 place count 867 transition count 1756
Iterating global reduction 6 with 1 rules applied. Total rules applied 434 place count 867 transition count 1756
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 435 place count 866 transition count 1755
Iterating global reduction 6 with 1 rules applied. Total rules applied 436 place count 866 transition count 1755
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 2 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 6 with 136 rules applied. Total rules applied 572 place count 798 transition count 1687
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 579 place count 798 transition count 1680
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 585 place count 792 transition count 1674
Iterating global reduction 7 with 6 rules applied. Total rules applied 591 place count 792 transition count 1674
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 597 place count 792 transition count 1668
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 598 place count 792 transition count 1667
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 8 with 18 rules applied. Total rules applied 616 place count 792 transition count 1649
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 635 place count 773 transition count 1649
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 9 with 25 rules applied. Total rules applied 660 place count 773 transition count 1649
Applied a total of 660 rules in 357 ms. Remains 773 /1085 variables (removed 312) and now considering 1649/1972 (removed 323) transitions.
// Phase 1: matrix 1649 rows 773 cols
[2023-03-12 09:45:44] [INFO ] Computed 113 place invariants in 21 ms
[2023-03-12 09:45:45] [INFO ] Implicit Places using invariants in 530 ms returned [72, 91, 97, 100, 102, 105, 106, 176, 182, 185, 187, 196, 197, 249, 266, 272, 275, 277, 282, 283, 335, 352, 358, 361, 363, 368, 369, 421, 438, 444, 447, 449, 454, 455, 524, 530, 533, 535, 538, 543, 544, 596, 613, 619, 622, 624, 629, 630, 682, 699, 705, 708, 710]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 533 ms to find 53 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 720/1170 places, 1649/1972 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 695 transition count 1624
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 695 transition count 1624
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 687 transition count 1616
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 687 transition count 1616
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 94 place count 673 transition count 1602
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 95 place count 673 transition count 1601
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 119 place count 673 transition count 1577
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 143 place count 649 transition count 1577
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 149 place count 649 transition count 1571
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 155 place count 643 transition count 1571
Applied a total of 155 rules in 250 ms. Remains 643 /720 variables (removed 77) and now considering 1571/1649 (removed 78) transitions.
// Phase 1: matrix 1571 rows 643 cols
[2023-03-12 09:45:45] [INFO ] Computed 60 place invariants in 22 ms
[2023-03-12 09:45:45] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-12 09:45:45] [INFO ] Invariant cache hit.
[2023-03-12 09:45:47] [INFO ] Implicit Places using invariants and state equation in 1709 ms returned []
Implicit Place search using SMT with State Equation took 2116 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 643/1170 places, 1571/1972 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4172 ms. Remains : 643/1170 places, 1571/1972 transitions.
Successfully produced net in file /tmp/petri1000_2363139225334324089.dot
Successfully produced net in file /tmp/petri1001_10181625710957715781.dot
Successfully produced net in file /tmp/petri1002_15582642688075358896.dot
Successfully produced net in file /tmp/petri1003_7549045102398661139.dot
Successfully produced net in file /tmp/petri1004_17653629855621292136.dot
Successfully produced net in file /tmp/petri1005_12999938472195143854.dot
Successfully produced net in file /tmp/petri1006_2869809875884152671.dot
Successfully produced net in file /tmp/petri1007_281645077779052563.dot
Drop transitions removed 8 transitions
Dominated transitions for bounds rules discarded 8 transitions
// Phase 1: matrix 1563 rows 643 cols
[2023-03-12 09:45:47] [INFO ] Computed 60 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 17012 resets, run finished after 2410 ms. (steps per millisecond=414 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2926 resets, run finished after 785 ms. (steps per millisecond=1273 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2915 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2934 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2967 resets, run finished after 855 ms. (steps per millisecond=1169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2917 resets, run finished after 938 ms. (steps per millisecond=1066 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2943 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 6) seen :0
[2023-03-12 09:45:55] [INFO ] Invariant cache hit.
[2023-03-12 09:45:55] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-12 09:45:55] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 67 ms returned sat
[2023-03-12 09:45:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:45:55] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2023-03-12 09:45:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:45:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-12 09:45:55] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 44 ms returned sat
[2023-03-12 09:45:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:45:56] [INFO ] [Nat]Absence check using state equation in 695 ms returned sat
[2023-03-12 09:45:56] [INFO ] Computed and/alt/rep : 367/1604/367 causal constraints (skipped 1158 transitions) in 123 ms.
[2023-03-12 09:45:59] [INFO ] Added : 75 causal constraints over 15 iterations in 2675 ms. Result :sat
Minimization took 289 ms.
[2023-03-12 09:45:59] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-12 09:45:59] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 28 ms returned sat
[2023-03-12 09:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:00] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2023-03-12 09:46:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:46:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-12 09:46:00] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 28 ms returned sat
[2023-03-12 09:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:01] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2023-03-12 09:46:01] [INFO ] Computed and/alt/rep : 367/1604/367 causal constraints (skipped 1158 transitions) in 94 ms.
[2023-03-12 09:46:03] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 24 ms to minimize.
[2023-03-12 09:46:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-12 09:46:03] [INFO ] Added : 66 causal constraints over 14 iterations in 2093 ms. Result :sat
Minimization took 392 ms.
[2023-03-12 09:46:04] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-12 09:46:04] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 35 ms returned sat
[2023-03-12 09:46:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:04] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2023-03-12 09:46:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:46:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-12 09:46:04] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 51 ms returned sat
[2023-03-12 09:46:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:05] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2023-03-12 09:46:05] [INFO ] Deduced a trap composed of 24 places in 203 ms of which 22 ms to minimize.
[2023-03-12 09:46:06] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 1 ms to minimize.
[2023-03-12 09:46:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 512 ms
[2023-03-12 09:46:06] [INFO ] Computed and/alt/rep : 367/1604/367 causal constraints (skipped 1158 transitions) in 87 ms.
[2023-03-12 09:46:07] [INFO ] Added : 67 causal constraints over 14 iterations in 1733 ms. Result :sat
Minimization took 320 ms.
[2023-03-12 09:46:08] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-12 09:46:08] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 16 ms returned sat
[2023-03-12 09:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:08] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2023-03-12 09:46:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:46:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-12 09:46:09] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 52 ms returned sat
[2023-03-12 09:46:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:10] [INFO ] [Nat]Absence check using state equation in 1164 ms returned sat
[2023-03-12 09:46:10] [INFO ] Computed and/alt/rep : 367/1604/367 causal constraints (skipped 1158 transitions) in 124 ms.
[2023-03-12 09:46:11] [INFO ] Added : 23 causal constraints over 5 iterations in 806 ms. Result :sat
Minimization took 362 ms.
[2023-03-12 09:46:11] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-12 09:46:11] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 60 ms returned sat
[2023-03-12 09:46:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:12] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2023-03-12 09:46:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:46:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-12 09:46:12] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 24 ms returned sat
[2023-03-12 09:46:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:12] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2023-03-12 09:46:13] [INFO ] Computed and/alt/rep : 367/1604/367 causal constraints (skipped 1158 transitions) in 119 ms.
[2023-03-12 09:46:14] [INFO ] Added : 60 causal constraints over 12 iterations in 1334 ms. Result :sat
Minimization took 182 ms.
[2023-03-12 09:46:14] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-12 09:46:14] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 13 ms returned sat
[2023-03-12 09:46:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:15] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2023-03-12 09:46:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:46:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-12 09:46:15] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 13 ms returned sat
[2023-03-12 09:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:16] [INFO ] [Nat]Absence check using state equation in 763 ms returned sat
[2023-03-12 09:46:16] [INFO ] Computed and/alt/rep : 367/1604/367 causal constraints (skipped 1158 transitions) in 108 ms.
[2023-03-12 09:46:18] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 14 ms to minimize.
[2023-03-12 09:46:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2023-03-12 09:46:19] [INFO ] Added : 72 causal constraints over 16 iterations in 2726 ms. Result :sat
Minimization took 416 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-08a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-08a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-08a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-08a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 643 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 643/643 places, 1563/1563 transitions.
Graph (complete) has 3858 edges and 643 vertex of which 635 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 635 transition count 1561
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 633 transition count 1561
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 633 transition count 1560
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 631 transition count 1560
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 630 transition count 1559
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 630 transition count 1559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 630 transition count 1558
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 630 transition count 1558
Applied a total of 19 rules in 84 ms. Remains 630 /643 variables (removed 13) and now considering 1558/1563 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 630/643 places, 1558/1563 transitions.
// Phase 1: matrix 1558 rows 630 cols
[2023-03-12 09:46:21] [INFO ] Computed 59 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 17091 resets, run finished after 2129 ms. (steps per millisecond=469 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2908 resets, run finished after 724 ms. (steps per millisecond=1381 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2943 resets, run finished after 751 ms. (steps per millisecond=1331 ) properties (out of 2) seen :0
[2023-03-12 09:46:24] [INFO ] Invariant cache hit.
[2023-03-12 09:46:24] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2023-03-12 09:46:24] [INFO ] [Real]Absence check using 15 positive and 44 generalized place invariants in 25 ms returned sat
[2023-03-12 09:46:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:25] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2023-03-12 09:46:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:46:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 43 ms returned sat
[2023-03-12 09:46:25] [INFO ] [Nat]Absence check using 15 positive and 44 generalized place invariants in 28 ms returned sat
[2023-03-12 09:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:26] [INFO ] [Nat]Absence check using state equation in 867 ms returned sat
[2023-03-12 09:46:26] [INFO ] Computed and/alt/rep : 369/1643/369 causal constraints (skipped 1151 transitions) in 114 ms.
[2023-03-12 09:46:29] [INFO ] Added : 86 causal constraints over 18 iterations in 2759 ms. Result :sat
Minimization took 525 ms.
[2023-03-12 09:46:30] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-12 09:46:30] [INFO ] [Real]Absence check using 15 positive and 44 generalized place invariants in 16 ms returned sat
[2023-03-12 09:46:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:30] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2023-03-12 09:46:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:46:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2023-03-12 09:46:30] [INFO ] [Nat]Absence check using 15 positive and 44 generalized place invariants in 36 ms returned sat
[2023-03-12 09:46:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:31] [INFO ] [Nat]Absence check using state equation in 872 ms returned sat
[2023-03-12 09:46:31] [INFO ] Computed and/alt/rep : 369/1643/369 causal constraints (skipped 1151 transitions) in 110 ms.
[2023-03-12 09:46:34] [INFO ] Deduced a trap composed of 60 places in 288 ms of which 1 ms to minimize.
[2023-03-12 09:46:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 405 ms
[2023-03-12 09:46:34] [INFO ] Added : 83 causal constraints over 17 iterations in 2650 ms. Result :sat
Minimization took 337 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1558/1558 transitions.
Applied a total of 0 rules in 19 ms. Remains 630 /630 variables (removed 0) and now considering 1558/1558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 630/630 places, 1558/1558 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1558/1558 transitions.
Applied a total of 0 rules in 17 ms. Remains 630 /630 variables (removed 0) and now considering 1558/1558 (removed 0) transitions.
[2023-03-12 09:46:35] [INFO ] Invariant cache hit.
[2023-03-12 09:46:36] [INFO ] Implicit Places using invariants in 495 ms returned [140, 431]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 516 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 628/630 places, 1558/1558 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 626 transition count 1556
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 626 transition count 1554
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 624 transition count 1554
Applied a total of 8 rules in 47 ms. Remains 624 /628 variables (removed 4) and now considering 1554/1558 (removed 4) transitions.
// Phase 1: matrix 1554 rows 624 cols
[2023-03-12 09:46:36] [INFO ] Computed 57 place invariants in 10 ms
[2023-03-12 09:46:36] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-12 09:46:36] [INFO ] Invariant cache hit.
[2023-03-12 09:46:38] [INFO ] Implicit Places using invariants and state equation in 1875 ms returned []
Implicit Place search using SMT with State Equation took 2365 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 624/630 places, 1554/1558 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2945 ms. Remains : 624/630 places, 1554/1558 transitions.
[2023-03-12 09:46:38] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16936 resets, run finished after 2139 ms. (steps per millisecond=467 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2945 resets, run finished after 720 ms. (steps per millisecond=1388 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2918 resets, run finished after 724 ms. (steps per millisecond=1381 ) properties (out of 2) seen :0
[2023-03-12 09:46:42] [INFO ] Invariant cache hit.
[2023-03-12 09:46:42] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-12 09:46:42] [INFO ] [Real]Absence check using 13 positive and 44 generalized place invariants in 105 ms returned sat
[2023-03-12 09:46:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:42] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2023-03-12 09:46:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:46:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 28 ms returned sat
[2023-03-12 09:46:43] [INFO ] [Nat]Absence check using 13 positive and 44 generalized place invariants in 27 ms returned sat
[2023-03-12 09:46:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:43] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2023-03-12 09:46:43] [INFO ] Computed and/alt/rep : 351/1497/351 causal constraints (skipped 1165 transitions) in 71 ms.
[2023-03-12 09:46:44] [INFO ] Added : 44 causal constraints over 9 iterations in 719 ms. Result :sat
Minimization took 305 ms.
[2023-03-12 09:46:45] [INFO ] [Real]Absence check using 13 positive place invariants in 44 ms returned sat
[2023-03-12 09:46:45] [INFO ] [Real]Absence check using 13 positive and 44 generalized place invariants in 25 ms returned sat
[2023-03-12 09:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:45] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2023-03-12 09:46:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:46:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-12 09:46:45] [INFO ] [Nat]Absence check using 13 positive and 44 generalized place invariants in 37 ms returned sat
[2023-03-12 09:46:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:46] [INFO ] [Nat]Absence check using state equation in 687 ms returned sat
[2023-03-12 09:46:46] [INFO ] Computed and/alt/rep : 351/1497/351 causal constraints (skipped 1165 transitions) in 137 ms.
[2023-03-12 09:46:47] [INFO ] Added : 37 causal constraints over 8 iterations in 840 ms. Result :sat
Minimization took 262 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 1554/1554 transitions.
Applied a total of 0 rules in 18 ms. Remains 624 /624 variables (removed 0) and now considering 1554/1554 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 624/624 places, 1554/1554 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 1554/1554 transitions.
Applied a total of 0 rules in 16 ms. Remains 624 /624 variables (removed 0) and now considering 1554/1554 (removed 0) transitions.
[2023-03-12 09:46:48] [INFO ] Invariant cache hit.
[2023-03-12 09:46:49] [INFO ] Implicit Places using invariants in 556 ms returned []
[2023-03-12 09:46:49] [INFO ] Invariant cache hit.
[2023-03-12 09:46:51] [INFO ] Implicit Places using invariants and state equation in 1863 ms returned []
Implicit Place search using SMT with State Equation took 2438 ms to find 0 implicit places.
[2023-03-12 09:46:51] [INFO ] Redundant transitions in 130 ms returned []
[2023-03-12 09:46:51] [INFO ] Invariant cache hit.
[2023-03-12 09:46:51] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3172 ms. Remains : 624/624 places, 1554/1554 transitions.
Starting property specific reduction for ASLink-PT-08a-UpperBounds-04
[2023-03-12 09:46:51] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 175 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-12 09:46:51] [INFO ] Invariant cache hit.
[2023-03-12 09:46:51] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-12 09:46:51] [INFO ] [Real]Absence check using 13 positive and 44 generalized place invariants in 11 ms returned sat
[2023-03-12 09:46:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:52] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2023-03-12 09:46:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:46:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-12 09:46:52] [INFO ] [Nat]Absence check using 13 positive and 44 generalized place invariants in 42 ms returned sat
[2023-03-12 09:46:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:53] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2023-03-12 09:46:53] [INFO ] Computed and/alt/rep : 351/1497/351 causal constraints (skipped 1165 transitions) in 101 ms.
[2023-03-12 09:46:54] [INFO ] Added : 44 causal constraints over 9 iterations in 1006 ms. Result :sat
Minimization took 323 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 1554/1554 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 624 transition count 1553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 623 transition count 1553
Applied a total of 2 rules in 34 ms. Remains 623 /624 variables (removed 1) and now considering 1553/1554 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 623/624 places, 1553/1554 transitions.
// Phase 1: matrix 1553 rows 623 cols
[2023-03-12 09:46:54] [INFO ] Computed 57 place invariants in 34 ms
Incomplete random walk after 1000000 steps, including 17006 resets, run finished after 2440 ms. (steps per millisecond=409 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2937 resets, run finished after 797 ms. (steps per millisecond=1254 ) properties (out of 1) seen :0
[2023-03-12 09:46:58] [INFO ] Invariant cache hit.
[2023-03-12 09:46:58] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-12 09:46:58] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 48 ms returned sat
[2023-03-12 09:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:58] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2023-03-12 09:46:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:46:58] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-12 09:46:58] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 21 ms returned sat
[2023-03-12 09:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:46:59] [INFO ] [Nat]Absence check using state equation in 994 ms returned sat
[2023-03-12 09:47:00] [INFO ] Deduced a trap composed of 54 places in 239 ms of which 1 ms to minimize.
[2023-03-12 09:47:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-12 09:47:00] [INFO ] Computed and/alt/rep : 350/1496/350 causal constraints (skipped 1165 transitions) in 74 ms.
[2023-03-12 09:47:00] [INFO ] Added : 22 causal constraints over 5 iterations in 799 ms. Result :sat
Minimization took 444 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1553/1553 transitions.
Applied a total of 0 rules in 17 ms. Remains 623 /623 variables (removed 0) and now considering 1553/1553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 623/623 places, 1553/1553 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1553/1553 transitions.
Applied a total of 0 rules in 17 ms. Remains 623 /623 variables (removed 0) and now considering 1553/1553 (removed 0) transitions.
[2023-03-12 09:47:01] [INFO ] Invariant cache hit.
[2023-03-12 09:47:02] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-03-12 09:47:02] [INFO ] Invariant cache hit.
[2023-03-12 09:47:03] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 2072 ms to find 0 implicit places.
[2023-03-12 09:47:03] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-12 09:47:03] [INFO ] Invariant cache hit.
[2023-03-12 09:47:04] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2701 ms. Remains : 623/623 places, 1553/1553 transitions.
Ending property specific reduction for ASLink-PT-08a-UpperBounds-04 in 12679 ms.
Starting property specific reduction for ASLink-PT-08a-UpperBounds-11
// Phase 1: matrix 1554 rows 624 cols
[2023-03-12 09:47:04] [INFO ] Computed 57 place invariants in 15 ms
Incomplete random walk after 10000 steps, including 163 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-12 09:47:04] [INFO ] Invariant cache hit.
[2023-03-12 09:47:04] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-12 09:47:04] [INFO ] [Real]Absence check using 13 positive and 44 generalized place invariants in 27 ms returned sat
[2023-03-12 09:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:47:05] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2023-03-12 09:47:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:47:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 36 ms returned sat
[2023-03-12 09:47:05] [INFO ] [Nat]Absence check using 13 positive and 44 generalized place invariants in 36 ms returned sat
[2023-03-12 09:47:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:47:05] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2023-03-12 09:47:05] [INFO ] Computed and/alt/rep : 351/1497/351 causal constraints (skipped 1165 transitions) in 92 ms.
[2023-03-12 09:47:06] [INFO ] Added : 37 causal constraints over 8 iterations in 987 ms. Result :sat
Minimization took 262 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 1554/1554 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 624 transition count 1553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 623 transition count 1553
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 623 transition count 1552
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 622 transition count 1552
Applied a total of 4 rules in 25 ms. Remains 622 /624 variables (removed 2) and now considering 1552/1554 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 622/624 places, 1552/1554 transitions.
// Phase 1: matrix 1552 rows 622 cols
[2023-03-12 09:47:07] [INFO ] Computed 57 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 16780 resets, run finished after 2084 ms. (steps per millisecond=479 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2928 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties (out of 1) seen :0
[2023-03-12 09:47:10] [INFO ] Invariant cache hit.
[2023-03-12 09:47:10] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2023-03-12 09:47:10] [INFO ] [Real]Absence check using 13 positive and 44 generalized place invariants in 14 ms returned sat
[2023-03-12 09:47:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 09:47:11] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2023-03-12 09:47:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 09:47:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-12 09:47:11] [INFO ] [Nat]Absence check using 13 positive and 44 generalized place invariants in 42 ms returned sat
[2023-03-12 09:47:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 09:47:12] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2023-03-12 09:47:12] [INFO ] Computed and/alt/rep : 349/1495/349 causal constraints (skipped 1165 transitions) in 97 ms.
[2023-03-12 09:47:13] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 1 ms to minimize.
[2023-03-12 09:47:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-12 09:47:13] [INFO ] Added : 53 causal constraints over 11 iterations in 1407 ms. Result :sat
Minimization took 246 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1552/1552 transitions.
Applied a total of 0 rules in 17 ms. Remains 622 /622 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 622/622 places, 1552/1552 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1552/1552 transitions.
Applied a total of 0 rules in 17 ms. Remains 622 /622 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
[2023-03-12 09:47:14] [INFO ] Invariant cache hit.
[2023-03-12 09:47:14] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-12 09:47:14] [INFO ] Invariant cache hit.
[2023-03-12 09:47:16] [INFO ] Implicit Places using invariants and state equation in 1865 ms returned []
Implicit Place search using SMT with State Equation took 2307 ms to find 0 implicit places.
[2023-03-12 09:47:16] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-12 09:47:16] [INFO ] Invariant cache hit.
[2023-03-12 09:47:17] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3010 ms. Remains : 622/622 places, 1552/1552 transitions.
Ending property specific reduction for ASLink-PT-08a-UpperBounds-11 in 12640 ms.
[2023-03-12 09:47:17] [INFO ] Flatten gal took : 167 ms
[2023-03-12 09:47:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-12 09:47:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 624 places, 1554 transitions and 6349 arcs took 6 ms.
Total runtime 412638 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/800/ub_0_ --maxsum=/tmp/800/ub_1_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 13945932 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16094300 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
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-08a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ASLink-PT-08a, 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 r009-oct2-167813597500125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-08a.tgz
mv ASLink-PT-08a 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 ;