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-165245701500019.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-03b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701500019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 6.0K Apr 30 07:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 30 07:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 30 07:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 07:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 06:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 06:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 06:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 06:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 06:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 06:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 544K May 10 09:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652727397010

Running Version 0
[2022-05-16 18:56:38] [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:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:56:38] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2022-05-16 18:56:38] [INFO ] Transformed 1638 places.
[2022-05-16 18:56:38] [INFO ] Transformed 2094 transitions.
[2022-05-16 18:56:38] [INFO ] Found NUPN structural information;
[2022-05-16 18:56:38] [INFO ] Parsed PT model containing 1638 places and 2094 transitions in 183 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 2094 rows 1638 cols
[2022-05-16 18:56:39] [INFO ] Computed 160 place invariants in 158 ms
Incomplete random walk after 10000 steps, including 32 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :7
FORMULA ASLink-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :1
FORMULA ASLink-PT-03b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :2
FORMULA ASLink-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2094 rows 1638 cols
[2022-05-16 18:56:39] [INFO ] Computed 160 place invariants in 36 ms
[2022-05-16 18:56:39] [INFO ] [Real]Absence check using 37 positive place invariants in 33 ms returned sat
[2022-05-16 18:56:39] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 40 ms returned sat
[2022-05-16 18:56:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:40] [INFO ] [Real]Absence check using state equation in 746 ms returned sat
[2022-05-16 18:56:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:41] [INFO ] [Nat]Absence check using 37 positive place invariants in 30 ms returned sat
[2022-05-16 18:56:41] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 36 ms returned sat
[2022-05-16 18:56:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:44] [INFO ] [Nat]Absence check using state equation in 3237 ms returned sat
[2022-05-16 18:56:44] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 4 ms to minimize.
[2022-05-16 18:56:44] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 2 ms to minimize.
[2022-05-16 18:56:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 805 ms
[2022-05-16 18:56:45] [INFO ] Computed and/alt/rep : 1742/3856/1742 causal constraints (skipped 351 transitions) in 133 ms.
[2022-05-16 18:56:45] [INFO ] Added : 15 causal constraints over 3 iterations in 649 ms. Result :unknown
[2022-05-16 18:56:46] [INFO ] [Real]Absence check using 37 positive place invariants in 43 ms returned sat
[2022-05-16 18:56:46] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 47 ms returned sat
[2022-05-16 18:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:46] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2022-05-16 18:56:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:47] [INFO ] [Nat]Absence check using 37 positive place invariants in 31 ms returned sat
[2022-05-16 18:56:47] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 42 ms returned sat
[2022-05-16 18:56:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:50] [INFO ] [Nat]Absence check using state equation in 3078 ms returned sat
[2022-05-16 18:56:51] [INFO ] Deduced a trap composed of 26 places in 655 ms of which 1 ms to minimize.
[2022-05-16 18:56:51] [INFO ] Deduced a trap composed of 84 places in 736 ms of which 3 ms to minimize.
[2022-05-16 18:56:52] [INFO ] Deduced a trap composed of 22 places in 747 ms of which 3 ms to minimize.
[2022-05-16 18:56:52] [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:56:53] [INFO ] [Real]Absence check using 37 positive place invariants in 26 ms returned sat
[2022-05-16 18:56:53] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 39 ms returned sat
[2022-05-16 18:56:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:54] [INFO ] [Real]Absence check using state equation in 965 ms returned sat
[2022-05-16 18:56:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:54] [INFO ] [Nat]Absence check using 37 positive place invariants in 168 ms returned sat
[2022-05-16 18:56:54] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 48 ms returned sat
[2022-05-16 18:56:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:59] [INFO ] [Nat]Absence check using state equation in 4551 ms returned unknown
[2022-05-16 18:56:59] [INFO ] [Real]Absence check using 37 positive place invariants in 27 ms returned sat
[2022-05-16 18:56:59] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 38 ms returned sat
[2022-05-16 18:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:00] [INFO ] [Real]Absence check using state equation in 845 ms returned sat
[2022-05-16 18:57:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:00] [INFO ] [Nat]Absence check using 37 positive place invariants in 35 ms returned sat
[2022-05-16 18:57:00] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 43 ms returned sat
[2022-05-16 18:57:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:03] [INFO ] [Nat]Absence check using state equation in 3030 ms returned sat
[2022-05-16 18:57:04] [INFO ] Deduced a trap composed of 52 places in 652 ms of which 1 ms to minimize.
[2022-05-16 18:57:05] [INFO ] Deduced a trap composed of 39 places in 598 ms of which 2 ms to minimize.
[2022-05-16 18:57:05] [INFO ] Deduced a trap composed of 45 places in 548 ms of which 2 ms to minimize.
[2022-05-16 18:57:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:06] [INFO ] [Real]Absence check using 37 positive place invariants in 35 ms returned sat
[2022-05-16 18:57:06] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 48 ms returned sat
[2022-05-16 18:57:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:07] [INFO ] [Real]Absence check using state equation in 822 ms returned sat
[2022-05-16 18:57:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:07] [INFO ] [Nat]Absence check using 37 positive place invariants in 36 ms returned sat
[2022-05-16 18:57:07] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 48 ms returned sat
[2022-05-16 18:57:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:08] [INFO ] [Nat]Absence check using state equation in 1340 ms returned sat
[2022-05-16 18:57:09] [INFO ] Deduced a trap composed of 71 places in 700 ms of which 2 ms to minimize.
[2022-05-16 18:57:10] [INFO ] Deduced a trap composed of 64 places in 512 ms of which 1 ms to minimize.
[2022-05-16 18:57:10] [INFO ] Deduced a trap composed of 132 places in 464 ms of which 1 ms to minimize.
[2022-05-16 18:57:11] [INFO ] Deduced a trap composed of 58 places in 529 ms of which 1 ms to minimize.
[2022-05-16 18:57:11] [INFO ] Deduced a trap composed of 86 places in 398 ms of which 1 ms to minimize.
[2022-05-16 18:57:12] [INFO ] Deduced a trap composed of 68 places in 405 ms of which 1 ms to minimize.
[2022-05-16 18:57:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:12] [INFO ] [Real]Absence check using 37 positive place invariants in 36 ms returned sat
[2022-05-16 18:57:12] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 51 ms returned sat
[2022-05-16 18:57:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:13] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2022-05-16 18:57:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:14] [INFO ] [Nat]Absence check using 37 positive place invariants in 29 ms returned sat
[2022-05-16 18:57:14] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 38 ms returned sat
[2022-05-16 18:57:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:15] [INFO ] [Nat]Absence check using state equation in 1636 ms returned sat
[2022-05-16 18:57:16] [INFO ] Deduced a trap composed of 44 places in 593 ms of which 2 ms to minimize.
[2022-05-16 18:57:17] [INFO ] Deduced a trap composed of 50 places in 531 ms of which 1 ms to minimize.
[2022-05-16 18:57:17] [INFO ] Deduced a trap composed of 92 places in 611 ms of which 1 ms to minimize.
[2022-05-16 18:57:18] [INFO ] Deduced a trap composed of 114 places in 388 ms of which 1 ms to minimize.
[2022-05-16 18:57:18] [INFO ] Deduced a trap composed of 114 places in 385 ms of which 1 ms to minimize.
[2022-05-16 18:57:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3075 ms
[2022-05-16 18:57:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:671)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
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)
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 159600 steps, including 1002 resets, run finished after 593 ms. (steps per millisecond=269 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 6 out of 1638 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions removed 370 transitions
Trivial Post-agglo rules discarded 370 transitions
Performed 370 trivial Post agglomeration. Transition count delta: 370
Iterating post reduction 0 with 370 rules applied. Total rules applied 370 place count 1638 transition count 1724
Reduce places removed 370 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 388 rules applied. Total rules applied 758 place count 1268 transition count 1706
Reduce places removed 5 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 9 rules applied. Total rules applied 767 place count 1263 transition count 1702
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 771 place count 1259 transition count 1702
Performed 374 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 374 Pre rules applied. Total rules applied 771 place count 1259 transition count 1328
Deduced a syphon composed of 374 places in 4 ms
Ensure Unique test removed 32 places
Reduce places removed 406 places and 0 transitions.
Iterating global reduction 4 with 780 rules applied. Total rules applied 1551 place count 853 transition count 1328
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 25 rules applied. Total rules applied 1576 place count 850 transition count 1306
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1598 place count 828 transition count 1306
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1598 place count 828 transition count 1295
Deduced a syphon composed of 11 places in 6 ms
Ensure Unique test removed 11 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 33 rules applied. Total rules applied 1631 place count 806 transition count 1295
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 1631 place count 806 transition count 1284
Deduced a syphon composed of 11 places in 6 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 1653 place count 795 transition count 1284
Discarding 51 places :
Symmetric choice reduction at 6 with 51 rule applications. Total rules 1704 place count 744 transition count 1233
Iterating global reduction 6 with 51 rules applied. Total rules applied 1755 place count 744 transition count 1233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1756 place count 744 transition count 1232
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 18 Pre rules applied. Total rules applied 1756 place count 744 transition count 1214
Deduced a syphon composed of 18 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 37 rules applied. Total rules applied 1793 place count 725 transition count 1214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1793 place count 725 transition count 1213
Deduced a syphon composed of 1 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 1796 place count 723 transition count 1213
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1800 place count 719 transition count 1186
Iterating global reduction 7 with 4 rules applied. Total rules applied 1804 place count 719 transition count 1186
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 1804 place count 719 transition count 1183
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1810 place count 716 transition count 1183
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1811 place count 715 transition count 1175
Iterating global reduction 7 with 1 rules applied. Total rules applied 1812 place count 715 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1813 place count 714 transition count 1167
Iterating global reduction 7 with 1 rules applied. Total rules applied 1814 place count 714 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1815 place count 713 transition count 1159
Iterating global reduction 7 with 1 rules applied. Total rules applied 1816 place count 713 transition count 1159
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1817 place count 712 transition count 1151
Iterating global reduction 7 with 1 rules applied. Total rules applied 1818 place count 712 transition count 1151
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1819 place count 711 transition count 1143
Iterating global reduction 7 with 1 rules applied. Total rules applied 1820 place count 711 transition count 1143
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1821 place count 710 transition count 1135
Iterating global reduction 7 with 1 rules applied. Total rules applied 1822 place count 710 transition count 1135
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1823 place count 709 transition count 1127
Iterating global reduction 7 with 1 rules applied. Total rules applied 1824 place count 709 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1825 place count 708 transition count 1119
Iterating global reduction 7 with 1 rules applied. Total rules applied 1826 place count 708 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1827 place count 707 transition count 1111
Iterating global reduction 7 with 1 rules applied. Total rules applied 1828 place count 707 transition count 1111
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1829 place count 706 transition count 1103
Iterating global reduction 7 with 1 rules applied. Total rules applied 1830 place count 706 transition count 1103
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1831 place count 705 transition count 1095
Iterating global reduction 7 with 1 rules applied. Total rules applied 1832 place count 705 transition count 1095
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1833 place count 704 transition count 1087
Iterating global reduction 7 with 1 rules applied. Total rules applied 1834 place count 704 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1835 place count 703 transition count 1079
Iterating global reduction 7 with 1 rules applied. Total rules applied 1836 place count 703 transition count 1079
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1837 place count 702 transition count 1071
Iterating global reduction 7 with 1 rules applied. Total rules applied 1838 place count 702 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1839 place count 701 transition count 1063
Iterating global reduction 7 with 1 rules applied. Total rules applied 1840 place count 701 transition count 1063
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1841 place count 700 transition count 1055
Iterating global reduction 7 with 1 rules applied. Total rules applied 1842 place count 700 transition count 1055
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 2 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 7 with 182 rules applied. Total rules applied 2024 place count 609 transition count 964
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2025 place count 608 transition count 963
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 2027 place count 607 transition count 963
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2028 place count 606 transition count 962
Iterating global reduction 7 with 1 rules applied. Total rules applied 2029 place count 606 transition count 962
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 2031 place count 606 transition count 960
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2032 place count 605 transition count 960
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 2034 place count 604 transition count 969
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2038 place count 604 transition count 965
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2042 place count 600 transition count 965
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2044 place count 600 transition count 963
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 2046 place count 598 transition count 963
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2047 place count 597 transition count 962
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 11 with 9 rules applied. Total rules applied 2056 place count 591 transition count 959
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 2059 place count 588 transition count 959
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 9 Pre rules applied. Total rules applied 2059 place count 588 transition count 950
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 13 with 19 rules applied. Total rules applied 2078 place count 578 transition count 950
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 13 with 4 rules applied. Total rules applied 2082 place count 574 transition count 950
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2082 place count 574 transition count 949
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2084 place count 573 transition count 949
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 14 with 14 rules applied. Total rules applied 2098 place count 566 transition count 942
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 2101 place count 563 transition count 939
Iterating global reduction 14 with 3 rules applied. Total rules applied 2104 place count 563 transition count 939
Free-agglomeration rule applied 3 times.
Iterating global reduction 14 with 3 rules applied. Total rules applied 2107 place count 563 transition count 936
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 2110 place count 560 transition count 936
Applied a total of 2110 rules in 1265 ms. Remains 560 /1638 variables (removed 1078) and now considering 936/2094 (removed 1158) transitions.
Finished structural reductions, in 1 iterations. Remains : 560/1638 places, 936/2094 transitions.
// Phase 1: matrix 936 rows 560 cols
[2022-05-16 18:57:20] [INFO ] Computed 100 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 14108 resets, run finished after 1913 ms. (steps per millisecond=522 ) properties (out of 6) seen :2
FORMULA ASLink-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3905 resets, run finished after 1157 ms. (steps per millisecond=864 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3854 resets, run finished after 1063 ms. (steps per millisecond=940 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3874 resets, run finished after 1070 ms. (steps per millisecond=934 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3850 resets, run finished after 1053 ms. (steps per millisecond=949 ) properties (out of 4) seen :0
// Phase 1: matrix 936 rows 560 cols
[2022-05-16 18:57:27] [INFO ] Computed 100 place invariants in 28 ms
[2022-05-16 18:57:27] [INFO ] [Real]Absence check using 25 positive place invariants in 12 ms returned sat
[2022-05-16 18:57:27] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 18 ms returned sat
[2022-05-16 18:57:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:27] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2022-05-16 18:57:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:27] [INFO ] [Nat]Absence check using 25 positive place invariants in 12 ms returned sat
[2022-05-16 18:57:27] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 18 ms returned sat
[2022-05-16 18:57:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:28] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2022-05-16 18:57:28] [INFO ] Computed and/alt/rep : 378/1552/378 causal constraints (skipped 537 transitions) in 100 ms.
[2022-05-16 18:57:29] [INFO ] Added : 93 causal constraints over 19 iterations in 1689 ms. Result :sat
Minimization took 371 ms.
[2022-05-16 18:57:30] [INFO ] [Real]Absence check using 25 positive place invariants in 11 ms returned sat
[2022-05-16 18:57:30] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 19 ms returned sat
[2022-05-16 18:57:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:30] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2022-05-16 18:57:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:30] [INFO ] [Nat]Absence check using 25 positive place invariants in 11 ms returned sat
[2022-05-16 18:57:30] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 19 ms returned sat
[2022-05-16 18:57:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:31] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2022-05-16 18:57:31] [INFO ] Computed and/alt/rep : 378/1552/378 causal constraints (skipped 537 transitions) in 72 ms.
[2022-05-16 18:57:33] [INFO ] Added : 134 causal constraints over 27 iterations in 2422 ms. Result :sat
Minimization took 471 ms.
[2022-05-16 18:57:34] [INFO ] [Real]Absence check using 25 positive place invariants in 11 ms returned sat
[2022-05-16 18:57:34] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 18 ms returned sat
[2022-05-16 18:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:34] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2022-05-16 18:57:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:34] [INFO ] [Nat]Absence check using 25 positive place invariants in 11 ms returned sat
[2022-05-16 18:57:34] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 31 ms returned sat
[2022-05-16 18:57:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:35] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2022-05-16 18:57:35] [INFO ] Computed and/alt/rep : 378/1552/378 causal constraints (skipped 537 transitions) in 71 ms.
[2022-05-16 18:57:45] [INFO ] Added : 255 causal constraints over 51 iterations in 10641 ms. Result :unknown
[2022-05-16 18:57:45] [INFO ] [Real]Absence check using 25 positive place invariants in 11 ms returned sat
[2022-05-16 18:57:45] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 18 ms returned sat
[2022-05-16 18:57:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:46] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2022-05-16 18:57:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:46] [INFO ] [Nat]Absence check using 25 positive place invariants in 9 ms returned sat
[2022-05-16 18:57:46] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 14 ms returned sat
[2022-05-16 18:57:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:46] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2022-05-16 18:57:46] [INFO ] Computed and/alt/rep : 378/1552/378 causal constraints (skipped 537 transitions) in 59 ms.
[2022-05-16 18:57:49] [INFO ] Added : 102 causal constraints over 21 iterations in 2759 ms. Result :sat
Minimization took 453 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 129200 steps, including 4391 resets, run finished after 350 ms. (steps per millisecond=369 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 720300 steps, including 7646 resets, run finished after 1921 ms. (steps per millisecond=374 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 124700 steps, including 1918 resets, run finished after 292 ms. (steps per millisecond=427 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 134300 steps, including 4496 resets, run finished after 304 ms. (steps per millisecond=441 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 560 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 560/560 places, 936/936 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 560 transition count 935
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 559 transition count 935
Applied a total of 2 rules in 23 ms. Remains 559 /560 variables (removed 1) and now considering 935/936 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 559/560 places, 935/936 transitions.
// Phase 1: matrix 935 rows 559 cols
[2022-05-16 18:57:52] [INFO ] Computed 100 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 13959 resets, run finished after 2113 ms. (steps per millisecond=473 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3851 resets, run finished after 1184 ms. (steps per millisecond=844 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3892 resets, run finished after 1073 ms. (steps per millisecond=931 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3864 resets, run finished after 1047 ms. (steps per millisecond=955 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3840 resets, run finished after 1201 ms. (steps per millisecond=832 ) properties (out of 4) seen :0
// Phase 1: matrix 935 rows 559 cols
[2022-05-16 18:57:59] [INFO ] Computed 100 place invariants in 28 ms
[2022-05-16 18:57:59] [INFO ] [Real]Absence check using 25 positive place invariants in 9 ms returned sat
[2022-05-16 18:57:59] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 17 ms returned sat
[2022-05-16 18:57:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:59] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2022-05-16 18:57:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:59] [INFO ] [Nat]Absence check using 25 positive place invariants in 12 ms returned sat
[2022-05-16 18:57:59] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 20 ms returned sat
[2022-05-16 18:57:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:00] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2022-05-16 18:58:00] [INFO ] Computed and/alt/rep : 369/1472/369 causal constraints (skipped 545 transitions) in 75 ms.
[2022-05-16 18:58:07] [INFO ] Added : 258 causal constraints over 52 iterations in 7236 ms. Result :sat
Minimization took 368 ms.
[2022-05-16 18:58:07] [INFO ] [Real]Absence check using 25 positive place invariants in 11 ms returned sat
[2022-05-16 18:58:08] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 19 ms returned sat
[2022-05-16 18:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:08] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2022-05-16 18:58:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:08] [INFO ] [Nat]Absence check using 25 positive place invariants in 12 ms returned sat
[2022-05-16 18:58:08] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 19 ms returned sat
[2022-05-16 18:58:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:08] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2022-05-16 18:58:08] [INFO ] Computed and/alt/rep : 369/1472/369 causal constraints (skipped 545 transitions) in 74 ms.
[2022-05-16 18:58:11] [INFO ] Added : 133 causal constraints over 27 iterations in 2318 ms. Result :sat
Minimization took 436 ms.
[2022-05-16 18:58:11] [INFO ] [Real]Absence check using 25 positive place invariants in 11 ms returned sat
[2022-05-16 18:58:11] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 18 ms returned sat
[2022-05-16 18:58:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:12] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2022-05-16 18:58:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:12] [INFO ] [Nat]Absence check using 25 positive place invariants in 13 ms returned sat
[2022-05-16 18:58:12] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 19 ms returned sat
[2022-05-16 18:58:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:12] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2022-05-16 18:58:12] [INFO ] Computed and/alt/rep : 369/1472/369 causal constraints (skipped 545 transitions) in 72 ms.
[2022-05-16 18:58:17] [INFO ] Added : 259 causal constraints over 52 iterations in 4596 ms. Result :sat
Minimization took 1149 ms.
[2022-05-16 18:58:18] [INFO ] [Real]Absence check using 25 positive place invariants in 11 ms returned sat
[2022-05-16 18:58:18] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 19 ms returned sat
[2022-05-16 18:58:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:18] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2022-05-16 18:58:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:18] [INFO ] [Nat]Absence check using 25 positive place invariants in 9 ms returned sat
[2022-05-16 18:58:18] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 16 ms returned sat
[2022-05-16 18:58:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:19] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2022-05-16 18:58:19] [INFO ] Computed and/alt/rep : 369/1472/369 causal constraints (skipped 545 transitions) in 72 ms.
[2022-05-16 18:58:23] [INFO ] Added : 236 causal constraints over 48 iterations in 3973 ms. Result :sat
Minimization took 423 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 128800 steps, including 1002 resets, run finished after 299 ms. (steps per millisecond=430 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 116100 steps, including 2097 resets, run finished after 276 ms. (steps per millisecond=420 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 102200 steps, including 2642 resets, run finished after 250 ms. (steps per millisecond=408 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 127700 steps, including 1002 resets, run finished after 231 ms. (steps per millisecond=552 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 559 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 559/559 places, 935/935 transitions.
Applied a total of 0 rules in 17 ms. Remains 559 /559 variables (removed 0) and now considering 935/935 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 559/559 places, 935/935 transitions.
Starting structural reductions, iteration 0 : 559/559 places, 935/935 transitions.
Applied a total of 0 rules in 18 ms. Remains 559 /559 variables (removed 0) and now considering 935/935 (removed 0) transitions.
// Phase 1: matrix 935 rows 559 cols
[2022-05-16 18:58:24] [INFO ] Computed 100 place invariants in 22 ms
[2022-05-16 18:58:25] [INFO ] Implicit Places using invariants in 425 ms returned [1, 19, 20, 32, 49, 67, 103, 142, 146, 155, 156, 158, 175, 193, 262, 266, 267, 278, 279, 281, 298, 316, 385, 389, 390, 393, 404, 405, 406, 424, 426, 430, 448, 449, 450, 451, 463, 469, 475, 481, 487, 493, 499, 505, 511, 517, 523]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 428 ms to find 47 implicit places.
[2022-05-16 18:58:25] [INFO ] Redundant transitions in 50 ms returned []
// Phase 1: matrix 935 rows 512 cols
[2022-05-16 18:58:25] [INFO ] Computed 53 place invariants in 10 ms
[2022-05-16 18:58:25] [INFO ] Dead Transitions using invariants and state equation in 392 ms returned []
Starting structural reductions, iteration 1 : 512/559 places, 935/935 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 512 transition count 856
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 161 place count 433 transition count 853
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 161 place count 433 transition count 833
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 202 place count 412 transition count 833
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 214 place count 408 transition count 825
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 222 place count 400 transition count 825
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 237 place count 385 transition count 810
Iterating global reduction 4 with 15 rules applied. Total rules applied 252 place count 385 transition count 810
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 255 place count 385 transition count 807
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 255 place count 385 transition count 806
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 257 place count 384 transition count 806
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 260 place count 381 transition count 800
Iterating global reduction 5 with 3 rules applied. Total rules applied 263 place count 381 transition count 800
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 264 place count 380 transition count 799
Iterating global reduction 5 with 1 rules applied. Total rules applied 265 place count 380 transition count 799
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 266 place count 379 transition count 797
Iterating global reduction 5 with 1 rules applied. Total rules applied 267 place count 379 transition count 797
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 321 place count 352 transition count 770
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 324 place count 349 transition count 767
Iterating global reduction 5 with 3 rules applied. Total rules applied 327 place count 349 transition count 767
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 330 place count 349 transition count 764
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 334 place count 347 transition count 765
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 340 place count 347 transition count 759
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 347 place count 340 transition count 759
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 356 place count 340 transition count 759
Applied a total of 356 rules in 103 ms. Remains 340 /512 variables (removed 172) and now considering 759/935 (removed 176) transitions.
// Phase 1: matrix 759 rows 340 cols
[2022-05-16 18:58:25] [INFO ] Computed 47 place invariants in 8 ms
[2022-05-16 18:58:26] [INFO ] Implicit Places using invariants in 216 ms returned [73, 95, 101, 104, 106, 109, 110, 162, 179, 185, 188, 190, 195, 196, 248, 265, 271, 274, 276]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 218 ms to find 19 implicit places.
Starting structural reductions, iteration 2 : 321/559 places, 759/935 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 312 transition count 750
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 312 transition count 750
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 309 transition count 747
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 309 transition count 747
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 36 place count 303 transition count 741
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 45 place count 303 transition count 732
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 54 place count 294 transition count 732
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 294 transition count 729
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 291 transition count 729
Applied a total of 60 rules in 50 ms. Remains 291 /321 variables (removed 30) and now considering 729/759 (removed 30) transitions.
// Phase 1: matrix 729 rows 291 cols
[2022-05-16 18:58:26] [INFO ] Computed 28 place invariants in 7 ms
[2022-05-16 18:58:26] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 729 rows 291 cols
[2022-05-16 18:58:26] [INFO ] Computed 28 place invariants in 10 ms
[2022-05-16 18:58:26] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 291/559 places, 729/935 transitions.
Successfully produced net in file /tmp/petri1000_18328628287255207591.dot
Successfully produced net in file /tmp/petri1001_4009259414995453872.dot
Successfully produced net in file /tmp/petri1002_3463094825549796357.dot
Drop transitions removed 3 transitions
Dominated transitions for bounds rules discarded 3 transitions
// Phase 1: matrix 726 rows 291 cols
[2022-05-16 18:58:26] [INFO ] Computed 28 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 21680 resets, run finished after 1813 ms. (steps per millisecond=551 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6865 resets, run finished after 813 ms. (steps per millisecond=1230 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6940 resets, run finished after 801 ms. (steps per millisecond=1248 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6906 resets, run finished after 783 ms. (steps per millisecond=1277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6979 resets, run finished after 789 ms. (steps per millisecond=1267 ) properties (out of 4) seen :0
// Phase 1: matrix 726 rows 291 cols
[2022-05-16 18:58:31] [INFO ] Computed 28 place invariants in 15 ms
[2022-05-16 18:58:31] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:31] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 8 ms returned sat
[2022-05-16 18:58:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:32] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2022-05-16 18:58:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:32] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 6 ms returned sat
[2022-05-16 18:58:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:32] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2022-05-16 18:58:32] [INFO ] Computed and/alt/rep : 151/810/151 causal constraints (skipped 554 transitions) in 46 ms.
[2022-05-16 18:58:32] [INFO ] Added : 29 causal constraints over 7 iterations in 339 ms. Result :sat
Minimization took 149 ms.
[2022-05-16 18:58:33] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-16 18:58:33] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 8 ms returned sat
[2022-05-16 18:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:33] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2022-05-16 18:58:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:33] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 8 ms returned sat
[2022-05-16 18:58:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:33] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2022-05-16 18:58:33] [INFO ] Computed and/alt/rep : 151/810/151 causal constraints (skipped 554 transitions) in 37 ms.
[2022-05-16 18:58:33] [INFO ] Added : 30 causal constraints over 6 iterations in 400 ms. Result :sat
Minimization took 138 ms.
[2022-05-16 18:58:34] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:34] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 11 ms returned sat
[2022-05-16 18:58:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:34] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2022-05-16 18:58:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:34] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 9 ms returned sat
[2022-05-16 18:58:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:34] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2022-05-16 18:58:34] [INFO ] Computed and/alt/rep : 151/810/151 causal constraints (skipped 554 transitions) in 61 ms.
[2022-05-16 18:58:36] [INFO ] Added : 52 causal constraints over 11 iterations in 1767 ms. Result :sat
Minimization took 185 ms.
[2022-05-16 18:58:36] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:36] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 8 ms returned sat
[2022-05-16 18:58:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:36] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2022-05-16 18:58:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-05-16 18:58:36] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 6 ms returned sat
[2022-05-16 18:58:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:37] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2022-05-16 18:58:37] [INFO ] Computed and/alt/rep : 151/810/151 causal constraints (skipped 554 transitions) in 61 ms.
[2022-05-16 18:58:38] [INFO ] Added : 43 causal constraints over 9 iterations in 1130 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 66300 steps, including 2210 resets, run finished after 162 ms. (steps per millisecond=409 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA ASLink-PT-03b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-03b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 52300 steps, including 1003 resets, run finished after 82 ms. (steps per millisecond=637 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 57600 steps, including 2582 resets, run finished after 113 ms. (steps per millisecond=509 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 43300 steps, including 1003 resets, run finished after 68 ms. (steps per millisecond=636 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 291/291 places, 726/726 transitions.
Graph (complete) has 1787 edges and 291 vertex of which 288 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 288 transition count 725
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 287 transition count 725
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 287 transition count 725
Applied a total of 6 rules in 31 ms. Remains 287 /291 variables (removed 4) and now considering 725/726 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 287/291 places, 725/726 transitions.
// Phase 1: matrix 725 rows 287 cols
[2022-05-16 18:58:38] [INFO ] Computed 28 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 21733 resets, run finished after 2022 ms. (steps per millisecond=494 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6882 resets, run finished after 798 ms. (steps per millisecond=1253 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6922 resets, run finished after 774 ms. (steps per millisecond=1291 ) properties (out of 2) seen :0
// Phase 1: matrix 725 rows 287 cols
[2022-05-16 18:58:42] [INFO ] Computed 28 place invariants in 15 ms
[2022-05-16 18:58:42] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:42] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 8 ms returned sat
[2022-05-16 18:58:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:42] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2022-05-16 18:58:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:42] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 6 ms returned sat
[2022-05-16 18:58:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:43] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2022-05-16 18:58:43] [INFO ] Computed and/alt/rep : 142/728/142 causal constraints (skipped 562 transitions) in 41 ms.
[2022-05-16 18:58:43] [INFO ] Added : 13 causal constraints over 3 iterations in 231 ms. Result :sat
Minimization took 131 ms.
[2022-05-16 18:58:43] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:43] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 9 ms returned sat
[2022-05-16 18:58:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:43] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2022-05-16 18:58:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-16 18:58:43] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 7 ms returned sat
[2022-05-16 18:58:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:43] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2022-05-16 18:58:44] [INFO ] Computed and/alt/rep : 142/728/142 causal constraints (skipped 562 transitions) in 41 ms.
[2022-05-16 18:58:44] [INFO ] Added : 12 causal constraints over 3 iterations in 239 ms. Result :sat
Minimization took 140 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 47400 steps, including 2108 resets, run finished after 154 ms. (steps per millisecond=307 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 57100 steps, including 1003 resets, run finished after 142 ms. (steps per millisecond=402 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 725/725 transitions.
Applied a total of 0 rules in 13 ms. Remains 287 /287 variables (removed 0) and now considering 725/725 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 287/287 places, 725/725 transitions.
Starting structural reductions, iteration 0 : 287/287 places, 725/725 transitions.
Applied a total of 0 rules in 10 ms. Remains 287 /287 variables (removed 0) and now considering 725/725 (removed 0) transitions.
// Phase 1: matrix 725 rows 287 cols
[2022-05-16 18:58:44] [INFO ] Computed 28 place invariants in 13 ms
[2022-05-16 18:58:44] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 725 rows 287 cols
[2022-05-16 18:58:44] [INFO ] Computed 28 place invariants in 7 ms
[2022-05-16 18:58:45] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2022-05-16 18:58:45] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 725 rows 287 cols
[2022-05-16 18:58:45] [INFO ] Computed 28 place invariants in 9 ms
[2022-05-16 18:58:45] [INFO ] Dead Transitions using invariants and state equation in 290 ms returned []
Finished structural reductions, in 1 iterations. Remains : 287/287 places, 725/725 transitions.
Starting property specific reduction for ASLink-PT-03b-UpperBounds-01
// Phase 1: matrix 725 rows 287 cols
[2022-05-16 18:58:45] [INFO ] Computed 28 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 217 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 725 rows 287 cols
[2022-05-16 18:58:45] [INFO ] Computed 28 place invariants in 7 ms
[2022-05-16 18:58:45] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-05-16 18:58:45] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 5 ms returned sat
[2022-05-16 18:58:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:46] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-05-16 18:58:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-16 18:58:46] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 6 ms returned sat
[2022-05-16 18:58:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:46] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2022-05-16 18:58:46] [INFO ] Computed and/alt/rep : 142/728/142 causal constraints (skipped 562 transitions) in 51 ms.
[2022-05-16 18:58:46] [INFO ] Added : 13 causal constraints over 3 iterations in 270 ms. Result :sat
Minimization took 139 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[0]
Incomplete Parikh walk after 57100 steps, including 1003 resets, run finished after 124 ms. (steps per millisecond=460 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 725/725 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 287 transition count 724
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 286 transition count 724
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 285 transition count 723
Applied a total of 4 rules in 18 ms. Remains 285 /287 variables (removed 2) and now considering 723/725 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 285/287 places, 723/725 transitions.
// Phase 1: matrix 723 rows 285 cols
[2022-05-16 18:58:46] [INFO ] Computed 28 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 21533 resets, run finished after 2011 ms. (steps per millisecond=497 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6935 resets, run finished after 843 ms. (steps per millisecond=1186 ) properties (out of 1) seen :0
// Phase 1: matrix 723 rows 285 cols
[2022-05-16 18:58:49] [INFO ] Computed 28 place invariants in 7 ms
[2022-05-16 18:58:49] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:49] [INFO ] [Real]Absence check using 9 positive and 19 generalized place invariants in 8 ms returned sat
[2022-05-16 18:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:50] [INFO ] [Real]Absence check using state equation in 194 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 9 positive place invariants in 4 ms returned sat
[2022-05-16 18:58:50] [INFO ] [Nat]Absence check using 9 positive and 19 generalized place invariants in 6 ms returned sat
[2022-05-16 18:58:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:50] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2022-05-16 18:58:50] [INFO ] Computed and/alt/rep : 140/726/140 causal constraints (skipped 562 transitions) in 43 ms.
[2022-05-16 18:58:50] [INFO ] Added : 9 causal constraints over 2 iterations in 150 ms. Result :sat
Minimization took 154 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 48800 steps, including 2210 resets, run finished after 91 ms. (steps per millisecond=536 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 285/285 places, 723/723 transitions.
Applied a total of 0 rules in 11 ms. Remains 285 /285 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 285/285 places, 723/723 transitions.
Starting structural reductions, iteration 0 : 285/285 places, 723/723 transitions.
Applied a total of 0 rules in 8 ms. Remains 285 /285 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 285 cols
[2022-05-16 18:58:50] [INFO ] Computed 28 place invariants in 15 ms
[2022-05-16 18:58:51] [INFO ] Implicit Places using invariants in 268 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 272 ms to find 1 implicit places.
[2022-05-16 18:58:51] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 723 rows 284 cols
[2022-05-16 18:58:51] [INFO ] Computed 27 place invariants in 7 ms
[2022-05-16 18:58:51] [INFO ] Dead Transitions using invariants and state equation in 434 ms returned []
Starting structural reductions, iteration 1 : 284/285 places, 723/723 transitions.
Applied a total of 0 rules in 8 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2022-05-16 18:58:51] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 723 rows 284 cols
[2022-05-16 18:58:51] [INFO ] Computed 27 place invariants in 7 ms
[2022-05-16 18:58:51] [INFO ] Dead Transitions using invariants and state equation in 313 ms returned []
Finished structural reductions, in 2 iterations. Remains : 284/285 places, 723/723 transitions.
// Phase 1: matrix 723 rows 284 cols
[2022-05-16 18:58:51] [INFO ] Computed 27 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 21577 resets, run finished after 1866 ms. (steps per millisecond=535 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6901 resets, run finished after 732 ms. (steps per millisecond=1366 ) properties (out of 1) seen :0
// Phase 1: matrix 723 rows 284 cols
[2022-05-16 18:58:54] [INFO ] Computed 27 place invariants in 13 ms
[2022-05-16 18:58:54] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-16 18:58:54] [INFO ] [Real]Absence check using 8 positive and 19 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 168 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 8 positive place invariants in 4 ms returned sat
[2022-05-16 18:58:54] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 6 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 590 ms returned sat
[2022-05-16 18:58:55] [INFO ] Computed and/alt/rep : 140/725/140 causal constraints (skipped 562 transitions) in 73 ms.
[2022-05-16 18:58:56] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2022-05-16 18:58:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2022-05-16 18:58:56] [INFO ] Added : 49 causal constraints over 10 iterations in 1074 ms. Result :sat
Minimization took 160 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 46000 steps, including 1388 resets, run finished after 83 ms. (steps per millisecond=554 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 284/284 places, 723/723 transitions.
Applied a total of 0 rules in 10 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 284/284 places, 723/723 transitions.
Starting structural reductions, iteration 0 : 284/284 places, 723/723 transitions.
Applied a total of 0 rules in 10 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 284 cols
[2022-05-16 18:58:56] [INFO ] Computed 27 place invariants in 11 ms
[2022-05-16 18:58:56] [INFO ] Implicit Places using invariants in 196 ms returned []
// Phase 1: matrix 723 rows 284 cols
[2022-05-16 18:58:57] [INFO ] Computed 27 place invariants in 14 ms
[2022-05-16 18:58:57] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
[2022-05-16 18:58:57] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 723 rows 284 cols
[2022-05-16 18:58:57] [INFO ] Computed 27 place invariants in 7 ms
[2022-05-16 18:58:57] [INFO ] Dead Transitions using invariants and state equation in 257 ms returned []
Finished structural reductions, in 1 iterations. Remains : 284/284 places, 723/723 transitions.
Ending property specific reduction for ASLink-PT-03b-UpperBounds-01 in 11994 ms.
Starting property specific reduction for ASLink-PT-03b-UpperBounds-04
// Phase 1: matrix 725 rows 287 cols
[2022-05-16 18:58:57] [INFO ] Computed 28 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 210 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 725 rows 287 cols
[2022-05-16 18:58:57] [INFO ] Computed 28 place invariants in 5 ms
[2022-05-16 18:58:57] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-05-16 18:58:57] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 8 ms returned sat
[2022-05-16 18:58:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:58] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2022-05-16 18:58:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-05-16 18:58:58] [INFO ] [Nat]Absence check using 8 positive and 20 generalized place invariants in 30 ms returned sat
[2022-05-16 18:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:58] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2022-05-16 18:58:58] [INFO ] Computed and/alt/rep : 142/728/142 causal constraints (skipped 562 transitions) in 39 ms.
[2022-05-16 18:58:58] [INFO ] Added : 12 causal constraints over 3 iterations in 221 ms. Result :sat
Minimization took 149 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 47400 steps, including 2108 resets, run finished after 119 ms. (steps per millisecond=398 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 287/287 places, 725/725 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 287 transition count 724
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 286 transition count 724
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 286 transition count 723
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 285 transition count 723
Applied a total of 4 rules in 23 ms. Remains 285 /287 variables (removed 2) and now considering 723/725 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 285/287 places, 723/725 transitions.
// Phase 1: matrix 723 rows 285 cols
[2022-05-16 18:58:59] [INFO ] Computed 28 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 21602 resets, run finished after 1709 ms. (steps per millisecond=585 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6954 resets, run finished after 791 ms. (steps per millisecond=1264 ) properties (out of 1) seen :0
// Phase 1: matrix 723 rows 285 cols
[2022-05-16 18:59:01] [INFO ] Computed 28 place invariants in 15 ms
[2022-05-16 18:59:01] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2022-05-16 18:59:01] [INFO ] [Real]Absence check using 9 positive and 19 generalized place invariants in 32 ms returned sat
[2022-05-16 18:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:01] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2022-05-16 18:59:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-05-16 18:59:01] [INFO ] [Nat]Absence check using 9 positive and 19 generalized place invariants in 8 ms returned sat
[2022-05-16 18:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:02] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2022-05-16 18:59:02] [INFO ] Computed and/alt/rep : 140/726/140 causal constraints (skipped 562 transitions) in 37 ms.
[2022-05-16 18:59:02] [INFO ] Added : 33 causal constraints over 9 iterations in 374 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 66900 steps, including 2220 resets, run finished after 141 ms. (steps per millisecond=474 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 285/285 places, 723/723 transitions.
Applied a total of 0 rules in 8 ms. Remains 285 /285 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 285/285 places, 723/723 transitions.
Starting structural reductions, iteration 0 : 285/285 places, 723/723 transitions.
Applied a total of 0 rules in 13 ms. Remains 285 /285 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 285 cols
[2022-05-16 18:59:02] [INFO ] Computed 28 place invariants in 7 ms
[2022-05-16 18:59:03] [INFO ] Implicit Places using invariants in 169 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 171 ms to find 1 implicit places.
[2022-05-16 18:59:03] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 723 rows 284 cols
[2022-05-16 18:59:03] [INFO ] Computed 27 place invariants in 7 ms
[2022-05-16 18:59:03] [INFO ] Dead Transitions using invariants and state equation in 306 ms returned []
Starting structural reductions, iteration 1 : 284/285 places, 723/723 transitions.
Applied a total of 0 rules in 27 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2022-05-16 18:59:03] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 723 rows 284 cols
[2022-05-16 18:59:03] [INFO ] Computed 27 place invariants in 12 ms
[2022-05-16 18:59:03] [INFO ] Dead Transitions using invariants and state equation in 357 ms returned []
Finished structural reductions, in 2 iterations. Remains : 284/285 places, 723/723 transitions.
// Phase 1: matrix 723 rows 284 cols
[2022-05-16 18:59:03] [INFO ] Computed 27 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 21725 resets, run finished after 1887 ms. (steps per millisecond=529 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6880 resets, run finished after 862 ms. (steps per millisecond=1160 ) properties (out of 1) seen :0
// Phase 1: matrix 723 rows 284 cols
[2022-05-16 18:59:06] [INFO ] Computed 27 place invariants in 11 ms
[2022-05-16 18:59:06] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-05-16 18:59:06] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 8 ms returned sat
[2022-05-16 18:59:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:06] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2022-05-16 18:59:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-05-16 18:59:06] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 8 ms returned sat
[2022-05-16 18:59:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:07] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2022-05-16 18:59:07] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 1 ms to minimize.
[2022-05-16 18:59:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2022-05-16 18:59:07] [INFO ] Computed and/alt/rep : 140/725/140 causal constraints (skipped 562 transitions) in 58 ms.
[2022-05-16 18:59:07] [INFO ] Added : 38 causal constraints over 11 iterations in 643 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 41300 steps, including 1332 resets, run finished after 116 ms. (steps per millisecond=356 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 284/284 places, 723/723 transitions.
Applied a total of 0 rules in 11 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 284/284 places, 723/723 transitions.
Starting structural reductions, iteration 0 : 284/284 places, 723/723 transitions.
Applied a total of 0 rules in 11 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
// Phase 1: matrix 723 rows 284 cols
[2022-05-16 18:59:08] [INFO ] Computed 27 place invariants in 13 ms
[2022-05-16 18:59:08] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 723 rows 284 cols
[2022-05-16 18:59:08] [INFO ] Computed 27 place invariants in 6 ms
[2022-05-16 18:59:08] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2022-05-16 18:59:08] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 723 rows 284 cols
[2022-05-16 18:59:08] [INFO ] Computed 27 place invariants in 8 ms
[2022-05-16 18:59:09] [INFO ] Dead Transitions using invariants and state equation in 249 ms returned []
Finished structural reductions, in 1 iterations. Remains : 284/284 places, 723/723 transitions.
Ending property specific reduction for ASLink-PT-03b-UpperBounds-04 in 11313 ms.
[2022-05-16 18:59:09] [INFO ] Flatten gal took : 124 ms
[2022-05-16 18:59:09] [INFO ] Applying decomposition
[2022-05-16 18:59:09] [INFO ] Flatten gal took : 53 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/graph10207460783440616721.txt, -o, /tmp/graph10207460783440616721.bin, -w, /tmp/graph10207460783440616721.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/graph10207460783440616721.bin, -l, -1, -v, -w, /tmp/graph10207460783440616721.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 18:59:09] [INFO ] Decomposing Gal with order
[2022-05-16 18:59:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 18:59:10] [INFO ] Removed a total of 1525 redundant transitions.
[2022-05-16 18:59:10] [INFO ] Flatten gal took : 119 ms
[2022-05-16 18:59:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 19 ms.
[2022-05-16 18:59:10] [INFO ] Time to serialize gal into /tmp/UpperBounds14807250972830011059.gal : 12 ms
[2022-05-16 18:59:10] [INFO ] Time to serialize properties into /tmp/UpperBounds315464549380042255.prop : 1 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/UpperBounds14807250972830011059.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds315464549380042255.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/UpperBounds14807250972830011059.gal -t CGAL -reachable-file /tmp/UpperBounds315464549380042255.prop --nowitness
Loading property file /tmp/UpperBounds315464549380042255.prop.
Detected timeout of ITS tools.
[2022-05-16 19:20:00] [INFO ] Applying decomposition
[2022-05-16 19:20:00] [INFO ] Flatten gal took : 74 ms
[2022-05-16 19:20:00] [INFO ] Decomposing Gal with order
[2022-05-16 19:20:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 19:20:00] [INFO ] Removed a total of 1350 redundant transitions.
[2022-05-16 19:20:00] [INFO ] Flatten gal took : 111 ms
[2022-05-16 19:20:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 538 labels/synchronizations in 21 ms.
[2022-05-16 19:20:00] [INFO ] Time to serialize gal into /tmp/UpperBounds12449352621235621138.gal : 5 ms
[2022-05-16 19:20:00] [INFO ] Time to serialize properties into /tmp/UpperBounds1681001890473030724.prop : 1 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/UpperBounds12449352621235621138.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds1681001890473030724.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/UpperBounds12449352621235621138.gal -t CGAL -reachable-file /tmp/UpperBounds1681001890473030724.prop --nowitness
Loading property file /tmp/UpperBounds1681001890473030724.prop.
Detected timeout of ITS tools.
[2022-05-16 19:40:50] [INFO ] Flatten gal took : 30 ms
[2022-05-16 19:40:50] [INFO ] Input system was already deterministic with 725 transitions.
[2022-05-16 19:40:50] [INFO ] Transformed 287 places.
[2022-05-16 19:40:50] [INFO ] Transformed 725 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:40:51] [INFO ] Time to serialize gal into /tmp/UpperBounds9051527677991893437.gal : 7 ms
[2022-05-16 19:40:51] [INFO ] Time to serialize properties into /tmp/UpperBounds15673430488652802107.prop : 1 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/UpperBounds9051527677991893437.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15673430488652802107.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/UpperBounds9051527677991893437.gal -t CGAL -reachable-file /tmp/UpperBounds15673430488652802107.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/UpperBounds15673430488652802107.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-03b"
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-03b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-tajo-165245701500019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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