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.r010-oct2-167813598500069.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 marciexred
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 r010-oct2-167813598500069
=====================================================================

--------------------
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 1678659863328

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 22:24:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 22:24:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:24:26] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2023-03-12 22:24:26] [INFO ] Transformed 2034 places.
[2023-03-12 22:24:26] [INFO ] Transformed 2567 transitions.
[2023-03-12 22:24:26] [INFO ] Found NUPN structural information;
[2023-03-12 22:24:26] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 2567 rows 2034 cols
[2023-03-12 22:24:26] [INFO ] Computed 199 place invariants in 130 ms
Incomplete random walk after 10000 steps, including 25 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 16) seen :8
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-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-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :2
FORMULA ASLink-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :1
FORMULA ASLink-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-12 22:24:26] [INFO ] Invariant cache hit.
[2023-03-12 22:24:27] [INFO ] [Real]Absence check using 48 positive place invariants in 101 ms returned sat
[2023-03-12 22:24:27] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 206 ms returned sat
[2023-03-12 22:24:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:24:29] [INFO ] [Real]Absence check using state equation in 1620 ms returned sat
[2023-03-12 22:24:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:24:29] [INFO ] [Nat]Absence check using 48 positive place invariants in 35 ms returned sat
[2023-03-12 22:24:30] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 95 ms returned sat
[2023-03-12 22:24:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:24:34] [INFO ] [Nat]Absence check using state equation in 4516 ms returned unknown
[2023-03-12 22:24:35] [INFO ] [Real]Absence check using 48 positive place invariants in 46 ms returned sat
[2023-03-12 22:24:35] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 82 ms returned sat
[2023-03-12 22:24:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:24:36] [INFO ] [Real]Absence check using state equation in 1090 ms returned sat
[2023-03-12 22:24:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:24:36] [INFO ] [Nat]Absence check using 48 positive place invariants in 119 ms returned sat
[2023-03-12 22:24:36] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 71 ms returned sat
[2023-03-12 22:24:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:24:39] [INFO ] [Nat]Absence check using state equation in 2067 ms returned sat
[2023-03-12 22:24:40] [INFO ] Deduced a trap composed of 274 places in 1365 ms of which 5 ms to minimize.
[2023-03-12 22:24:41] [INFO ] Deduced a trap composed of 284 places in 1328 ms of which 19 ms to minimize.
[2023-03-12 22:24:41] [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-12 22:24:42] [INFO ] [Real]Absence check using 48 positive place invariants in 35 ms returned sat
[2023-03-12 22:24:42] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 106 ms returned sat
[2023-03-12 22:24:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:24:43] [INFO ] [Real]Absence check using state equation in 1380 ms returned sat
[2023-03-12 22:24:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:24:44] [INFO ] [Nat]Absence check using 48 positive place invariants in 37 ms returned sat
[2023-03-12 22:24:44] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 78 ms returned sat
[2023-03-12 22:24:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:24:49] [INFO ] [Nat]Absence check using state equation in 4480 ms returned unknown
[2023-03-12 22:24:49] [INFO ] [Real]Absence check using 48 positive place invariants in 49 ms returned sat
[2023-03-12 22:24:49] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 68 ms returned sat
[2023-03-12 22:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:24:51] [INFO ] [Real]Absence check using state equation in 1447 ms returned sat
[2023-03-12 22:24:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:24:51] [INFO ] [Nat]Absence check using 48 positive place invariants in 155 ms returned sat
[2023-03-12 22:24:52] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 82 ms returned sat
[2023-03-12 22:24:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:24:54] [INFO ] [Nat]Absence check using state equation in 2261 ms returned sat
[2023-03-12 22:24:55] [INFO ] Deduced a trap composed of 107 places in 1443 ms of which 3 ms to minimize.
[2023-03-12 22:24:56] [INFO ] Deduced a trap composed of 42 places in 1027 ms of which 1 ms to minimize.
[2023-03-12 22:24:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 22:24:57] [INFO ] [Real]Absence check using 48 positive place invariants in 36 ms returned sat
[2023-03-12 22:24:57] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 83 ms returned sat
[2023-03-12 22:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:24:58] [INFO ] [Real]Absence check using state equation in 1365 ms returned sat
[2023-03-12 22:24:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:24:59] [INFO ] [Nat]Absence check using 48 positive place invariants in 34 ms returned sat
[2023-03-12 22:24:59] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 69 ms returned sat
[2023-03-12 22:24:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:25:04] [INFO ] [Nat]Absence check using state equation in 4645 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions removed 465 transitions
Trivial Post-agglo rules discarded 465 transitions
Performed 465 trivial Post agglomeration. Transition count delta: 465
Iterating post reduction 0 with 465 rules applied. Total rules applied 465 place count 2034 transition count 2102
Reduce places removed 465 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 487 rules applied. Total rules applied 952 place count 1569 transition count 2080
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 959 place count 1563 transition count 2079
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 960 place count 1562 transition count 2079
Performed 469 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 469 Pre rules applied. Total rules applied 960 place count 1562 transition count 1610
Deduced a syphon composed of 469 places in 3 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 1941 place count 1050 transition count 1610
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 1973 place count 1046 transition count 1582
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 2001 place count 1018 transition count 1582
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 2001 place count 1018 transition count 1567
Deduced a syphon composed of 15 places in 6 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 2046 place count 988 transition count 1567
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 2046 place count 988 transition count 1552
Deduced a syphon composed of 15 places in 6 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 2076 place count 973 transition count 1552
Discarding 64 places :
Symmetric choice reduction at 6 with 64 rule applications. Total rules 2140 place count 909 transition count 1488
Iterating global reduction 6 with 64 rules applied. Total rules applied 2204 place count 909 transition count 1488
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2205 place count 909 transition count 1487
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2205 place count 909 transition count 1465
Deduced a syphon composed of 22 places in 6 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 2250 place count 886 transition count 1465
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2250 place count 886 transition count 1464
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 7 with 3 rules applied. Total rules applied 2253 place count 884 transition count 1464
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2258 place count 879 transition count 1431
Iterating global reduction 7 with 5 rules applied. Total rules applied 2263 place count 879 transition count 1431
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 2263 place count 879 transition count 1427
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 2271 place count 875 transition count 1427
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2272 place count 874 transition count 1419
Iterating global reduction 7 with 1 rules applied. Total rules applied 2273 place count 874 transition count 1419
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2274 place count 873 transition count 1411
Iterating global reduction 7 with 1 rules applied. Total rules applied 2275 place count 873 transition count 1411
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2276 place count 872 transition count 1403
Iterating global reduction 7 with 1 rules applied. Total rules applied 2277 place count 872 transition count 1403
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2278 place count 871 transition count 1395
Iterating global reduction 7 with 1 rules applied. Total rules applied 2279 place count 871 transition count 1395
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2280 place count 870 transition count 1387
Iterating global reduction 7 with 1 rules applied. Total rules applied 2281 place count 870 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2282 place count 869 transition count 1379
Iterating global reduction 7 with 1 rules applied. Total rules applied 2283 place count 869 transition count 1379
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2284 place count 868 transition count 1371
Iterating global reduction 7 with 1 rules applied. Total rules applied 2285 place count 868 transition count 1371
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2286 place count 867 transition count 1363
Iterating global reduction 7 with 1 rules applied. Total rules applied 2287 place count 867 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2288 place count 866 transition count 1355
Iterating global reduction 7 with 1 rules applied. Total rules applied 2289 place count 866 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2290 place count 865 transition count 1347
Iterating global reduction 7 with 1 rules applied. Total rules applied 2291 place count 865 transition count 1347
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2292 place count 864 transition count 1339
Iterating global reduction 7 with 1 rules applied. Total rules applied 2293 place count 864 transition count 1339
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2294 place count 863 transition count 1331
Iterating global reduction 7 with 1 rules applied. Total rules applied 2295 place count 863 transition count 1331
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2296 place count 862 transition count 1323
Iterating global reduction 7 with 1 rules applied. Total rules applied 2297 place count 862 transition count 1323
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2298 place count 861 transition count 1315
Iterating global reduction 7 with 1 rules applied. Total rules applied 2299 place count 861 transition count 1315
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2300 place count 860 transition count 1307
Iterating global reduction 7 with 1 rules applied. Total rules applied 2301 place count 860 transition count 1307
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2302 place count 859 transition count 1299
Iterating global reduction 7 with 1 rules applied. Total rules applied 2303 place count 859 transition count 1299
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 2531 place count 745 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2532 place count 744 transition count 1184
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 2534 place count 743 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2535 place count 742 transition count 1183
Iterating global reduction 7 with 1 rules applied. Total rules applied 2536 place count 742 transition count 1183
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 2538 place count 742 transition count 1181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2539 place count 741 transition count 1181
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 2541 place count 740 transition count 1190
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 2546 place count 740 transition count 1185
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2551 place count 735 transition count 1185
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 2554 place count 735 transition count 1182
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2557 place count 732 transition count 1182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2558 place count 731 transition count 1181
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 2570 place count 723 transition count 1177
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2574 place count 719 transition count 1177
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 12 Pre rules applied. Total rules applied 2574 place count 719 transition count 1165
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 2599 place count 706 transition count 1165
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 13 with 5 rules applied. Total rules applied 2604 place count 701 transition count 1165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2604 place count 701 transition count 1164
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2606 place count 700 transition count 1164
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 14 with 18 rules applied. Total rules applied 2624 place count 691 transition count 1155
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 2628 place count 687 transition count 1151
Iterating global reduction 14 with 4 rules applied. Total rules applied 2632 place count 687 transition count 1151
Free-agglomeration rule applied 4 times.
Iterating global reduction 14 with 4 rules applied. Total rules applied 2636 place count 687 transition count 1147
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 2640 place count 683 transition count 1147
Applied a total of 2640 rules in 1485 ms. Remains 683 /2034 variables (removed 1351) and now considering 1147/2567 (removed 1420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1486 ms. Remains : 683/2034 places, 1147/2567 transitions.
// Phase 1: matrix 1147 rows 683 cols
[2023-03-12 22:25:05] [INFO ] Computed 120 place invariants in 55 ms
Incomplete random walk after 1000000 steps, including 12773 resets, run finished after 2637 ms. (steps per millisecond=379 ) properties (out of 5) seen :2
FORMULA ASLink-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2956 resets, run finished after 1180 ms. (steps per millisecond=847 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2948 resets, run finished after 1138 ms. (steps per millisecond=878 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2894 resets, run finished after 1187 ms. (steps per millisecond=842 ) properties (out of 3) seen :0
[2023-03-12 22:25:11] [INFO ] Invariant cache hit.
[2023-03-12 22:25:12] [INFO ] [Real]Absence check using 31 positive place invariants in 60 ms returned sat
[2023-03-12 22:25:12] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 52 ms returned sat
[2023-03-12 22:25:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:25:12] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2023-03-12 22:25:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:25:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 209 ms returned sat
[2023-03-12 22:25:12] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 24 ms returned sat
[2023-03-12 22:25:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:25:13] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2023-03-12 22:25:13] [INFO ] Computed and/alt/rep : 455/1790/455 causal constraints (skipped 667 transitions) in 123 ms.
[2023-03-12 22:25:21] [INFO ] Added : 360 causal constraints over 72 iterations in 8131 ms. Result :sat
Minimization took 445 ms.
[2023-03-12 22:25:22] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-12 22:25:22] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 85 ms returned sat
[2023-03-12 22:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:25:22] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2023-03-12 22:25:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:25:22] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-12 22:25:22] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 20 ms returned sat
[2023-03-12 22:25:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:25:23] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2023-03-12 22:25:23] [INFO ] Computed and/alt/rep : 455/1790/455 causal constraints (skipped 667 transitions) in 109 ms.
[2023-03-12 22:25:30] [INFO ] Added : 330 causal constraints over 66 iterations in 6629 ms. Result :sat
Minimization took 523 ms.
[2023-03-12 22:25:30] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2023-03-12 22:25:30] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 23 ms returned sat
[2023-03-12 22:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:25:31] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2023-03-12 22:25:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:25:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 32 ms returned sat
[2023-03-12 22:25:31] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 42 ms returned sat
[2023-03-12 22:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:25:31] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2023-03-12 22:25:32] [INFO ] Computed and/alt/rep : 455/1790/455 causal constraints (skipped 667 transitions) in 90 ms.
[2023-03-12 22:25:38] [INFO ] Deduced a trap composed of 87 places in 321 ms of which 23 ms to minimize.
[2023-03-12 22:25:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 461 ms
[2023-03-12 22:25:39] [INFO ] Added : 336 causal constraints over 68 iterations in 7023 ms. Result :sat
Minimization took 420 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 683/683 places, 1147/1147 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 683 transition count 1145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 681 transition count 1145
Applied a total of 4 rules in 26 ms. Remains 681 /683 variables (removed 2) and now considering 1145/1147 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 681/683 places, 1145/1147 transitions.
// Phase 1: matrix 1145 rows 681 cols
[2023-03-12 22:25:41] [INFO ] Computed 120 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 12707 resets, run finished after 2286 ms. (steps per millisecond=437 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2937 resets, run finished after 1196 ms. (steps per millisecond=836 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2918 resets, run finished after 1111 ms. (steps per millisecond=900 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2885 resets, run finished after 1020 ms. (steps per millisecond=980 ) properties (out of 3) seen :0
[2023-03-12 22:25:46] [INFO ] Invariant cache hit.
[2023-03-12 22:25:46] [INFO ] [Real]Absence check using 32 positive place invariants in 25 ms returned sat
[2023-03-12 22:25:46] [INFO ] [Real]Absence check using 32 positive and 88 generalized place invariants in 30 ms returned sat
[2023-03-12 22:25:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:25:47] [INFO ] [Real]Absence check using state equation in 658 ms returned sat
[2023-03-12 22:25:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:25:47] [INFO ] [Nat]Absence check using 32 positive place invariants in 11 ms returned sat
[2023-03-12 22:25:47] [INFO ] [Nat]Absence check using 32 positive and 88 generalized place invariants in 18 ms returned sat
[2023-03-12 22:25:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:25:48] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2023-03-12 22:25:48] [INFO ] Computed and/alt/rep : 453/1788/453 causal constraints (skipped 667 transitions) in 80 ms.
[2023-03-12 22:25:53] [INFO ] Added : 230 causal constraints over 46 iterations in 4851 ms. Result :sat
Minimization took 284 ms.
[2023-03-12 22:25:53] [INFO ] [Real]Absence check using 32 positive place invariants in 45 ms returned sat
[2023-03-12 22:25:53] [INFO ] [Real]Absence check using 32 positive and 88 generalized place invariants in 101 ms returned sat
[2023-03-12 22:25:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:25:54] [INFO ] [Real]Absence check using state equation in 685 ms returned sat
[2023-03-12 22:25:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:25:54] [INFO ] [Nat]Absence check using 32 positive place invariants in 11 ms returned sat
[2023-03-12 22:25:54] [INFO ] [Nat]Absence check using 32 positive and 88 generalized place invariants in 86 ms returned sat
[2023-03-12 22:25:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:25:55] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2023-03-12 22:25:55] [INFO ] Computed and/alt/rep : 453/1788/453 causal constraints (skipped 667 transitions) in 118 ms.
[2023-03-12 22:26:00] [INFO ] Added : 247 causal constraints over 50 iterations in 4986 ms. Result :sat
Minimization took 360 ms.
[2023-03-12 22:26:01] [INFO ] [Real]Absence check using 32 positive place invariants in 208 ms returned sat
[2023-03-12 22:26:01] [INFO ] [Real]Absence check using 32 positive and 88 generalized place invariants in 28 ms returned sat
[2023-03-12 22:26:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:01] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2023-03-12 22:26:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:26:01] [INFO ] [Nat]Absence check using 32 positive place invariants in 13 ms returned sat
[2023-03-12 22:26:01] [INFO ] [Nat]Absence check using 32 positive and 88 generalized place invariants in 33 ms returned sat
[2023-03-12 22:26:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:02] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2023-03-12 22:26:02] [INFO ] Deduced a trap composed of 99 places in 332 ms of which 1 ms to minimize.
[2023-03-12 22:26:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2023-03-12 22:26:02] [INFO ] Computed and/alt/rep : 453/1788/453 causal constraints (skipped 667 transitions) in 66 ms.
[2023-03-12 22:26:08] [INFO ] Added : 270 causal constraints over 54 iterations in 5477 ms. Result :sat
Minimization took 447 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 681/681 places, 1145/1145 transitions.
Applied a total of 0 rules in 21 ms. Remains 681 /681 variables (removed 0) and now considering 1145/1145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 681/681 places, 1145/1145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 681/681 places, 1145/1145 transitions.
Applied a total of 0 rules in 20 ms. Remains 681 /681 variables (removed 0) and now considering 1145/1145 (removed 0) transitions.
[2023-03-12 22:26:10] [INFO ] Invariant cache hit.
[2023-03-12 22:26:11] [INFO ] Implicit Places using invariants in 1175 ms returned [1, 18, 19, 31, 50, 68, 107, 141, 145, 154, 155, 157, 174, 192, 261, 265, 266, 277, 278, 280, 297, 315, 384, 388, 389, 400, 401, 403, 420, 438, 507, 511, 512, 515, 526, 527, 528, 546, 548, 552, 570, 571, 572, 573, 585, 591, 597, 603, 609, 615, 621, 627, 633, 639, 645]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 1189 ms to find 55 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 626/681 places, 1145/1145 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 626 transition count 1051
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 532 transition count 1045
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 196 place count 530 transition count 1045
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 530 transition count 1022
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 506 transition count 1022
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 502 transition count 1014
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 263 place count 494 transition count 1014
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 278 place count 479 transition count 999
Iterating global reduction 5 with 15 rules applied. Total rules applied 293 place count 479 transition count 999
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 479 transition count 996
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 479 transition count 995
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 478 transition count 995
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 301 place count 475 transition count 989
Iterating global reduction 6 with 3 rules applied. Total rules applied 304 place count 475 transition count 989
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 305 place count 474 transition count 988
Iterating global reduction 6 with 1 rules applied. Total rules applied 306 place count 474 transition count 988
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 307 place count 473 transition count 986
Iterating global reduction 6 with 1 rules applied. Total rules applied 308 place count 473 transition count 986
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 374 place count 440 transition count 953
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 378 place count 436 transition count 949
Iterating global reduction 6 with 4 rules applied. Total rules applied 382 place count 436 transition count 949
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 436 transition count 945
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 434 transition count 946
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 398 place count 434 transition count 938
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 425 transition count 938
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 425 transition count 938
Applied a total of 419 rules in 128 ms. Remains 425 /626 variables (removed 201) and now considering 938/1145 (removed 207) transitions.
// Phase 1: matrix 938 rows 425 cols
[2023-03-12 22:26:11] [INFO ] Computed 59 place invariants in 17 ms
[2023-03-12 22:26:12] [INFO ] Implicit Places using invariants in 495 ms returned [74, 94, 100, 103, 105, 108, 109, 161, 178, 184, 187, 189, 194, 195, 247, 264, 270, 273, 275, 280, 281, 333, 350, 356, 359, 361]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 498 ms to find 26 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 399/681 places, 938/1145 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 387 transition count 926
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 387 transition count 926
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 383 transition count 922
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 383 transition count 922
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 375 transition count 914
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 375 transition count 902
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 72 place count 363 transition count 902
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 363 transition count 898
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 359 transition count 898
Applied a total of 80 rules in 55 ms. Remains 359 /399 variables (removed 40) and now considering 898/938 (removed 40) transitions.
// Phase 1: matrix 898 rows 359 cols
[2023-03-12 22:26:12] [INFO ] Computed 33 place invariants in 6 ms
[2023-03-12 22:26:12] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-12 22:26:12] [INFO ] Invariant cache hit.
[2023-03-12 22:26:13] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 359/681 places, 898/1145 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2991 ms. Remains : 359/681 places, 898/1145 transitions.
Successfully produced net in file /tmp/petri1000_7997803334673999341.dot
Successfully produced net in file /tmp/petri1001_1291628453318235139.dot
Successfully produced net in file /tmp/petri1002_11070910619032039733.dot
Successfully produced net in file /tmp/petri1003_14660917950927454892.dot
Drop transitions removed 4 transitions
Dominated transitions for bounds rules discarded 4 transitions
// Phase 1: matrix 894 rows 359 cols
[2023-03-12 22:26:13] [INFO ] Computed 33 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 19705 resets, run finished after 1721 ms. (steps per millisecond=581 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5358 resets, run finished after 671 ms. (steps per millisecond=1490 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5386 resets, run finished after 673 ms. (steps per millisecond=1485 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5400 resets, run finished after 668 ms. (steps per millisecond=1497 ) properties (out of 3) seen :0
[2023-03-12 22:26:17] [INFO ] Invariant cache hit.
[2023-03-12 22:26:17] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-12 22:26:17] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 171 ms returned sat
[2023-03-12 22:26:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:17] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2023-03-12 22:26:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:26:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-12 22:26:17] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 30 ms returned sat
[2023-03-12 22:26:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:18] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2023-03-12 22:26:18] [INFO ] Computed and/alt/rep : 194/973/194 causal constraints (skipped 675 transitions) in 67 ms.
[2023-03-12 22:26:19] [INFO ] Added : 51 causal constraints over 11 iterations in 1034 ms. Result :sat
Minimization took 257 ms.
[2023-03-12 22:26:19] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-12 22:26:19] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 22 ms returned sat
[2023-03-12 22:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:19] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2023-03-12 22:26:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:26:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-12 22:26:20] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 58 ms returned sat
[2023-03-12 22:26:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:20] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2023-03-12 22:26:20] [INFO ] Computed and/alt/rep : 194/973/194 causal constraints (skipped 675 transitions) in 73 ms.
[2023-03-12 22:26:22] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 13 ms to minimize.
[2023-03-12 22:26:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
[2023-03-12 22:26:22] [INFO ] Added : 51 causal constraints over 11 iterations in 1972 ms. Result :sat
Minimization took 158 ms.
[2023-03-12 22:26:22] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-12 22:26:22] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-12 22:26:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:22] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2023-03-12 22:26:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:26:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2023-03-12 22:26:23] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-12 22:26:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:23] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2023-03-12 22:26:23] [INFO ] Computed and/alt/rep : 194/973/194 causal constraints (skipped 675 transitions) in 66 ms.
[2023-03-12 22:26:25] [INFO ] Added : 89 causal constraints over 18 iterations in 1867 ms. Result :sat
Minimization took 162 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA ASLink-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 894/894 transitions.
Graph (complete) has 2204 edges and 359 vertex of which 355 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output 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 2 place count 355 transition count 893
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 354 transition count 893
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 354 transition count 892
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 353 transition count 892
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 353 transition count 892
Applied a total of 9 rules in 28 ms. Remains 353 /359 variables (removed 6) and now considering 892/894 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 353/359 places, 892/894 transitions.
// Phase 1: matrix 892 rows 353 cols
[2023-03-12 22:26:25] [INFO ] Computed 33 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 19607 resets, run finished after 1780 ms. (steps per millisecond=561 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5402 resets, run finished after 782 ms. (steps per millisecond=1278 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5424 resets, run finished after 650 ms. (steps per millisecond=1538 ) properties (out of 2) seen :0
[2023-03-12 22:26:29] [INFO ] Invariant cache hit.
[2023-03-12 22:26:29] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-03-12 22:26:29] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-12 22:26:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:29] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2023-03-12 22:26:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:26:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-12 22:26:29] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-12 22:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:30] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2023-03-12 22:26:30] [INFO ] Computed and/alt/rep : 184/890/184 causal constraints (skipped 683 transitions) in 68 ms.
[2023-03-12 22:26:30] [INFO ] Added : 17 causal constraints over 4 iterations in 517 ms. Result :sat
Minimization took 245 ms.
[2023-03-12 22:26:31] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-12 22:26:31] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-12 22:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:31] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2023-03-12 22:26:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:26:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-12 22:26:31] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-12 22:26:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:31] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2023-03-12 22:26:32] [INFO ] Computed and/alt/rep : 184/890/184 causal constraints (skipped 683 transitions) in 102 ms.
[2023-03-12 22:26:32] [INFO ] Added : 28 causal constraints over 6 iterations in 556 ms. Result :sat
Minimization took 170 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 11 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 11 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-12 22:26:32] [INFO ] Invariant cache hit.
[2023-03-12 22:26:33] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-12 22:26:33] [INFO ] Invariant cache hit.
[2023-03-12 22:26:33] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 994 ms to find 0 implicit places.
[2023-03-12 22:26:34] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-12 22:26:34] [INFO ] Invariant cache hit.
[2023-03-12 22:26:34] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1451 ms. Remains : 353/353 places, 892/892 transitions.
Starting property specific reduction for ASLink-PT-04b-UpperBounds-13
[2023-03-12 22:26:34] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 185 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-12 22:26:34] [INFO ] Invariant cache hit.
[2023-03-12 22:26:34] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-12 22:26:34] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-12 22:26:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:34] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2023-03-12 22:26:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:26:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-03-12 22:26:34] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-12 22:26:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:35] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2023-03-12 22:26:35] [INFO ] Computed and/alt/rep : 184/890/184 causal constraints (skipped 683 transitions) in 81 ms.
[2023-03-12 22:26:35] [INFO ] Added : 17 causal constraints over 4 iterations in 427 ms. Result :sat
Minimization took 241 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-12 22:26:36] [INFO ] Computed 33 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 19570 resets, run finished after 1653 ms. (steps per millisecond=604 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5398 resets, run finished after 710 ms. (steps per millisecond=1408 ) properties (out of 1) seen :0
[2023-03-12 22:26:38] [INFO ] Invariant cache hit.
[2023-03-12 22:26:38] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-12 22:26:38] [INFO ] [Real]Absence check using 10 positive and 23 generalized place invariants in 11 ms returned sat
[2023-03-12 22:26:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:38] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2023-03-12 22:26:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:26:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 22:26:39] [INFO ] [Nat]Absence check using 10 positive and 23 generalized place invariants in 9 ms returned sat
[2023-03-12 22:26:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:39] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2023-03-12 22:26:39] [INFO ] Computed and/alt/rep : 183/889/183 causal constraints (skipped 683 transitions) in 54 ms.
[2023-03-12 22:26:40] [INFO ] Added : 20 causal constraints over 5 iterations in 682 ms. Result :sat
Minimization took 284 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 18 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 18 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 15 ms. Remains 352 /352 variables (removed 0) and now considering 891/891 (removed 0) transitions.
[2023-03-12 22:26:40] [INFO ] Invariant cache hit.
[2023-03-12 22:26:41] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-12 22:26:41] [INFO ] Invariant cache hit.
[2023-03-12 22:26:41] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 997 ms to find 0 implicit places.
[2023-03-12 22:26:41] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-12 22:26:41] [INFO ] Invariant cache hit.
[2023-03-12 22:26:42] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1488 ms. Remains : 352/352 places, 891/891 transitions.
Ending property specific reduction for ASLink-PT-04b-UpperBounds-13 in 7846 ms.
Starting property specific reduction for ASLink-PT-04b-UpperBounds-14
// Phase 1: matrix 892 rows 353 cols
[2023-03-12 22:26:42] [INFO ] Computed 33 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 193 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-12 22:26:42] [INFO ] Invariant cache hit.
[2023-03-12 22:26:42] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-12 22:26:42] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-12 22:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:42] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2023-03-12 22:26:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:26:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2023-03-12 22:26:42] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 91 ms returned sat
[2023-03-12 22:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:43] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2023-03-12 22:26:43] [INFO ] Computed and/alt/rep : 184/890/184 causal constraints (skipped 683 transitions) in 67 ms.
[2023-03-12 22:26:43] [INFO ] Added : 28 causal constraints over 6 iterations in 501 ms. Result :sat
Minimization took 159 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 14 ms. Remains : 351/353 places, 890/892 transitions.
// Phase 1: matrix 890 rows 351 cols
[2023-03-12 22:26:44] [INFO ] Computed 33 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 19809 resets, run finished after 1938 ms. (steps per millisecond=515 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5452 resets, run finished after 649 ms. (steps per millisecond=1540 ) properties (out of 1) seen :0
[2023-03-12 22:26:46] [INFO ] Invariant cache hit.
[2023-03-12 22:26:46] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2023-03-12 22:26:46] [INFO ] [Real]Absence check using 11 positive and 22 generalized place invariants in 61 ms returned sat
[2023-03-12 22:26:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:47] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2023-03-12 22:26:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 22:26:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 80 ms returned sat
[2023-03-12 22:26:47] [INFO ] [Nat]Absence check using 11 positive and 22 generalized place invariants in 39 ms returned sat
[2023-03-12 22:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 22:26:47] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2023-03-12 22:26:47] [INFO ] Computed and/alt/rep : 182/888/182 causal constraints (skipped 683 transitions) in 75 ms.
[2023-03-12 22:26:48] [INFO ] Added : 17 causal constraints over 4 iterations in 454 ms. Result :sat
Minimization took 83 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 28 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 28 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 11 ms. Remains 351 /351 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2023-03-12 22:26:48] [INFO ] Invariant cache hit.
[2023-03-12 22:26:49] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-12 22:26:49] [INFO ] Invariant cache hit.
[2023-03-12 22:26:50] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 1472 ms to find 0 implicit places.
[2023-03-12 22:26:50] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-12 22:26:50] [INFO ] Invariant cache hit.
[2023-03-12 22:26:50] [INFO ] Dead Transitions using invariants and state equation in 468 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1999 ms. Remains : 351/351 places, 890/890 transitions.
Ending property specific reduction for ASLink-PT-04b-UpperBounds-14 in 8396 ms.
[2023-03-12 22:26:50] [INFO ] Flatten gal took : 107 ms
[2023-03-12 22:26:50] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-12 22:26:51] [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 145295 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ASLink_PT_04b
(NrP: 353 NrTr: 892 NrArc: 3648)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.025sec

net check time: 0m 0.000sec

init dd package: 0m 3.217sec


before gc: list nodes free: 1557305

after gc: idd nodes used:4615, unused:63995385; list nodes free:287247678
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6225980 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097892 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.003sec

4022 3011 2952 3351 3350 3283 2812 3200 3447 3482 3222 2931 3416 3472 3423 2952 3314 3533 3568 3379 3154 3576 3621 3665 2998 3482 3676 3732 3892 3292 3757 3806 3799 3318 3594 3868 3921 4121 3435 3997 3959 3999 3813 3813 4124 4074 3910 3452 4114 4211 4246 4097 3713 4291 4345 4171 3558 4234 4389 4422 4362 3801 4459 4505 4369 3645 4351 4577 4602 4344 3949 4622 4660 4700 3791 4506 4739 4774 4365 4085 4824 4871 4870 4161 4540 4861 4986 5142 4193 4860 4957 4992 4416 4301 5025 5072 4712 4215 5016 5117 5160 4619 4436 5214 5211 4930 4358 5130 5310 5345 5375 4633 5346 5402

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="marciexred"
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 marciexred"
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 r010-oct2-167813598500069"
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 '' 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 ;