Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245688800053.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-03b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245688800053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 6.0K Apr 30 07:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 30 07:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 30 07:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 07:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 06:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 06:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 06:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 06:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 06:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 06:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 544K May 10 09:33 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-03b-UpperBounds-00
FORMULA_NAME ASLink-PT-03b-UpperBounds-01
FORMULA_NAME ASLink-PT-03b-UpperBounds-02
FORMULA_NAME ASLink-PT-03b-UpperBounds-03
FORMULA_NAME ASLink-PT-03b-UpperBounds-04
FORMULA_NAME ASLink-PT-03b-UpperBounds-05
FORMULA_NAME ASLink-PT-03b-UpperBounds-06
FORMULA_NAME ASLink-PT-03b-UpperBounds-07
FORMULA_NAME ASLink-PT-03b-UpperBounds-08
FORMULA_NAME ASLink-PT-03b-UpperBounds-09
FORMULA_NAME ASLink-PT-03b-UpperBounds-10
FORMULA_NAME ASLink-PT-03b-UpperBounds-11
FORMULA_NAME ASLink-PT-03b-UpperBounds-12
FORMULA_NAME ASLink-PT-03b-UpperBounds-13
FORMULA_NAME ASLink-PT-03b-UpperBounds-14
FORMULA_NAME ASLink-PT-03b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652644826061

Running Version 202205111006
[2022-05-15 20:00:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 20:00:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:00:27] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2022-05-15 20:00:27] [INFO ] Transformed 1638 places.
[2022-05-15 20:00:28] [INFO ] Transformed 2094 transitions.
[2022-05-15 20:00:28] [INFO ] Found NUPN structural information;
[2022-05-15 20:00:28] [INFO ] Parsed PT model containing 1638 places and 2094 transitions in 442 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 2094 rows 1638 cols
[2022-05-15 20:00:28] [INFO ] Computed 160 place invariants in 189 ms
Incomplete random walk after 10000 steps, including 31 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 16) seen :11
FORMULA ASLink-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :2
FORMULA ASLink-PT-03b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2094 rows 1638 cols
[2022-05-15 20:00:28] [INFO ] Computed 160 place invariants in 89 ms
[2022-05-15 20:00:29] [INFO ] [Real]Absence check using 37 positive place invariants in 35 ms returned sat
[2022-05-15 20:00:29] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 39 ms returned sat
[2022-05-15 20:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:00:29] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2022-05-15 20:00:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:00:30] [INFO ] [Nat]Absence check using 37 positive place invariants in 41 ms returned sat
[2022-05-15 20:00:30] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 67 ms returned sat
[2022-05-15 20:00:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:00:34] [INFO ] [Nat]Absence check using state equation in 3843 ms returned sat
[2022-05-15 20:00:35] [INFO ] Deduced a trap composed of 26 places in 460 ms of which 20 ms to minimize.
[2022-05-15 20:00:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 20:00:35] [INFO ] [Real]Absence check using 37 positive place invariants in 63 ms returned sat
[2022-05-15 20:00:35] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 60 ms returned sat
[2022-05-15 20:00:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:00:40] [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: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-15 20:00:40] [INFO ] [Real]Absence check using 37 positive place invariants in 25 ms returned sat
[2022-05-15 20:00:40] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 60 ms returned sat
[2022-05-15 20:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:00:41] [INFO ] [Real]Absence check using state equation in 952 ms returned sat
[2022-05-15 20:00:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:00:42] [INFO ] [Nat]Absence check using 37 positive place invariants in 35 ms returned sat
[2022-05-15 20:00:42] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 49 ms returned sat
[2022-05-15 20:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:00:43] [INFO ] [Nat]Absence check using state equation in 1516 ms returned sat
[2022-05-15 20:00:44] [INFO ] Deduced a trap composed of 44 places in 857 ms of which 2 ms to minimize.
[2022-05-15 20:00:45] [INFO ] Deduced a trap composed of 135 places in 706 ms of which 2 ms to minimize.
[2022-05-15 20:00:46] [INFO ] Deduced a trap composed of 114 places in 490 ms of which 3 ms to minimize.
[2022-05-15 20:00:46] [INFO ] Deduced a trap composed of 114 places in 401 ms of which 2 ms to minimize.
[2022-05-15 20:00:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2901 ms
[2022-05-15 20:00:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1001)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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] Max seen :[0, 0, 0]
Support contains 3 out of 1638 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions removed 372 transitions
Trivial Post-agglo rules discarded 372 transitions
Performed 372 trivial Post agglomeration. Transition count delta: 372
Iterating post reduction 0 with 372 rules applied. Total rules applied 372 place count 1638 transition count 1722
Reduce places removed 372 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 390 rules applied. Total rules applied 762 place count 1266 transition count 1704
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 769 place count 1261 transition count 1702
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 771 place count 1259 transition count 1702
Performed 376 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 376 Pre rules applied. Total rules applied 771 place count 1259 transition count 1326
Deduced a syphon composed of 376 places in 3 ms
Ensure Unique test removed 32 places
Reduce places removed 408 places and 0 transitions.
Iterating global reduction 4 with 784 rules applied. Total rules applied 1555 place count 851 transition count 1326
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 25 rules applied. Total rules applied 1580 place count 848 transition count 1304
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1602 place count 826 transition count 1304
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1602 place count 826 transition count 1293
Deduced a syphon composed of 11 places in 5 ms
Ensure Unique test removed 11 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 33 rules applied. Total rules applied 1635 place count 804 transition count 1293
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1635 place count 804 transition count 1282
Deduced a syphon composed of 11 places in 19 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1657 place count 793 transition count 1282
Discarding 51 places :
Symmetric choice reduction at 6 with 51 rule applications. Total rules 1708 place count 742 transition count 1231
Iterating global reduction 6 with 51 rules applied. Total rules applied 1759 place count 742 transition count 1231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1760 place count 742 transition count 1230
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 18 Pre rules applied. Total rules applied 1760 place count 742 transition count 1212
Deduced a syphon composed of 18 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 37 rules applied. Total rules applied 1797 place count 723 transition count 1212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1797 place count 723 transition count 1211
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 1800 place count 721 transition count 1211
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1804 place count 717 transition count 1184
Iterating global reduction 7 with 4 rules applied. Total rules applied 1808 place count 717 transition count 1184
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 1808 place count 717 transition count 1181
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1814 place count 714 transition count 1181
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1815 place count 713 transition count 1173
Iterating global reduction 7 with 1 rules applied. Total rules applied 1816 place count 713 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1817 place count 712 transition count 1165
Iterating global reduction 7 with 1 rules applied. Total rules applied 1818 place count 712 transition count 1165
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1819 place count 711 transition count 1157
Iterating global reduction 7 with 1 rules applied. Total rules applied 1820 place count 711 transition count 1157
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1821 place count 710 transition count 1149
Iterating global reduction 7 with 1 rules applied. Total rules applied 1822 place count 710 transition count 1149
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1823 place count 709 transition count 1141
Iterating global reduction 7 with 1 rules applied. Total rules applied 1824 place count 709 transition count 1141
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1825 place count 708 transition count 1133
Iterating global reduction 7 with 1 rules applied. Total rules applied 1826 place count 708 transition count 1133
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1827 place count 707 transition count 1125
Iterating global reduction 7 with 1 rules applied. Total rules applied 1828 place count 707 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1829 place count 706 transition count 1117
Iterating global reduction 7 with 1 rules applied. Total rules applied 1830 place count 706 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1831 place count 705 transition count 1109
Iterating global reduction 7 with 1 rules applied. Total rules applied 1832 place count 705 transition count 1109
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1833 place count 704 transition count 1101
Iterating global reduction 7 with 1 rules applied. Total rules applied 1834 place count 704 transition count 1101
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1835 place count 703 transition count 1093
Iterating global reduction 7 with 1 rules applied. Total rules applied 1836 place count 703 transition count 1093
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1837 place count 702 transition count 1085
Iterating global reduction 7 with 1 rules applied. Total rules applied 1838 place count 702 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1839 place count 701 transition count 1077
Iterating global reduction 7 with 1 rules applied. Total rules applied 1840 place count 701 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1841 place count 700 transition count 1069
Iterating global reduction 7 with 1 rules applied. Total rules applied 1842 place count 700 transition count 1069
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1843 place count 699 transition count 1061
Iterating global reduction 7 with 1 rules applied. Total rules applied 1844 place count 699 transition count 1061
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1845 place count 698 transition count 1053
Iterating global reduction 7 with 1 rules applied. Total rules applied 1846 place count 698 transition count 1053
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 7 with 182 rules applied. Total rules applied 2028 place count 607 transition count 962
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2029 place count 606 transition count 961
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 2031 place count 605 transition count 961
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2032 place count 604 transition count 960
Iterating global reduction 7 with 1 rules applied. Total rules applied 2033 place count 604 transition count 960
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2035 place count 604 transition count 958
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2036 place count 603 transition count 958
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2038 place count 602 transition count 967
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2042 place count 602 transition count 963
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2046 place count 598 transition count 963
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2048 place count 598 transition count 961
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 2050 place count 596 transition count 961
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2051 place count 595 transition count 960
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 11 with 9 rules applied. Total rules applied 2060 place count 589 transition count 957
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 2063 place count 586 transition count 957
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 9 Pre rules applied. Total rules applied 2063 place count 586 transition count 948
Deduced a syphon composed of 9 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 13 with 19 rules applied. Total rules applied 2082 place count 576 transition count 948
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 13 with 4 rules applied. Total rules applied 2086 place count 572 transition count 948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2086 place count 572 transition count 947
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2088 place count 571 transition count 947
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 14 with 14 rules applied. Total rules applied 2102 place count 564 transition count 940
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 2105 place count 561 transition count 937
Iterating global reduction 14 with 3 rules applied. Total rules applied 2108 place count 561 transition count 937
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 2111 place count 561 transition count 934
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 2114 place count 558 transition count 934
Applied a total of 2114 rules in 1304 ms. Remains 558 /1638 variables (removed 1080) and now considering 934/2094 (removed 1160) transitions.
Finished structural reductions, in 1 iterations. Remains : 558/1638 places, 934/2094 transitions.
// Phase 1: matrix 934 rows 558 cols
[2022-05-15 20:00:48] [INFO ] Computed 100 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 14126 resets, run finished after 1947 ms. (steps per millisecond=513 ) properties (out of 3) seen :1
FORMULA ASLink-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3868 resets, run finished after 1036 ms. (steps per millisecond=965 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3888 resets, run finished after 941 ms. (steps per millisecond=1062 ) properties (out of 2) seen :0
// Phase 1: matrix 934 rows 558 cols
[2022-05-15 20:00:52] [INFO ] Computed 100 place invariants in 22 ms
[2022-05-15 20:00:52] [INFO ] [Real]Absence check using 26 positive place invariants in 11 ms returned sat
[2022-05-15 20:00:52] [INFO ] [Real]Absence check using 26 positive and 74 generalized place invariants in 21 ms returned sat
[2022-05-15 20:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:00:55] [INFO ] [Real]Absence check using state equation in 3058 ms returned sat
[2022-05-15 20:00:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:00:55] [INFO ] [Nat]Absence check using 26 positive place invariants in 8 ms returned sat
[2022-05-15 20:00:55] [INFO ] [Nat]Absence check using 26 positive and 74 generalized place invariants in 14 ms returned sat
[2022-05-15 20:00:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:00:55] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2022-05-15 20:00:56] [INFO ] Computed and/alt/rep : 360/1392/360 causal constraints (skipped 553 transitions) in 104 ms.
[2022-05-15 20:00:57] [INFO ] Added : 80 causal constraints over 16 iterations in 1343 ms. Result :sat
Minimization took 246 ms.
[2022-05-15 20:00:57] [INFO ] [Real]Absence check using 26 positive place invariants in 23 ms returned sat
[2022-05-15 20:00:57] [INFO ] [Real]Absence check using 26 positive and 74 generalized place invariants in 22 ms returned sat
[2022-05-15 20:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:00:58] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2022-05-15 20:00:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:00:58] [INFO ] [Nat]Absence check using 26 positive place invariants in 10 ms returned sat
[2022-05-15 20:00:58] [INFO ] [Nat]Absence check using 26 positive and 74 generalized place invariants in 15 ms returned sat
[2022-05-15 20:00:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:00:58] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2022-05-15 20:00:58] [INFO ] Computed and/alt/rep : 360/1392/360 causal constraints (skipped 553 transitions) in 91 ms.
[2022-05-15 20:01:02] [INFO ] Added : 259 causal constraints over 52 iterations in 3956 ms. Result :sat
Minimization took 345 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 558 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 558/558 places, 934/934 transitions.
Applied a total of 0 rules in 32 ms. Remains 558 /558 variables (removed 0) and now considering 934/934 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 558/558 places, 934/934 transitions.
// Phase 1: matrix 934 rows 558 cols
[2022-05-15 20:01:04] [INFO ] Computed 100 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 14048 resets, run finished after 2245 ms. (steps per millisecond=445 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3869 resets, run finished after 1009 ms. (steps per millisecond=991 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3837 resets, run finished after 1141 ms. (steps per millisecond=876 ) properties (out of 2) seen :0
// Phase 1: matrix 934 rows 558 cols
[2022-05-15 20:01:08] [INFO ] Computed 100 place invariants in 18 ms
[2022-05-15 20:01:08] [INFO ] [Real]Absence check using 26 positive place invariants in 10 ms returned sat
[2022-05-15 20:01:08] [INFO ] [Real]Absence check using 26 positive and 74 generalized place invariants in 17 ms returned sat
[2022-05-15 20:01:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:09] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2022-05-15 20:01:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:01:09] [INFO ] [Nat]Absence check using 26 positive place invariants in 10 ms returned sat
[2022-05-15 20:01:09] [INFO ] [Nat]Absence check using 26 positive and 74 generalized place invariants in 16 ms returned sat
[2022-05-15 20:01:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:09] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2022-05-15 20:01:09] [INFO ] Computed and/alt/rep : 360/1392/360 causal constraints (skipped 553 transitions) in 81 ms.
[2022-05-15 20:01:11] [INFO ] Added : 80 causal constraints over 16 iterations in 1524 ms. Result :sat
Minimization took 365 ms.
[2022-05-15 20:01:11] [INFO ] [Real]Absence check using 26 positive place invariants in 10 ms returned sat
[2022-05-15 20:01:11] [INFO ] [Real]Absence check using 26 positive and 74 generalized place invariants in 18 ms returned sat
[2022-05-15 20:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:12] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2022-05-15 20:01:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:01:12] [INFO ] [Nat]Absence check using 26 positive place invariants in 11 ms returned sat
[2022-05-15 20:01:12] [INFO ] [Nat]Absence check using 26 positive and 74 generalized place invariants in 17 ms returned sat
[2022-05-15 20:01:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:12] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2022-05-15 20:01:12] [INFO ] Computed and/alt/rep : 360/1392/360 causal constraints (skipped 553 transitions) in 90 ms.
[2022-05-15 20:01:17] [INFO ] Added : 259 causal constraints over 52 iterations in 4466 ms. Result :sat
Minimization took 370 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 558 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 558/558 places, 934/934 transitions.
Applied a total of 0 rules in 22 ms. Remains 558 /558 variables (removed 0) and now considering 934/934 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 558/558 places, 934/934 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 558/558 places, 934/934 transitions.
Applied a total of 0 rules in 22 ms. Remains 558 /558 variables (removed 0) and now considering 934/934 (removed 0) transitions.
// Phase 1: matrix 934 rows 558 cols
[2022-05-15 20:01:18] [INFO ] Computed 100 place invariants in 9 ms
[2022-05-15 20:01:18] [INFO ] Implicit Places using invariants in 581 ms returned [1, 18, 19, 31, 48, 66, 102, 141, 145, 154, 155, 157, 174, 192, 261, 265, 266, 277, 278, 280, 297, 315, 384, 388, 389, 392, 403, 404, 405, 423, 425, 429, 447, 448, 449, 450, 462, 468, 474, 480, 486, 492, 498, 504, 510, 516, 522]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 584 ms to find 47 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 511/558 places, 934/934 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 511 transition count 855
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 161 place count 432 transition count 852
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 161 place count 432 transition count 832
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 202 place count 411 transition count 832
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 214 place count 407 transition count 824
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 222 place count 399 transition count 824
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 237 place count 384 transition count 809
Iterating global reduction 4 with 15 rules applied. Total rules applied 252 place count 384 transition count 809
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 255 place count 384 transition count 806
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 255 place count 384 transition count 805
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 257 place count 383 transition count 805
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 260 place count 380 transition count 799
Iterating global reduction 5 with 3 rules applied. Total rules applied 263 place count 380 transition count 799
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 264 place count 379 transition count 798
Iterating global reduction 5 with 1 rules applied. Total rules applied 265 place count 379 transition count 798
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 266 place count 378 transition count 796
Iterating global reduction 5 with 1 rules applied. Total rules applied 267 place count 378 transition count 796
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 321 place count 351 transition count 769
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 324 place count 348 transition count 766
Iterating global reduction 5 with 3 rules applied. Total rules applied 327 place count 348 transition count 766
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 330 place count 348 transition count 763
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 334 place count 346 transition count 764
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 340 place count 346 transition count 758
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 347 place count 339 transition count 758
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 356 place count 339 transition count 758
Applied a total of 356 rules in 195 ms. Remains 339 /511 variables (removed 172) and now considering 758/934 (removed 176) transitions.
// Phase 1: matrix 758 rows 339 cols
[2022-05-15 20:01:19] [INFO ] Computed 47 place invariants in 12 ms
[2022-05-15 20:01:19] [INFO ] Implicit Places using invariants in 286 ms returned [72, 94, 100, 103, 105, 108, 109, 161, 178, 184, 187, 189, 194, 195, 247, 264, 270, 273, 275]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 289 ms to find 19 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 320/558 places, 758/934 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 311 transition count 749
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 311 transition count 749
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 308 transition count 746
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 308 transition count 746
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 36 place count 302 transition count 740
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 45 place count 302 transition count 731
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 54 place count 293 transition count 731
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 293 transition count 728
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 290 transition count 728
Applied a total of 60 rules in 58 ms. Remains 290 /320 variables (removed 30) and now considering 728/758 (removed 30) transitions.
// Phase 1: matrix 728 rows 290 cols
[2022-05-15 20:01:19] [INFO ] Computed 28 place invariants in 6 ms
[2022-05-15 20:01:19] [INFO ] Implicit Places using invariants in 225 ms returned []
// Phase 1: matrix 728 rows 290 cols
[2022-05-15 20:01:19] [INFO ] Computed 28 place invariants in 6 ms
[2022-05-15 20:01:20] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 290/558 places, 728/934 transitions.
Finished structural reductions, in 3 iterations. Remains : 290/558 places, 728/934 transitions.
Successfully produced net in file /tmp/petri1000_8467673321914376776.dot
Successfully produced net in file /tmp/petri1001_10413618492715102351.dot
Successfully produced net in file /tmp/petri1002_6410194829780017765.dot
Drop transitions removed 3 transitions
Dominated transitions for bounds rules discarded 3 transitions
// Phase 1: matrix 725 rows 290 cols
[2022-05-15 20:01:20] [INFO ] Computed 28 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 21790 resets, run finished after 1862 ms. (steps per millisecond=537 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6889 resets, run finished after 856 ms. (steps per millisecond=1168 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6949 resets, run finished after 818 ms. (steps per millisecond=1222 ) properties (out of 2) seen :0
// Phase 1: matrix 725 rows 290 cols
[2022-05-15 20:01:23] [INFO ] Computed 28 place invariants in 6 ms
[2022-05-15 20:01:23] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-05-15 20:01:23] [INFO ] [Real]Absence check using 9 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-15 20:01:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:23] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2022-05-15 20:01:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:01:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-15 20:01:23] [INFO ] [Nat]Absence check using 9 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-15 20:01:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:24] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2022-05-15 20:01:24] [INFO ] Computed and/alt/rep : 142/730/142 causal constraints (skipped 562 transitions) in 54 ms.
[2022-05-15 20:01:24] [INFO ] Added : 11 causal constraints over 3 iterations in 185 ms. Result :sat
Minimization took 72 ms.
[2022-05-15 20:01:24] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2022-05-15 20:01:24] [INFO ] [Real]Absence check using 9 positive and 19 generalized place invariants in 5 ms returned sat
[2022-05-15 20:01:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:24] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-05-15 20:01:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:01:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-05-15 20:01:24] [INFO ] [Nat]Absence check using 9 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-15 20:01:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:24] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2022-05-15 20:01:25] [INFO ] Computed and/alt/rep : 142/730/142 causal constraints (skipped 562 transitions) in 70 ms.
[2022-05-15 20:01:25] [INFO ] Added : 17 causal constraints over 5 iterations in 409 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 290 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 290/290 places, 725/725 transitions.
Graph (complete) has 1786 edges and 290 vertex of which 287 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 287 transition count 725
Applied a total of 4 rules in 26 ms. Remains 287 /290 variables (removed 3) and now considering 725/725 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 287/290 places, 725/725 transitions.
// Phase 1: matrix 725 rows 287 cols
[2022-05-15 20:01:25] [INFO ] Computed 28 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 21659 resets, run finished after 1853 ms. (steps per millisecond=539 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6850 resets, run finished after 711 ms. (steps per millisecond=1406 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6814 resets, run finished after 717 ms. (steps per millisecond=1394 ) properties (out of 2) seen :0
// Phase 1: matrix 725 rows 287 cols
[2022-05-15 20:01:29] [INFO ] Computed 28 place invariants in 11 ms
[2022-05-15 20:01:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-15 20:01:29] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 8 ms returned sat
[2022-05-15 20:01:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:29] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2022-05-15 20:01:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:01:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-05-15 20:01:29] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 6 ms returned sat
[2022-05-15 20:01:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:29] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2022-05-15 20:01:29] [INFO ] Computed and/alt/rep : 142/728/142 causal constraints (skipped 562 transitions) in 52 ms.
[2022-05-15 20:01:30] [INFO ] Added : 14 causal constraints over 3 iterations in 256 ms. Result :sat
Minimization took 122 ms.
[2022-05-15 20:01:30] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-15 20:01:30] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 7 ms returned sat
[2022-05-15 20:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:30] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2022-05-15 20:01:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:01:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-15 20:01:30] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 8 ms returned sat
[2022-05-15 20:01:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:30] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2022-05-15 20:01:31] [INFO ] Computed and/alt/rep : 142/728/142 causal constraints (skipped 562 transitions) in 59 ms.
[2022-05-15 20:01:31] [INFO ] Added : 13 causal constraints over 3 iterations in 265 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 287/287 places, 725/725 transitions.
Applied a total of 0 rules in 11 ms. Remains 287 /287 variables (removed 0) and now considering 725/725 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 287/287 places, 725/725 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 287/287 places, 725/725 transitions.
Applied a total of 0 rules in 10 ms. Remains 287 /287 variables (removed 0) and now considering 725/725 (removed 0) transitions.
// Phase 1: matrix 725 rows 287 cols
[2022-05-15 20:01:31] [INFO ] Computed 28 place invariants in 10 ms
[2022-05-15 20:01:31] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 725 rows 287 cols
[2022-05-15 20:01:31] [INFO ] Computed 28 place invariants in 7 ms
[2022-05-15 20:01:32] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2022-05-15 20:01:32] [INFO ] Redundant transitions in 58 ms returned []
// Phase 1: matrix 725 rows 287 cols
[2022-05-15 20:01:32] [INFO ] Computed 28 place invariants in 5 ms
[2022-05-15 20:01:32] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 287/287 places, 725/725 transitions.
Starting property specific reduction for ASLink-PT-03b-UpperBounds-01
// Phase 1: matrix 725 rows 287 cols
[2022-05-15 20:01:32] [INFO ] Computed 28 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 230 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 725 rows 287 cols
[2022-05-15 20:01:32] [INFO ] Computed 28 place invariants in 7 ms
[2022-05-15 20:01:32] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-15 20:01:32] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 7 ms returned sat
[2022-05-15 20:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:33] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2022-05-15 20:01:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:01:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-05-15 20:01:33] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 4 ms returned sat
[2022-05-15 20:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:33] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2022-05-15 20:01:33] [INFO ] Computed and/alt/rep : 142/728/142 causal constraints (skipped 562 transitions) in 45 ms.
[2022-05-15 20:01:33] [INFO ] Added : 14 causal constraints over 3 iterations in 171 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[0]
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 287/287 places, 725/725 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 287 transition count 724
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 286 transition count 724
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 285 transition count 723
Applied a total of 4 rules in 18 ms. Remains 285 /287 variables (removed 2) and now considering 723/725 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 285/287 places, 723/725 transitions.
// Phase 1: matrix 723 rows 285 cols
[2022-05-15 20:01:33] [INFO ] Computed 28 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 21592 resets, run finished after 1581 ms. (steps per millisecond=632 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6920 resets, run finished after 682 ms. (steps per millisecond=1466 ) properties (out of 1) seen :0
// Phase 1: matrix 723 rows 285 cols
[2022-05-15 20:01:35] [INFO ] Computed 28 place invariants in 12 ms
[2022-05-15 20:01:36] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-15 20:01:36] [INFO ] [Real]Absence check using 9 positive and 19 generalized place invariants in 7 ms returned sat
[2022-05-15 20:01:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:36] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2022-05-15 20:01:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:01:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-15 20:01:36] [INFO ] [Nat]Absence check using 9 positive and 19 generalized place invariants in 7 ms returned sat
[2022-05-15 20:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:36] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2022-05-15 20:01:36] [INFO ] Computed and/alt/rep : 140/726/140 causal constraints (skipped 562 transitions) in 53 ms.
[2022-05-15 20:01:37] [INFO ] Added : 18 causal constraints over 4 iterations in 437 ms. Result :sat
Minimization took 210 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 285/285 places, 723/723 transitions.
Applied a total of 0 rules in 12 ms. Remains 285 /285 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 285/285 places, 723/723 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 285/285 places, 723/723 transitions.
Applied a total of 0 rules in 11 ms. Remains 285 /285 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 285 cols
[2022-05-15 20:01:37] [INFO ] Computed 28 place invariants in 10 ms
[2022-05-15 20:01:37] [INFO ] Implicit Places using invariants in 238 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 241 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 284/285 places, 723/723 transitions.
Applied a total of 0 rules in 12 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 284/285 places, 723/723 transitions.
// Phase 1: matrix 723 rows 284 cols
[2022-05-15 20:01:37] [INFO ] Computed 27 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 21678 resets, run finished after 1916 ms. (steps per millisecond=521 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6867 resets, run finished after 814 ms. (steps per millisecond=1228 ) properties (out of 1) seen :0
// Phase 1: matrix 723 rows 284 cols
[2022-05-15 20:01:40] [INFO ] Computed 27 place invariants in 12 ms
[2022-05-15 20:01:40] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-15 20:01:40] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 7 ms returned sat
[2022-05-15 20:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:40] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2022-05-15 20:01:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:01:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-15 20:01:40] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 8 ms returned sat
[2022-05-15 20:01:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:41] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2022-05-15 20:01:41] [INFO ] Computed and/alt/rep : 140/725/140 causal constraints (skipped 562 transitions) in 51 ms.
[2022-05-15 20:01:41] [INFO ] Added : 48 causal constraints over 11 iterations in 809 ms. Result :sat
Minimization took 138 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 284/284 places, 723/723 transitions.
Applied a total of 0 rules in 11 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 284/284 places, 723/723 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 284/284 places, 723/723 transitions.
Applied a total of 0 rules in 11 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 284 cols
[2022-05-15 20:01:42] [INFO ] Computed 27 place invariants in 12 ms
[2022-05-15 20:01:42] [INFO ] Implicit Places using invariants in 243 ms returned []
// Phase 1: matrix 723 rows 284 cols
[2022-05-15 20:01:42] [INFO ] Computed 27 place invariants in 13 ms
[2022-05-15 20:01:43] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2022-05-15 20:01:43] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 723 rows 284 cols
[2022-05-15 20:01:43] [INFO ] Computed 27 place invariants in 8 ms
[2022-05-15 20:01:43] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 284/284 places, 723/723 transitions.
Ending property specific reduction for ASLink-PT-03b-UpperBounds-01 in 10674 ms.
Starting property specific reduction for ASLink-PT-03b-UpperBounds-04
// Phase 1: matrix 725 rows 287 cols
[2022-05-15 20:01:43] [INFO ] Computed 28 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 218 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 725 rows 287 cols
[2022-05-15 20:01:43] [INFO ] Computed 28 place invariants in 22 ms
[2022-05-15 20:01:43] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-05-15 20:01:43] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 17 ms returned sat
[2022-05-15 20:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:43] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2022-05-15 20:01:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:01:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-05-15 20:01:43] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 6 ms returned sat
[2022-05-15 20:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:44] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2022-05-15 20:01:44] [INFO ] Computed and/alt/rep : 142/728/142 causal constraints (skipped 562 transitions) in 42 ms.
[2022-05-15 20:01:44] [INFO ] Added : 13 causal constraints over 3 iterations in 172 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 287/287 places, 725/725 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 287 transition count 724
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 286 transition count 724
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 286 transition count 723
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 285 transition count 723
Applied a total of 4 rules in 16 ms. Remains 285 /287 variables (removed 2) and now considering 723/725 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 285/287 places, 723/725 transitions.
// Phase 1: matrix 723 rows 285 cols
[2022-05-15 20:01:44] [INFO ] Computed 28 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 21478 resets, run finished after 1405 ms. (steps per millisecond=711 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6848 resets, run finished after 615 ms. (steps per millisecond=1626 ) properties (out of 1) seen :0
// Phase 1: matrix 723 rows 285 cols
[2022-05-15 20:01:46] [INFO ] Computed 28 place invariants in 12 ms
[2022-05-15 20:01:46] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-15 20:01:46] [INFO ] [Real]Absence check using 9 positive and 19 generalized place invariants in 10 ms returned sat
[2022-05-15 20:01:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:46] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2022-05-15 20:01:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:01:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-15 20:01:46] [INFO ] [Nat]Absence check using 9 positive and 19 generalized place invariants in 7 ms returned sat
[2022-05-15 20:01:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:47] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2022-05-15 20:01:47] [INFO ] Computed and/alt/rep : 140/726/140 causal constraints (skipped 562 transitions) in 53 ms.
[2022-05-15 20:01:47] [INFO ] Added : 18 causal constraints over 4 iterations in 372 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 285/285 places, 723/723 transitions.
Applied a total of 0 rules in 11 ms. Remains 285 /285 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 285/285 places, 723/723 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 285/285 places, 723/723 transitions.
Applied a total of 0 rules in 10 ms. Remains 285 /285 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 285 cols
[2022-05-15 20:01:47] [INFO ] Computed 28 place invariants in 7 ms
[2022-05-15 20:01:48] [INFO ] Implicit Places using invariants in 233 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 235 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 284/285 places, 723/723 transitions.
Applied a total of 0 rules in 10 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 284/285 places, 723/723 transitions.
// Phase 1: matrix 723 rows 284 cols
[2022-05-15 20:01:48] [INFO ] Computed 27 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 21835 resets, run finished after 1566 ms. (steps per millisecond=638 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6954 resets, run finished after 645 ms. (steps per millisecond=1550 ) properties (out of 1) seen :0
// Phase 1: matrix 723 rows 284 cols
[2022-05-15 20:01:50] [INFO ] Computed 27 place invariants in 11 ms
[2022-05-15 20:01:50] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-15 20:01:50] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 11 ms returned sat
[2022-05-15 20:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:50] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2022-05-15 20:01:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:01:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-15 20:01:50] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 8 ms returned sat
[2022-05-15 20:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:01:50] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2022-05-15 20:01:50] [INFO ] Computed and/alt/rep : 140/725/140 causal constraints (skipped 562 transitions) in 42 ms.
[2022-05-15 20:01:51] [INFO ] Added : 33 causal constraints over 8 iterations in 539 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 284/284 places, 723/723 transitions.
Applied a total of 0 rules in 12 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 284/284 places, 723/723 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 284/284 places, 723/723 transitions.
Applied a total of 0 rules in 11 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 284 cols
[2022-05-15 20:01:51] [INFO ] Computed 27 place invariants in 11 ms
[2022-05-15 20:01:51] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 723 rows 284 cols
[2022-05-15 20:01:51] [INFO ] Computed 27 place invariants in 11 ms
[2022-05-15 20:01:52] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
[2022-05-15 20:01:52] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 723 rows 284 cols
[2022-05-15 20:01:52] [INFO ] Computed 27 place invariants in 5 ms
[2022-05-15 20:01:52] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 284/284 places, 723/723 transitions.
Ending property specific reduction for ASLink-PT-03b-UpperBounds-04 in 9475 ms.
[2022-05-15 20:01:53] [INFO ] Flatten gal took : 115 ms
[2022-05-15 20:01:53] [INFO ] Applying decomposition
[2022-05-15 20:01:53] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11456207777204517762.txt' '-o' '/tmp/graph11456207777204517762.bin' '-w' '/tmp/graph11456207777204517762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11456207777204517762.bin' '-l' '-1' '-v' '-w' '/tmp/graph11456207777204517762.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:01:53] [INFO ] Decomposing Gal with order
[2022-05-15 20:01:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:01:53] [INFO ] Removed a total of 1394 redundant transitions.
[2022-05-15 20:01:53] [INFO ] Flatten gal took : 125 ms
[2022-05-15 20:01:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 15 ms.
[2022-05-15 20:01:53] [INFO ] Time to serialize gal into /tmp/UpperBounds2698674643312804304.gal : 10 ms
[2022-05-15 20:01:53] [INFO ] Time to serialize properties into /tmp/UpperBounds4789530160146322342.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2698674643312804304.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4789530160146322342.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds4789530160146322342.prop.
Detected timeout of ITS tools.
[2022-05-15 20:22:21] [INFO ] Applying decomposition
[2022-05-15 20:22:22] [INFO ] Flatten gal took : 54 ms
[2022-05-15 20:22:22] [INFO ] Decomposing Gal with order
[2022-05-15 20:22:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:22:22] [INFO ] Removed a total of 1350 redundant transitions.
[2022-05-15 20:22:22] [INFO ] Flatten gal took : 115 ms
[2022-05-15 20:22:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 538 labels/synchronizations in 21 ms.
[2022-05-15 20:22:22] [INFO ] Time to serialize gal into /tmp/UpperBounds4385508705060219500.gal : 6 ms
[2022-05-15 20:22:22] [INFO ] Time to serialize properties into /tmp/UpperBounds14732511082717242996.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4385508705060219500.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14732511082717242996.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds14732511082717242996.prop.
Detected timeout of ITS tools.
[2022-05-15 20:42:50] [INFO ] Flatten gal took : 71 ms
[2022-05-15 20:42:50] [INFO ] Input system was already deterministic with 725 transitions.
[2022-05-15 20:42:50] [INFO ] Transformed 287 places.
[2022-05-15 20:42:50] [INFO ] Transformed 725 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 20:42:50] [INFO ] Time to serialize gal into /tmp/UpperBounds2948169244720057013.gal : 10 ms
[2022-05-15 20:42:50] [INFO ] Time to serialize properties into /tmp/UpperBounds14837574172821757536.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2948169244720057013.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14837574172821757536.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds14837574172821757536.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ sed s/.jar//
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-03b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-03b, 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 r006-tajo-165245688800053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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