About the Execution of LoLa+red for ASLink-PT-04b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1470.764 | 90196.00 | 126364.00 | 60.10 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r007-oct2-167813595000069.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 lolaxred
Input is ASLink-PT-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595000069
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 13:12 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:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 13:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 13:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 669K 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-04b-UpperBounds-00
FORMULA_NAME ASLink-PT-04b-UpperBounds-01
FORMULA_NAME ASLink-PT-04b-UpperBounds-02
FORMULA_NAME ASLink-PT-04b-UpperBounds-03
FORMULA_NAME ASLink-PT-04b-UpperBounds-04
FORMULA_NAME ASLink-PT-04b-UpperBounds-05
FORMULA_NAME ASLink-PT-04b-UpperBounds-06
FORMULA_NAME ASLink-PT-04b-UpperBounds-07
FORMULA_NAME ASLink-PT-04b-UpperBounds-08
FORMULA_NAME ASLink-PT-04b-UpperBounds-09
FORMULA_NAME ASLink-PT-04b-UpperBounds-10
FORMULA_NAME ASLink-PT-04b-UpperBounds-11
FORMULA_NAME ASLink-PT-04b-UpperBounds-12
FORMULA_NAME ASLink-PT-04b-UpperBounds-13
FORMULA_NAME ASLink-PT-04b-UpperBounds-14
FORMULA_NAME ASLink-PT-04b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678336823770
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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 04:40:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 04:40:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 04:40:26] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2023-03-09 04:40:26] [INFO ] Transformed 2034 places.
[2023-03-09 04:40:26] [INFO ] Transformed 2567 transitions.
[2023-03-09 04:40:26] [INFO ] Found NUPN structural information;
[2023-03-09 04:40:26] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 2567 rows 2034 cols
[2023-03-09 04:40:26] [INFO ] Computed 199 place invariants in 133 ms
Incomplete random walk after 10000 steps, including 22 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 16) seen :12
FORMULA ASLink-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :1
FORMULA ASLink-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
[2023-03-09 04:40:27] [INFO ] Invariant cache hit.
[2023-03-09 04:40:27] [INFO ] [Real]Absence check using 48 positive place invariants in 48 ms returned sat
[2023-03-09 04:40:27] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 59 ms returned sat
[2023-03-09 04:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:40:29] [INFO ] [Real]Absence check using state equation in 1695 ms returned sat
[2023-03-09 04:40:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:40:29] [INFO ] [Nat]Absence check using 48 positive place invariants in 36 ms returned sat
[2023-03-09 04:40:30] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 66 ms returned sat
[2023-03-09 04:40:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:40:32] [INFO ] [Nat]Absence check using state equation in 2195 ms returned sat
[2023-03-09 04:40:33] [INFO ] Deduced a trap composed of 274 places in 1443 ms of which 14 ms to minimize.
[2023-03-09 04:40:35] [INFO ] Deduced a trap composed of 284 places in 1335 ms of which 2 ms to minimize.
[2023-03-09 04:40:35] [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 0
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-09 04:40:35] [INFO ] [Real]Absence check using 48 positive place invariants in 53 ms returned sat
[2023-03-09 04:40:35] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 64 ms returned sat
[2023-03-09 04:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:40:37] [INFO ] [Real]Absence check using state equation in 1557 ms returned sat
[2023-03-09 04:40:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:40:37] [INFO ] [Nat]Absence check using 48 positive place invariants in 65 ms returned sat
[2023-03-09 04:40:38] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 79 ms returned sat
[2023-03-09 04:40:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:40:40] [INFO ] [Nat]Absence check using state equation in 2451 ms returned sat
[2023-03-09 04:40:41] [INFO ] Deduced a trap composed of 107 places in 920 ms of which 49 ms to minimize.
[2023-03-09 04:40:42] [INFO ] Deduced a trap composed of 42 places in 809 ms of which 14 ms to minimize.
[2023-03-09 04:40:43] [INFO ] Deduced a trap composed of 159 places in 807 ms of which 14 ms to minimize.
[2023-03-09 04:40:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
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-09 04:40:43] [INFO ] [Real]Absence check using 48 positive place invariants in 33 ms returned sat
[2023-03-09 04:40:43] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 71 ms returned sat
[2023-03-09 04:40:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:40:45] [INFO ] [Real]Absence check using state equation in 1251 ms returned sat
[2023-03-09 04:40:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:40:45] [INFO ] [Nat]Absence check using 48 positive place invariants in 37 ms returned sat
[2023-03-09 04:40:45] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 180 ms returned sat
[2023-03-09 04:40:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:40:50] [INFO ] [Nat]Absence check using state equation in 4369 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions removed 468 transitions
Trivial Post-agglo rules discarded 468 transitions
Performed 468 trivial Post agglomeration. Transition count delta: 468
Iterating post reduction 0 with 468 rules applied. Total rules applied 468 place count 2034 transition count 2099
Reduce places removed 468 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 490 rules applied. Total rules applied 958 place count 1566 transition count 2077
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 965 place count 1560 transition count 2076
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 966 place count 1559 transition count 2076
Performed 469 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 469 Pre rules applied. Total rules applied 966 place count 1559 transition count 1607
Deduced a syphon composed of 469 places in 7 ms
Ensure Unique test removed 43 places
Reduce places removed 512 places and 0 transitions.
Iterating global reduction 4 with 981 rules applied. Total rules applied 1947 place count 1047 transition count 1607
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 4 with 32 rules applied. Total rules applied 1979 place count 1043 transition count 1579
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 2007 place count 1015 transition count 1579
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 2007 place count 1015 transition count 1564
Deduced a syphon composed of 15 places in 7 ms
Ensure Unique test removed 15 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 45 rules applied. Total rules applied 2052 place count 985 transition count 1564
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 2052 place count 985 transition count 1549
Deduced a syphon composed of 15 places in 7 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 2082 place count 970 transition count 1549
Discarding 64 places :
Symmetric choice reduction at 6 with 64 rule applications. Total rules 2146 place count 906 transition count 1485
Iterating global reduction 6 with 64 rules applied. Total rules applied 2210 place count 906 transition count 1485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2211 place count 906 transition count 1484
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2211 place count 906 transition count 1462
Deduced a syphon composed of 22 places in 16 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 45 rules applied. Total rules applied 2256 place count 883 transition count 1462
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2256 place count 883 transition count 1461
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 2259 place count 881 transition count 1461
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2264 place count 876 transition count 1428
Iterating global reduction 7 with 5 rules applied. Total rules applied 2269 place count 876 transition count 1428
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 2269 place count 876 transition count 1424
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 2277 place count 872 transition count 1424
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2278 place count 871 transition count 1416
Iterating global reduction 7 with 1 rules applied. Total rules applied 2279 place count 871 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2280 place count 870 transition count 1408
Iterating global reduction 7 with 1 rules applied. Total rules applied 2281 place count 870 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2282 place count 869 transition count 1400
Iterating global reduction 7 with 1 rules applied. Total rules applied 2283 place count 869 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2284 place count 868 transition count 1392
Iterating global reduction 7 with 1 rules applied. Total rules applied 2285 place count 868 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2286 place count 867 transition count 1384
Iterating global reduction 7 with 1 rules applied. Total rules applied 2287 place count 867 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2288 place count 866 transition count 1376
Iterating global reduction 7 with 1 rules applied. Total rules applied 2289 place count 866 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2290 place count 865 transition count 1368
Iterating global reduction 7 with 1 rules applied. Total rules applied 2291 place count 865 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2292 place count 864 transition count 1360
Iterating global reduction 7 with 1 rules applied. Total rules applied 2293 place count 864 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2294 place count 863 transition count 1352
Iterating global reduction 7 with 1 rules applied. Total rules applied 2295 place count 863 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2296 place count 862 transition count 1344
Iterating global reduction 7 with 1 rules applied. Total rules applied 2297 place count 862 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2298 place count 861 transition count 1336
Iterating global reduction 7 with 1 rules applied. Total rules applied 2299 place count 861 transition count 1336
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2300 place count 860 transition count 1328
Iterating global reduction 7 with 1 rules applied. Total rules applied 2301 place count 860 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2302 place count 859 transition count 1320
Iterating global reduction 7 with 1 rules applied. Total rules applied 2303 place count 859 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2304 place count 858 transition count 1312
Iterating global reduction 7 with 1 rules applied. Total rules applied 2305 place count 858 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2306 place count 857 transition count 1304
Iterating global reduction 7 with 1 rules applied. Total rules applied 2307 place count 857 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2308 place count 856 transition count 1296
Iterating global reduction 7 with 1 rules applied. Total rules applied 2309 place count 856 transition count 1296
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 3 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 7 with 228 rules applied. Total rules applied 2537 place count 742 transition count 1182
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2538 place count 741 transition count 1181
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 2540 place count 740 transition count 1181
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2541 place count 739 transition count 1180
Iterating global reduction 7 with 1 rules applied. Total rules applied 2542 place count 739 transition count 1180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2544 place count 739 transition count 1178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2545 place count 738 transition count 1178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2547 place count 737 transition count 1187
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 2552 place count 737 transition count 1182
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2557 place count 732 transition count 1182
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 2560 place count 732 transition count 1179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2563 place count 729 transition count 1179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2564 place count 728 transition count 1178
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 11 with 12 rules applied. Total rules applied 2576 place count 720 transition count 1174
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2580 place count 716 transition count 1174
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 12 Pre rules applied. Total rules applied 2580 place count 716 transition count 1162
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 13 with 25 rules applied. Total rules applied 2605 place count 703 transition count 1162
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 13 with 5 rules applied. Total rules applied 2610 place count 698 transition count 1162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2610 place count 698 transition count 1161
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2612 place count 697 transition count 1161
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 14 with 18 rules applied. Total rules applied 2630 place count 688 transition count 1152
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 2634 place count 684 transition count 1148
Iterating global reduction 14 with 4 rules applied. Total rules applied 2638 place count 684 transition count 1148
Free-agglomeration rule applied 4 times.
Iterating global reduction 14 with 4 rules applied. Total rules applied 2642 place count 684 transition count 1144
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 2646 place count 680 transition count 1144
Applied a total of 2646 rules in 1396 ms. Remains 680 /2034 variables (removed 1354) and now considering 1144/2567 (removed 1423) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1396 ms. Remains : 680/2034 places, 1144/2567 transitions.
// Phase 1: matrix 1144 rows 680 cols
[2023-03-09 04:40:51] [INFO ] Computed 120 place invariants in 30 ms
Incomplete random walk after 1000000 steps, including 12561 resets, run finished after 2803 ms. (steps per millisecond=356 ) properties (out of 3) seen :1
FORMULA ASLink-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2909 resets, run finished after 1267 ms. (steps per millisecond=789 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2936 resets, run finished after 1040 ms. (steps per millisecond=961 ) properties (out of 2) seen :0
[2023-03-09 04:40:56] [INFO ] Invariant cache hit.
[2023-03-09 04:40:56] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-09 04:40:56] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 21 ms returned sat
[2023-03-09 04:40:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:40:57] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2023-03-09 04:40:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:40:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 35 ms returned sat
[2023-03-09 04:40:57] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 34 ms returned sat
[2023-03-09 04:40:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:40:58] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2023-03-09 04:40:58] [INFO ] Computed and/alt/rep : 444/1708/444 causal constraints (skipped 675 transitions) in 212 ms.
[2023-03-09 04:41:03] [INFO ] Added : 278 causal constraints over 56 iterations in 4878 ms. Result :sat
Minimization took 350 ms.
[2023-03-09 04:41:03] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2023-03-09 04:41:03] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 38 ms returned sat
[2023-03-09 04:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:04] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2023-03-09 04:41:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:41:04] [INFO ] [Nat]Absence check using 31 positive place invariants in 89 ms returned sat
[2023-03-09 04:41:04] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 25 ms returned sat
[2023-03-09 04:41:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:04] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2023-03-09 04:41:05] [INFO ] Computed and/alt/rep : 444/1708/444 causal constraints (skipped 675 transitions) in 95 ms.
[2023-03-09 04:41:07] [INFO ] Added : 97 causal constraints over 20 iterations in 2102 ms. Result :sat
Minimization took 308 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 1144/1144 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 680 transition count 1143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 679 transition count 1143
Applied a total of 2 rules in 25 ms. Remains 679 /680 variables (removed 1) and now considering 1143/1144 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 679/680 places, 1143/1144 transitions.
// Phase 1: matrix 1143 rows 679 cols
[2023-03-09 04:41:07] [INFO ] Computed 120 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 12893 resets, run finished after 2576 ms. (steps per millisecond=388 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2923 resets, run finished after 1123 ms. (steps per millisecond=890 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2896 resets, run finished after 1208 ms. (steps per millisecond=827 ) properties (out of 2) seen :0
[2023-03-09 04:41:12] [INFO ] Invariant cache hit.
[2023-03-09 04:41:13] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned sat
[2023-03-09 04:41:13] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 65 ms returned sat
[2023-03-09 04:41:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:13] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2023-03-09 04:41:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:41:13] [INFO ] [Nat]Absence check using 31 positive place invariants in 50 ms returned sat
[2023-03-09 04:41:13] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 49 ms returned sat
[2023-03-09 04:41:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:14] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2023-03-09 04:41:14] [INFO ] Computed and/alt/rep : 443/1707/443 causal constraints (skipped 675 transitions) in 57 ms.
[2023-03-09 04:41:15] [INFO ] Added : 99 causal constraints over 20 iterations in 1600 ms. Result :sat
Minimization took 351 ms.
[2023-03-09 04:41:16] [INFO ] [Real]Absence check using 31 positive place invariants in 8 ms returned sat
[2023-03-09 04:41:16] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 15 ms returned sat
[2023-03-09 04:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:16] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2023-03-09 04:41:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:41:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-09 04:41:16] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 28 ms returned sat
[2023-03-09 04:41:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:17] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2023-03-09 04:41:17] [INFO ] Computed and/alt/rep : 443/1707/443 causal constraints (skipped 675 transitions) in 135 ms.
[2023-03-09 04:41:21] [INFO ] Added : 250 causal constraints over 50 iterations in 3852 ms. Result :sat
Minimization took 309 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 679 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 679/679 places, 1143/1143 transitions.
Applied a total of 0 rules in 20 ms. Remains 679 /679 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 679/679 places, 1143/1143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 679/679 places, 1143/1143 transitions.
Applied a total of 0 rules in 21 ms. Remains 679 /679 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
[2023-03-09 04:41:21] [INFO ] Invariant cache hit.
[2023-03-09 04:41:22] [INFO ] Implicit Places using invariants in 526 ms returned [1, 18, 19, 31, 48, 66, 105, 139, 143, 152, 153, 155, 172, 190, 259, 263, 264, 275, 276, 278, 295, 313, 382, 386, 387, 398, 399, 401, 418, 436, 505, 509, 510, 513, 524, 525, 526, 544, 546, 550, 568, 569, 570, 571, 583, 589, 595, 601, 607, 613, 619, 625, 631, 637, 643]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 530 ms to find 55 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 624/679 places, 1143/1143 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 624 transition count 1049
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 100 rules applied. Total rules applied 194 place count 530 transition count 1043
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 196 place count 528 transition count 1043
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 196 place count 528 transition count 1020
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 243 place count 504 transition count 1020
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 255 place count 500 transition count 1012
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 263 place count 492 transition count 1012
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 278 place count 477 transition count 997
Iterating global reduction 5 with 15 rules applied. Total rules applied 293 place count 477 transition count 997
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 296 place count 477 transition count 994
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 296 place count 477 transition count 993
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 298 place count 476 transition count 993
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 301 place count 473 transition count 987
Iterating global reduction 6 with 3 rules applied. Total rules applied 304 place count 473 transition count 987
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 305 place count 472 transition count 986
Iterating global reduction 6 with 1 rules applied. Total rules applied 306 place count 472 transition count 986
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 307 place count 471 transition count 984
Iterating global reduction 6 with 1 rules applied. Total rules applied 308 place count 471 transition count 984
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 374 place count 438 transition count 951
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 378 place count 434 transition count 947
Iterating global reduction 6 with 4 rules applied. Total rules applied 382 place count 434 transition count 947
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 386 place count 434 transition count 943
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 390 place count 432 transition count 944
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 398 place count 432 transition count 936
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 407 place count 423 transition count 936
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 419 place count 423 transition count 936
Applied a total of 419 rules in 142 ms. Remains 423 /624 variables (removed 201) and now considering 936/1143 (removed 207) transitions.
// Phase 1: matrix 936 rows 423 cols
[2023-03-09 04:41:22] [INFO ] Computed 59 place invariants in 19 ms
[2023-03-09 04:41:23] [INFO ] Implicit Places using invariants in 461 ms returned [72, 92, 98, 101, 103, 106, 107, 159, 176, 182, 185, 187, 192, 193, 245, 262, 268, 271, 273, 278, 279, 331, 348, 354, 357, 359]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 475 ms to find 26 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 397/679 places, 936/1143 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 385 transition count 924
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 385 transition count 924
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 381 transition count 920
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 381 transition count 920
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 48 place count 373 transition count 912
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 373 transition count 900
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 72 place count 361 transition count 900
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 361 transition count 896
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 357 transition count 896
Applied a total of 80 rules in 70 ms. Remains 357 /397 variables (removed 40) and now considering 896/936 (removed 40) transitions.
// Phase 1: matrix 896 rows 357 cols
[2023-03-09 04:41:23] [INFO ] Computed 33 place invariants in 6 ms
[2023-03-09 04:41:23] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-09 04:41:23] [INFO ] Invariant cache hit.
[2023-03-09 04:41:24] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 357/679 places, 896/1143 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2247 ms. Remains : 357/679 places, 896/1143 transitions.
Successfully produced net in file /tmp/petri1000_2806883749335882354.dot
Successfully produced net in file /tmp/petri1001_15395051415085466250.dot
Successfully produced net in file /tmp/petri1002_555687873400477076.dot
Successfully produced net in file /tmp/petri1003_16108004003500211823.dot
Drop transitions removed 4 transitions
Dominated transitions for bounds rules discarded 4 transitions
// Phase 1: matrix 892 rows 357 cols
[2023-03-09 04:41:24] [INFO ] Computed 33 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 19739 resets, run finished after 1748 ms. (steps per millisecond=572 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5468 resets, run finished after 693 ms. (steps per millisecond=1443 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5438 resets, run finished after 703 ms. (steps per millisecond=1422 ) properties (out of 2) seen :0
[2023-03-09 04:41:27] [INFO ] Invariant cache hit.
[2023-03-09 04:41:27] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-09 04:41:27] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 04:41:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:27] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2023-03-09 04:41:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:41:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-09 04:41:27] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-09 04:41:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:28] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2023-03-09 04:41:28] [INFO ] Computed and/alt/rep : 184/892/184 causal constraints (skipped 683 transitions) in 62 ms.
[2023-03-09 04:41:29] [INFO ] Added : 17 causal constraints over 4 iterations in 500 ms. Result :sat
Minimization took 147 ms.
[2023-03-09 04:41:29] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-09 04:41:29] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 46 ms returned sat
[2023-03-09 04:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:29] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2023-03-09 04:41:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:41:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-09 04:41:29] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 04:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:30] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2023-03-09 04:41:30] [INFO ] Computed and/alt/rep : 184/892/184 causal constraints (skipped 683 transitions) in 60 ms.
[2023-03-09 04:41:30] [INFO ] Added : 33 causal constraints over 7 iterations in 415 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 892/892 transitions.
Graph (complete) has 2202 edges and 357 vertex of which 353 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Discarding 4 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 353 transition count 892
Applied a total of 5 rules in 40 ms. Remains 353 /357 variables (removed 4) and now considering 892/892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 353/357 places, 892/892 transitions.
// Phase 1: matrix 892 rows 353 cols
[2023-03-09 04:41:30] [INFO ] Computed 33 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 19746 resets, run finished after 1599 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5477 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5506 resets, run finished after 645 ms. (steps per millisecond=1550 ) properties (out of 2) seen :0
[2023-03-09 04:41:33] [INFO ] Invariant cache hit.
[2023-03-09 04:41:34] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-09 04:41:34] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-09 04:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:34] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2023-03-09 04:41:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:41:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-09 04:41:34] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 04:41:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:34] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2023-03-09 04:41:34] [INFO ] Computed and/alt/rep : 184/890/184 causal constraints (skipped 683 transitions) in 38 ms.
[2023-03-09 04:41:35] [INFO ] Added : 18 causal constraints over 4 iterations in 276 ms. Result :sat
Minimization took 148 ms.
[2023-03-09 04:41:35] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2023-03-09 04:41:35] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 04:41:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:35] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2023-03-09 04:41:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:41:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-09 04:41:36] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-09 04:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:36] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2023-03-09 04:41:36] [INFO ] Computed and/alt/rep : 184/890/184 causal constraints (skipped 683 transitions) in 41 ms.
[2023-03-09 04:41:36] [INFO ] Added : 18 causal constraints over 4 iterations in 318 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 892/892 transitions.
Applied a total of 0 rules in 14 ms. Remains 353 /353 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 353/353 places, 892/892 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 892/892 transitions.
Applied a total of 0 rules in 12 ms. Remains 353 /353 variables (removed 0) and now considering 892/892 (removed 0) transitions.
[2023-03-09 04:41:37] [INFO ] Invariant cache hit.
[2023-03-09 04:41:37] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-09 04:41:37] [INFO ] Invariant cache hit.
[2023-03-09 04:41:38] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
[2023-03-09 04:41:38] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-09 04:41:38] [INFO ] Invariant cache hit.
[2023-03-09 04:41:38] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1459 ms. Remains : 353/353 places, 892/892 transitions.
Starting property specific reduction for ASLink-PT-04b-UpperBounds-13
[2023-03-09 04:41:38] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 195 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 04:41:38] [INFO ] Invariant cache hit.
[2023-03-09 04:41:38] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-09 04:41:38] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-09 04:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:38] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-03-09 04:41:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:41:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-09 04:41:39] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 33 ms returned sat
[2023-03-09 04:41:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:39] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2023-03-09 04:41:39] [INFO ] Computed and/alt/rep : 184/890/184 causal constraints (skipped 683 transitions) in 52 ms.
[2023-03-09 04:41:39] [INFO ] Added : 18 causal constraints over 4 iterations in 339 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 892/892 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 353 transition count 891
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 352 transition count 891
Applied a total of 2 rules in 12 ms. Remains 352 /353 variables (removed 1) and now considering 891/892 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 352/353 places, 891/892 transitions.
// Phase 1: matrix 891 rows 352 cols
[2023-03-09 04:41:40] [INFO ] Computed 33 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 19674 resets, run finished after 1524 ms. (steps per millisecond=656 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5409 resets, run finished after 668 ms. (steps per millisecond=1497 ) properties (out of 1) seen :0
[2023-03-09 04:41:42] [INFO ] Invariant cache hit.
[2023-03-09 04:41:42] [INFO ] [Real]Absence check using 10 positive place invariants in 78 ms returned sat
[2023-03-09 04:41:42] [INFO ] [Real]Absence check using 10 positive and 23 generalized place invariants in 34 ms returned sat
[2023-03-09 04:41:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:42] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2023-03-09 04:41:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:41:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-09 04:41:43] [INFO ] [Nat]Absence check using 10 positive and 23 generalized place invariants in 15 ms returned sat
[2023-03-09 04:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:43] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2023-03-09 04:41:43] [INFO ] Computed and/alt/rep : 183/889/183 causal constraints (skipped 683 transitions) in 41 ms.
[2023-03-09 04:41:43] [INFO ] Added : 19 causal constraints over 4 iterations in 334 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 891/891 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 352/352 places, 891/891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 891/891 transitions.
Applied a total of 0 rules in 20 ms. Remains 352 /352 variables (removed 0) and now considering 891/891 (removed 0) transitions.
[2023-03-09 04:41:43] [INFO ] Invariant cache hit.
[2023-03-09 04:41:44] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-09 04:41:44] [INFO ] Invariant cache hit.
[2023-03-09 04:41:45] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
[2023-03-09 04:41:45] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-09 04:41:45] [INFO ] Invariant cache hit.
[2023-03-09 04:41:45] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1664 ms. Remains : 352/352 places, 891/891 transitions.
Ending property specific reduction for ASLink-PT-04b-UpperBounds-13 in 7068 ms.
Starting property specific reduction for ASLink-PT-04b-UpperBounds-14
// Phase 1: matrix 892 rows 353 cols
[2023-03-09 04:41:45] [INFO ] Computed 33 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 193 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 04:41:45] [INFO ] Invariant cache hit.
[2023-03-09 04:41:45] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-09 04:41:45] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-09 04:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:45] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2023-03-09 04:41:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:41:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 36 ms returned sat
[2023-03-09 04:41:46] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-09 04:41:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:46] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2023-03-09 04:41:46] [INFO ] Computed and/alt/rep : 184/890/184 causal constraints (skipped 683 transitions) in 74 ms.
[2023-03-09 04:41:46] [INFO ] Added : 18 causal constraints over 4 iterations in 408 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 892/892 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 353 transition count 891
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 352 transition count 891
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 352 transition count 890
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 351 transition count 890
Applied a total of 4 rules in 14 ms. Remains 351 /353 variables (removed 2) and now considering 890/892 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 351/353 places, 890/892 transitions.
// Phase 1: matrix 890 rows 351 cols
[2023-03-09 04:41:47] [INFO ] Computed 33 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 19325 resets, run finished after 1892 ms. (steps per millisecond=528 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5378 resets, run finished after 664 ms. (steps per millisecond=1506 ) properties (out of 1) seen :0
[2023-03-09 04:41:49] [INFO ] Invariant cache hit.
[2023-03-09 04:41:49] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-09 04:41:49] [INFO ] [Real]Absence check using 11 positive and 22 generalized place invariants in 15 ms returned sat
[2023-03-09 04:41:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:50] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2023-03-09 04:41:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:41:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-09 04:41:50] [INFO ] [Nat]Absence check using 11 positive and 22 generalized place invariants in 6 ms returned sat
[2023-03-09 04:41:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:41:50] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2023-03-09 04:41:50] [INFO ] Computed and/alt/rep : 182/888/182 causal constraints (skipped 683 transitions) in 90 ms.
[2023-03-09 04:41:51] [INFO ] Added : 23 causal constraints over 5 iterations in 536 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 890/890 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 351/351 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 890/890 transitions.
Applied a total of 0 rules in 10 ms. Remains 351 /351 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2023-03-09 04:41:51] [INFO ] Invariant cache hit.
[2023-03-09 04:41:51] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-09 04:41:51] [INFO ] Invariant cache hit.
[2023-03-09 04:41:52] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1301 ms to find 0 implicit places.
[2023-03-09 04:41:52] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-09 04:41:52] [INFO ] Invariant cache hit.
[2023-03-09 04:41:53] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1723 ms. Remains : 351/351 places, 890/890 transitions.
Ending property specific reduction for ASLink-PT-04b-UpperBounds-14 in 7521 ms.
[2023-03-09 04:41:53] [INFO ] Flatten gal took : 110 ms
[2023-03-09 04:41:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-09 04:41:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 353 places, 892 transitions and 3648 arcs took 4 ms.
Total runtime 87160 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ASLink-PT-04b
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/382
Upper Bounds
FORMULA ASLink-PT-04b-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ASLink-PT-04b-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678336913966
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/382/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/382/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/382/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 9 (type EXCL) for 3 ASLink-PT-04b-UpperBounds-14
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 3 ASLink-PT-04b-UpperBounds-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 3 ASLink-PT-04b-UpperBounds-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: LAUNCH task # 6 (type FNDP) for 0 ASLink-PT-04b-UpperBounds-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 9 (type EXCL) for ASLink-PT-04b-UpperBounds-14
lola: markings : 267
lola: fired transitions : 266
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 7 (type FNDP) for ASLink-PT-04b-UpperBounds-14 (obsolete)
lola: CANCELED task # 8 (type EQUN) for ASLink-PT-04b-UpperBounds-14 (obsolete)
lola: LAUNCH task # 11 (type EXCL) for 0 ASLink-PT-04b-UpperBounds-13
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 10 (type EQUN) for 0 ASLink-PT-04b-UpperBounds-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/382/UpperBounds-8.sara.
lola: REPORT NUM
lola: FINISHED task # 6 (type FNDP) for ASLink-PT-04b-UpperBounds-13
lola: fired transitions : 266
lola: tried executions : 1
lola: time used : 0.000000
lola: CANCELED task # 10 (type EQUN) for ASLink-PT-04b-UpperBounds-13 (obsolete)
lola: CANCELED task # 11 (type EXCL) for ASLink-PT-04b-UpperBounds-13 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ASLink-PT-04b-UpperBounds-13: BOUND 1 findpath
ASLink-PT-04b-UpperBounds-14: BOUND 1 state space
Time elapsed: 0 secs. Pages in use: 1
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-04b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ASLink-PT-04b, 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 r007-oct2-167813595000069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04b.tgz
mv ASLink-PT-04b 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 ;