fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r007-oct2-167813595000117
Last Updated
May 14, 2023

About the Execution of LoLa+red for ASLink-PT-07b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2033.216 250652.00 303920.00 38.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-167813595000117.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-07b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595000117
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-07b-UpperBounds-00
FORMULA_NAME ASLink-PT-07b-UpperBounds-01
FORMULA_NAME ASLink-PT-07b-UpperBounds-02
FORMULA_NAME ASLink-PT-07b-UpperBounds-03
FORMULA_NAME ASLink-PT-07b-UpperBounds-04
FORMULA_NAME ASLink-PT-07b-UpperBounds-05
FORMULA_NAME ASLink-PT-07b-UpperBounds-06
FORMULA_NAME ASLink-PT-07b-UpperBounds-07
FORMULA_NAME ASLink-PT-07b-UpperBounds-08
FORMULA_NAME ASLink-PT-07b-UpperBounds-09
FORMULA_NAME ASLink-PT-07b-UpperBounds-10
FORMULA_NAME ASLink-PT-07b-UpperBounds-11
FORMULA_NAME ASLink-PT-07b-UpperBounds-12
FORMULA_NAME ASLink-PT-07b-UpperBounds-13
FORMULA_NAME ASLink-PT-07b-UpperBounds-14
FORMULA_NAME ASLink-PT-07b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678340643439

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-07b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 05:44:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 05:44:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 05:44:06] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2023-03-09 05:44:06] [INFO ] Transformed 3222 places.
[2023-03-09 05:44:06] [INFO ] Transformed 3986 transitions.
[2023-03-09 05:44:06] [INFO ] Found NUPN structural information;
[2023-03-09 05:44:06] [INFO ] Parsed PT model containing 3222 places and 3986 transitions and 12126 arcs in 341 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 3986 rows 3222 cols
[2023-03-09 05:44:06] [INFO ] Computed 316 place invariants in 186 ms
Incomplete random walk after 10000 steps, including 12 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 16) seen :7
FORMULA ASLink-PT-07b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
[2023-03-09 05:44:07] [INFO ] Invariant cache hit.
[2023-03-09 05:44:08] [INFO ] [Real]Absence check using 75 positive place invariants in 213 ms returned sat
[2023-03-09 05:44:08] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 105 ms returned sat
[2023-03-09 05:44:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:44:12] [INFO ] [Real]Absence check using state equation in 3892 ms returned unknown
[2023-03-09 05:44:12] [INFO ] [Real]Absence check using 75 positive place invariants in 74 ms returned sat
[2023-03-09 05:44:13] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 101 ms returned sat
[2023-03-09 05:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:44:15] [INFO ] [Real]Absence check using state equation in 2725 ms returned sat
[2023-03-09 05:44:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:44:16] [INFO ] [Nat]Absence check using 75 positive place invariants in 70 ms returned sat
[2023-03-09 05:44:16] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 145 ms returned sat
[2023-03-09 05:44:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:44:21] [INFO ] [Nat]Absence check using state equation in 4205 ms returned unknown
[2023-03-09 05:44:21] [INFO ] [Real]Absence check using 75 positive place invariants in 83 ms returned sat
[2023-03-09 05:44:21] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 144 ms returned sat
[2023-03-09 05:44:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:44:24] [INFO ] [Real]Absence check using state equation in 2357 ms returned sat
[2023-03-09 05:44:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:44:24] [INFO ] [Nat]Absence check using 75 positive place invariants in 87 ms returned sat
[2023-03-09 05:44:25] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 344 ms returned sat
[2023-03-09 05:44:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:44:29] [INFO ] [Nat]Absence check using state equation in 4029 ms returned unknown
[2023-03-09 05:44:29] [INFO ] [Real]Absence check using 75 positive place invariants in 78 ms returned sat
[2023-03-09 05:44:30] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 138 ms returned sat
[2023-03-09 05:44:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:44:32] [INFO ] [Real]Absence check using state equation in 2579 ms returned sat
[2023-03-09 05:44:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:44:33] [INFO ] [Nat]Absence check using 75 positive place invariants in 101 ms returned sat
[2023-03-09 05:44:33] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 132 ms returned sat
[2023-03-09 05:44:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:44:37] [INFO ] [Nat]Absence check using state equation in 4298 ms returned unknown
[2023-03-09 05:44:38] [INFO ] [Real]Absence check using 75 positive place invariants in 83 ms returned sat
[2023-03-09 05:44:38] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 102 ms returned sat
[2023-03-09 05:44:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:44:41] [INFO ] [Real]Absence check using state equation in 2937 ms returned sat
[2023-03-09 05:44:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:44:42] [INFO ] [Nat]Absence check using 75 positive place invariants in 68 ms returned sat
[2023-03-09 05:44:42] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 258 ms returned sat
[2023-03-09 05:44:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:44:44] [INFO ] [Nat]Absence check using state equation in 1866 ms returned sat
[2023-03-09 05:44:47] [INFO ] Deduced a trap composed of 157 places in 2899 ms of which 31 ms to minimize.
[2023-03-09 05:44:47] [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 4
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 05:44:48] [INFO ] [Real]Absence check using 75 positive place invariants in 87 ms returned sat
[2023-03-09 05:44:48] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 236 ms returned sat
[2023-03-09 05:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:44:51] [INFO ] [Real]Absence check using state equation in 3051 ms returned sat
[2023-03-09 05:44:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:44:52] [INFO ] [Nat]Absence check using 75 positive place invariants in 83 ms returned sat
[2023-03-09 05:44:52] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 189 ms returned sat
[2023-03-09 05:44:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:44:56] [INFO ] [Nat]Absence check using state equation in 4312 ms returned unknown
[2023-03-09 05:44:57] [INFO ] [Real]Absence check using 75 positive place invariants in 95 ms returned sat
[2023-03-09 05:44:57] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 187 ms returned sat
[2023-03-09 05:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:44:59] [INFO ] [Real]Absence check using state equation in 2299 ms returned sat
[2023-03-09 05:44:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:45:00] [INFO ] [Nat]Absence check using 75 positive place invariants in 74 ms returned sat
[2023-03-09 05:45:00] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 239 ms returned sat
[2023-03-09 05:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:45:04] [INFO ] [Nat]Absence check using state equation in 4149 ms returned unknown
[2023-03-09 05:45:05] [INFO ] [Real]Absence check using 75 positive place invariants in 58 ms returned sat
[2023-03-09 05:45:05] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 213 ms returned sat
[2023-03-09 05:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:45:09] [INFO ] [Real]Absence check using state equation in 3761 ms returned sat
[2023-03-09 05:45:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:45:10] [INFO ] [Nat]Absence check using 75 positive place invariants in 64 ms returned sat
[2023-03-09 05:45:10] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 147 ms returned sat
[2023-03-09 05:45:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:45:14] [INFO ] [Nat]Absence check using state equation in 4340 ms returned unknown
[2023-03-09 05:45:15] [INFO ] [Real]Absence check using 75 positive place invariants in 57 ms returned sat
[2023-03-09 05:45:15] [INFO ] [Real]Absence check using 75 positive and 241 generalized place invariants in 97 ms returned sat
[2023-03-09 05:45:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:45:18] [INFO ] [Real]Absence check using state equation in 3250 ms returned sat
[2023-03-09 05:45:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:45:19] [INFO ] [Nat]Absence check using 75 positive place invariants in 72 ms returned sat
[2023-03-09 05:45:19] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 132 ms returned sat
[2023-03-09 05:45:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:45:23] [INFO ] [Nat]Absence check using state equation in 4289 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 3222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3222/3222 places, 3986/3986 transitions.
Drop transitions removed 746 transitions
Trivial Post-agglo rules discarded 746 transitions
Performed 746 trivial Post agglomeration. Transition count delta: 746
Iterating post reduction 0 with 746 rules applied. Total rules applied 746 place count 3222 transition count 3240
Reduce places removed 746 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 780 rules applied. Total rules applied 1526 place count 2476 transition count 3206
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 1536 place count 2467 transition count 3205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1537 place count 2466 transition count 3205
Performed 745 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 745 Pre rules applied. Total rules applied 1537 place count 2466 transition count 2460
Deduced a syphon composed of 745 places in 7 ms
Ensure Unique test removed 73 places
Reduce places removed 818 places and 0 transitions.
Iterating global reduction 4 with 1563 rules applied. Total rules applied 3100 place count 1648 transition count 2460
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 4 with 54 rules applied. Total rules applied 3154 place count 1640 transition count 2414
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 47 rules applied. Total rules applied 3201 place count 1594 transition count 2413
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3202 place count 1593 transition count 2413
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 28 Pre rules applied. Total rules applied 3202 place count 1593 transition count 2385
Deduced a syphon composed of 28 places in 6 ms
Ensure Unique test removed 27 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 7 with 83 rules applied. Total rules applied 3285 place count 1538 transition count 2385
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 27 Pre rules applied. Total rules applied 3285 place count 1538 transition count 2358
Deduced a syphon composed of 27 places in 12 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 3339 place count 1511 transition count 2358
Discarding 103 places :
Symmetric choice reduction at 7 with 103 rule applications. Total rules 3442 place count 1408 transition count 2255
Iterating global reduction 7 with 103 rules applied. Total rules applied 3545 place count 1408 transition count 2255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3546 place count 1408 transition count 2254
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 34 Pre rules applied. Total rules applied 3546 place count 1408 transition count 2220
Deduced a syphon composed of 34 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 8 with 69 rules applied. Total rules applied 3615 place count 1373 transition count 2220
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3615 place count 1373 transition count 2219
Deduced a syphon composed of 1 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 3618 place count 1371 transition count 2219
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 3626 place count 1363 transition count 2168
Iterating global reduction 8 with 8 rules applied. Total rules applied 3634 place count 1363 transition count 2168
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 7 Pre rules applied. Total rules applied 3634 place count 1363 transition count 2161
Deduced a syphon composed of 7 places in 11 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 3648 place count 1356 transition count 2161
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3649 place count 1355 transition count 2153
Iterating global reduction 8 with 1 rules applied. Total rules applied 3650 place count 1355 transition count 2153
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3651 place count 1354 transition count 2145
Iterating global reduction 8 with 1 rules applied. Total rules applied 3652 place count 1354 transition count 2145
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3653 place count 1353 transition count 2137
Iterating global reduction 8 with 1 rules applied. Total rules applied 3654 place count 1353 transition count 2137
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3655 place count 1352 transition count 2129
Iterating global reduction 8 with 1 rules applied. Total rules applied 3656 place count 1352 transition count 2129
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3657 place count 1351 transition count 2121
Iterating global reduction 8 with 1 rules applied. Total rules applied 3658 place count 1351 transition count 2121
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3659 place count 1350 transition count 2113
Iterating global reduction 8 with 1 rules applied. Total rules applied 3660 place count 1350 transition count 2113
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3661 place count 1349 transition count 2105
Iterating global reduction 8 with 1 rules applied. Total rules applied 3662 place count 1349 transition count 2105
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3663 place count 1348 transition count 2097
Iterating global reduction 8 with 1 rules applied. Total rules applied 3664 place count 1348 transition count 2097
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3665 place count 1347 transition count 2089
Iterating global reduction 8 with 1 rules applied. Total rules applied 3666 place count 1347 transition count 2089
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3667 place count 1346 transition count 2081
Iterating global reduction 8 with 1 rules applied. Total rules applied 3668 place count 1346 transition count 2081
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3669 place count 1345 transition count 2073
Iterating global reduction 8 with 1 rules applied. Total rules applied 3670 place count 1345 transition count 2073
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3671 place count 1344 transition count 2065
Iterating global reduction 8 with 1 rules applied. Total rules applied 3672 place count 1344 transition count 2065
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3673 place count 1343 transition count 2057
Iterating global reduction 8 with 1 rules applied. Total rules applied 3674 place count 1343 transition count 2057
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3675 place count 1342 transition count 2049
Iterating global reduction 8 with 1 rules applied. Total rules applied 3676 place count 1342 transition count 2049
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3677 place count 1341 transition count 2041
Iterating global reduction 8 with 1 rules applied. Total rules applied 3678 place count 1341 transition count 2041
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3679 place count 1340 transition count 2033
Iterating global reduction 8 with 1 rules applied. Total rules applied 3680 place count 1340 transition count 2033
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 186
Deduced a syphon composed of 186 places in 2 ms
Reduce places removed 186 places and 0 transitions.
Iterating global reduction 8 with 372 rules applied. Total rules applied 4052 place count 1154 transition count 1847
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4053 place count 1153 transition count 1846
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 4055 place count 1152 transition count 1846
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4056 place count 1151 transition count 1845
Iterating global reduction 8 with 1 rules applied. Total rules applied 4057 place count 1151 transition count 1845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 4059 place count 1151 transition count 1843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4060 place count 1150 transition count 1843
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4062 place count 1149 transition count 1852
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 4070 place count 1149 transition count 1844
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 4078 place count 1141 transition count 1844
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 11 with 6 rules applied. Total rules applied 4084 place count 1141 transition count 1838
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 4090 place count 1135 transition count 1838
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4091 place count 1134 transition count 1837
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 12 with 21 rules applied. Total rules applied 4112 place count 1120 transition count 1830
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 4119 place count 1113 transition count 1830
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 20 Pre rules applied. Total rules applied 4119 place count 1113 transition count 1810
Deduced a syphon composed of 20 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 14 with 41 rules applied. Total rules applied 4160 place count 1092 transition count 1810
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 14 with 8 rules applied. Total rules applied 4168 place count 1084 transition count 1810
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 4168 place count 1084 transition count 1809
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 4170 place count 1083 transition count 1809
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 15 with 30 rules applied. Total rules applied 4200 place count 1068 transition count 1794
Discarding 7 places :
Symmetric choice reduction at 15 with 7 rule applications. Total rules 4207 place count 1061 transition count 1787
Iterating global reduction 15 with 7 rules applied. Total rules applied 4214 place count 1061 transition count 1787
Free-agglomeration rule applied 7 times.
Iterating global reduction 15 with 7 rules applied. Total rules applied 4221 place count 1061 transition count 1780
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 4228 place count 1054 transition count 1780
Applied a total of 4228 rules in 2334 ms. Remains 1054 /3222 variables (removed 2168) and now considering 1780/3986 (removed 2206) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2346 ms. Remains : 1054/3222 places, 1780/3986 transitions.
// Phase 1: matrix 1780 rows 1054 cols
[2023-03-09 05:45:26] [INFO ] Computed 182 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 10802 resets, run finished after 3977 ms. (steps per millisecond=251 ) properties (out of 9) seen :6
FORMULA ASLink-PT-07b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1530 resets, run finished after 1636 ms. (steps per millisecond=611 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1530 resets, run finished after 1690 ms. (steps per millisecond=591 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1525 resets, run finished after 1640 ms. (steps per millisecond=609 ) properties (out of 3) seen :0
[2023-03-09 05:45:35] [INFO ] Invariant cache hit.
[2023-03-09 05:45:35] [INFO ] [Real]Absence check using 50 positive place invariants in 19 ms returned sat
[2023-03-09 05:45:35] [INFO ] [Real]Absence check using 50 positive and 132 generalized place invariants in 51 ms returned sat
[2023-03-09 05:45:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:45:35] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2023-03-09 05:45:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:45:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 35 ms returned sat
[2023-03-09 05:45:36] [INFO ] [Nat]Absence check using 50 positive and 132 generalized place invariants in 26 ms returned sat
[2023-03-09 05:45:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:45:37] [INFO ] [Nat]Absence check using state equation in 688 ms returned sat
[2023-03-09 05:45:37] [INFO ] Computed and/alt/rep : 718/2822/718 causal constraints (skipped 1025 transitions) in 271 ms.
[2023-03-09 05:45:54] [INFO ] Added : 558 causal constraints over 112 iterations in 17071 ms. Result :sat
Minimization took 869 ms.
[2023-03-09 05:45:55] [INFO ] [Real]Absence check using 50 positive place invariants in 27 ms returned sat
[2023-03-09 05:45:55] [INFO ] [Real]Absence check using 50 positive and 132 generalized place invariants in 100 ms returned sat
[2023-03-09 05:45:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:45:56] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2023-03-09 05:45:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:45:56] [INFO ] [Nat]Absence check using 50 positive place invariants in 25 ms returned sat
[2023-03-09 05:45:56] [INFO ] [Nat]Absence check using 50 positive and 132 generalized place invariants in 35 ms returned sat
[2023-03-09 05:45:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:45:57] [INFO ] [Nat]Absence check using state equation in 915 ms returned sat
[2023-03-09 05:45:57] [INFO ] Deduced a trap composed of 103 places in 189 ms of which 1 ms to minimize.
[2023-03-09 05:45:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-09 05:45:57] [INFO ] Computed and/alt/rep : 718/2822/718 causal constraints (skipped 1025 transitions) in 109 ms.
[2023-03-09 05:46:05] [INFO ] Added : 286 causal constraints over 58 iterations in 7445 ms. Result :sat
Minimization took 393 ms.
[2023-03-09 05:46:05] [INFO ] [Real]Absence check using 50 positive place invariants in 34 ms returned sat
[2023-03-09 05:46:05] [INFO ] [Real]Absence check using 50 positive and 132 generalized place invariants in 44 ms returned sat
[2023-03-09 05:46:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:46:06] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2023-03-09 05:46:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:46:06] [INFO ] [Nat]Absence check using 50 positive place invariants in 36 ms returned sat
[2023-03-09 05:46:06] [INFO ] [Nat]Absence check using 50 positive and 132 generalized place invariants in 52 ms returned sat
[2023-03-09 05:46:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:46:07] [INFO ] [Nat]Absence check using state equation in 1038 ms returned sat
[2023-03-09 05:46:08] [INFO ] Computed and/alt/rep : 718/2822/718 causal constraints (skipped 1025 transitions) in 136 ms.
[2023-03-09 05:46:22] [INFO ] Added : 550 causal constraints over 110 iterations in 14290 ms. Result :sat
Minimization took 913 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 1054 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1054/1054 places, 1780/1780 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1054 transition count 1778
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1052 transition count 1778
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 1052 transition count 1773
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 1047 transition count 1773
Applied a total of 14 rules in 58 ms. Remains 1047 /1054 variables (removed 7) and now considering 1773/1780 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1047/1054 places, 1773/1780 transitions.
// Phase 1: matrix 1773 rows 1047 cols
[2023-03-09 05:46:26] [INFO ] Computed 182 place invariants in 55 ms
Incomplete random walk after 1000000 steps, including 10913 resets, run finished after 3383 ms. (steps per millisecond=295 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1527 resets, run finished after 1405 ms. (steps per millisecond=711 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1530 resets, run finished after 1352 ms. (steps per millisecond=739 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1514 resets, run finished after 1362 ms. (steps per millisecond=734 ) properties (out of 3) seen :0
[2023-03-09 05:46:33] [INFO ] Invariant cache hit.
[2023-03-09 05:46:34] [INFO ] [Real]Absence check using 49 positive place invariants in 17 ms returned sat
[2023-03-09 05:46:34] [INFO ] [Real]Absence check using 49 positive and 133 generalized place invariants in 43 ms returned sat
[2023-03-09 05:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:46:34] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2023-03-09 05:46:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:46:35] [INFO ] [Nat]Absence check using 49 positive place invariants in 29 ms returned sat
[2023-03-09 05:46:35] [INFO ] [Nat]Absence check using 49 positive and 133 generalized place invariants in 62 ms returned sat
[2023-03-09 05:46:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:46:41] [INFO ] [Nat]Absence check using state equation in 6620 ms returned unknown
[2023-03-09 05:46:42] [INFO ] [Real]Absence check using 49 positive place invariants in 16 ms returned sat
[2023-03-09 05:46:42] [INFO ] [Real]Absence check using 49 positive and 133 generalized place invariants in 128 ms returned sat
[2023-03-09 05:46:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:46:42] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2023-03-09 05:46:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:46:43] [INFO ] [Nat]Absence check using 49 positive place invariants in 54 ms returned sat
[2023-03-09 05:46:43] [INFO ] [Nat]Absence check using 49 positive and 133 generalized place invariants in 34 ms returned sat
[2023-03-09 05:46:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:46:43] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2023-03-09 05:46:44] [INFO ] Computed and/alt/rep : 695/2657/695 causal constraints (skipped 1041 transitions) in 102 ms.
[2023-03-09 05:46:46] [INFO ] Added : 88 causal constraints over 18 iterations in 2782 ms. Result :sat
Minimization took 494 ms.
[2023-03-09 05:46:47] [INFO ] [Real]Absence check using 49 positive place invariants in 14 ms returned sat
[2023-03-09 05:46:47] [INFO ] [Real]Absence check using 49 positive and 133 generalized place invariants in 29 ms returned sat
[2023-03-09 05:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:46:48] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2023-03-09 05:46:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:46:48] [INFO ] [Nat]Absence check using 49 positive place invariants in 15 ms returned sat
[2023-03-09 05:46:48] [INFO ] [Nat]Absence check using 49 positive and 133 generalized place invariants in 43 ms returned sat
[2023-03-09 05:46:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:46:49] [INFO ] [Nat]Absence check using state equation in 1220 ms returned sat
[2023-03-09 05:46:49] [INFO ] Computed and/alt/rep : 695/2657/695 causal constraints (skipped 1041 transitions) in 108 ms.
[2023-03-09 05:47:04] [INFO ] Added : 529 causal constraints over 106 iterations in 14258 ms. Result :sat
Minimization took 581 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 1047 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1047/1047 places, 1773/1773 transitions.
Applied a total of 0 rules in 36 ms. Remains 1047 /1047 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1047/1047 places, 1773/1773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1047/1047 places, 1773/1773 transitions.
Applied a total of 0 rules in 34 ms. Remains 1047 /1047 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
[2023-03-09 05:47:06] [INFO ] Invariant cache hit.
[2023-03-09 05:47:07] [INFO ] Implicit Places using invariants in 1344 ms returned [1, 18, 19, 31, 48, 66, 136, 140, 149, 150, 152, 169, 187, 262, 263, 274, 275, 277, 294, 312, 381, 385, 386, 397, 398, 400, 417, 435, 504, 508, 509, 520, 521, 523, 540, 558, 627, 631, 632, 643, 644, 646, 663, 681, 750, 754, 755, 766, 767, 769, 786, 804, 873, 877, 878, 881, 892, 893, 894, 912, 914, 918, 936, 937, 938, 939, 951, 957, 963, 969, 975, 981, 987, 993, 999, 1005, 1011]
Discarding 77 places :
Implicit Place search using SMT only with invariants took 1361 ms to find 77 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 970/1047 places, 1773/1773 transitions.
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 970 transition count 1632
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 148 rules applied. Total rules applied 289 place count 829 transition count 1625
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 289 place count 829 transition count 1590
Deduced a syphon composed of 35 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 71 rules applied. Total rules applied 360 place count 793 transition count 1590
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 372 place count 789 transition count 1582
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 380 place count 781 transition count 1582
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 395 place count 766 transition count 1567
Iterating global reduction 4 with 15 rules applied. Total rules applied 410 place count 766 transition count 1567
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 413 place count 766 transition count 1564
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 413 place count 766 transition count 1563
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 415 place count 765 transition count 1563
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 418 place count 762 transition count 1557
Iterating global reduction 5 with 3 rules applied. Total rules applied 421 place count 762 transition count 1557
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 422 place count 761 transition count 1556
Iterating global reduction 5 with 1 rules applied. Total rules applied 423 place count 761 transition count 1556
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 424 place count 760 transition count 1554
Iterating global reduction 5 with 1 rules applied. Total rules applied 425 place count 760 transition count 1554
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 5 with 104 rules applied. Total rules applied 529 place count 708 transition count 1502
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 535 place count 702 transition count 1496
Iterating global reduction 5 with 6 rules applied. Total rules applied 541 place count 702 transition count 1496
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 547 place count 702 transition count 1490
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 551 place count 700 transition count 1491
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 6 with 16 rules applied. Total rules applied 567 place count 700 transition count 1475
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 584 place count 683 transition count 1475
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 7 with 21 rules applied. Total rules applied 605 place count 683 transition count 1475
Applied a total of 605 rules in 368 ms. Remains 683 /970 variables (removed 287) and now considering 1475/1773 (removed 298) transitions.
// Phase 1: matrix 1475 rows 683 cols
[2023-03-09 05:47:07] [INFO ] Computed 99 place invariants in 11 ms
[2023-03-09 05:47:08] [INFO ] Implicit Places using invariants in 493 ms returned [72, 91, 97, 100, 102, 105, 106, 175, 181, 184, 186, 189, 194, 195, 247, 264, 270, 273, 275, 280, 281, 333, 350, 356, 359, 361, 366, 367, 419, 436, 442, 445, 447, 452, 453, 505, 522, 528, 531, 533, 538, 539, 591, 608, 614, 617, 619]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 495 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 636/1047 places, 1475/1773 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 614 transition count 1453
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 614 transition count 1453
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 607 transition count 1446
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 607 transition count 1446
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 84 place count 594 transition count 1433
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 85 place count 594 transition count 1432
Free-agglomeration rule applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 106 place count 594 transition count 1411
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 127 place count 573 transition count 1411
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 133 place count 573 transition count 1405
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 139 place count 567 transition count 1405
Applied a total of 139 rules in 123 ms. Remains 567 /636 variables (removed 69) and now considering 1405/1475 (removed 70) transitions.
// Phase 1: matrix 1405 rows 567 cols
[2023-03-09 05:47:08] [INFO ] Computed 52 place invariants in 27 ms
[2023-03-09 05:47:08] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-09 05:47:08] [INFO ] Invariant cache hit.
[2023-03-09 05:47:10] [INFO ] Implicit Places using invariants and state equation in 1732 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 567/1047 places, 1405/1773 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4458 ms. Remains : 567/1047 places, 1405/1773 transitions.
Successfully produced net in file /tmp/petri1000_17915077715870774388.dot
Successfully produced net in file /tmp/petri1001_1078730351748523341.dot
Successfully produced net in file /tmp/petri1002_13998600320489054686.dot
Successfully produced net in file /tmp/petri1003_11548958267179142044.dot
Successfully produced net in file /tmp/petri1004_4389990450062579270.dot
Successfully produced net in file /tmp/petri1005_14794547482888436291.dot
Successfully produced net in file /tmp/petri1006_12195510005842156073.dot
Drop transitions removed 7 transitions
Dominated transitions for bounds rules discarded 7 transitions
// Phase 1: matrix 1398 rows 567 cols
[2023-03-09 05:47:10] [INFO ] Computed 52 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 17248 resets, run finished after 2391 ms. (steps per millisecond=418 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3220 resets, run finished after 798 ms. (steps per millisecond=1253 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3222 resets, run finished after 817 ms. (steps per millisecond=1223 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3212 resets, run finished after 731 ms. (steps per millisecond=1367 ) properties (out of 3) seen :0
[2023-03-09 05:47:15] [INFO ] Invariant cache hit.
[2023-03-09 05:47:15] [INFO ] [Real]Absence check using 12 positive place invariants in 14 ms returned sat
[2023-03-09 05:47:15] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 24 ms returned sat
[2023-03-09 05:47:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:47:15] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2023-03-09 05:47:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:47:16] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-09 05:47:16] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 13 ms returned sat
[2023-03-09 05:47:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:47:17] [INFO ] [Nat]Absence check using state equation in 942 ms returned sat
[2023-03-09 05:47:17] [INFO ] Computed and/alt/rep : 322/1457/322 causal constraints (skipped 1039 transitions) in 101 ms.
[2023-03-09 05:47:18] [INFO ] Added : 22 causal constraints over 5 iterations in 906 ms. Result :sat
Minimization took 294 ms.
[2023-03-09 05:47:18] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-09 05:47:18] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 30 ms returned sat
[2023-03-09 05:47:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:47:18] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2023-03-09 05:47:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:47:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-09 05:47:19] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 13 ms returned sat
[2023-03-09 05:47:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:47:19] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2023-03-09 05:47:20] [INFO ] Computed and/alt/rep : 322/1457/322 causal constraints (skipped 1039 transitions) in 127 ms.
[2023-03-09 05:47:21] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 2 ms to minimize.
[2023-03-09 05:47:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2023-03-09 05:47:22] [INFO ] Added : 53 causal constraints over 13 iterations in 2294 ms. Result :sat
Minimization took 300 ms.
[2023-03-09 05:47:22] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2023-03-09 05:47:22] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 25 ms returned sat
[2023-03-09 05:47:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:47:23] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2023-03-09 05:47:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:47:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-09 05:47:23] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 16 ms returned sat
[2023-03-09 05:47:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:47:24] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2023-03-09 05:47:24] [INFO ] Computed and/alt/rep : 322/1457/322 causal constraints (skipped 1039 transitions) in 108 ms.
[2023-03-09 05:47:25] [INFO ] Added : 24 causal constraints over 6 iterations in 944 ms. Result :sat
Minimization took 315 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 567/567 places, 1398/1398 transitions.
Graph (complete) has 3449 edges and 567 vertex of which 560 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 560 transition count 1398
Applied a total of 8 rules in 41 ms. Remains 560 /567 variables (removed 7) and now considering 1398/1398 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 560/567 places, 1398/1398 transitions.
// Phase 1: matrix 1398 rows 560 cols
[2023-03-09 05:47:26] [INFO ] Computed 52 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 16974 resets, run finished after 2497 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3249 resets, run finished after 861 ms. (steps per millisecond=1161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3251 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3257 resets, run finished after 734 ms. (steps per millisecond=1362 ) properties (out of 3) seen :0
[2023-03-09 05:47:31] [INFO ] Invariant cache hit.
[2023-03-09 05:47:31] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-03-09 05:47:31] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 27 ms returned sat
[2023-03-09 05:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:47:31] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2023-03-09 05:47:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:47:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 73 ms returned sat
[2023-03-09 05:47:32] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 67 ms returned sat
[2023-03-09 05:47:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:47:33] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2023-03-09 05:47:33] [INFO ] Deduced a trap composed of 60 places in 334 ms of which 15 ms to minimize.
[2023-03-09 05:47:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 411 ms
[2023-03-09 05:47:33] [INFO ] Computed and/alt/rep : 322/1455/322 causal constraints (skipped 1039 transitions) in 106 ms.
[2023-03-09 05:47:34] [INFO ] Added : 41 causal constraints over 9 iterations in 1069 ms. Result :sat
Minimization took 389 ms.
[2023-03-09 05:47:35] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-03-09 05:47:35] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 36 ms returned sat
[2023-03-09 05:47:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:47:35] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2023-03-09 05:47:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:47:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2023-03-09 05:47:35] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 25 ms returned sat
[2023-03-09 05:47:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:47:36] [INFO ] [Nat]Absence check using state equation in 778 ms returned sat
[2023-03-09 05:47:36] [INFO ] Computed and/alt/rep : 322/1455/322 causal constraints (skipped 1039 transitions) in 144 ms.
[2023-03-09 05:47:38] [INFO ] Added : 55 causal constraints over 13 iterations in 1599 ms. Result :sat
Minimization took 319 ms.
[2023-03-09 05:47:38] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-09 05:47:38] [INFO ] [Real]Absence check using 12 positive and 40 generalized place invariants in 36 ms returned sat
[2023-03-09 05:47:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:47:39] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2023-03-09 05:47:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:47:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-09 05:47:39] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 50 ms returned sat
[2023-03-09 05:47:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:47:40] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2023-03-09 05:47:40] [INFO ] Computed and/alt/rep : 322/1455/322 causal constraints (skipped 1039 transitions) in 128 ms.
[2023-03-09 05:47:41] [INFO ] Added : 43 causal constraints over 9 iterations in 1243 ms. Result :sat
Minimization took 291 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA ASLink-PT-07b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-07b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 1398/1398 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 560 transition count 1397
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 559 transition count 1397
Applied a total of 2 rules in 23 ms. Remains 559 /560 variables (removed 1) and now considering 1397/1398 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 559/560 places, 1397/1398 transitions.
// Phase 1: matrix 1397 rows 559 cols
[2023-03-09 05:47:42] [INFO ] Computed 52 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 17271 resets, run finished after 2326 ms. (steps per millisecond=429 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3262 resets, run finished after 751 ms. (steps per millisecond=1331 ) properties (out of 1) seen :0
[2023-03-09 05:47:45] [INFO ] Invariant cache hit.
[2023-03-09 05:47:45] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-09 05:47:45] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 24 ms returned sat
[2023-03-09 05:47:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:47:46] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2023-03-09 05:47:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:47:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-09 05:47:46] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 20 ms returned sat
[2023-03-09 05:47:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:47:47] [INFO ] [Nat]Absence check using state equation in 800 ms returned sat
[2023-03-09 05:47:47] [INFO ] Computed and/alt/rep : 321/1454/321 causal constraints (skipped 1039 transitions) in 99 ms.
[2023-03-09 05:47:48] [INFO ] Added : 30 causal constraints over 6 iterations in 887 ms. Result :sat
Minimization took 247 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 559/559 places, 1397/1397 transitions.
Applied a total of 0 rules in 20 ms. Remains 559 /559 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 559/559 places, 1397/1397 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 559/559 places, 1397/1397 transitions.
Applied a total of 0 rules in 20 ms. Remains 559 /559 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
[2023-03-09 05:47:49] [INFO ] Invariant cache hit.
[2023-03-09 05:47:49] [INFO ] Implicit Places using invariants in 366 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 380 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 558/559 places, 1397/1397 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 557 transition count 1396
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 557 transition count 1395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 556 transition count 1395
Applied a total of 4 rules in 51 ms. Remains 556 /558 variables (removed 2) and now considering 1395/1397 (removed 2) transitions.
// Phase 1: matrix 1395 rows 556 cols
[2023-03-09 05:47:49] [INFO ] Computed 51 place invariants in 14 ms
[2023-03-09 05:47:49] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-09 05:47:49] [INFO ] Invariant cache hit.
[2023-03-09 05:47:51] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 556/559 places, 1395/1397 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2018 ms. Remains : 556/559 places, 1395/1397 transitions.
[2023-03-09 05:47:51] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 17228 resets, run finished after 2243 ms. (steps per millisecond=445 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3249 resets, run finished after 750 ms. (steps per millisecond=1333 ) properties (out of 1) seen :0
[2023-03-09 05:47:54] [INFO ] Invariant cache hit.
[2023-03-09 05:47:54] [INFO ] [Real]Absence check using 12 positive place invariants in 37 ms returned sat
[2023-03-09 05:47:54] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 20 ms returned sat
[2023-03-09 05:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:47:54] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2023-03-09 05:47:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:47:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-09 05:47:54] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 41 ms returned sat
[2023-03-09 05:47:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:47:55] [INFO ] [Nat]Absence check using state equation in 1027 ms returned sat
[2023-03-09 05:47:56] [INFO ] Computed and/alt/rep : 312/1381/312 causal constraints (skipped 1046 transitions) in 96 ms.
[2023-03-09 05:47:57] [INFO ] Added : 43 causal constraints over 9 iterations in 1126 ms. Result :sat
Minimization took 280 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1395/1395 transitions.
Applied a total of 0 rules in 18 ms. Remains 556 /556 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 556/556 places, 1395/1395 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1395/1395 transitions.
Applied a total of 0 rules in 18 ms. Remains 556 /556 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
[2023-03-09 05:47:57] [INFO ] Invariant cache hit.
[2023-03-09 05:47:58] [INFO ] Implicit Places using invariants in 500 ms returned []
[2023-03-09 05:47:58] [INFO ] Invariant cache hit.
[2023-03-09 05:47:59] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1734 ms to find 0 implicit places.
[2023-03-09 05:47:59] [INFO ] Redundant transitions in 106 ms returned []
[2023-03-09 05:47:59] [INFO ] Invariant cache hit.
[2023-03-09 05:48:00] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2397 ms. Remains : 556/556 places, 1395/1395 transitions.
Starting property specific reduction for ASLink-PT-07b-UpperBounds-12
[2023-03-09 05:48:00] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 177 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
[2023-03-09 05:48:00] [INFO ] Invariant cache hit.
[2023-03-09 05:48:00] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-03-09 05:48:00] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 26 ms returned sat
[2023-03-09 05:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:48:00] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2023-03-09 05:48:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:48:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-09 05:48:01] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 27 ms returned sat
[2023-03-09 05:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:48:01] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2023-03-09 05:48:02] [INFO ] Computed and/alt/rep : 312/1381/312 causal constraints (skipped 1046 transitions) in 96 ms.
[2023-03-09 05:48:03] [INFO ] Added : 43 causal constraints over 9 iterations in 1139 ms. Result :sat
Minimization took 295 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1395/1395 transitions.
Applied a total of 0 rules in 20 ms. Remains 556 /556 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 556/556 places, 1395/1395 transitions.
[2023-03-09 05:48:03] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 17144 resets, run finished after 2348 ms. (steps per millisecond=425 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3285 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 1) seen :0
[2023-03-09 05:48:07] [INFO ] Invariant cache hit.
[2023-03-09 05:48:07] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-09 05:48:07] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 77 ms returned sat
[2023-03-09 05:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:48:07] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2023-03-09 05:48:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:48:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-09 05:48:07] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 13 ms returned sat
[2023-03-09 05:48:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:48:09] [INFO ] [Nat]Absence check using state equation in 1153 ms returned sat
[2023-03-09 05:48:09] [INFO ] Computed and/alt/rep : 312/1381/312 causal constraints (skipped 1046 transitions) in 91 ms.
[2023-03-09 05:48:10] [INFO ] Added : 43 causal constraints over 9 iterations in 1118 ms. Result :sat
Minimization took 267 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1395/1395 transitions.
Applied a total of 0 rules in 19 ms. Remains 556 /556 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 556/556 places, 1395/1395 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1395/1395 transitions.
Applied a total of 0 rules in 19 ms. Remains 556 /556 variables (removed 0) and now considering 1395/1395 (removed 0) transitions.
[2023-03-09 05:48:10] [INFO ] Invariant cache hit.
[2023-03-09 05:48:11] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-09 05:48:11] [INFO ] Invariant cache hit.
[2023-03-09 05:48:12] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1637 ms to find 0 implicit places.
[2023-03-09 05:48:12] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-09 05:48:12] [INFO ] Invariant cache hit.
[2023-03-09 05:48:13] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2272 ms. Remains : 556/556 places, 1395/1395 transitions.
Ending property specific reduction for ASLink-PT-07b-UpperBounds-12 in 13100 ms.
[2023-03-09 05:48:13] [INFO ] Flatten gal took : 143 ms
[2023-03-09 05:48:13] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-09 05:48:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 556 places, 1395 transitions and 5707 arcs took 5 ms.
Total runtime 247579 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ASLink-PT-07b
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
Upper Bounds

FORMULA ASLink-PT-07b-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678340894091

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 5 (type EXCL) for 0 ASLink-PT-07b-UpperBounds-12
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 ASLink-PT-07b-UpperBounds-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 ASLink-PT-07b-UpperBounds-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 5 (type EXCL) for ASLink-PT-07b-UpperBounds-12
lola: markings : 462
lola: fired transitions : 461
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for ASLink-PT-07b-UpperBounds-12 (obsolete)
lola: CANCELED task # 4 (type EQUN) for ASLink-PT-07b-UpperBounds-12 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ASLink-PT-07b-UpperBounds-12: BOUND 1 state space


Time elapsed: 1 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-07b"
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-07b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-oct2-167813595000117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-07b.tgz
mv ASLink-PT-07b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;