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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 13:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 13:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 26 13:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 669K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678489773873

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-10 23:09:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 23:09:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 23:09:36] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-03-10 23:09:36] [INFO ] Transformed 2034 places.
[2023-03-10 23:09:36] [INFO ] Transformed 2567 transitions.
[2023-03-10 23:09:36] [INFO ] Found NUPN structural information;
[2023-03-10 23:09:36] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 2567 rows 2034 cols
[2023-03-10 23:09:36] [INFO ] Computed 199 place invariants in 151 ms
Incomplete random walk after 10000 steps, including 22 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 16) seen :12
FORMULA ASLink-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
[2023-03-10 23:09:37] [INFO ] Invariant cache hit.
[2023-03-10 23:09:37] [INFO ] [Real]Absence check using 48 positive place invariants in 48 ms returned sat
[2023-03-10 23:09:37] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 60 ms returned sat
[2023-03-10 23:09:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:09:39] [INFO ] [Real]Absence check using state equation in 1354 ms returned sat
[2023-03-10 23:09:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:09:39] [INFO ] [Nat]Absence check using 48 positive place invariants in 40 ms returned sat
[2023-03-10 23:09:39] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 82 ms returned sat
[2023-03-10 23:09:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:09:44] [INFO ] [Nat]Absence check using state equation in 4506 ms returned unknown
[2023-03-10 23:09:44] [INFO ] [Real]Absence check using 48 positive place invariants in 81 ms returned sat
[2023-03-10 23:09:44] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 106 ms returned sat
[2023-03-10 23:09:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:09:46] [INFO ] [Real]Absence check using state equation in 1454 ms returned sat
[2023-03-10 23:09:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:09:46] [INFO ] [Nat]Absence check using 48 positive place invariants in 54 ms returned sat
[2023-03-10 23:09:46] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 60 ms returned sat
[2023-03-10 23:09:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:09:49] [INFO ] [Nat]Absence check using state equation in 2200 ms returned sat
[2023-03-10 23:09:50] [INFO ] Deduced a trap composed of 274 places in 1231 ms of which 32 ms to minimize.
[2023-03-10 23:09:51] [INFO ] Deduced a trap composed of 284 places in 1404 ms of which 3 ms to minimize.
[2023-03-10 23:09:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 23:09:52] [INFO ] [Real]Absence check using 48 positive place invariants in 33 ms returned sat
[2023-03-10 23:09:52] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 102 ms returned sat
[2023-03-10 23:09:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:09:53] [INFO ] [Real]Absence check using state equation in 1355 ms returned sat
[2023-03-10 23:09:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:09:54] [INFO ] [Nat]Absence check using 48 positive place invariants in 42 ms returned sat
[2023-03-10 23:09:54] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 69 ms returned sat
[2023-03-10 23:09:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:09:56] [INFO ] [Nat]Absence check using state equation in 1856 ms returned sat
[2023-03-10 23:09:57] [INFO ] Deduced a trap composed of 107 places in 1049 ms of which 15 ms to minimize.
[2023-03-10 23:09:58] [INFO ] Deduced a trap composed of 42 places in 830 ms of which 7 ms to minimize.
[2023-03-10 23:09:59] [INFO ] Deduced a trap composed of 159 places in 982 ms of which 15 ms to minimize.
[2023-03-10 23:09:59] [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:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 23:10:00] [INFO ] [Real]Absence check using 48 positive place invariants in 64 ms returned sat
[2023-03-10 23:10:00] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 93 ms returned sat
[2023-03-10 23:10:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:10:01] [INFO ] [Real]Absence check using state equation in 1461 ms returned sat
[2023-03-10 23:10:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:10:02] [INFO ] [Nat]Absence check using 48 positive place invariants in 37 ms returned sat
[2023-03-10 23:10:02] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 66 ms returned sat
[2023-03-10 23:10:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:10:06] [INFO ] [Nat]Absence check using state equation in 4547 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions removed 467 transitions
Trivial Post-agglo rules discarded 467 transitions
Performed 467 trivial Post agglomeration. Transition count delta: 467
Iterating post reduction 0 with 467 rules applied. Total rules applied 467 place count 2034 transition count 2100
Reduce places removed 467 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 489 rules applied. Total rules applied 956 place count 1567 transition count 2078
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 963 place count 1561 transition count 2077
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 964 place count 1560 transition count 2077
Performed 468 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 468 Pre rules applied. Total rules applied 964 place count 1560 transition count 1609
Deduced a syphon composed of 468 places in 3 ms
Ensure Unique test removed 43 places
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 4 with 979 rules applied. Total rules applied 1943 place count 1049 transition count 1609
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 4 with 32 rules applied. Total rules applied 1975 place count 1045 transition count 1581
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 2003 place count 1017 transition count 1581
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 2003 place count 1017 transition count 1566
Deduced a syphon composed of 15 places in 7 ms
Ensure Unique test removed 15 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 45 rules applied. Total rules applied 2048 place count 987 transition count 1566
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 15 Pre rules applied. Total rules applied 2048 place count 987 transition count 1551
Deduced a syphon composed of 15 places in 6 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 2078 place count 972 transition count 1551
Discarding 64 places :
Symmetric choice reduction at 6 with 64 rule applications. Total rules 2142 place count 908 transition count 1487
Iterating global reduction 6 with 64 rules applied. Total rules applied 2206 place count 908 transition count 1487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2207 place count 908 transition count 1486
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 22 Pre rules applied. Total rules applied 2207 place count 908 transition count 1464
Deduced a syphon composed of 22 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 45 rules applied. Total rules applied 2252 place count 885 transition count 1464
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2252 place count 885 transition count 1463
Deduced a syphon composed of 1 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 2255 place count 883 transition count 1463
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2260 place count 878 transition count 1430
Iterating global reduction 7 with 5 rules applied. Total rules applied 2265 place count 878 transition count 1430
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 2265 place count 878 transition count 1426
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 2273 place count 874 transition count 1426
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2274 place count 873 transition count 1418
Iterating global reduction 7 with 1 rules applied. Total rules applied 2275 place count 873 transition count 1418
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2276 place count 872 transition count 1410
Iterating global reduction 7 with 1 rules applied. Total rules applied 2277 place count 872 transition count 1410
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2278 place count 871 transition count 1402
Iterating global reduction 7 with 1 rules applied. Total rules applied 2279 place count 871 transition count 1402
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2280 place count 870 transition count 1394
Iterating global reduction 7 with 1 rules applied. Total rules applied 2281 place count 870 transition count 1394
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2282 place count 869 transition count 1386
Iterating global reduction 7 with 1 rules applied. Total rules applied 2283 place count 869 transition count 1386
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2284 place count 868 transition count 1378
Iterating global reduction 7 with 1 rules applied. Total rules applied 2285 place count 868 transition count 1378
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2286 place count 867 transition count 1370
Iterating global reduction 7 with 1 rules applied. Total rules applied 2287 place count 867 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2288 place count 866 transition count 1362
Iterating global reduction 7 with 1 rules applied. Total rules applied 2289 place count 866 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2290 place count 865 transition count 1354
Iterating global reduction 7 with 1 rules applied. Total rules applied 2291 place count 865 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2292 place count 864 transition count 1346
Iterating global reduction 7 with 1 rules applied. Total rules applied 2293 place count 864 transition count 1346
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2294 place count 863 transition count 1338
Iterating global reduction 7 with 1 rules applied. Total rules applied 2295 place count 863 transition count 1338
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2296 place count 862 transition count 1330
Iterating global reduction 7 with 1 rules applied. Total rules applied 2297 place count 862 transition count 1330
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2298 place count 861 transition count 1322
Iterating global reduction 7 with 1 rules applied. Total rules applied 2299 place count 861 transition count 1322
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2300 place count 860 transition count 1314
Iterating global reduction 7 with 1 rules applied. Total rules applied 2301 place count 860 transition count 1314
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2302 place count 859 transition count 1306
Iterating global reduction 7 with 1 rules applied. Total rules applied 2303 place count 859 transition count 1306
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2304 place count 858 transition count 1298
Iterating global reduction 7 with 1 rules applied. Total rules applied 2305 place count 858 transition count 1298
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 2 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 7 with 228 rules applied. Total rules applied 2533 place count 744 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2534 place count 743 transition count 1183
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 2536 place count 742 transition count 1183
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2537 place count 741 transition count 1182
Iterating global reduction 7 with 1 rules applied. Total rules applied 2538 place count 741 transition count 1182
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 2540 place count 741 transition count 1180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2541 place count 740 transition count 1180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2543 place count 739 transition count 1189
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 2548 place count 739 transition count 1184
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2553 place count 734 transition count 1184
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 2556 place count 734 transition count 1181
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 2559 place count 731 transition count 1181
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2560 place count 730 transition count 1180
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 11 with 12 rules applied. Total rules applied 2572 place count 722 transition count 1176
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2576 place count 718 transition count 1176
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 12 Pre rules applied. Total rules applied 2576 place count 718 transition count 1164
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 13 with 25 rules applied. Total rules applied 2601 place count 705 transition count 1164
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 13 with 5 rules applied. Total rules applied 2606 place count 700 transition count 1164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2606 place count 700 transition count 1163
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2608 place count 699 transition count 1163
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 14 with 18 rules applied. Total rules applied 2626 place count 690 transition count 1154
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 2630 place count 686 transition count 1150
Iterating global reduction 14 with 4 rules applied. Total rules applied 2634 place count 686 transition count 1150
Free-agglomeration rule applied 4 times.
Iterating global reduction 14 with 4 rules applied. Total rules applied 2638 place count 686 transition count 1146
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 2642 place count 682 transition count 1146
Applied a total of 2642 rules in 1569 ms. Remains 682 /2034 variables (removed 1352) and now considering 1146/2567 (removed 1421) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1569 ms. Remains : 682/2034 places, 1146/2567 transitions.
// Phase 1: matrix 1146 rows 682 cols
[2023-03-10 23:10:08] [INFO ] Computed 120 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 12711 resets, run finished after 2606 ms. (steps per millisecond=383 ) properties (out of 4) seen :1
FORMULA ASLink-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2920 resets, run finished after 1132 ms. (steps per millisecond=883 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2917 resets, run finished after 1139 ms. (steps per millisecond=877 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2920 resets, run finished after 1026 ms. (steps per millisecond=974 ) properties (out of 3) seen :0
[2023-03-10 23:10:14] [INFO ] Invariant cache hit.
[2023-03-10 23:10:14] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2023-03-10 23:10:14] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 34 ms returned sat
[2023-03-10 23:10:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:10:15] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2023-03-10 23:10:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:10:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 42 ms returned sat
[2023-03-10 23:10:15] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 109 ms returned sat
[2023-03-10 23:10:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:10:15] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2023-03-10 23:10:15] [INFO ] Computed and/alt/rep : 454/1789/454 causal constraints (skipped 667 transitions) in 80 ms.
[2023-03-10 23:10:17] [INFO ] Added : 82 causal constraints over 17 iterations in 1690 ms. Result :sat
Minimization took 547 ms.
[2023-03-10 23:10:18] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned sat
[2023-03-10 23:10:18] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 66 ms returned sat
[2023-03-10 23:10:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:10:18] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2023-03-10 23:10:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:10:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 8 ms returned sat
[2023-03-10 23:10:18] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 32 ms returned sat
[2023-03-10 23:10:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:10:19] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2023-03-10 23:10:19] [INFO ] Computed and/alt/rep : 454/1789/454 causal constraints (skipped 667 transitions) in 86 ms.
[2023-03-10 23:10:25] [INFO ] Added : 316 causal constraints over 64 iterations in 6351 ms. Result :sat
Minimization took 445 ms.
[2023-03-10 23:10:26] [INFO ] [Real]Absence check using 31 positive place invariants in 39 ms returned sat
[2023-03-10 23:10:26] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 27 ms returned sat
[2023-03-10 23:10:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:10:26] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2023-03-10 23:10:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:10:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-10 23:10:26] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 19 ms returned sat
[2023-03-10 23:10:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:10:27] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2023-03-10 23:10:27] [INFO ] Computed and/alt/rep : 454/1789/454 causal constraints (skipped 667 transitions) in 96 ms.
[2023-03-10 23:10:34] [INFO ] Added : 307 causal constraints over 62 iterations in 6559 ms. Result :sat
Minimization took 569 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 682/682 places, 1146/1146 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 682 transition count 1145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 681 transition count 1145
Applied a total of 2 rules in 25 ms. Remains 681 /682 variables (removed 1) and now considering 1145/1146 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 681/682 places, 1145/1146 transitions.
// Phase 1: matrix 1145 rows 681 cols
[2023-03-10 23:10:39] [INFO ] Computed 120 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 12725 resets, run finished after 2247 ms. (steps per millisecond=445 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2932 resets, run finished after 900 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2916 resets, run finished after 1025 ms. (steps per millisecond=975 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2936 resets, run finished after 1012 ms. (steps per millisecond=988 ) properties (out of 3) seen :1
FORMULA ASLink-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-10 23:10:44] [INFO ] Invariant cache hit.
[2023-03-10 23:10:44] [INFO ] [Real]Absence check using 32 positive place invariants in 37 ms returned sat
[2023-03-10 23:10:44] [INFO ] [Real]Absence check using 32 positive and 88 generalized place invariants in 39 ms returned sat
[2023-03-10 23:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:10:45] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2023-03-10 23:10:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:10:45] [INFO ] [Nat]Absence check using 32 positive place invariants in 14 ms returned sat
[2023-03-10 23:10:45] [INFO ] [Nat]Absence check using 32 positive and 88 generalized place invariants in 72 ms returned sat
[2023-03-10 23:10:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:10:45] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2023-03-10 23:10:46] [INFO ] Computed and/alt/rep : 453/1788/453 causal constraints (skipped 667 transitions) in 173 ms.
[2023-03-10 23:10:51] [INFO ] Added : 296 causal constraints over 60 iterations in 5721 ms. Result :sat
Minimization took 423 ms.
[2023-03-10 23:10:52] [INFO ] [Real]Absence check using 32 positive place invariants in 15 ms returned sat
[2023-03-10 23:10:52] [INFO ] [Real]Absence check using 32 positive and 88 generalized place invariants in 26 ms returned sat
[2023-03-10 23:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:10:52] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2023-03-10 23:10:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:10:52] [INFO ] [Nat]Absence check using 32 positive place invariants in 12 ms returned sat
[2023-03-10 23:10:52] [INFO ] [Nat]Absence check using 32 positive and 88 generalized place invariants in 58 ms returned sat
[2023-03-10 23:10:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:10:53] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2023-03-10 23:10:53] [INFO ] Computed and/alt/rep : 453/1788/453 causal constraints (skipped 667 transitions) in 104 ms.
[2023-03-10 23:10:58] [INFO ] Added : 286 causal constraints over 58 iterations in 5266 ms. Result :sat
Minimization took 375 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 681/681 places, 1145/1145 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 681 transition count 1144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 680 transition count 1144
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 680 transition count 1143
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 679 transition count 1143
Applied a total of 4 rules in 28 ms. Remains 679 /681 variables (removed 2) and now considering 1143/1145 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 679/681 places, 1143/1145 transitions.
// Phase 1: matrix 1143 rows 679 cols
[2023-03-10 23:10:59] [INFO ] Computed 120 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 13078 resets, run finished after 2220 ms. (steps per millisecond=450 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2915 resets, run finished after 911 ms. (steps per millisecond=1097 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2936 resets, run finished after 894 ms. (steps per millisecond=1118 ) properties (out of 2) seen :0
[2023-03-10 23:11:03] [INFO ] Invariant cache hit.
[2023-03-10 23:11:04] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2023-03-10 23:11:04] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 42 ms returned sat
[2023-03-10 23:11:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:04] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2023-03-10 23:11:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:11:04] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2023-03-10 23:11:04] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 16 ms returned sat
[2023-03-10 23:11:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:04] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2023-03-10 23:11:05] [INFO ] Computed and/alt/rep : 443/1707/443 causal constraints (skipped 675 transitions) in 76 ms.
[2023-03-10 23:11:07] [INFO ] Added : 106 causal constraints over 22 iterations in 2052 ms. Result :sat
Minimization took 424 ms.
[2023-03-10 23:11:07] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-10 23:11:07] [INFO ] [Real]Absence check using 31 positive and 89 generalized place invariants in 52 ms returned sat
[2023-03-10 23:11:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:08] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2023-03-10 23:11:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:11:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2023-03-10 23:11:08] [INFO ] [Nat]Absence check using 31 positive and 89 generalized place invariants in 49 ms returned sat
[2023-03-10 23:11:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:08] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2023-03-10 23:11:08] [INFO ] Computed and/alt/rep : 443/1707/443 causal constraints (skipped 675 transitions) in 134 ms.
[2023-03-10 23:11:13] [INFO ] Added : 272 causal constraints over 55 iterations in 5195 ms. Result :sat
Minimization took 307 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 679 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 679/679 places, 1143/1143 transitions.
Applied a total of 0 rules in 19 ms. Remains 679 /679 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 679/679 places, 1143/1143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 679/679 places, 1143/1143 transitions.
Applied a total of 0 rules in 25 ms. Remains 679 /679 variables (removed 0) and now considering 1143/1143 (removed 0) transitions.
[2023-03-10 23:11:14] [INFO ] Invariant cache hit.
[2023-03-10 23:11:15] [INFO ] Implicit Places using invariants in 676 ms returned [1, 18, 19, 31, 48, 66, 105, 139, 143, 152, 153, 155, 172, 190, 259, 263, 264, 275, 276, 278, 295, 313, 382, 386, 387, 398, 399, 401, 418, 436, 505, 509, 510, 513, 524, 525, 526, 544, 546, 550, 568, 569, 570, 571, 583, 589, 595, 601, 607, 613, 619, 625, 631, 637, 643]
Discarding 55 places :
Implicit Place search using SMT only with invariants took 692 ms to find 55 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 624/679 places, 1143/1143 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 624 transition count 1049
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 100 rules applied. Total rules applied 194 place count 530 transition count 1043
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 196 place count 528 transition count 1043
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 196 place count 528 transition count 1020
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 243 place count 504 transition count 1020
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 255 place count 500 transition count 1012
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 263 place count 492 transition count 1012
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 278 place count 477 transition count 997
Iterating global reduction 5 with 15 rules applied. Total rules applied 293 place count 477 transition count 997
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 296 place count 477 transition count 994
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 296 place count 477 transition count 993
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 298 place count 476 transition count 993
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 301 place count 473 transition count 987
Iterating global reduction 6 with 3 rules applied. Total rules applied 304 place count 473 transition count 987
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 305 place count 472 transition count 986
Iterating global reduction 6 with 1 rules applied. Total rules applied 306 place count 472 transition count 986
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 307 place count 471 transition count 984
Iterating global reduction 6 with 1 rules applied. Total rules applied 308 place count 471 transition count 984
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 374 place count 438 transition count 951
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 378 place count 434 transition count 947
Iterating global reduction 6 with 4 rules applied. Total rules applied 382 place count 434 transition count 947
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 386 place count 434 transition count 943
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 390 place count 432 transition count 944
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 398 place count 432 transition count 936
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 407 place count 423 transition count 936
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 419 place count 423 transition count 936
Applied a total of 419 rules in 130 ms. Remains 423 /624 variables (removed 201) and now considering 936/1143 (removed 207) transitions.
// Phase 1: matrix 936 rows 423 cols
[2023-03-10 23:11:15] [INFO ] Computed 59 place invariants in 17 ms
[2023-03-10 23:11:16] [INFO ] Implicit Places using invariants in 358 ms returned [72, 92, 98, 101, 103, 106, 107, 159, 176, 182, 185, 187, 192, 193, 245, 262, 268, 271, 273, 278, 279, 331, 348, 354, 357, 359]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 359 ms to find 26 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 397/679 places, 936/1143 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 385 transition count 924
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 385 transition count 924
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 381 transition count 920
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 381 transition count 920
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 48 place count 373 transition count 912
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 60 place count 373 transition count 900
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 72 place count 361 transition count 900
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 361 transition count 896
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 357 transition count 896
Applied a total of 80 rules in 69 ms. Remains 357 /397 variables (removed 40) and now considering 896/936 (removed 40) transitions.
// Phase 1: matrix 896 rows 357 cols
[2023-03-10 23:11:16] [INFO ] Computed 33 place invariants in 8 ms
[2023-03-10 23:11:16] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-10 23:11:16] [INFO ] Invariant cache hit.
[2023-03-10 23:11:17] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 357/679 places, 896/1143 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2214 ms. Remains : 357/679 places, 896/1143 transitions.
Successfully produced net in file /tmp/petri1000_13715092951290774557.dot
Successfully produced net in file /tmp/petri1001_12911738821484623713.dot
Successfully produced net in file /tmp/petri1002_3928486535779866977.dot
Successfully produced net in file /tmp/petri1003_8131135989182755355.dot
Drop transitions removed 4 transitions
Dominated transitions for bounds rules discarded 4 transitions
// Phase 1: matrix 892 rows 357 cols
[2023-03-10 23:11:17] [INFO ] Computed 33 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 19685 resets, run finished after 1853 ms. (steps per millisecond=539 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5406 resets, run finished after 699 ms. (steps per millisecond=1430 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5396 resets, run finished after 693 ms. (steps per millisecond=1443 ) properties (out of 2) seen :0
[2023-03-10 23:11:20] [INFO ] Invariant cache hit.
[2023-03-10 23:11:20] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-10 23:11:20] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-10 23:11:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:20] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2023-03-10 23:11:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:11:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2023-03-10 23:11:20] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-10 23:11:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:21] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2023-03-10 23:11:21] [INFO ] Computed and/alt/rep : 184/892/184 causal constraints (skipped 683 transitions) in 70 ms.
[2023-03-10 23:11:22] [INFO ] Added : 75 causal constraints over 16 iterations in 1392 ms. Result :sat
Minimization took 202 ms.
[2023-03-10 23:11:23] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-10 23:11:23] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-10 23:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:23] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2023-03-10 23:11:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:11:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-10 23:11:23] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-10 23:11:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:23] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2023-03-10 23:11:23] [INFO ] Computed and/alt/rep : 184/892/184 causal constraints (skipped 683 transitions) in 75 ms.
[2023-03-10 23:11:24] [INFO ] Added : 35 causal constraints over 9 iterations in 726 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 892/892 transitions.
Graph (complete) has 2202 edges and 357 vertex of which 353 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 353 transition count 892
Applied a total of 5 rules in 28 ms. Remains 353 /357 variables (removed 4) and now considering 892/892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 353/357 places, 892/892 transitions.
// Phase 1: matrix 892 rows 353 cols
[2023-03-10 23:11:25] [INFO ] Computed 33 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 19584 resets, run finished after 1741 ms. (steps per millisecond=574 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5361 resets, run finished after 725 ms. (steps per millisecond=1379 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5449 resets, run finished after 643 ms. (steps per millisecond=1555 ) properties (out of 2) seen :0
[2023-03-10 23:11:28] [INFO ] Invariant cache hit.
[2023-03-10 23:11:28] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2023-03-10 23:11:28] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-10 23:11:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:28] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2023-03-10 23:11:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:11:28] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-10 23:11:28] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-10 23:11:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:29] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2023-03-10 23:11:29] [INFO ] Computed and/alt/rep : 184/890/184 causal constraints (skipped 683 transitions) in 65 ms.
[2023-03-10 23:11:29] [INFO ] Added : 16 causal constraints over 4 iterations in 464 ms. Result :sat
Minimization took 155 ms.
[2023-03-10 23:11:30] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2023-03-10 23:11:30] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 94 ms returned sat
[2023-03-10 23:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:30] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2023-03-10 23:11:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:11:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2023-03-10 23:11:30] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-10 23:11:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:30] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2023-03-10 23:11:31] [INFO ] Computed and/alt/rep : 184/890/184 causal constraints (skipped 683 transitions) in 70 ms.
[2023-03-10 23:11:31] [INFO ] Added : 40 causal constraints over 10 iterations in 822 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 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 892/892 transitions.
Applied a total of 0 rules in 12 ms. Remains 353 /353 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 353/353 places, 892/892 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 892/892 transitions.
Applied a total of 0 rules in 10 ms. Remains 353 /353 variables (removed 0) and now considering 892/892 (removed 0) transitions.
[2023-03-10 23:11:32] [INFO ] Invariant cache hit.
[2023-03-10 23:11:32] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-10 23:11:32] [INFO ] Invariant cache hit.
[2023-03-10 23:11:33] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
[2023-03-10 23:11:33] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-10 23:11:33] [INFO ] Invariant cache hit.
[2023-03-10 23:11:33] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1461 ms. Remains : 353/353 places, 892/892 transitions.
Starting property specific reduction for ASLink-PT-04b-UpperBounds-13
[2023-03-10 23:11:33] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 191 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-10 23:11:33] [INFO ] Invariant cache hit.
[2023-03-10 23:11:33] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-03-10 23:11:33] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-10 23:11:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:34] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2023-03-10 23:11:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:11:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2023-03-10 23:11:34] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-10 23:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:34] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2023-03-10 23:11:34] [INFO ] Computed and/alt/rep : 184/890/184 causal constraints (skipped 683 transitions) in 64 ms.
[2023-03-10 23:11:35] [INFO ] Added : 16 causal constraints over 4 iterations in 416 ms. Result :sat
Minimization took 108 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 892/892 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 353 transition count 891
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 352 transition count 891
Applied a total of 2 rules in 13 ms. Remains 352 /353 variables (removed 1) and now considering 891/892 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 352/353 places, 891/892 transitions.
// Phase 1: matrix 891 rows 352 cols
[2023-03-10 23:11:35] [INFO ] Computed 33 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 19579 resets, run finished after 1740 ms. (steps per millisecond=574 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5383 resets, run finished after 706 ms. (steps per millisecond=1416 ) properties (out of 1) seen :0
[2023-03-10 23:11:38] [INFO ] Invariant cache hit.
[2023-03-10 23:11:38] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-10 23:11:38] [INFO ] [Real]Absence check using 10 positive and 23 generalized place invariants in 15 ms returned sat
[2023-03-10 23:11:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:38] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2023-03-10 23:11:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:11:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-10 23:11:38] [INFO ] [Nat]Absence check using 10 positive and 23 generalized place invariants in 6 ms returned sat
[2023-03-10 23:11:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:38] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2023-03-10 23:11:38] [INFO ] Computed and/alt/rep : 183/889/183 causal constraints (skipped 683 transitions) in 61 ms.
[2023-03-10 23:11:39] [INFO ] Added : 11 causal constraints over 3 iterations in 314 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 891/891 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 352/352 places, 891/891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 891/891 transitions.
Applied a total of 0 rules in 10 ms. Remains 352 /352 variables (removed 0) and now considering 891/891 (removed 0) transitions.
[2023-03-10 23:11:39] [INFO ] Invariant cache hit.
[2023-03-10 23:11:39] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-10 23:11:39] [INFO ] Invariant cache hit.
[2023-03-10 23:11:40] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1047 ms to find 0 implicit places.
[2023-03-10 23:11:40] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-10 23:11:40] [INFO ] Invariant cache hit.
[2023-03-10 23:11:40] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1605 ms. Remains : 352/352 places, 891/891 transitions.
Ending property specific reduction for ASLink-PT-04b-UpperBounds-13 in 7198 ms.
Starting property specific reduction for ASLink-PT-04b-UpperBounds-14
// Phase 1: matrix 892 rows 353 cols
[2023-03-10 23:11:40] [INFO ] Computed 33 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 201 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-10 23:11:40] [INFO ] Invariant cache hit.
[2023-03-10 23:11:41] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-10 23:11:41] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-10 23:11:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:41] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2023-03-10 23:11:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:11:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-03-10 23:11:41] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-10 23:11:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:42] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2023-03-10 23:11:42] [INFO ] Computed and/alt/rep : 184/890/184 causal constraints (skipped 683 transitions) in 86 ms.
[2023-03-10 23:11:43] [INFO ] Added : 40 causal constraints over 10 iterations in 876 ms. Result :sat
Minimization took 139 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 892/892 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 353 transition count 891
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 352 transition count 891
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 352 transition count 890
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 351 transition count 890
Applied a total of 4 rules in 14 ms. Remains 351 /353 variables (removed 2) and now considering 890/892 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 351/353 places, 890/892 transitions.
// Phase 1: matrix 890 rows 351 cols
[2023-03-10 23:11:43] [INFO ] Computed 33 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 19705 resets, run finished after 1658 ms. (steps per millisecond=603 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5452 resets, run finished after 638 ms. (steps per millisecond=1567 ) properties (out of 1) seen :0
[2023-03-10 23:11:45] [INFO ] Invariant cache hit.
[2023-03-10 23:11:45] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-10 23:11:45] [INFO ] [Real]Absence check using 11 positive and 22 generalized place invariants in 26 ms returned sat
[2023-03-10 23:11:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:46] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2023-03-10 23:11:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:11:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-10 23:11:46] [INFO ] [Nat]Absence check using 11 positive and 22 generalized place invariants in 16 ms returned sat
[2023-03-10 23:11:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:11:46] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2023-03-10 23:11:46] [INFO ] Computed and/alt/rep : 182/888/182 causal constraints (skipped 683 transitions) in 100 ms.
[2023-03-10 23:11:46] [INFO ] Added : 14 causal constraints over 3 iterations in 344 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 890/890 transitions.
Applied a total of 0 rules in 10 ms. Remains 351 /351 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 351/351 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 890/890 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2023-03-10 23:11:47] [INFO ] Invariant cache hit.
[2023-03-10 23:11:47] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-10 23:11:47] [INFO ] Invariant cache hit.
[2023-03-10 23:11:48] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
[2023-03-10 23:11:48] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-10 23:11:48] [INFO ] Invariant cache hit.
[2023-03-10 23:11:48] [INFO ] Dead Transitions using invariants and state equation in 334 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1465 ms. Remains : 351/351 places, 890/890 transitions.
Ending property specific reduction for ASLink-PT-04b-UpperBounds-14 in 7899 ms.
[2023-03-10 23:11:49] [INFO ] Flatten gal took : 127 ms
[2023-03-10 23:11:49] [INFO ] Applying decomposition
[2023-03-10 23:11:49] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7533525374052280485.txt' '-o' '/tmp/graph7533525374052280485.bin' '-w' '/tmp/graph7533525374052280485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7533525374052280485.bin' '-l' '-1' '-v' '-w' '/tmp/graph7533525374052280485.weights' '-q' '0' '-e' '0.001'
[2023-03-10 23:11:49] [INFO ] Decomposing Gal with order
[2023-03-10 23:11:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 23:11:49] [INFO ] Removed a total of 1839 redundant transitions.
[2023-03-10 23:11:49] [INFO ] Flatten gal took : 124 ms
[2023-03-10 23:11:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 17 ms.
[2023-03-10 23:11:49] [INFO ] Time to serialize gal into /tmp/UpperBounds10875711905004869800.gal : 14 ms
[2023-03-10 23:11:49] [INFO ] Time to serialize properties into /tmp/UpperBounds8822431363151208147.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10875711905004869800.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8822431363151208147.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds8822431363151208147.prop.
Detected timeout of ITS tools.
[2023-03-10 23:32:34] [INFO ] Applying decomposition
[2023-03-10 23:32:34] [INFO ] Flatten gal took : 74 ms
[2023-03-10 23:32:34] [INFO ] Decomposing Gal with order
[2023-03-10 23:32:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 23:32:34] [INFO ] Removed a total of 1675 redundant transitions.
[2023-03-10 23:32:34] [INFO ] Flatten gal took : 86 ms
[2023-03-10 23:32:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 677 labels/synchronizations in 20 ms.
[2023-03-10 23:32:34] [INFO ] Time to serialize gal into /tmp/UpperBounds14378581192746435743.gal : 6 ms
[2023-03-10 23:32:34] [INFO ] Time to serialize properties into /tmp/UpperBounds765314318184844053.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14378581192746435743.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds765314318184844053.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds765314318184844053.prop.
Detected timeout of ITS tools.
[2023-03-10 23:53:18] [INFO ] Flatten gal took : 36 ms
[2023-03-10 23:53:18] [INFO ] Input system was already deterministic with 892 transitions.
[2023-03-10 23:53:18] [INFO ] Transformed 353 places.
[2023-03-10 23:53:18] [INFO ] Transformed 892 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2023-03-10 23:53:18] [INFO ] Time to serialize gal into /tmp/UpperBounds1396475652366346664.gal : 22 ms
[2023-03-10 23:53:18] [INFO ] Time to serialize properties into /tmp/UpperBounds9121984503243389590.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1396475652366346664.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9121984503243389590.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds9121984503243389590.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 150972 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16229984 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-04b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="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-5348"
echo " Executing tool itstools"
echo " Input is ASLink-PT-04b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813592600069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;