fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r010-tajo-165245701500025
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for ASLink-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16232.596 3600000.00 3678974.00 5562.10 1 1 1 1 1 1 1 1 1 1 ? 1 1 1 1 ? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r010-tajo-165245701500025.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 gold2021
Input is ASLink-PT-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701500025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 7.0K Apr 30 07:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 07:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 07:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 07:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 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 669K 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-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 1652727413520

Running Version 0
[2022-05-16 18:56:55] [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-16 18:56:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:56:55] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2022-05-16 18:56:55] [INFO ] Transformed 2034 places.
[2022-05-16 18:56:55] [INFO ] Transformed 2567 transitions.
[2022-05-16 18:56:55] [INFO ] Found NUPN structural information;
[2022-05-16 18:56:55] [INFO ] Parsed PT model containing 2034 places and 2567 transitions in 233 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 2567 rows 2034 cols
[2022-05-16 18:56:55] [INFO ] Computed 199 place invariants in 137 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :10
FORMULA ASLink-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-UpperBounds-05 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-02 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 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
// Phase 1: matrix 2567 rows 2034 cols
[2022-05-16 18:56:55] [INFO ] Computed 199 place invariants in 80 ms
[2022-05-16 18:56:56] [INFO ] [Real]Absence check using 48 positive place invariants in 42 ms returned sat
[2022-05-16 18:56:56] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 47 ms returned sat
[2022-05-16 18:56:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:57] [INFO ] [Real]Absence check using state equation in 1225 ms returned sat
[2022-05-16 18:56:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:58] [INFO ] [Nat]Absence check using 48 positive place invariants in 38 ms returned sat
[2022-05-16 18:56:58] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 46 ms returned sat
[2022-05-16 18:56:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:02] [INFO ] [Nat]Absence check using state equation in 4584 ms returned unknown
[2022-05-16 18:57:03] [INFO ] [Real]Absence check using 48 positive place invariants in 37 ms returned sat
[2022-05-16 18:57:03] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 98 ms returned sat
[2022-05-16 18:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:04] [INFO ] [Real]Absence check using state equation in 1198 ms returned sat
[2022-05-16 18:57:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:05] [INFO ] [Nat]Absence check using 48 positive place invariants in 43 ms returned sat
[2022-05-16 18:57:05] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 52 ms returned sat
[2022-05-16 18:57:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:07] [INFO ] [Nat]Absence check using state equation in 1903 ms returned sat
[2022-05-16 18:57:08] [INFO ] Deduced a trap composed of 34 places in 1024 ms of which 13 ms to minimize.
[2022-05-16 18:57:09] [INFO ] Deduced a trap composed of 26 places in 1050 ms of which 5 ms to minimize.
[2022-05-16 18:57:10] [INFO ] Deduced a trap composed of 248 places in 985 ms of which 2 ms to minimize.
[2022-05-16 18:57:10] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 18:57:10] [INFO ] [Real]Absence check using 48 positive place invariants in 53 ms returned sat
[2022-05-16 18:57:10] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 61 ms returned sat
[2022-05-16 18:57:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:11] [INFO ] [Real]Absence check using state equation in 1025 ms returned sat
[2022-05-16 18:57:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:12] [INFO ] [Nat]Absence check using 48 positive place invariants in 48 ms returned sat
[2022-05-16 18:57:12] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 69 ms returned sat
[2022-05-16 18:57:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:16] [INFO ] [Nat]Absence check using state equation in 4006 ms returned sat
[2022-05-16 18:57:17] [INFO ] Deduced a trap composed of 42 places in 655 ms of which 3 ms to minimize.
[2022-05-16 18:57:17] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 18:57:17] [INFO ] [Real]Absence check using 48 positive place invariants in 49 ms returned sat
[2022-05-16 18:57:17] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 82 ms returned sat
[2022-05-16 18:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:18] [INFO ] [Real]Absence check using state equation in 987 ms returned sat
[2022-05-16 18:57:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:19] [INFO ] [Nat]Absence check using 48 positive place invariants in 50 ms returned sat
[2022-05-16 18:57:19] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 76 ms returned sat
[2022-05-16 18:57:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:24] [INFO ] [Nat]Absence check using state equation in 4499 ms returned unknown
[2022-05-16 18:57:24] [INFO ] [Real]Absence check using 48 positive place invariants in 44 ms returned sat
[2022-05-16 18:57:24] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 56 ms returned sat
[2022-05-16 18:57:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:25] [INFO ] [Real]Absence check using state equation in 1290 ms returned sat
[2022-05-16 18:57:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:26] [INFO ] [Nat]Absence check using 48 positive place invariants in 49 ms returned sat
[2022-05-16 18:57:26] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 65 ms returned sat
[2022-05-16 18:57:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:30] [INFO ] [Nat]Absence check using state equation in 4521 ms returned unknown
[2022-05-16 18:57:31] [INFO ] [Real]Absence check using 48 positive place invariants in 47 ms returned sat
[2022-05-16 18:57:31] [INFO ] [Real]Absence check using 48 positive and 151 generalized place invariants in 74 ms returned sat
[2022-05-16 18:57:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:32] [INFO ] [Real]Absence check using state equation in 1278 ms returned sat
[2022-05-16 18:57:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:33] [INFO ] [Nat]Absence check using 48 positive place invariants in 50 ms returned sat
[2022-05-16 18:57:33] [INFO ] [Nat]Absence check using 48 positive and 151 generalized place invariants in 67 ms returned sat
[2022-05-16 18:57:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:37] [INFO ] [Nat]Absence check using state equation in 4525 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 2034 places. Attempting structural reductions.
Starting structural reductions, 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 467 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 467 Pre rules applied. Total rules applied 964 place count 1560 transition count 1610
Deduced a syphon composed of 467 places in 4 ms
Ensure Unique test removed 42 places
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 4 with 976 rules applied. Total rules applied 1940 place count 1051 transition count 1610
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 4 with 32 rules applied. Total rules applied 1972 place count 1046 transition count 1583
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 1999 place count 1019 transition count 1583
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 1999 place count 1019 transition count 1567
Deduced a syphon composed of 16 places in 8 ms
Ensure Unique test removed 16 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2047 place count 987 transition count 1567
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 2047 place count 987 transition count 1551
Deduced a syphon composed of 16 places in 8 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 2079 place count 971 transition count 1551
Discarding 64 places :
Symmetric choice reduction at 6 with 64 rule applications. Total rules 2143 place count 907 transition count 1487
Iterating global reduction 6 with 64 rules applied. Total rules applied 2207 place count 907 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 2208 place count 907 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 2208 place count 907 transition count 1464
Deduced a syphon composed of 22 places in 3 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 2253 place count 884 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 2253 place count 884 transition count 1463
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 2256 place count 882 transition count 1463
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2261 place count 877 transition count 1430
Iterating global reduction 7 with 5 rules applied. Total rules applied 2266 place count 877 transition count 1430
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 2266 place count 877 transition count 1427
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2272 place count 874 transition count 1427
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2273 place count 873 transition count 1419
Iterating global reduction 7 with 1 rules applied. Total rules applied 2274 place count 873 transition count 1419
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2275 place count 872 transition count 1411
Iterating global reduction 7 with 1 rules applied. Total rules applied 2276 place count 872 transition count 1411
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2277 place count 871 transition count 1403
Iterating global reduction 7 with 1 rules applied. Total rules applied 2278 place count 871 transition count 1403
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2279 place count 870 transition count 1395
Iterating global reduction 7 with 1 rules applied. Total rules applied 2280 place count 870 transition count 1395
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2281 place count 869 transition count 1387
Iterating global reduction 7 with 1 rules applied. Total rules applied 2282 place count 869 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2283 place count 868 transition count 1379
Iterating global reduction 7 with 1 rules applied. Total rules applied 2284 place count 868 transition count 1379
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2285 place count 867 transition count 1371
Iterating global reduction 7 with 1 rules applied. Total rules applied 2286 place count 867 transition count 1371
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2287 place count 866 transition count 1363
Iterating global reduction 7 with 1 rules applied. Total rules applied 2288 place count 866 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2289 place count 865 transition count 1355
Iterating global reduction 7 with 1 rules applied. Total rules applied 2290 place count 865 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2291 place count 864 transition count 1347
Iterating global reduction 7 with 1 rules applied. Total rules applied 2292 place count 864 transition count 1347
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2293 place count 863 transition count 1339
Iterating global reduction 7 with 1 rules applied. Total rules applied 2294 place count 863 transition count 1339
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2295 place count 862 transition count 1331
Iterating global reduction 7 with 1 rules applied. Total rules applied 2296 place count 862 transition count 1331
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2297 place count 861 transition count 1323
Iterating global reduction 7 with 1 rules applied. Total rules applied 2298 place count 861 transition count 1323
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2299 place count 860 transition count 1315
Iterating global reduction 7 with 1 rules applied. Total rules applied 2300 place count 860 transition count 1315
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2301 place count 859 transition count 1307
Iterating global reduction 7 with 1 rules applied. Total rules applied 2302 place count 859 transition count 1307
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2303 place count 858 transition count 1299
Iterating global reduction 7 with 1 rules applied. Total rules applied 2304 place count 858 transition count 1299
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 1 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 7 with 230 rules applied. Total rules applied 2534 place count 743 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2535 place count 742 transition count 1183
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 2537 place count 741 transition count 1183
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2538 place count 740 transition count 1182
Iterating global reduction 7 with 1 rules applied. Total rules applied 2539 place count 740 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 2541 place count 740 transition count 1180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2542 place count 739 transition count 1180
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 2544 place count 738 transition count 1189
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 2549 place count 738 transition count 1184
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2554 place count 733 transition count 1184
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 2558 place count 733 transition count 1180
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2562 place count 729 transition count 1180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2563 place count 728 transition count 1179
Reduce places removed 7 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 10 rules applied. Total rules applied 2573 place count 721 transition count 1176
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 2576 place count 718 transition count 1176
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 11 Pre rules applied. Total rules applied 2576 place count 718 transition count 1165
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 13 with 23 rules applied. Total rules applied 2599 place count 706 transition count 1165
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 13 with 5 rules applied. Total rules applied 2604 place count 701 transition count 1165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2604 place count 701 transition count 1164
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2606 place count 700 transition count 1164
Performed 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 14 with 16 rules applied. Total rules applied 2622 place count 692 transition count 1156
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 2625 place count 689 transition count 1153
Iterating global reduction 14 with 3 rules applied. Total rules applied 2628 place count 689 transition count 1153
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 2631 place count 689 transition count 1150
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 2634 place count 686 transition count 1150
Applied a total of 2634 rules in 1693 ms. Remains 686 /2034 variables (removed 1348) and now considering 1150/2567 (removed 1417) transitions.
Finished structural reductions, in 1 iterations. Remains : 686/2034 places, 1150/2567 transitions.
// Phase 1: matrix 1150 rows 686 cols
[2022-05-16 18:57:39] [INFO ] Computed 120 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 13134 resets, run finished after 2267 ms. (steps per millisecond=441 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2942 resets, run finished after 1037 ms. (steps per millisecond=964 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2984 resets, run finished after 1025 ms. (steps per millisecond=975 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2929 resets, run finished after 1045 ms. (steps per millisecond=956 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2953 resets, run finished after 1001 ms. (steps per millisecond=999 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2979 resets, run finished after 1004 ms. (steps per millisecond=996 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2966 resets, run finished after 1006 ms. (steps per millisecond=994 ) properties (out of 6) seen :0
// Phase 1: matrix 1150 rows 686 cols
[2022-05-16 18:57:48] [INFO ] Computed 120 place invariants in 46 ms
[2022-05-16 18:57:48] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2022-05-16 18:57:48] [INFO ] [Real]Absence check using 34 positive and 86 generalized place invariants in 22 ms returned sat
[2022-05-16 18:57:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:48] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2022-05-16 18:57:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-05-16 18:57:48] [INFO ] [Nat]Absence check using 34 positive and 86 generalized place invariants in 20 ms returned sat
[2022-05-16 18:57:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:49] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2022-05-16 18:57:49] [INFO ] Computed and/alt/rep : 450/1719/450 causal constraints (skipped 674 transitions) in 117 ms.
[2022-05-16 18:57:55] [INFO ] Added : 270 causal constraints over 54 iterations in 6324 ms. Result :sat
Minimization took 488 ms.
[2022-05-16 18:57:56] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-05-16 18:57:56] [INFO ] [Real]Absence check using 34 positive and 86 generalized place invariants in 21 ms returned sat
[2022-05-16 18:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:56] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2022-05-16 18:57:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:56] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-05-16 18:57:56] [INFO ] [Nat]Absence check using 34 positive and 86 generalized place invariants in 20 ms returned sat
[2022-05-16 18:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:57] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2022-05-16 18:57:57] [INFO ] Computed and/alt/rep : 450/1719/450 causal constraints (skipped 674 transitions) in 99 ms.
[2022-05-16 18:58:02] [INFO ] Added : 289 causal constraints over 58 iterations in 5512 ms. Result :sat
Minimization took 406 ms.
[2022-05-16 18:58:03] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2022-05-16 18:58:03] [INFO ] [Real]Absence check using 34 positive and 86 generalized place invariants in 21 ms returned sat
[2022-05-16 18:58:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:03] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2022-05-16 18:58:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:03] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2022-05-16 18:58:03] [INFO ] [Nat]Absence check using 34 positive and 86 generalized place invariants in 18 ms returned sat
[2022-05-16 18:58:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:04] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2022-05-16 18:58:04] [INFO ] Computed and/alt/rep : 450/1719/450 causal constraints (skipped 674 transitions) in 81 ms.
[2022-05-16 18:58:12] [INFO ] Added : 362 causal constraints over 73 iterations in 7755 ms. Result :sat
Minimization took 796 ms.
[2022-05-16 18:58:13] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2022-05-16 18:58:13] [INFO ] [Real]Absence check using 34 positive and 86 generalized place invariants in 20 ms returned sat
[2022-05-16 18:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:13] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2022-05-16 18:58:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:13] [INFO ] [Nat]Absence check using 34 positive place invariants in 13 ms returned sat
[2022-05-16 18:58:13] [INFO ] [Nat]Absence check using 34 positive and 86 generalized place invariants in 19 ms returned sat
[2022-05-16 18:58:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:13] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2022-05-16 18:58:14] [INFO ] Computed and/alt/rep : 450/1719/450 causal constraints (skipped 674 transitions) in 76 ms.
[2022-05-16 18:58:20] [INFO ] Added : 370 causal constraints over 74 iterations in 6464 ms. Result :sat
Minimization took 449 ms.
[2022-05-16 18:58:21] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-05-16 18:58:21] [INFO ] [Real]Absence check using 34 positive and 86 generalized place invariants in 21 ms returned sat
[2022-05-16 18:58:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:21] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2022-05-16 18:58:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2022-05-16 18:58:21] [INFO ] [Nat]Absence check using 34 positive and 86 generalized place invariants in 21 ms returned sat
[2022-05-16 18:58:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:22] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2022-05-16 18:58:22] [INFO ] Computed and/alt/rep : 450/1719/450 causal constraints (skipped 674 transitions) in 88 ms.
[2022-05-16 18:58:27] [INFO ] Added : 342 causal constraints over 69 iterations in 5004 ms. Result :sat
Minimization took 429 ms.
[2022-05-16 18:58:27] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-05-16 18:58:27] [INFO ] [Real]Absence check using 34 positive and 86 generalized place invariants in 22 ms returned sat
[2022-05-16 18:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:28] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2022-05-16 18:58:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2022-05-16 18:58:28] [INFO ] [Nat]Absence check using 34 positive and 86 generalized place invariants in 21 ms returned sat
[2022-05-16 18:58:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:28] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2022-05-16 18:58:29] [INFO ] Computed and/alt/rep : 450/1719/450 causal constraints (skipped 674 transitions) in 94 ms.
[2022-05-16 18:58:31] [INFO ] Added : 119 causal constraints over 24 iterations in 2845 ms. Result :sat
Minimization took 377 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 107300 steps, including 3051 resets, run finished after 413 ms. (steps per millisecond=259 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 112100 steps, including 1912 resets, run finished after 333 ms. (steps per millisecond=336 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 198600 steps, including 3290 resets, run finished after 532 ms. (steps per millisecond=373 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 161900 steps, including 1002 resets, run finished after 367 ms. (steps per millisecond=441 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 83900 steps, including 1722 resets, run finished after 208 ms. (steps per millisecond=403 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1209300 steps, including 15021 resets, run finished after 2951 ms. (steps per millisecond=409 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 6 out of 686 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 686/686 places, 1150/1150 transitions.
Applied a total of 0 rules in 18 ms. Remains 686 /686 variables (removed 0) and now considering 1150/1150 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 686/686 places, 1150/1150 transitions.
Starting structural reductions, iteration 0 : 686/686 places, 1150/1150 transitions.
Applied a total of 0 rules in 21 ms. Remains 686 /686 variables (removed 0) and now considering 1150/1150 (removed 0) transitions.
// Phase 1: matrix 1150 rows 686 cols
[2022-05-16 18:58:37] [INFO ] Computed 120 place invariants in 26 ms
[2022-05-16 18:58:37] [INFO ] Implicit Places using invariants in 650 ms returned [19, 20, 33, 50, 68, 143, 147, 156, 158, 159, 161, 178, 196, 270, 271, 282, 283, 285, 302, 320, 389, 393, 394, 405, 406, 408, 425, 443, 512, 516, 517, 520, 531, 532, 533, 551, 553, 557, 575, 576, 577, 578, 590, 596, 602, 608, 614, 620, 626, 632, 638, 644, 650]
Discarding 53 places :
Implicit Place search using SMT only with invariants took 655 ms to find 53 implicit places.
[2022-05-16 18:58:37] [INFO ] Redundant transitions in 81 ms returned []
// Phase 1: matrix 1150 rows 633 cols
[2022-05-16 18:58:37] [INFO ] Computed 67 place invariants in 27 ms
[2022-05-16 18:58:38] [INFO ] Dead Transitions using invariants and state equation in 533 ms returned []
Starting structural reductions, iteration 1 : 633/686 places, 1150/1150 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 633 transition count 1060
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 183 place count 543 transition count 1057
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 183 place count 543 transition count 1033
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 232 place count 518 transition count 1033
Discarding 5 places :
Implicit places reduction removed 5 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 13 rules applied. Total rules applied 245 place count 513 transition count 1025
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 253 place count 505 transition count 1025
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 268 place count 490 transition count 1010
Iterating global reduction 4 with 15 rules applied. Total rules applied 283 place count 490 transition count 1010
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 286 place count 490 transition count 1007
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 286 place count 490 transition count 1006
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 288 place count 489 transition count 1006
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 291 place count 486 transition count 1000
Iterating global reduction 5 with 3 rules applied. Total rules applied 294 place count 486 transition count 1000
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 295 place count 485 transition count 999
Iterating global reduction 5 with 1 rules applied. Total rules applied 296 place count 485 transition count 999
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 297 place count 484 transition count 997
Iterating global reduction 5 with 1 rules applied. Total rules applied 298 place count 484 transition count 997
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 366 place count 450 transition count 963
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 369 place count 447 transition count 960
Iterating global reduction 5 with 3 rules applied. Total rules applied 372 place count 447 transition count 960
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 375 place count 447 transition count 957
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 379 place count 445 transition count 958
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 380 place count 445 transition count 957
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 381 place count 444 transition count 957
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 392 place count 444 transition count 946
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 404 place count 432 transition count 946
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 405 place count 432 transition count 945
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 417 place count 432 transition count 945
Applied a total of 417 rules in 388 ms. Remains 432 /633 variables (removed 201) and now considering 945/1150 (removed 205) transitions.
// Phase 1: matrix 945 rows 432 cols
[2022-05-16 18:58:38] [INFO ] Computed 60 place invariants in 17 ms
[2022-05-16 18:58:39] [INFO ] Implicit Places using invariants in 295 ms returned [79, 96, 102, 105, 107, 110, 111, 182, 188, 191, 193, 200, 201, 253, 271, 277, 280, 282, 287, 288, 340, 357, 363, 366, 368]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 300 ms to find 25 implicit places.
Starting structural reductions, iteration 2 : 407/686 places, 945/1150 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 395 transition count 933
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 395 transition count 933
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 391 transition count 929
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 391 transition count 929
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 46 place count 384 transition count 922
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 58 place count 384 transition count 910
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 70 place count 372 transition count 910
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 372 transition count 907
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 76 place count 369 transition count 907
Applied a total of 76 rules in 71 ms. Remains 369 /407 variables (removed 38) and now considering 907/945 (removed 38) transitions.
// Phase 1: matrix 907 rows 369 cols
[2022-05-16 18:58:39] [INFO ] Computed 35 place invariants in 8 ms
[2022-05-16 18:58:39] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 907 rows 369 cols
[2022-05-16 18:58:39] [INFO ] Computed 35 place invariants in 12 ms
[2022-05-16 18:58:39] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 369/686 places, 907/1150 transitions.
Successfully produced net in file /tmp/petri1000_5440907963284624451.dot
Successfully produced net in file /tmp/petri1001_15189218766758593440.dot
Successfully produced net in file /tmp/petri1002_6934161307566386843.dot
Successfully produced net in file /tmp/petri1003_6063048917009207290.dot
Drop transitions removed 4 transitions
Dominated transitions for bounds rules discarded 4 transitions
// Phase 1: matrix 903 rows 369 cols
[2022-05-16 18:58:40] [INFO ] Computed 35 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 19574 resets, run finished after 2155 ms. (steps per millisecond=464 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5439 resets, run finished after 931 ms. (steps per millisecond=1074 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5521 resets, run finished after 845 ms. (steps per millisecond=1183 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5454 resets, run finished after 1025 ms. (steps per millisecond=975 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5399 resets, run finished after 878 ms. (steps per millisecond=1138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5381 resets, run finished after 815 ms. (steps per millisecond=1226 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5455 resets, run finished after 807 ms. (steps per millisecond=1239 ) properties (out of 6) seen :0
// Phase 1: matrix 903 rows 369 cols
[2022-05-16 18:58:47] [INFO ] Computed 35 place invariants in 19 ms
[2022-05-16 18:58:47] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-16 18:58:47] [INFO ] [Real]Absence check using 10 positive and 25 generalized place invariants in 5 ms returned sat
[2022-05-16 18:58:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:47] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2022-05-16 18:58:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-16 18:58:47] [INFO ] [Nat]Absence check using 10 positive and 25 generalized place invariants in 9 ms returned sat
[2022-05-16 18:58:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:48] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2022-05-16 18:58:48] [INFO ] Computed and/alt/rep : 195/925/195 causal constraints (skipped 683 transitions) in 93 ms.
[2022-05-16 18:58:48] [INFO ] Added : 30 causal constraints over 6 iterations in 544 ms. Result :sat
Minimization took 206 ms.
[2022-05-16 18:58:49] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-16 18:58:49] [INFO ] [Real]Absence check using 10 positive and 25 generalized place invariants in 9 ms returned sat
[2022-05-16 18:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:49] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2022-05-16 18:58:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-16 18:58:49] [INFO ] [Nat]Absence check using 10 positive and 25 generalized place invariants in 9 ms returned sat
[2022-05-16 18:58:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:49] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2022-05-16 18:58:49] [INFO ] Computed and/alt/rep : 195/925/195 causal constraints (skipped 683 transitions) in 69 ms.
[2022-05-16 18:58:50] [INFO ] Added : 18 causal constraints over 4 iterations in 442 ms. Result :sat
Minimization took 118 ms.
[2022-05-16 18:58:50] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-16 18:58:50] [INFO ] [Real]Absence check using 10 positive and 25 generalized place invariants in 9 ms returned sat
[2022-05-16 18:58:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:50] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2022-05-16 18:58:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-16 18:58:50] [INFO ] [Nat]Absence check using 10 positive and 25 generalized place invariants in 9 ms returned sat
[2022-05-16 18:58:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:51] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2022-05-16 18:58:51] [INFO ] Computed and/alt/rep : 195/925/195 causal constraints (skipped 683 transitions) in 51 ms.
[2022-05-16 18:58:51] [INFO ] Added : 18 causal constraints over 4 iterations in 291 ms. Result :sat
Minimization took 158 ms.
[2022-05-16 18:58:51] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-16 18:58:51] [INFO ] [Real]Absence check using 10 positive and 25 generalized place invariants in 9 ms returned sat
[2022-05-16 18:58:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:51] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2022-05-16 18:58:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-16 18:58:52] [INFO ] [Nat]Absence check using 10 positive and 25 generalized place invariants in 10 ms returned sat
[2022-05-16 18:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:52] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2022-05-16 18:58:52] [INFO ] Computed and/alt/rep : 195/925/195 causal constraints (skipped 683 transitions) in 56 ms.
[2022-05-16 18:58:52] [INFO ] Added : 15 causal constraints over 3 iterations in 272 ms. Result :sat
Minimization took 129 ms.
[2022-05-16 18:58:52] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-16 18:58:52] [INFO ] [Real]Absence check using 10 positive and 25 generalized place invariants in 9 ms returned sat
[2022-05-16 18:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:53] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2022-05-16 18:58:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-16 18:58:53] [INFO ] [Nat]Absence check using 10 positive and 25 generalized place invariants in 9 ms returned sat
[2022-05-16 18:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:53] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2022-05-16 18:58:53] [INFO ] Computed and/alt/rep : 195/925/195 causal constraints (skipped 683 transitions) in 58 ms.
[2022-05-16 18:58:54] [INFO ] Added : 37 causal constraints over 8 iterations in 621 ms. Result :sat
Minimization took 157 ms.
[2022-05-16 18:58:54] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-16 18:58:54] [INFO ] [Real]Absence check using 10 positive and 25 generalized place invariants in 8 ms returned sat
[2022-05-16 18:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:54] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2022-05-16 18:58:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-16 18:58:54] [INFO ] [Nat]Absence check using 10 positive and 25 generalized place invariants in 9 ms returned sat
[2022-05-16 18:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:55] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2022-05-16 18:58:55] [INFO ] Computed and/alt/rep : 195/925/195 causal constraints (skipped 683 transitions) in 74 ms.
[2022-05-16 18:58:55] [INFO ] Added : 42 causal constraints over 9 iterations in 651 ms. Result :sat
Minimization took 166 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 76400 steps, including 2774 resets, run finished after 129 ms. (steps per millisecond=592 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 72400 steps, including 1907 resets, run finished after 130 ms. (steps per millisecond=556 ) properties (out of 6) seen :2 could not realise parikh vector
FORMULA ASLink-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 56800 steps, including 1439 resets, run finished after 92 ms. (steps per millisecond=617 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA ASLink-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 42700 steps, including 1303 resets, run finished after 73 ms. (steps per millisecond=584 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 58700 steps, including 2509 resets, run finished after 89 ms. (steps per millisecond=659 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 77200 steps, including 2350 resets, run finished after 133 ms. (steps per millisecond=580 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 369 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 369/369 places, 903/903 transitions.
Graph (complete) has 2214 edges and 369 vertex of which 365 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 0 output 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 0 with 3 rules applied. Total rules applied 4 place count 365 transition count 900
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 362 transition count 900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 362 transition count 899
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 9 place count 361 transition count 899
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 360 transition count 898
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 360 transition count 898
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 360 transition count 897
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 360 transition count 897
Applied a total of 16 rules in 60 ms. Remains 360 /369 variables (removed 9) and now considering 897/903 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 360/369 places, 897/903 transitions.
// Phase 1: matrix 897 rows 360 cols
[2022-05-16 18:58:56] [INFO ] Computed 35 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 19857 resets, run finished after 2272 ms. (steps per millisecond=440 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5459 resets, run finished after 822 ms. (steps per millisecond=1216 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5435 resets, run finished after 780 ms. (steps per millisecond=1282 ) properties (out of 2) seen :0
// Phase 1: matrix 897 rows 360 cols
[2022-05-16 18:59:00] [INFO ] Computed 35 place invariants in 19 ms
[2022-05-16 18:59:00] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-16 18:59:00] [INFO ] [Real]Absence check using 9 positive and 26 generalized place invariants in 9 ms returned sat
[2022-05-16 18:59:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:00] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2022-05-16 18:59:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-16 18:59:00] [INFO ] [Nat]Absence check using 9 positive and 26 generalized place invariants in 8 ms returned sat
[2022-05-16 18:59:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:01] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2022-05-16 18:59:01] [INFO ] Computed and/alt/rep : 196/970/196 causal constraints (skipped 676 transitions) in 64 ms.
[2022-05-16 18:59:01] [INFO ] Added : 40 causal constraints over 9 iterations in 632 ms. Result :sat
Minimization took 154 ms.
[2022-05-16 18:59:02] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-16 18:59:02] [INFO ] [Real]Absence check using 9 positive and 26 generalized place invariants in 10 ms returned sat
[2022-05-16 18:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:02] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2022-05-16 18:59:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-16 18:59:02] [INFO ] [Nat]Absence check using 9 positive and 26 generalized place invariants in 7 ms returned sat
[2022-05-16 18:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:03] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2022-05-16 18:59:03] [INFO ] Computed and/alt/rep : 196/970/196 causal constraints (skipped 676 transitions) in 69 ms.
[2022-05-16 18:59:03] [INFO ] Added : 29 causal constraints over 6 iterations in 560 ms. Result :sat
Minimization took 215 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 85800 steps, including 3893 resets, run finished after 257 ms. (steps per millisecond=333 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 72200 steps, including 1003 resets, run finished after 183 ms. (steps per millisecond=394 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 360/360 places, 897/897 transitions.
Applied a total of 0 rules in 15 ms. Remains 360 /360 variables (removed 0) and now considering 897/897 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 360/360 places, 897/897 transitions.
Starting structural reductions, iteration 0 : 360/360 places, 897/897 transitions.
Applied a total of 0 rules in 14 ms. Remains 360 /360 variables (removed 0) and now considering 897/897 (removed 0) transitions.
// Phase 1: matrix 897 rows 360 cols
[2022-05-16 18:59:04] [INFO ] Computed 35 place invariants in 18 ms
[2022-05-16 18:59:04] [INFO ] Implicit Places using invariants in 272 ms returned [1, 144]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 275 ms to find 2 implicit places.
[2022-05-16 18:59:04] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 897 rows 358 cols
[2022-05-16 18:59:04] [INFO ] Computed 33 place invariants in 18 ms
[2022-05-16 18:59:05] [INFO ] Dead Transitions using invariants and state equation in 368 ms returned []
Starting structural reductions, iteration 1 : 358/360 places, 897/897 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 358 transition count 895
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 356 transition count 895
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 354 transition count 893
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 354 transition count 892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 353 transition count 892
Applied a total of 10 rules in 79 ms. Remains 353 /358 variables (removed 5) and now considering 892/897 (removed 5) transitions.
// Phase 1: matrix 892 rows 353 cols
[2022-05-16 18:59:05] [INFO ] Computed 33 place invariants in 7 ms
[2022-05-16 18:59:05] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 892 rows 353 cols
[2022-05-16 18:59:05] [INFO ] Computed 33 place invariants in 16 ms
[2022-05-16 18:59:06] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 353/360 places, 892/897 transitions.
// Phase 1: matrix 892 rows 353 cols
[2022-05-16 18:59:06] [INFO ] Computed 33 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 19567 resets, run finished after 2021 ms. (steps per millisecond=494 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5425 resets, run finished after 718 ms. (steps per millisecond=1392 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5404 resets, run finished after 714 ms. (steps per millisecond=1400 ) properties (out of 2) seen :0
// Phase 1: matrix 892 rows 353 cols
[2022-05-16 18:59:09] [INFO ] Computed 33 place invariants in 18 ms
[2022-05-16 18:59:09] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-16 18:59:09] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-16 18:59:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:09] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2022-05-16 18:59:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2022-05-16 18:59:09] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-16 18:59:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:10] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2022-05-16 18:59:10] [INFO ] Computed and/alt/rep : 184/890/184 causal constraints (skipped 683 transitions) in 74 ms.
[2022-05-16 18:59:10] [INFO ] Added : 19 causal constraints over 4 iterations in 460 ms. Result :sat
Minimization took 230 ms.
[2022-05-16 18:59:11] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-16 18:59:11] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 10 ms returned sat
[2022-05-16 18:59:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:11] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2022-05-16 18:59:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-16 18:59:11] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 10 ms returned sat
[2022-05-16 18:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:11] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2022-05-16 18:59:11] [INFO ] Computed and/alt/rep : 184/890/184 causal constraints (skipped 683 transitions) in 61 ms.
[2022-05-16 18:59:12] [INFO ] Added : 41 causal constraints over 9 iterations in 638 ms. Result :sat
Minimization took 341 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 120100 steps, including 2033 resets, run finished after 292 ms. (steps per millisecond=411 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 58700 steps, including 2705 resets, run finished after 121 ms. (steps per millisecond=485 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions, 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 1 iterations. Remains : 353/353 places, 892/892 transitions.
Starting structural reductions, 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.
// Phase 1: matrix 892 rows 353 cols
[2022-05-16 18:59:13] [INFO ] Computed 33 place invariants in 19 ms
[2022-05-16 18:59:13] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 892 rows 353 cols
[2022-05-16 18:59:13] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-16 18:59:14] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
[2022-05-16 18:59:14] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 892 rows 353 cols
[2022-05-16 18:59:14] [INFO ] Computed 33 place invariants in 16 ms
[2022-05-16 18:59:14] [INFO ] Dead Transitions using invariants and state equation in 398 ms returned []
Finished structural reductions, in 1 iterations. Remains : 353/353 places, 892/892 transitions.
Starting property specific reduction for ASLink-PT-04b-UpperBounds-10
// Phase 1: matrix 892 rows 353 cols
[2022-05-16 18:59:14] [INFO ] Computed 33 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 196 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 892 rows 353 cols
[2022-05-16 18:59:14] [INFO ] Computed 33 place invariants in 13 ms
[2022-05-16 18:59:14] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-16 18:59:14] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 10 ms returned sat
[2022-05-16 18:59:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:14] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2022-05-16 18:59:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2022-05-16 18:59:15] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 10 ms returned sat
[2022-05-16 18:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:15] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2022-05-16 18:59:15] [INFO ] Computed and/alt/rep : 184/890/184 causal constraints (skipped 683 transitions) in 64 ms.
[2022-05-16 18:59:15] [INFO ] Added : 19 causal constraints over 4 iterations in 446 ms. Result :sat
Minimization took 237 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Incomplete Parikh walk after 58700 steps, including 2722 resets, run finished after 144 ms. (steps per millisecond=407 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 353 places. Attempting structural reductions.
Starting structural reductions, 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 18 ms. Remains 351 /353 variables (removed 2) and now considering 890/892 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/353 places, 890/892 transitions.
// Phase 1: matrix 890 rows 351 cols
[2022-05-16 18:59:16] [INFO ] Computed 33 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 19492 resets, run finished after 1895 ms. (steps per millisecond=527 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5459 resets, run finished after 718 ms. (steps per millisecond=1392 ) properties (out of 1) seen :0
// Phase 1: matrix 890 rows 351 cols
[2022-05-16 18:59:18] [INFO ] Computed 33 place invariants in 18 ms
[2022-05-16 18:59:18] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-16 18:59:18] [INFO ] [Real]Absence check using 11 positive and 22 generalized place invariants in 9 ms returned sat
[2022-05-16 18:59:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:19] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2022-05-16 18:59:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-16 18:59:19] [INFO ] [Nat]Absence check using 11 positive and 22 generalized place invariants in 8 ms returned sat
[2022-05-16 18:59:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:19] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2022-05-16 18:59:19] [INFO ] Computed and/alt/rep : 182/888/182 causal constraints (skipped 683 transitions) in 61 ms.
[2022-05-16 18:59:20] [INFO ] Added : 51 causal constraints over 11 iterations in 720 ms. Result :sat
Minimization took 196 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Incomplete Parikh walk after 77000 steps, including 2061 resets, run finished after 171 ms. (steps per millisecond=450 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 351/351 places, 890/890 transitions.
Applied a total of 0 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 890/890 transitions.
Starting structural reductions, iteration 0 : 351/351 places, 890/890 transitions.
Applied a total of 0 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 890/890 (removed 0) transitions.
// Phase 1: matrix 890 rows 351 cols
[2022-05-16 18:59:20] [INFO ] Computed 33 place invariants in 16 ms
[2022-05-16 18:59:20] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 890 rows 351 cols
[2022-05-16 18:59:21] [INFO ] Computed 33 place invariants in 21 ms
[2022-05-16 18:59:21] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
[2022-05-16 18:59:21] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 890 rows 351 cols
[2022-05-16 18:59:21] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-16 18:59:22] [INFO ] Dead Transitions using invariants and state equation in 387 ms returned []
Finished structural reductions, in 1 iterations. Remains : 351/351 places, 890/890 transitions.
Ending property specific reduction for ASLink-PT-04b-UpperBounds-10 in 7502 ms.
Starting property specific reduction for ASLink-PT-04b-UpperBounds-15
// Phase 1: matrix 892 rows 353 cols
[2022-05-16 18:59:22] [INFO ] Computed 33 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 220 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 55 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 892 rows 353 cols
[2022-05-16 18:59:22] [INFO ] Computed 33 place invariants in 6 ms
[2022-05-16 18:59:22] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-16 18:59:22] [INFO ] [Real]Absence check using 9 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-16 18:59:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:22] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2022-05-16 18:59:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-16 18:59:22] [INFO ] [Nat]Absence check using 9 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-16 18:59:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:22] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2022-05-16 18:59:22] [INFO ] Computed and/alt/rep : 184/890/184 causal constraints (skipped 683 transitions) in 54 ms.
[2022-05-16 18:59:23] [INFO ] Added : 41 causal constraints over 9 iterations in 611 ms. Result :sat
Minimization took 297 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 120100 steps, including 2030 resets, run finished after 269 ms. (steps per millisecond=446 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 353 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 353/353 places, 892/892 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 353 transition count 891
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 352 transition count 891
Applied a total of 2 rules in 14 ms. Remains 352 /353 variables (removed 1) and now considering 891/892 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 352/353 places, 891/892 transitions.
// Phase 1: matrix 891 rows 352 cols
[2022-05-16 18:59:24] [INFO ] Computed 33 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 19640 resets, run finished after 1762 ms. (steps per millisecond=567 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5447 resets, run finished after 659 ms. (steps per millisecond=1517 ) properties (out of 1) seen :0
// Phase 1: matrix 891 rows 352 cols
[2022-05-16 18:59:26] [INFO ] Computed 33 place invariants in 19 ms
[2022-05-16 18:59:26] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-16 18:59:26] [INFO ] [Real]Absence check using 10 positive and 23 generalized place invariants in 10 ms returned sat
[2022-05-16 18:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:26] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2022-05-16 18:59:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2022-05-16 18:59:26] [INFO ] [Nat]Absence check using 10 positive and 23 generalized place invariants in 10 ms returned sat
[2022-05-16 18:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:27] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2022-05-16 18:59:27] [INFO ] Computed and/alt/rep : 183/889/183 causal constraints (skipped 683 transitions) in 69 ms.
[2022-05-16 18:59:28] [INFO ] Added : 51 causal constraints over 11 iterations in 913 ms. Result :sat
Minimization took 296 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 126000 steps, including 3236 resets, run finished after 336 ms. (steps per millisecond=375 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 352/352 places, 891/891 transitions.
Applied a total of 0 rules in 13 ms. Remains 352 /352 variables (removed 0) and now considering 891/891 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 352/352 places, 891/891 transitions.
Starting structural reductions, iteration 0 : 352/352 places, 891/891 transitions.
Applied a total of 0 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 891/891 (removed 0) transitions.
// Phase 1: matrix 891 rows 352 cols
[2022-05-16 18:59:28] [INFO ] Computed 33 place invariants in 17 ms
[2022-05-16 18:59:29] [INFO ] Implicit Places using invariants in 281 ms returned []
// Phase 1: matrix 891 rows 352 cols
[2022-05-16 18:59:29] [INFO ] Computed 33 place invariants in 7 ms
[2022-05-16 18:59:29] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
[2022-05-16 18:59:29] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 891 rows 352 cols
[2022-05-16 18:59:29] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-16 18:59:30] [INFO ] Dead Transitions using invariants and state equation in 392 ms returned []
Finished structural reductions, in 1 iterations. Remains : 352/352 places, 891/891 transitions.
Ending property specific reduction for ASLink-PT-04b-UpperBounds-15 in 8208 ms.
[2022-05-16 18:59:30] [INFO ] Flatten gal took : 126 ms
[2022-05-16 18:59:30] [INFO ] Applying decomposition
[2022-05-16 18:59:30] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5270855124472800401.txt, -o, /tmp/graph5270855124472800401.bin, -w, /tmp/graph5270855124472800401.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5270855124472800401.bin, -l, -1, -v, -w, /tmp/graph5270855124472800401.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 18:59:30] [INFO ] Decomposing Gal with order
[2022-05-16 18:59:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 18:59:31] [INFO ] Removed a total of 1737 redundant transitions.
[2022-05-16 18:59:31] [INFO ] Flatten gal took : 113 ms
[2022-05-16 18:59:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 19 ms.
[2022-05-16 18:59:31] [INFO ] Time to serialize gal into /tmp/UpperBounds15525194821619952383.gal : 11 ms
[2022-05-16 18:59:31] [INFO ] Time to serialize properties into /tmp/UpperBounds3179385208046539905.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds15525194821619952383.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3179385208046539905.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds15525194821619952383.gal -t CGAL -reachable-file /tmp/UpperBounds3179385208046539905.prop --nowitness
Loading property file /tmp/UpperBounds3179385208046539905.prop.
Detected timeout of ITS tools.
[2022-05-16 19:20:22] [INFO ] Applying decomposition
[2022-05-16 19:20:22] [INFO ] Flatten gal took : 87 ms
[2022-05-16 19:20:22] [INFO ] Decomposing Gal with order
[2022-05-16 19:20:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 19:20:22] [INFO ] Removed a total of 1674 redundant transitions.
[2022-05-16 19:20:22] [INFO ] Flatten gal took : 104 ms
[2022-05-16 19:20:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 682 labels/synchronizations in 18 ms.
[2022-05-16 19:20:22] [INFO ] Time to serialize gal into /tmp/UpperBounds7900979501734751630.gal : 3 ms
[2022-05-16 19:20:22] [INFO ] Time to serialize properties into /tmp/UpperBounds5354985519487035843.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds7900979501734751630.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds5354985519487035843.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds7900979501734751630.gal -t CGAL -reachable-file /tmp/UpperBounds5354985519487035843.prop --nowitness
Loading property file /tmp/UpperBounds5354985519487035843.prop.
Detected timeout of ITS tools.
[2022-05-16 19:41:14] [INFO ] Flatten gal took : 72 ms
[2022-05-16 19:41:14] [INFO ] Input system was already deterministic with 892 transitions.
[2022-05-16 19:41:14] [INFO ] Transformed 353 places.
[2022-05-16 19:41:14] [INFO ] Transformed 892 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 19:41:14] [INFO ] Time to serialize gal into /tmp/UpperBounds7251623420413164229.gal : 5 ms
[2022-05-16 19:41:14] [INFO ] Time to serialize properties into /tmp/UpperBounds3424579751261656541.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds7251623420413164229.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3424579751261656541.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds7251623420413164229.gal -t CGAL -reachable-file /tmp/UpperBounds3424579751261656541.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds3424579751261656541.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="gold2021"
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 gold2021"
echo " Input is ASLink-PT-04b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-tajo-165245701500025"
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 ;