Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r031-oct2-167813615300006.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is ASLink-PT-03a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-oct2-167813615300006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 8.3K Feb 26 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 357K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678866303956

Running Version 202205111006
[2023-03-15 07:45:06] [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]
[2023-03-15 07:45:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:45:06] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2023-03-15 07:45:06] [INFO ] Transformed 821 places.
[2023-03-15 07:45:06] [INFO ] Transformed 1281 transitions.
[2023-03-15 07:45:06] [INFO ] Found NUPN structural information;
[2023-03-15 07:45:06] [INFO ] Parsed PT model containing 821 places and 1281 transitions in 375 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
// Phase 1: matrix 1268 rows 821 cols
[2023-03-15 07:45:06] [INFO ] Computed 156 place invariants in 128 ms
Incomplete random walk after 10000 steps, including 87 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :9
FORMULA ASLink-PT-03a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
// Phase 1: matrix 1268 rows 821 cols
[2023-03-15 07:45:07] [INFO ] Computed 156 place invariants in 40 ms
[2023-03-15 07:45:07] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2023-03-15 07:45:07] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 27 ms returned sat
[2023-03-15 07:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:08] [INFO ] [Real]Absence check using state equation in 992 ms returned sat
[2023-03-15 07:45:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2023-03-15 07:45:09] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 24 ms returned sat
[2023-03-15 07:45:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:13] [INFO ] [Nat]Absence check using state equation in 4793 ms returned unknown
[2023-03-15 07:45:14] [INFO ] [Real]Absence check using 36 positive place invariants in 50 ms returned sat
[2023-03-15 07:45:14] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 69 ms returned sat
[2023-03-15 07:45:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:14] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2023-03-15 07:45:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2023-03-15 07:45:15] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 51 ms returned sat
[2023-03-15 07:45:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:16] [INFO ] [Nat]Absence check using state equation in 1131 ms returned sat
[2023-03-15 07:45:17] [INFO ] Deduced a trap composed of 85 places in 558 ms of which 10 ms to minimize.
[2023-03-15 07:45:17] [INFO ] Deduced a trap composed of 25 places in 225 ms of which 1 ms to minimize.
[2023-03-15 07:45:17] [INFO ] Deduced a trap composed of 30 places in 266 ms of which 2 ms to minimize.
[2023-03-15 07:45:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1307 ms
[2023-03-15 07:45:17] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 128 ms.
[2023-03-15 07:45:20] [INFO ] Added : 35 causal constraints over 7 iterations in 2350 ms. Result :unknown
[2023-03-15 07:45:20] [INFO ] [Real]Absence check using 36 positive place invariants in 36 ms returned sat
[2023-03-15 07:45:20] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 56 ms returned sat
[2023-03-15 07:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:21] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2023-03-15 07:45:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 29 ms returned sat
[2023-03-15 07:45:21] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 32 ms returned sat
[2023-03-15 07:45:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:22] [INFO ] [Nat]Absence check using state equation in 1359 ms returned sat
[2023-03-15 07:45:23] [INFO ] Deduced a trap composed of 68 places in 245 ms of which 2 ms to minimize.
[2023-03-15 07:45:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
[2023-03-15 07:45:23] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 123 ms.
[2023-03-15 07:45:26] [INFO ] Deduced a trap composed of 5 places in 625 ms of which 13 ms to minimize.
[2023-03-15 07:45:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 07:45:27] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2023-03-15 07:45:27] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 43 ms returned sat
[2023-03-15 07:45:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:28] [INFO ] [Real]Absence check using state equation in 977 ms returned sat
[2023-03-15 07:45:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2023-03-15 07:45:28] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 76 ms returned sat
[2023-03-15 07:45:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:33] [INFO ] [Nat]Absence check using state equation in 4762 ms returned unknown
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 38 ms returned sat
[2023-03-15 07:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:34] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2023-03-15 07:45:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2023-03-15 07:45:34] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 30 ms returned sat
[2023-03-15 07:45:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:39] [INFO ] [Nat]Absence check using state equation in 4747 ms returned unknown
[2023-03-15 07:45:39] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2023-03-15 07:45:39] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 61 ms returned sat
[2023-03-15 07:45:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:40] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2023-03-15 07:45:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2023-03-15 07:45:40] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 30 ms returned sat
[2023-03-15 07:45:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:41] [INFO ] [Nat]Absence check using state equation in 1130 ms returned sat
[2023-03-15 07:45:41] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 159 ms.
[2023-03-15 07:45:45] [INFO ] Deduced a trap composed of 5 places in 636 ms of which 1 ms to minimize.
[2023-03-15 07:45:45] [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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 07:45:46] [INFO ] [Real]Absence check using 36 positive place invariants in 26 ms returned sat
[2023-03-15 07:45:46] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 27 ms returned sat
[2023-03-15 07:45:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:46] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2023-03-15 07:45:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:45:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 55 ms returned sat
[2023-03-15 07:45:47] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 40 ms returned sat
[2023-03-15 07:45:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:45:49] [INFO ] [Nat]Absence check using state equation in 1998 ms returned sat
[2023-03-15 07:45:49] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 119 ms.
[2023-03-15 07:45:51] [INFO ] Added : 25 causal constraints over 5 iterations in 2697 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-03a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 821 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 803 transition count 1199
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 157 place count 734 transition count 1198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 158 place count 733 transition count 1198
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 158 place count 733 transition count 1129
Deduced a syphon composed of 69 places in 3 ms
Ensure Unique test removed 27 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 165 rules applied. Total rules applied 323 place count 637 transition count 1129
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 324 place count 637 transition count 1128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 325 place count 636 transition count 1128
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 331 place count 630 transition count 1099
Ensure Unique test removed 1 places
Iterating global reduction 5 with 7 rules applied. Total rules applied 338 place count 629 transition count 1099
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 344 place count 628 transition count 1094
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 347 place count 625 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 348 place count 624 transition count 1086
Iterating global reduction 7 with 1 rules applied. Total rules applied 349 place count 624 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 350 place count 623 transition count 1078
Iterating global reduction 7 with 1 rules applied. Total rules applied 351 place count 623 transition count 1078
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 352 place count 622 transition count 1070
Iterating global reduction 7 with 1 rules applied. Total rules applied 353 place count 622 transition count 1070
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 354 place count 621 transition count 1062
Iterating global reduction 7 with 1 rules applied. Total rules applied 355 place count 621 transition count 1062
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 356 place count 620 transition count 1054
Iterating global reduction 7 with 1 rules applied. Total rules applied 357 place count 620 transition count 1054
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 358 place count 619 transition count 1046
Iterating global reduction 7 with 1 rules applied. Total rules applied 359 place count 619 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 360 place count 618 transition count 1038
Iterating global reduction 7 with 1 rules applied. Total rules applied 361 place count 618 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 362 place count 617 transition count 1030
Iterating global reduction 7 with 1 rules applied. Total rules applied 363 place count 617 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 364 place count 616 transition count 1022
Iterating global reduction 7 with 1 rules applied. Total rules applied 365 place count 616 transition count 1022
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 366 place count 615 transition count 1014
Iterating global reduction 7 with 1 rules applied. Total rules applied 367 place count 615 transition count 1014
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 368 place count 614 transition count 1006
Iterating global reduction 7 with 1 rules applied. Total rules applied 369 place count 614 transition count 1006
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 370 place count 613 transition count 998
Iterating global reduction 7 with 1 rules applied. Total rules applied 371 place count 613 transition count 998
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 372 place count 612 transition count 990
Iterating global reduction 7 with 1 rules applied. Total rules applied 373 place count 612 transition count 990
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 374 place count 611 transition count 982
Iterating global reduction 7 with 1 rules applied. Total rules applied 375 place count 611 transition count 982
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 376 place count 610 transition count 974
Iterating global reduction 7 with 1 rules applied. Total rules applied 377 place count 610 transition count 974
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 378 place count 609 transition count 966
Iterating global reduction 7 with 1 rules applied. Total rules applied 379 place count 609 transition count 966
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 421 place count 588 transition count 945
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 423 place count 588 transition count 943
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 425 place count 586 transition count 943
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 429 place count 586 transition count 943
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 430 place count 585 transition count 942
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 436 place count 579 transition count 942
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 436 place count 579 transition count 931
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 23 rules applied. Total rules applied 459 place count 567 transition count 931
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 9 with 4 rules applied. Total rules applied 463 place count 563 transition count 931
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 463 place count 563 transition count 930
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 465 place count 562 transition count 930
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 473 place count 558 transition count 926
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 476 place count 555 transition count 923
Iterating global reduction 10 with 3 rules applied. Total rules applied 479 place count 555 transition count 923
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 482 place count 555 transition count 920
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 485 place count 552 transition count 920
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 488 place count 552 transition count 920
Applied a total of 488 rules in 795 ms. Remains 552 /821 variables (removed 269) and now considering 920/1268 (removed 348) transitions.
Finished structural reductions, in 1 iterations. Remains : 552/821 places, 920/1268 transitions.
// Phase 1: matrix 920 rows 552 cols
[2023-03-15 07:45:54] [INFO ] Computed 98 place invariants in 47 ms
Incomplete random walk after 1000000 steps, including 14209 resets, run finished after 2033 ms. (steps per millisecond=491 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3899 resets, run finished after 1067 ms. (steps per millisecond=937 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3866 resets, run finished after 1055 ms. (steps per millisecond=947 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3907 resets, run finished after 1042 ms. (steps per millisecond=959 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3874 resets, run finished after 982 ms. (steps per millisecond=1018 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3939 resets, run finished after 950 ms. (steps per millisecond=1052 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3918 resets, run finished after 926 ms. (steps per millisecond=1079 ) properties (out of 6) seen :0
// Phase 1: matrix 920 rows 552 cols
[2023-03-15 07:46:02] [INFO ] Computed 98 place invariants in 15 ms
[2023-03-15 07:46:02] [INFO ] [Real]Absence check using 26 positive place invariants in 11 ms returned sat
[2023-03-15 07:46:02] [INFO ] [Real]Absence check using 26 positive and 72 generalized place invariants in 18 ms returned sat
[2023-03-15 07:46:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:02] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2023-03-15 07:46:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:46:02] [INFO ] [Nat]Absence check using 26 positive place invariants in 12 ms returned sat
[2023-03-15 07:46:02] [INFO ] [Nat]Absence check using 26 positive and 72 generalized place invariants in 23 ms returned sat
[2023-03-15 07:46:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:03] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2023-03-15 07:46:03] [INFO ] Computed and/alt/rep : 352/1376/352 causal constraints (skipped 547 transitions) in 79 ms.
[2023-03-15 07:46:13] [INFO ] Added : 205 causal constraints over 41 iterations in 10002 ms. Result :unknown
[2023-03-15 07:46:13] [INFO ] [Real]Absence check using 26 positive place invariants in 27 ms returned sat
[2023-03-15 07:46:13] [INFO ] [Real]Absence check using 26 positive and 72 generalized place invariants in 26 ms returned sat
[2023-03-15 07:46:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:13] [INFO ] [Real]Absence check using state equation in 326 ms returned sat
[2023-03-15 07:46:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:46:14] [INFO ] [Nat]Absence check using 26 positive place invariants in 8 ms returned sat
[2023-03-15 07:46:14] [INFO ] [Nat]Absence check using 26 positive and 72 generalized place invariants in 15 ms returned sat
[2023-03-15 07:46:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:14] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2023-03-15 07:46:14] [INFO ] Computed and/alt/rep : 352/1376/352 causal constraints (skipped 547 transitions) in 127 ms.
[2023-03-15 07:46:18] [INFO ] Added : 200 causal constraints over 40 iterations in 3481 ms. Result :sat
Minimization took 186 ms.
[2023-03-15 07:46:18] [INFO ] [Real]Absence check using 26 positive place invariants in 11 ms returned sat
[2023-03-15 07:46:18] [INFO ] [Real]Absence check using 26 positive and 72 generalized place invariants in 37 ms returned sat
[2023-03-15 07:46:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:18] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2023-03-15 07:46:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:46:19] [INFO ] [Nat]Absence check using 26 positive place invariants in 12 ms returned sat
[2023-03-15 07:46:19] [INFO ] [Nat]Absence check using 26 positive and 72 generalized place invariants in 32 ms returned sat
[2023-03-15 07:46:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:19] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2023-03-15 07:46:19] [INFO ] Computed and/alt/rep : 352/1376/352 causal constraints (skipped 547 transitions) in 59 ms.
[2023-03-15 07:46:26] [INFO ] Added : 30 causal constraints over 6 iterations in 6629 ms. Result :unknown
[2023-03-15 07:46:26] [INFO ] [Real]Absence check using 26 positive place invariants in 47 ms returned sat
[2023-03-15 07:46:26] [INFO ] [Real]Absence check using 26 positive and 72 generalized place invariants in 34 ms returned sat
[2023-03-15 07:46:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:26] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2023-03-15 07:46:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:46:26] [INFO ] [Nat]Absence check using 26 positive place invariants in 8 ms returned sat
[2023-03-15 07:46:26] [INFO ] [Nat]Absence check using 26 positive and 72 generalized place invariants in 15 ms returned sat
[2023-03-15 07:46:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:27] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2023-03-15 07:46:27] [INFO ] Computed and/alt/rep : 352/1376/352 causal constraints (skipped 547 transitions) in 53 ms.
[2023-03-15 07:46:29] [INFO ] Added : 88 causal constraints over 18 iterations in 1756 ms. Result :sat
Minimization took 272 ms.
[2023-03-15 07:46:29] [INFO ] [Real]Absence check using 26 positive place invariants in 14 ms returned sat
[2023-03-15 07:46:29] [INFO ] [Real]Absence check using 26 positive and 72 generalized place invariants in 36 ms returned sat
[2023-03-15 07:46:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:29] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2023-03-15 07:46:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:46:30] [INFO ] [Nat]Absence check using 26 positive place invariants in 41 ms returned sat
[2023-03-15 07:46:30] [INFO ] [Nat]Absence check using 26 positive and 72 generalized place invariants in 23 ms returned sat
[2023-03-15 07:46:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:30] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2023-03-15 07:46:30] [INFO ] Computed and/alt/rep : 352/1376/352 causal constraints (skipped 547 transitions) in 66 ms.
[2023-03-15 07:46:35] [INFO ] Added : 229 causal constraints over 46 iterations in 4536 ms. Result :sat
Minimization took 268 ms.
[2023-03-15 07:46:35] [INFO ] [Real]Absence check using 26 positive place invariants in 84 ms returned sat
[2023-03-15 07:46:36] [INFO ] [Real]Absence check using 26 positive and 72 generalized place invariants in 146 ms returned sat
[2023-03-15 07:46:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:36] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2023-03-15 07:46:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:46:36] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2023-03-15 07:46:36] [INFO ] [Nat]Absence check using 26 positive and 72 generalized place invariants in 16 ms returned sat
[2023-03-15 07:46:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:37] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2023-03-15 07:46:37] [INFO ] Computed and/alt/rep : 352/1376/352 causal constraints (skipped 547 transitions) in 71 ms.
[2023-03-15 07:46:41] [INFO ] Added : 231 causal constraints over 47 iterations in 4134 ms. Result :sat
Minimization took 234 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-03a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-03a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-03a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-03a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 552/552 places, 920/920 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 552 transition count 919
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 551 transition count 919
Applied a total of 2 rules in 34 ms. Remains 551 /552 variables (removed 1) and now considering 919/920 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 551/552 places, 919/920 transitions.
// Phase 1: matrix 919 rows 551 cols
[2023-03-15 07:46:43] [INFO ] Computed 98 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 14095 resets, run finished after 2203 ms. (steps per millisecond=453 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3831 resets, run finished after 963 ms. (steps per millisecond=1038 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3895 resets, run finished after 1025 ms. (steps per millisecond=975 ) properties (out of 2) seen :0
// Phase 1: matrix 919 rows 551 cols
[2023-03-15 07:46:47] [INFO ] Computed 98 place invariants in 20 ms
[2023-03-15 07:46:47] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2023-03-15 07:46:47] [INFO ] [Real]Absence check using 23 positive and 75 generalized place invariants in 30 ms returned sat
[2023-03-15 07:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:47] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2023-03-15 07:46:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:46:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-15 07:46:48] [INFO ] [Nat]Absence check using 23 positive and 75 generalized place invariants in 16 ms returned sat
[2023-03-15 07:46:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:48] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2023-03-15 07:46:48] [INFO ] Computed and/alt/rep : 351/1375/351 causal constraints (skipped 547 transitions) in 98 ms.
[2023-03-15 07:46:52] [INFO ] Added : 248 causal constraints over 50 iterations in 4254 ms. Result :sat
Minimization took 199 ms.
[2023-03-15 07:46:53] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2023-03-15 07:46:53] [INFO ] [Real]Absence check using 23 positive and 75 generalized place invariants in 33 ms returned sat
[2023-03-15 07:46:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:53] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2023-03-15 07:46:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:46:53] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2023-03-15 07:46:53] [INFO ] [Nat]Absence check using 23 positive and 75 generalized place invariants in 18 ms returned sat
[2023-03-15 07:46:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:46:54] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2023-03-15 07:46:54] [INFO ] Computed and/alt/rep : 351/1375/351 causal constraints (skipped 547 transitions) in 89 ms.
[2023-03-15 07:46:57] [INFO ] Added : 201 causal constraints over 41 iterations in 3520 ms. Result :sat
Minimization took 246 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 551/551 places, 919/919 transitions.
Applied a total of 0 rules in 15 ms. Remains 551 /551 variables (removed 0) and now considering 919/919 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 551/551 places, 919/919 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 551/551 places, 919/919 transitions.
Applied a total of 0 rules in 14 ms. Remains 551 /551 variables (removed 0) and now considering 919/919 (removed 0) transitions.
// Phase 1: matrix 919 rows 551 cols
[2023-03-15 07:46:58] [INFO ] Computed 98 place invariants in 7 ms
[2023-03-15 07:46:59] [INFO ] Implicit Places using invariants in 631 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 273, 291, 309, 378, 382, 383, 386, 397, 398, 399, 417, 419, 422, 440, 441, 442, 443, 455, 461, 467, 473, 479, 485, 491, 497, 503, 509, 515]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 651 ms to find 46 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 505/551 places, 919/919 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 505 transition count 844
Reduce places removed 75 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 151 place count 430 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 429 transition count 843
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 152 place count 429 transition count 824
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 39 rules applied. Total rules applied 191 place count 409 transition count 824
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 203 place count 405 transition count 816
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 211 place count 397 transition count 816
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 226 place count 382 transition count 801
Iterating global reduction 5 with 15 rules applied. Total rules applied 241 place count 382 transition count 801
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 244 place count 382 transition count 798
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 244 place count 382 transition count 797
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 246 place count 381 transition count 797
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 249 place count 378 transition count 794
Iterating global reduction 6 with 3 rules applied. Total rules applied 252 place count 378 transition count 794
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 253 place count 377 transition count 793
Iterating global reduction 6 with 1 rules applied. Total rules applied 254 place count 377 transition count 793
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 255 place count 376 transition count 792
Iterating global reduction 6 with 1 rules applied. Total rules applied 256 place count 376 transition count 792
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 320 place count 344 transition count 760
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 323 place count 344 transition count 757
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 326 place count 341 transition count 754
Iterating global reduction 7 with 3 rules applied. Total rules applied 329 place count 341 transition count 754
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 332 place count 341 transition count 751
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 338 place count 341 transition count 745
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 345 place count 334 transition count 745
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 355 place count 334 transition count 745
Applied a total of 355 rules in 137 ms. Remains 334 /505 variables (removed 171) and now considering 745/919 (removed 174) transitions.
// Phase 1: matrix 745 rows 334 cols
[2023-03-15 07:46:59] [INFO ] Computed 46 place invariants in 25 ms
[2023-03-15 07:46:59] [INFO ] Implicit Places using invariants in 513 ms returned [72, 90, 96, 99, 101, 104, 105, 157, 174, 180, 183, 185, 190, 191, 243, 260, 266, 269, 271]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 516 ms to find 19 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 315/551 places, 745/919 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 306 transition count 736
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 306 transition count 736
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 303 transition count 733
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 303 transition count 733
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 297 transition count 727
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 45 place count 297 transition count 718
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 54 place count 288 transition count 718
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 288 transition count 715
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 285 transition count 715
Applied a total of 60 rules in 75 ms. Remains 285 /315 variables (removed 30) and now considering 715/745 (removed 30) transitions.
// Phase 1: matrix 715 rows 285 cols
[2023-03-15 07:46:59] [INFO ] Computed 27 place invariants in 5 ms
[2023-03-15 07:47:00] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 715 rows 285 cols
[2023-03-15 07:47:00] [INFO ] Computed 27 place invariants in 5 ms
[2023-03-15 07:47:00] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 285/551 places, 715/919 transitions.
Finished structural reductions, in 3 iterations. Remains : 285/551 places, 715/919 transitions.
Successfully produced net in file /tmp/petri1000_15814698841300840729.dot
Successfully produced net in file /tmp/petri1001_5542448385458547884.dot
Successfully produced net in file /tmp/petri1002_14386860022277644301.dot
Drop transitions removed 3 transitions
Dominated transitions for bounds rules discarded 3 transitions
// Phase 1: matrix 712 rows 285 cols
[2023-03-15 07:47:00] [INFO ] Computed 27 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 21031 resets, run finished after 1668 ms. (steps per millisecond=599 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7396 resets, run finished after 706 ms. (steps per millisecond=1416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7263 resets, run finished after 731 ms. (steps per millisecond=1367 ) properties (out of 2) seen :0
// Phase 1: matrix 712 rows 285 cols
[2023-03-15 07:47:03] [INFO ] Computed 27 place invariants in 14 ms
[2023-03-15 07:47:04] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-15 07:47:04] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 6 ms returned sat
[2023-03-15 07:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:47:04] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2023-03-15 07:47:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:47:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-15 07:47:04] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 12 ms returned sat
[2023-03-15 07:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:47:04] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2023-03-15 07:47:04] [INFO ] Computed and/alt/rep : 134/677/134 causal constraints (skipped 560 transitions) in 41 ms.
[2023-03-15 07:47:04] [INFO ] Added : 11 causal constraints over 3 iterations in 238 ms. Result :sat
Minimization took 89 ms.
[2023-03-15 07:47:05] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-15 07:47:05] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 11 ms returned sat
[2023-03-15 07:47:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:47:05] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2023-03-15 07:47:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:47:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 25 ms returned sat
[2023-03-15 07:47:05] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 21 ms returned sat
[2023-03-15 07:47:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:47:06] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2023-03-15 07:47:06] [INFO ] Computed and/alt/rep : 134/677/134 causal constraints (skipped 560 transitions) in 82 ms.
[2023-03-15 07:47:06] [INFO ] Added : 42 causal constraints over 9 iterations in 708 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 285/285 places, 712/712 transitions.
Graph (complete) has 1769 edges and 285 vertex of which 282 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.11 ms
Discarding 3 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 282 transition count 712
Applied a total of 4 rules in 44 ms. Remains 282 /285 variables (removed 3) and now considering 712/712 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 282/285 places, 712/712 transitions.
// Phase 1: matrix 712 rows 282 cols
[2023-03-15 07:47:07] [INFO ] Computed 27 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 21109 resets, run finished after 1650 ms. (steps per millisecond=606 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7222 resets, run finished after 796 ms. (steps per millisecond=1256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7278 resets, run finished after 673 ms. (steps per millisecond=1485 ) properties (out of 2) seen :0
// Phase 1: matrix 712 rows 282 cols
[2023-03-15 07:47:10] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-15 07:47:10] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-15 07:47:10] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 11 ms returned sat
[2023-03-15 07:47:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:47:10] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2023-03-15 07:47:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:47:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-15 07:47:10] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 12 ms returned sat
[2023-03-15 07:47:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:47:11] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2023-03-15 07:47:11] [INFO ] Computed and/alt/rep : 134/675/134 causal constraints (skipped 560 transitions) in 60 ms.
[2023-03-15 07:47:11] [INFO ] Added : 36 causal constraints over 9 iterations in 800 ms. Result :sat
Minimization took 101 ms.
[2023-03-15 07:47:12] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-15 07:47:12] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 18 ms returned sat
[2023-03-15 07:47:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:47:12] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2023-03-15 07:47:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:47:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 38 ms returned sat
[2023-03-15 07:47:12] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 12 ms returned sat
[2023-03-15 07:47:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:47:12] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2023-03-15 07:47:13] [INFO ] Computed and/alt/rep : 134/675/134 causal constraints (skipped 560 transitions) in 62 ms.
[2023-03-15 07:47:13] [INFO ] Added : 19 causal constraints over 4 iterations in 434 ms. Result :sat
Minimization took 105 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 282/282 places, 712/712 transitions.
Applied a total of 0 rules in 8 ms. Remains 282 /282 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 282/282 places, 712/712 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 282/282 places, 712/712 transitions.
Applied a total of 0 rules in 7 ms. Remains 282 /282 variables (removed 0) and now considering 712/712 (removed 0) transitions.
// Phase 1: matrix 712 rows 282 cols
[2023-03-15 07:47:13] [INFO ] Computed 27 place invariants in 12 ms
[2023-03-15 07:47:14] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 712 rows 282 cols
[2023-03-15 07:47:14] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-15 07:47:14] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
[2023-03-15 07:47:14] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 712 rows 282 cols
[2023-03-15 07:47:14] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-15 07:47:15] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 282/282 places, 712/712 transitions.
Starting property specific reduction for ASLink-PT-03a-UpperBounds-04
// Phase 1: matrix 712 rows 282 cols
[2023-03-15 07:47:15] [INFO ] Computed 27 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 203 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 712 rows 282 cols
[2023-03-15 07:47:15] [INFO ] Computed 27 place invariants in 12 ms
[2023-03-15 07:47:15] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-15 07:47:15] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 60 ms returned sat
[2023-03-15 07:47:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:47:15] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2023-03-15 07:47:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:47:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-15 07:47:15] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-15 07:47:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:47:16] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2023-03-15 07:47:16] [INFO ] Computed and/alt/rep : 134/675/134 causal constraints (skipped 560 transitions) in 43 ms.
[2023-03-15 07:47:17] [INFO ] Added : 36 causal constraints over 9 iterations in 1011 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 282 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 282/282 places, 712/712 transitions.
Applied a total of 0 rules in 8 ms. Remains 282 /282 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 282/282 places, 712/712 transitions.
// Phase 1: matrix 712 rows 282 cols
[2023-03-15 07:47:17] [INFO ] Computed 27 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 21159 resets, run finished after 1360 ms. (steps per millisecond=735 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7357 resets, run finished after 695 ms. (steps per millisecond=1438 ) properties (out of 1) seen :0
// Phase 1: matrix 712 rows 282 cols
[2023-03-15 07:47:19] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-15 07:47:19] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-15 07:47:19] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 18 ms returned sat
[2023-03-15 07:47:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:47:20] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2023-03-15 07:47:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:47:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-15 07:47:20] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-15 07:47:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:47:20] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2023-03-15 07:47:20] [INFO ] Computed and/alt/rep : 134/675/134 causal constraints (skipped 560 transitions) in 82 ms.
[2023-03-15 07:47:21] [INFO ] Added : 36 causal constraints over 9 iterations in 865 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 282 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 282/282 places, 712/712 transitions.
Applied a total of 0 rules in 8 ms. Remains 282 /282 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 282/282 places, 712/712 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 282/282 places, 712/712 transitions.
Applied a total of 0 rules in 7 ms. Remains 282 /282 variables (removed 0) and now considering 712/712 (removed 0) transitions.
// Phase 1: matrix 712 rows 282 cols
[2023-03-15 07:47:21] [INFO ] Computed 27 place invariants in 11 ms
[2023-03-15 07:47:22] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 712 rows 282 cols
[2023-03-15 07:47:22] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-15 07:47:22] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
[2023-03-15 07:47:22] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 712 rows 282 cols
[2023-03-15 07:47:22] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-15 07:47:23] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 282/282 places, 712/712 transitions.
Ending property specific reduction for ASLink-PT-03a-UpperBounds-04 in 8039 ms.
Starting property specific reduction for ASLink-PT-03a-UpperBounds-13
// Phase 1: matrix 712 rows 282 cols
[2023-03-15 07:47:23] [INFO ] Computed 27 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 198 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 712 rows 282 cols
[2023-03-15 07:47:23] [INFO ] Computed 27 place invariants in 5 ms
[2023-03-15 07:47:23] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-15 07:47:23] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-15 07:47:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:47:23] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2023-03-15 07:47:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:47:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-15 07:47:23] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-15 07:47:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:47:23] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2023-03-15 07:47:23] [INFO ] Computed and/alt/rep : 134/675/134 causal constraints (skipped 560 transitions) in 46 ms.
[2023-03-15 07:47:24] [INFO ] Added : 19 causal constraints over 4 iterations in 358 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 282 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 282/282 places, 712/712 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 282 transition count 711
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 281 transition count 711
Applied a total of 2 rules in 15 ms. Remains 281 /282 variables (removed 1) and now considering 711/712 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 281/282 places, 711/712 transitions.
// Phase 1: matrix 711 rows 281 cols
[2023-03-15 07:47:24] [INFO ] Computed 27 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 21125 resets, run finished after 1468 ms. (steps per millisecond=681 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7298 resets, run finished after 641 ms. (steps per millisecond=1560 ) properties (out of 1) seen :0
// Phase 1: matrix 711 rows 281 cols
[2023-03-15 07:47:26] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-15 07:47:26] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-15 07:47:26] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 8 ms returned sat
[2023-03-15 07:47:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 07:47:26] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-15 07:47:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 07:47:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-15 07:47:27] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-15 07:47:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 07:47:27] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2023-03-15 07:47:27] [INFO ] Computed and/alt/rep : 133/674/133 causal constraints (skipped 560 transitions) in 47 ms.
[2023-03-15 07:47:27] [INFO ] Added : 8 causal constraints over 2 iterations in 308 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 281 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 281/281 places, 711/711 transitions.
Applied a total of 0 rules in 39 ms. Remains 281 /281 variables (removed 0) and now considering 711/711 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 281/281 places, 711/711 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 281/281 places, 711/711 transitions.
Applied a total of 0 rules in 9 ms. Remains 281 /281 variables (removed 0) and now considering 711/711 (removed 0) transitions.
// Phase 1: matrix 711 rows 281 cols
[2023-03-15 07:47:27] [INFO ] Computed 27 place invariants in 5 ms
[2023-03-15 07:47:28] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 711 rows 281 cols
[2023-03-15 07:47:28] [INFO ] Computed 27 place invariants in 4 ms
[2023-03-15 07:47:28] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2023-03-15 07:47:28] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 711 rows 281 cols
[2023-03-15 07:47:28] [INFO ] Computed 27 place invariants in 5 ms
[2023-03-15 07:47:29] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 281/281 places, 711/711 transitions.
Ending property specific reduction for ASLink-PT-03a-UpperBounds-13 in 6201 ms.
[2023-03-15 07:47:29] [INFO ] Flatten gal took : 106 ms
[2023-03-15 07:47:29] [INFO ] Applying decomposition
[2023-03-15 07:47:29] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13862761312589668523.txt' '-o' '/tmp/graph13862761312589668523.bin' '-w' '/tmp/graph13862761312589668523.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13862761312589668523.bin' '-l' '-1' '-v' '-w' '/tmp/graph13862761312589668523.weights' '-q' '0' '-e' '0.001'
[2023-03-15 07:47:29] [INFO ] Decomposing Gal with order
[2023-03-15 07:47:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 07:47:30] [INFO ] Removed a total of 1495 redundant transitions.
[2023-03-15 07:47:30] [INFO ] Flatten gal took : 126 ms
[2023-03-15 07:47:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 17 ms.
[2023-03-15 07:47:30] [INFO ] Time to serialize gal into /tmp/UpperBounds18144200386301541844.gal : 10 ms
[2023-03-15 07:47:30] [INFO ] Time to serialize properties into /tmp/UpperBounds12860470661910092963.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds18144200386301541844.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12860470661910092963.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds12860470661910092963.prop.
Detected timeout of ITS tools.
[2023-03-15 08:08:17] [INFO ] Applying decomposition
[2023-03-15 08:08:17] [INFO ] Flatten gal took : 35 ms
[2023-03-15 08:08:17] [INFO ] Decomposing Gal with order
[2023-03-15 08:08:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:08:17] [INFO ] Removed a total of 1313 redundant transitions.
[2023-03-15 08:08:17] [INFO ] Flatten gal took : 75 ms
[2023-03-15 08:08:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 251 labels/synchronizations in 11 ms.
[2023-03-15 08:08:17] [INFO ] Time to serialize gal into /tmp/UpperBounds9383005729854982574.gal : 3 ms
[2023-03-15 08:08:17] [INFO ] Time to serialize properties into /tmp/UpperBounds7957957783162065573.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9383005729854982574.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7957957783162065573.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds7957957783162065573.prop.
Detected timeout of ITS tools.
[2023-03-15 08:29:05] [INFO ] Flatten gal took : 36 ms
[2023-03-15 08:29:05] [INFO ] Input system was already deterministic with 712 transitions.
[2023-03-15 08:29:05] [INFO ] Transformed 282 places.
[2023-03-15 08:29:05] [INFO ] Transformed 712 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 08:29:05] [INFO ] Time to serialize gal into /tmp/UpperBounds12791885321633861374.gal : 4 ms
[2023-03-15 08:29:05] [INFO ] Time to serialize properties into /tmp/UpperBounds10767416077874007009.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12791885321633861374.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10767416077874007009.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-03a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is ASLink-PT-03a, 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 r031-oct2-167813615300006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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