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.r011-oct2-167813599800149.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 smartxred
Input is ASLink-PT-09b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813599800149
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.3M 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-09b-UpperBounds-00
FORMULA_NAME ASLink-PT-09b-UpperBounds-01
FORMULA_NAME ASLink-PT-09b-UpperBounds-02
FORMULA_NAME ASLink-PT-09b-UpperBounds-03
FORMULA_NAME ASLink-PT-09b-UpperBounds-04
FORMULA_NAME ASLink-PT-09b-UpperBounds-05
FORMULA_NAME ASLink-PT-09b-UpperBounds-06
FORMULA_NAME ASLink-PT-09b-UpperBounds-07
FORMULA_NAME ASLink-PT-09b-UpperBounds-08
FORMULA_NAME ASLink-PT-09b-UpperBounds-09
FORMULA_NAME ASLink-PT-09b-UpperBounds-10
FORMULA_NAME ASLink-PT-09b-UpperBounds-11
FORMULA_NAME ASLink-PT-09b-UpperBounds-12
FORMULA_NAME ASLink-PT-09b-UpperBounds-13
FORMULA_NAME ASLink-PT-09b-UpperBounds-14
FORMULA_NAME ASLink-PT-09b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678728196285

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 17:23:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 17:23:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:23:18] [INFO ] Load time of PNML (sax parser for PT used): 245 ms
[2023-03-13 17:23:18] [INFO ] Transformed 4014 places.
[2023-03-13 17:23:18] [INFO ] Transformed 4932 transitions.
[2023-03-13 17:23:18] [INFO ] Found NUPN structural information;
[2023-03-13 17:23:18] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 4932 rows 4014 cols
[2023-03-13 17:23:19] [INFO ] Computed 394 place invariants in 207 ms
Incomplete random walk after 10000 steps, including 16 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :11
FORMULA ASLink-PT-09b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
[2023-03-13 17:23:19] [INFO ] Invariant cache hit.
[2023-03-13 17:23:20] [INFO ] [Real]Absence check using 93 positive place invariants in 176 ms returned sat
[2023-03-13 17:23:20] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 195 ms returned sat
[2023-03-13 17:23:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:23:24] [INFO ] [Real]Absence check using state equation in 3844 ms returned unknown
[2023-03-13 17:23:25] [INFO ] [Real]Absence check using 93 positive place invariants in 139 ms returned sat
[2023-03-13 17:23:25] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 130 ms returned sat
[2023-03-13 17:23:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:23:28] [INFO ] [Real]Absence check using state equation in 3056 ms returned sat
[2023-03-13 17:23:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:23:29] [INFO ] [Nat]Absence check using 93 positive place invariants in 133 ms returned sat
[2023-03-13 17:23:30] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 214 ms returned sat
[2023-03-13 17:23:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:23:34] [INFO ] [Nat]Absence check using state equation in 3876 ms returned unknown
[2023-03-13 17:23:34] [INFO ] [Real]Absence check using 93 positive place invariants in 118 ms returned sat
[2023-03-13 17:23:35] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 228 ms returned sat
[2023-03-13 17:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:23:39] [INFO ] [Real]Absence check using state equation in 3979 ms returned sat
[2023-03-13 17:23:42] [INFO ] Deduced a trap composed of 16 places in 3347 ms of which 15 ms to minimize.
[2023-03-13 17:23:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-13 17:23:43] [INFO ] [Real]Absence check using 93 positive place invariants in 82 ms returned sat
[2023-03-13 17:23:43] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 183 ms returned sat
[2023-03-13 17:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:23:47] [INFO ] [Real]Absence check using state equation in 4160 ms returned unknown
[2023-03-13 17:23:48] [INFO ] [Real]Absence check using 93 positive place invariants in 82 ms returned sat
[2023-03-13 17:23:48] [INFO ] [Real]Absence check using 93 positive and 301 generalized place invariants in 152 ms returned sat
[2023-03-13 17:23:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:23:52] [INFO ] [Real]Absence check using state equation in 4005 ms returned sat
[2023-03-13 17:23:55] [INFO ] Deduced a trap composed of 16 places in 3428 ms of which 5 ms to minimize.
[2023-03-13 17:23:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 4014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Drop transitions removed 937 transitions
Trivial Post-agglo rules discarded 937 transitions
Performed 937 trivial Post agglomeration. Transition count delta: 937
Iterating post reduction 0 with 937 rules applied. Total rules applied 937 place count 4014 transition count 3995
Reduce places removed 937 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 979 rules applied. Total rules applied 1916 place count 3077 transition count 3953
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1928 place count 3066 transition count 3952
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1929 place count 3065 transition count 3952
Performed 934 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 934 Pre rules applied. Total rules applied 1929 place count 3065 transition count 3018
Deduced a syphon composed of 934 places in 8 ms
Ensure Unique test removed 93 places
Reduce places removed 1027 places and 0 transitions.
Iterating global reduction 4 with 1961 rules applied. Total rules applied 3890 place count 2038 transition count 3018
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 4 with 66 rules applied. Total rules applied 3956 place count 2029 transition count 2961
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 58 rules applied. Total rules applied 4014 place count 1972 transition count 2960
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4015 place count 1971 transition count 2960
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 36 Pre rules applied. Total rules applied 4015 place count 1971 transition count 2924
Deduced a syphon composed of 36 places in 17 ms
Ensure Unique test removed 36 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 7 with 108 rules applied. Total rules applied 4123 place count 1899 transition count 2924
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 36 Pre rules applied. Total rules applied 4123 place count 1899 transition count 2888
Deduced a syphon composed of 36 places in 17 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 4195 place count 1863 transition count 2888
Discarding 129 places :
Symmetric choice reduction at 7 with 129 rule applications. Total rules 4324 place count 1734 transition count 2759
Iterating global reduction 7 with 129 rules applied. Total rules applied 4453 place count 1734 transition count 2759
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4454 place count 1734 transition count 2758
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 42 Pre rules applied. Total rules applied 4454 place count 1734 transition count 2716
Deduced a syphon composed of 42 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 8 with 85 rules applied. Total rules applied 4539 place count 1691 transition count 2716
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4539 place count 1691 transition count 2715
Deduced a syphon composed of 1 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 4542 place count 1689 transition count 2715
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 4552 place count 1679 transition count 2652
Iterating global reduction 8 with 10 rules applied. Total rules applied 4562 place count 1679 transition count 2652
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 4562 place count 1679 transition count 2643
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 4580 place count 1670 transition count 2643
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4581 place count 1669 transition count 2635
Iterating global reduction 8 with 1 rules applied. Total rules applied 4582 place count 1669 transition count 2635
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4583 place count 1668 transition count 2627
Iterating global reduction 8 with 1 rules applied. Total rules applied 4584 place count 1668 transition count 2627
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4585 place count 1667 transition count 2619
Iterating global reduction 8 with 1 rules applied. Total rules applied 4586 place count 1667 transition count 2619
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4587 place count 1666 transition count 2611
Iterating global reduction 8 with 1 rules applied. Total rules applied 4588 place count 1666 transition count 2611
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4589 place count 1665 transition count 2603
Iterating global reduction 8 with 1 rules applied. Total rules applied 4590 place count 1665 transition count 2603
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4591 place count 1664 transition count 2595
Iterating global reduction 8 with 1 rules applied. Total rules applied 4592 place count 1664 transition count 2595
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4593 place count 1663 transition count 2587
Iterating global reduction 8 with 1 rules applied. Total rules applied 4594 place count 1663 transition count 2587
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4595 place count 1662 transition count 2579
Iterating global reduction 8 with 1 rules applied. Total rules applied 4596 place count 1662 transition count 2579
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4597 place count 1661 transition count 2571
Iterating global reduction 8 with 1 rules applied. Total rules applied 4598 place count 1661 transition count 2571
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4599 place count 1660 transition count 2563
Iterating global reduction 8 with 1 rules applied. Total rules applied 4600 place count 1660 transition count 2563
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4601 place count 1659 transition count 2555
Iterating global reduction 8 with 1 rules applied. Total rules applied 4602 place count 1659 transition count 2555
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4603 place count 1658 transition count 2547
Iterating global reduction 8 with 1 rules applied. Total rules applied 4604 place count 1658 transition count 2547
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4605 place count 1657 transition count 2539
Iterating global reduction 8 with 1 rules applied. Total rules applied 4606 place count 1657 transition count 2539
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4607 place count 1656 transition count 2531
Iterating global reduction 8 with 1 rules applied. Total rules applied 4608 place count 1656 transition count 2531
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4609 place count 1655 transition count 2523
Iterating global reduction 8 with 1 rules applied. Total rules applied 4610 place count 1655 transition count 2523
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4611 place count 1654 transition count 2515
Iterating global reduction 8 with 1 rules applied. Total rules applied 4612 place count 1654 transition count 2515
Performed 233 Post agglomeration using F-continuation condition.Transition count delta: 233
Deduced a syphon composed of 233 places in 11 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 8 with 466 rules applied. Total rules applied 5078 place count 1421 transition count 2282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 5080 place count 1420 transition count 2291
Free-agglomeration rule applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 5090 place count 1420 transition count 2281
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 5100 place count 1410 transition count 2281
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 5108 place count 1410 transition count 2273
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 5116 place count 1402 transition count 2273
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 5117 place count 1402 transition count 2273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 5118 place count 1401 transition count 2272
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 26 rules applied. Total rules applied 5144 place count 1383 transition count 2264
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 5152 place count 1375 transition count 2264
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 27 Pre rules applied. Total rules applied 5152 place count 1375 transition count 2237
Deduced a syphon composed of 27 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 12 with 55 rules applied. Total rules applied 5207 place count 1347 transition count 2237
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 12 with 10 rules applied. Total rules applied 5217 place count 1337 transition count 2237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 5217 place count 1337 transition count 2236
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 5219 place count 1336 transition count 2236
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 13 with 38 rules applied. Total rules applied 5257 place count 1317 transition count 2217
Discarding 9 places :
Symmetric choice reduction at 13 with 9 rule applications. Total rules 5266 place count 1308 transition count 2208
Iterating global reduction 13 with 9 rules applied. Total rules applied 5275 place count 1308 transition count 2208
Free-agglomeration rule applied 9 times.
Iterating global reduction 13 with 9 rules applied. Total rules applied 5284 place count 1308 transition count 2199
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 5293 place count 1299 transition count 2199
Applied a total of 5293 rules in 2723 ms. Remains 1299 /4014 variables (removed 2715) and now considering 2199/4932 (removed 2733) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2724 ms. Remains : 1299/4014 places, 2199/4932 transitions.
// Phase 1: matrix 2199 rows 1299 cols
[2023-03-13 17:23:58] [INFO ] Computed 225 place invariants in 81 ms
Incomplete random walk after 1000000 steps, including 10013 resets, run finished after 4306 ms. (steps per millisecond=232 ) properties (out of 5) seen :2
FORMULA ASLink-PT-09b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1085 resets, run finished after 1628 ms. (steps per millisecond=614 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1065 resets, run finished after 1833 ms. (steps per millisecond=545 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1074 resets, run finished after 1829 ms. (steps per millisecond=546 ) properties (out of 3) seen :0
[2023-03-13 17:24:08] [INFO ] Invariant cache hit.
[2023-03-13 17:24:08] [INFO ] [Real]Absence check using 61 positive place invariants in 21 ms returned sat
[2023-03-13 17:24:08] [INFO ] [Real]Absence check using 61 positive and 164 generalized place invariants in 41 ms returned sat
[2023-03-13 17:24:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:24:09] [INFO ] [Real]Absence check using state equation in 1171 ms returned sat
[2023-03-13 17:24:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:24:10] [INFO ] [Nat]Absence check using 61 positive place invariants in 31 ms returned sat
[2023-03-13 17:24:10] [INFO ] [Nat]Absence check using 61 positive and 164 generalized place invariants in 46 ms returned sat
[2023-03-13 17:24:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:24:11] [INFO ] [Nat]Absence check using state equation in 955 ms returned sat
[2023-03-13 17:24:12] [INFO ] Deduced a trap composed of 99 places in 762 ms of which 2 ms to minimize.
[2023-03-13 17:24:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1119 ms
[2023-03-13 17:24:12] [INFO ] Computed and/alt/rep : 871/3323/871 causal constraints (skipped 1283 transitions) in 353 ms.
[2023-03-13 17:24:32] [INFO ] Added : 635 causal constraints over 127 iterations in 20165 ms.(timeout) Result :sat
Minimization took 1873 ms.
[2023-03-13 17:24:34] [INFO ] [Real]Absence check using 61 positive place invariants in 17 ms returned sat
[2023-03-13 17:24:34] [INFO ] [Real]Absence check using 61 positive and 164 generalized place invariants in 71 ms returned sat
[2023-03-13 17:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:24:35] [INFO ] [Real]Absence check using state equation in 957 ms returned sat
[2023-03-13 17:24:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:24:35] [INFO ] [Nat]Absence check using 61 positive place invariants in 21 ms returned sat
[2023-03-13 17:24:36] [INFO ] [Nat]Absence check using 61 positive and 164 generalized place invariants in 63 ms returned sat
[2023-03-13 17:24:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:24:36] [INFO ] [Nat]Absence check using state equation in 926 ms returned sat
[2023-03-13 17:24:37] [INFO ] Computed and/alt/rep : 871/3323/871 causal constraints (skipped 1283 transitions) in 172 ms.
[2023-03-13 17:24:57] [INFO ] Added : 640 causal constraints over 128 iterations in 20068 ms.(timeout) Result :sat
Minimization took 972 ms.
[2023-03-13 17:24:58] [INFO ] [Real]Absence check using 61 positive place invariants in 43 ms returned sat
[2023-03-13 17:24:58] [INFO ] [Real]Absence check using 61 positive and 164 generalized place invariants in 73 ms returned sat
[2023-03-13 17:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:24:59] [INFO ] [Real]Absence check using state equation in 785 ms returned sat
[2023-03-13 17:24:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:24:59] [INFO ] [Nat]Absence check using 61 positive place invariants in 31 ms returned sat
[2023-03-13 17:24:59] [INFO ] [Nat]Absence check using 61 positive and 164 generalized place invariants in 73 ms returned sat
[2023-03-13 17:24:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:25:01] [INFO ] [Nat]Absence check using state equation in 1345 ms returned sat
[2023-03-13 17:25:01] [INFO ] Computed and/alt/rep : 871/3323/871 causal constraints (skipped 1283 transitions) in 146 ms.
[2023-03-13 17:25:20] [INFO ] Added : 594 causal constraints over 119 iterations in 19478 ms. Result :sat
Minimization took 670 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 1299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1299/1299 places, 2199/2199 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 1299 transition count 2198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1298 transition count 2198
Applied a total of 2 rules in 54 ms. Remains 1298 /1299 variables (removed 1) and now considering 2198/2199 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1298/1299 places, 2198/2199 transitions.
// Phase 1: matrix 2198 rows 1298 cols
[2023-03-13 17:25:32] [INFO ] Computed 225 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 9764 resets, run finished after 3743 ms. (steps per millisecond=267 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1076 resets, run finished after 1698 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1089 resets, run finished after 1776 ms. (steps per millisecond=563 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1070 resets, run finished after 1560 ms. (steps per millisecond=641 ) properties (out of 3) seen :0
[2023-03-13 17:25:41] [INFO ] Invariant cache hit.
[2023-03-13 17:25:41] [INFO ] [Real]Absence check using 62 positive place invariants in 20 ms returned sat
[2023-03-13 17:25:41] [INFO ] [Real]Absence check using 62 positive and 163 generalized place invariants in 77 ms returned sat
[2023-03-13 17:25:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:25:42] [INFO ] [Real]Absence check using state equation in 893 ms returned sat
[2023-03-13 17:25:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:25:42] [INFO ] [Nat]Absence check using 62 positive place invariants in 18 ms returned sat
[2023-03-13 17:25:42] [INFO ] [Nat]Absence check using 62 positive and 163 generalized place invariants in 43 ms returned sat
[2023-03-13 17:25:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:25:43] [INFO ] [Nat]Absence check using state equation in 1108 ms returned sat
[2023-03-13 17:25:43] [INFO ] Computed and/alt/rep : 870/3322/870 causal constraints (skipped 1283 transitions) in 154 ms.
[2023-03-13 17:25:47] [INFO ] Added : 119 causal constraints over 24 iterations in 3886 ms. Result :sat
Minimization took 491 ms.
[2023-03-13 17:25:48] [INFO ] [Real]Absence check using 62 positive place invariants in 19 ms returned sat
[2023-03-13 17:25:48] [INFO ] [Real]Absence check using 62 positive and 163 generalized place invariants in 37 ms returned sat
[2023-03-13 17:25:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:25:49] [INFO ] [Real]Absence check using state equation in 962 ms returned sat
[2023-03-13 17:25:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:25:49] [INFO ] [Nat]Absence check using 62 positive place invariants in 20 ms returned sat
[2023-03-13 17:25:49] [INFO ] [Nat]Absence check using 62 positive and 163 generalized place invariants in 47 ms returned sat
[2023-03-13 17:25:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:25:51] [INFO ] [Nat]Absence check using state equation in 1547 ms returned sat
[2023-03-13 17:25:51] [INFO ] Computed and/alt/rep : 870/3322/870 causal constraints (skipped 1283 transitions) in 187 ms.
[2023-03-13 17:25:57] [INFO ] Added : 156 causal constraints over 32 iterations in 6029 ms. Result :sat
Minimization took 660 ms.
[2023-03-13 17:25:58] [INFO ] [Real]Absence check using 62 positive place invariants in 22 ms returned sat
[2023-03-13 17:25:58] [INFO ] [Real]Absence check using 62 positive and 163 generalized place invariants in 76 ms returned sat
[2023-03-13 17:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:25:59] [INFO ] [Real]Absence check using state equation in 1003 ms returned sat
[2023-03-13 17:25:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:25:59] [INFO ] [Nat]Absence check using 62 positive place invariants in 19 ms returned sat
[2023-03-13 17:25:59] [INFO ] [Nat]Absence check using 62 positive and 163 generalized place invariants in 38 ms returned sat
[2023-03-13 17:25:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:26:01] [INFO ] [Nat]Absence check using state equation in 1268 ms returned sat
[2023-03-13 17:26:01] [INFO ] Computed and/alt/rep : 870/3322/870 causal constraints (skipped 1283 transitions) in 155 ms.
[2023-03-13 17:26:06] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 26 ms to minimize.
[2023-03-13 17:26:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 488 ms
[2023-03-13 17:26:07] [INFO ] Added : 155 causal constraints over 32 iterations in 5830 ms. Result :sat
Minimization took 700 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 1298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1298/1298 places, 2198/2198 transitions.
Applied a total of 0 rules in 58 ms. Remains 1298 /1298 variables (removed 0) and now considering 2198/2198 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1298/1298 places, 2198/2198 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1298/1298 places, 2198/2198 transitions.
Applied a total of 0 rules in 54 ms. Remains 1298 /1298 variables (removed 0) and now considering 2198/2198 (removed 0) transitions.
[2023-03-13 17:26:13] [INFO ] Invariant cache hit.
[2023-03-13 17:26:14] [INFO ] Implicit Places using invariants in 1245 ms returned [1, 18, 19, 20, 36, 53, 71, 140, 144, 153, 154, 156, 173, 191, 260, 264, 265, 276, 277, 279, 296, 314, 383, 387, 388, 399, 400, 402, 419, 437, 506, 510, 511, 522, 523, 525, 542, 560, 629, 633, 634, 645, 646, 666, 684, 755, 759, 760, 771, 772, 774, 791, 809, 878, 882, 883, 894, 895, 897, 914, 932, 1001, 1005, 1006, 1017, 1018, 1020, 1037, 1055, 1124, 1128, 1129, 1132, 1143, 1144, 1145, 1163, 1165, 1169, 1187, 1188, 1189, 1190, 1202, 1208, 1214, 1220, 1226, 1232, 1238, 1244, 1250, 1256, 1262]
Discarding 94 places :
Implicit Place search using SMT only with invariants took 1252 ms to find 94 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1204/1298 places, 2198/2198 transitions.
Drop transitions removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 1204 transition count 2029
Reduce places removed 169 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 177 rules applied. Total rules applied 346 place count 1035 transition count 2021
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 346 place count 1035 transition count 1978
Deduced a syphon composed of 43 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 87 rules applied. Total rules applied 433 place count 991 transition count 1978
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 445 place count 987 transition count 1970
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 453 place count 979 transition count 1970
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 469 place count 963 transition count 1954
Iterating global reduction 4 with 16 rules applied. Total rules applied 485 place count 963 transition count 1954
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 488 place count 963 transition count 1951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 488 place count 963 transition count 1950
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 490 place count 962 transition count 1950
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 494 place count 958 transition count 1943
Iterating global reduction 5 with 4 rules applied. Total rules applied 498 place count 958 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 500 place count 956 transition count 1941
Iterating global reduction 5 with 2 rules applied. Total rules applied 502 place count 956 transition count 1941
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 503 place count 956 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 504 place count 955 transition count 1938
Iterating global reduction 6 with 1 rules applied. Total rules applied 505 place count 955 transition count 1938
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 3 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 6 with 130 rules applied. Total rules applied 635 place count 890 transition count 1873
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 643 place count 882 transition count 1865
Iterating global reduction 6 with 8 rules applied. Total rules applied 651 place count 882 transition count 1865
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 659 place count 882 transition count 1857
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 663 place count 880 transition count 1858
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 7 with 19 rules applied. Total rules applied 682 place count 880 transition count 1839
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 702 place count 860 transition count 1839
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 703 place count 860 transition count 1838
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 8 with 28 rules applied. Total rules applied 731 place count 860 transition count 1838
Applied a total of 731 rules in 446 ms. Remains 860 /1204 variables (removed 344) and now considering 1838/2198 (removed 360) transitions.
// Phase 1: matrix 1838 rows 860 cols
[2023-03-13 17:26:15] [INFO ] Computed 125 place invariants in 24 ms
[2023-03-13 17:26:15] [INFO ] Implicit Places using invariants in 667 ms returned [73, 90, 96, 99, 101, 104, 105, 157, 174, 180, 183, 185, 190, 191, 243, 260, 266, 269, 271, 276, 277, 329, 346, 352, 355, 357, 362, 363, 415, 432, 438, 441, 443, 448, 449, 506, 527, 533, 536, 538, 543, 544, 596, 613, 619, 622, 624, 629, 630, 682, 699, 705, 708, 710, 715, 716, 768, 785, 791, 794, 796]
Discarding 61 places :
Implicit Place search using SMT only with invariants took 669 ms to find 61 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 799/1298 places, 1838/2198 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 771 transition count 1810
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 771 transition count 1810
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 762 transition count 1801
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 762 transition count 1801
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 108 place count 745 transition count 1784
Free-agglomeration rule applied 27 times.
Iterating global reduction 0 with 27 rules applied. Total rules applied 135 place count 745 transition count 1757
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 162 place count 718 transition count 1757
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 170 place count 718 transition count 1749
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 178 place count 710 transition count 1749
Applied a total of 178 rules in 142 ms. Remains 710 /799 variables (removed 89) and now considering 1749/1838 (removed 89) transitions.
// Phase 1: matrix 1749 rows 710 cols
[2023-03-13 17:26:15] [INFO ] Computed 64 place invariants in 35 ms
[2023-03-13 17:26:16] [INFO ] Implicit Places using invariants in 693 ms returned []
[2023-03-13 17:26:16] [INFO ] Invariant cache hit.
[2023-03-13 17:26:18] [INFO ] Implicit Places using invariants and state equation in 1831 ms returned []
Implicit Place search using SMT with State Equation took 2541 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 710/1298 places, 1749/2198 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5105 ms. Remains : 710/1298 places, 1749/2198 transitions.
Successfully produced net in file /tmp/petri1000_4584825321408231465.dot
Successfully produced net in file /tmp/petri1001_16977481310865048823.dot
Successfully produced net in file /tmp/petri1002_5611885363557283211.dot
Successfully produced net in file /tmp/petri1003_16774538867978886212.dot
Successfully produced net in file /tmp/petri1004_5350298509858316929.dot
Successfully produced net in file /tmp/petri1005_18078308472288114189.dot
Successfully produced net in file /tmp/petri1006_16540626974575914791.dot
Successfully produced net in file /tmp/petri1007_10822540985699877195.dot
Successfully produced net in file /tmp/petri1008_13176618100212743566.dot
Drop transitions removed 9 transitions
Dominated transitions for bounds rules discarded 9 transitions
// Phase 1: matrix 1740 rows 710 cols
[2023-03-13 17:26:18] [INFO ] Computed 64 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 16405 resets, run finished after 3059 ms. (steps per millisecond=326 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2437 resets, run finished after 1038 ms. (steps per millisecond=963 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2439 resets, run finished after 816 ms. (steps per millisecond=1225 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2431 resets, run finished after 855 ms. (steps per millisecond=1169 ) properties (out of 3) seen :0
[2023-03-13 17:26:24] [INFO ] Invariant cache hit.
[2023-03-13 17:26:24] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2023-03-13 17:26:24] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 34 ms returned sat
[2023-03-13 17:26:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:26:25] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2023-03-13 17:26:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:26:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-13 17:26:25] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 29 ms returned sat
[2023-03-13 17:26:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:26:26] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2023-03-13 17:26:26] [INFO ] Computed and/alt/rep : 413/1814/413 causal constraints (skipped 1282 transitions) in 118 ms.
[2023-03-13 17:26:30] [INFO ] Added : 10 causal constraints over 2 iterations in 4192 ms. Result :sat
Minimization took 287 ms.
[2023-03-13 17:26:30] [INFO ] [Real]Absence check using 14 positive place invariants in 61 ms returned sat
[2023-03-13 17:26:31] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 22 ms returned sat
[2023-03-13 17:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:26:31] [INFO ] [Real]Absence check using state equation in 550 ms returned sat
[2023-03-13 17:26:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:26:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-13 17:26:31] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 76 ms returned sat
[2023-03-13 17:26:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:26:32] [INFO ] [Nat]Absence check using state equation in 893 ms returned sat
[2023-03-13 17:26:32] [INFO ] Computed and/alt/rep : 413/1814/413 causal constraints (skipped 1282 transitions) in 130 ms.
[2023-03-13 17:26:34] [INFO ] Added : 34 causal constraints over 8 iterations in 1300 ms. Result :sat
Minimization took 571 ms.
[2023-03-13 17:26:34] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-13 17:26:34] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 17 ms returned sat
[2023-03-13 17:26:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:26:35] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2023-03-13 17:26:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:26:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-13 17:26:35] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 22 ms returned sat
[2023-03-13 17:26:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:26:36] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2023-03-13 17:26:36] [INFO ] Computed and/alt/rep : 413/1814/413 causal constraints (skipped 1282 transitions) in 105 ms.
[2023-03-13 17:26:37] [INFO ] Added : 48 causal constraints over 10 iterations in 1553 ms. Result :sat
Minimization took 297 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA ASLink-PT-09b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 710 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 710/710 places, 1740/1740 transitions.
Graph (complete) has 4304 edges and 710 vertex of which 701 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 700 transition count 1739
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 700 transition count 1739
Applied a total of 12 rules in 71 ms. Remains 700 /710 variables (removed 10) and now considering 1739/1740 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 700/710 places, 1739/1740 transitions.
// Phase 1: matrix 1739 rows 700 cols
[2023-03-13 17:26:39] [INFO ] Computed 64 place invariants in 39 ms
Incomplete random walk after 1000000 steps, including 16484 resets, run finished after 2917 ms. (steps per millisecond=342 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2418 resets, run finished after 983 ms. (steps per millisecond=1017 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2430 resets, run finished after 934 ms. (steps per millisecond=1070 ) properties (out of 2) seen :0
[2023-03-13 17:26:44] [INFO ] Invariant cache hit.
[2023-03-13 17:26:44] [INFO ] [Real]Absence check using 14 positive place invariants in 35 ms returned sat
[2023-03-13 17:26:44] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 60 ms returned sat
[2023-03-13 17:26:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:26:45] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2023-03-13 17:26:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:26:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 79 ms returned sat
[2023-03-13 17:26:45] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 35 ms returned sat
[2023-03-13 17:26:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:26:46] [INFO ] [Nat]Absence check using state equation in 880 ms returned sat
[2023-03-13 17:26:46] [INFO ] Computed and/alt/rep : 412/1814/412 causal constraints (skipped 1282 transitions) in 103 ms.
[2023-03-13 17:26:47] [INFO ] Added : 21 causal constraints over 5 iterations in 727 ms. Result :sat
Minimization took 213 ms.
[2023-03-13 17:26:47] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-13 17:26:47] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 29 ms returned sat
[2023-03-13 17:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:26:48] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2023-03-13 17:26:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:26:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 58 ms returned sat
[2023-03-13 17:26:48] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 73 ms returned sat
[2023-03-13 17:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:26:49] [INFO ] [Nat]Absence check using state equation in 1182 ms returned sat
[2023-03-13 17:26:49] [INFO ] Computed and/alt/rep : 412/1814/412 causal constraints (skipped 1282 transitions) in 98 ms.
[2023-03-13 17:26:51] [INFO ] Added : 33 causal constraints over 7 iterations in 1304 ms. Result :sat
Minimization took 386 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA ASLink-PT-09b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1739/1739 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 700 transition count 1738
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 699 transition count 1738
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 698 transition count 1737
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 698 transition count 1736
Applied a total of 5 rules in 56 ms. Remains 698 /700 variables (removed 2) and now considering 1736/1739 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 698/700 places, 1736/1739 transitions.
// Phase 1: matrix 1736 rows 698 cols
[2023-03-13 17:26:52] [INFO ] Computed 64 place invariants in 45 ms
Incomplete random walk after 1000000 steps, including 16364 resets, run finished after 2743 ms. (steps per millisecond=364 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2429 resets, run finished after 881 ms. (steps per millisecond=1135 ) properties (out of 1) seen :0
[2023-03-13 17:26:55] [INFO ] Invariant cache hit.
[2023-03-13 17:26:55] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-13 17:26:55] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 16 ms returned sat
[2023-03-13 17:26:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:26:56] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2023-03-13 17:26:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:26:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-13 17:26:56] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 32 ms returned sat
[2023-03-13 17:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:26:57] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2023-03-13 17:26:57] [INFO ] Computed and/alt/rep : 409/1800/409 causal constraints (skipped 1282 transitions) in 86 ms.
[2023-03-13 17:26:58] [INFO ] Added : 38 causal constraints over 8 iterations in 1402 ms. Result :sat
Minimization took 435 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 698 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 698/698 places, 1736/1736 transitions.
Applied a total of 0 rules in 25 ms. Remains 698 /698 variables (removed 0) and now considering 1736/1736 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 698/698 places, 1736/1736 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 698/698 places, 1736/1736 transitions.
Applied a total of 0 rules in 25 ms. Remains 698 /698 variables (removed 0) and now considering 1736/1736 (removed 0) transitions.
[2023-03-13 17:26:59] [INFO ] Invariant cache hit.
[2023-03-13 17:27:00] [INFO ] Implicit Places using invariants in 491 ms returned [361]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 493 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 697/698 places, 1736/1736 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 0 with 4 rules applied. Total rules applied 4 place count 697 transition count 1732
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 693 transition count 1732
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 692 transition count 1731
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 692 transition count 1730
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 691 transition count 1730
Applied a total of 12 rules in 74 ms. Remains 691 /697 variables (removed 6) and now considering 1730/1736 (removed 6) transitions.
// Phase 1: matrix 1730 rows 691 cols
[2023-03-13 17:27:00] [INFO ] Computed 63 place invariants in 27 ms
[2023-03-13 17:27:00] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-13 17:27:00] [INFO ] Invariant cache hit.
[2023-03-13 17:27:02] [INFO ] Implicit Places using invariants and state equation in 1922 ms returned []
Implicit Place search using SMT with State Equation took 2389 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 691/698 places, 1730/1736 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2981 ms. Remains : 691/698 places, 1730/1736 transitions.
[2023-03-13 17:27:02] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16254 resets, run finished after 2800 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2448 resets, run finished after 940 ms. (steps per millisecond=1063 ) properties (out of 1) seen :0
[2023-03-13 17:27:06] [INFO ] Invariant cache hit.
[2023-03-13 17:27:06] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-13 17:27:06] [INFO ] [Real]Absence check using 15 positive and 48 generalized place invariants in 15 ms returned sat
[2023-03-13 17:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:27:07] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2023-03-13 17:27:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:27:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 19 ms returned sat
[2023-03-13 17:27:07] [INFO ] [Nat]Absence check using 15 positive and 48 generalized place invariants in 13 ms returned sat
[2023-03-13 17:27:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:27:09] [INFO ] [Nat]Absence check using state equation in 1408 ms returned sat
[2023-03-13 17:27:09] [INFO ] Computed and/alt/rep : 397/1708/397 causal constraints (skipped 1288 transitions) in 109 ms.
[2023-03-13 17:27:10] [INFO ] Added : 45 causal constraints over 9 iterations in 1631 ms. Result :sat
Minimization took 406 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1730/1730 transitions.
Applied a total of 0 rules in 25 ms. Remains 691 /691 variables (removed 0) and now considering 1730/1730 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 691/691 places, 1730/1730 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1730/1730 transitions.
Applied a total of 0 rules in 25 ms. Remains 691 /691 variables (removed 0) and now considering 1730/1730 (removed 0) transitions.
[2023-03-13 17:27:11] [INFO ] Invariant cache hit.
[2023-03-13 17:27:12] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-13 17:27:12] [INFO ] Invariant cache hit.
[2023-03-13 17:27:13] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
[2023-03-13 17:27:13] [INFO ] Redundant transitions in 114 ms returned []
[2023-03-13 17:27:13] [INFO ] Invariant cache hit.
[2023-03-13 17:27:14] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2835 ms. Remains : 691/691 places, 1730/1730 transitions.
Starting property specific reduction for ASLink-PT-09b-UpperBounds-10
[2023-03-13 17:27:14] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 153 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-13 17:27:14] [INFO ] Invariant cache hit.
[2023-03-13 17:27:14] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-13 17:27:14] [INFO ] [Real]Absence check using 15 positive and 48 generalized place invariants in 15 ms returned sat
[2023-03-13 17:27:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:27:15] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2023-03-13 17:27:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:27:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 42 ms returned sat
[2023-03-13 17:27:15] [INFO ] [Nat]Absence check using 15 positive and 48 generalized place invariants in 44 ms returned sat
[2023-03-13 17:27:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:27:17] [INFO ] [Nat]Absence check using state equation in 1372 ms returned sat
[2023-03-13 17:27:17] [INFO ] Computed and/alt/rep : 397/1708/397 causal constraints (skipped 1288 transitions) in 168 ms.
[2023-03-13 17:27:18] [INFO ] Added : 45 causal constraints over 9 iterations in 1669 ms. Result :sat
Minimization took 413 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1730/1730 transitions.
Applied a total of 0 rules in 26 ms. Remains 691 /691 variables (removed 0) and now considering 1730/1730 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 691/691 places, 1730/1730 transitions.
[2023-03-13 17:27:19] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16480 resets, run finished after 2820 ms. (steps per millisecond=354 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2420 resets, run finished after 839 ms. (steps per millisecond=1191 ) properties (out of 1) seen :0
[2023-03-13 17:27:23] [INFO ] Invariant cache hit.
[2023-03-13 17:27:23] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-13 17:27:23] [INFO ] [Real]Absence check using 15 positive and 48 generalized place invariants in 16 ms returned sat
[2023-03-13 17:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:27:24] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2023-03-13 17:27:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:27:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-13 17:27:24] [INFO ] [Nat]Absence check using 15 positive and 48 generalized place invariants in 65 ms returned sat
[2023-03-13 17:27:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:27:26] [INFO ] [Nat]Absence check using state equation in 1481 ms returned sat
[2023-03-13 17:27:26] [INFO ] Computed and/alt/rep : 397/1708/397 causal constraints (skipped 1288 transitions) in 99 ms.
[2023-03-13 17:27:27] [INFO ] Added : 45 causal constraints over 9 iterations in 1626 ms. Result :sat
Minimization took 413 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1730/1730 transitions.
Applied a total of 0 rules in 29 ms. Remains 691 /691 variables (removed 0) and now considering 1730/1730 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 691/691 places, 1730/1730 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1730/1730 transitions.
Applied a total of 0 rules in 27 ms. Remains 691 /691 variables (removed 0) and now considering 1730/1730 (removed 0) transitions.
[2023-03-13 17:27:28] [INFO ] Invariant cache hit.
[2023-03-13 17:27:29] [INFO ] Implicit Places using invariants in 638 ms returned []
[2023-03-13 17:27:29] [INFO ] Invariant cache hit.
[2023-03-13 17:27:31] [INFO ] Implicit Places using invariants and state equation in 1895 ms returned []
Implicit Place search using SMT with State Equation took 2552 ms to find 0 implicit places.
[2023-03-13 17:27:31] [INFO ] Redundant transitions in 91 ms returned []
[2023-03-13 17:27:31] [INFO ] Invariant cache hit.
[2023-03-13 17:27:32] [INFO ] Dead Transitions using invariants and state equation in 657 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3350 ms. Remains : 691/691 places, 1730/1730 transitions.
Ending property specific reduction for ASLink-PT-09b-UpperBounds-10 in 17493 ms.
[2023-03-13 17:27:32] [INFO ] Flatten gal took : 179 ms
[2023-03-13 17:27:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-13 17:27:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 691 places, 1730 transitions and 7079 arcs took 15 ms.
Total runtime 253961 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 09b
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 691 places, 1730 transitions, 7079 arcs.
Final Score: 32082.739
Took : 83 seconds
Bounds file is: UpperBounds.xml

BK_STOP 1678731758883

--------------------
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
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 721 Killed ${SMART}/smart ${INPUT_SM}

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-09b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ASLink-PT-09b, 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 r011-oct2-167813599800149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-09b.tgz
mv ASLink-PT-09b 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 ;