Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r021-smll-171620127800061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ASLink-PT-06b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620127800061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 921K May 18 16:42 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-06b-UpperBounds-00
FORMULA_NAME ASLink-PT-06b-UpperBounds-01
FORMULA_NAME ASLink-PT-06b-UpperBounds-02
FORMULA_NAME ASLink-PT-06b-UpperBounds-03
FORMULA_NAME ASLink-PT-06b-UpperBounds-04
FORMULA_NAME ASLink-PT-06b-UpperBounds-05
FORMULA_NAME ASLink-PT-06b-UpperBounds-06
FORMULA_NAME ASLink-PT-06b-UpperBounds-07
FORMULA_NAME ASLink-PT-06b-UpperBounds-08
FORMULA_NAME ASLink-PT-06b-UpperBounds-09
FORMULA_NAME ASLink-PT-06b-UpperBounds-10
FORMULA_NAME ASLink-PT-06b-UpperBounds-11
FORMULA_NAME ASLink-PT-06b-UpperBounds-12
FORMULA_NAME ASLink-PT-06b-UpperBounds-13
FORMULA_NAME ASLink-PT-06b-UpperBounds-14
FORMULA_NAME ASLink-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716427002510

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-23 01:16:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 01:16:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 01:16:45] [INFO ] Load time of PNML (sax parser for PT used): 384 ms
[2024-05-23 01:16:45] [INFO ] Transformed 2826 places.
[2024-05-23 01:16:45] [INFO ] Transformed 3513 transitions.
[2024-05-23 01:16:45] [INFO ] Found NUPN structural information;
[2024-05-23 01:16:45] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 598 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 3513 rows 2826 cols
[2024-05-23 01:16:46] [INFO ] Computed 277 invariants in 197 ms
Incomplete random walk after 10000 steps, including 15 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 16) seen :8
FORMULA ASLink-PT-06b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
[2024-05-23 01:16:46] [INFO ] Invariant cache hit.
[2024-05-23 01:16:47] [INFO ] [Real]Absence check using 65 positive place invariants in 108 ms returned sat
[2024-05-23 01:16:47] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 130 ms returned sat
[2024-05-23 01:16:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:16:51] [INFO ] [Real]Absence check using state equation in 3604 ms returned sat
[2024-05-23 01:16:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:16:52] [INFO ] [Nat]Absence check using 65 positive place invariants in 104 ms returned sat
[2024-05-23 01:16:52] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 109 ms returned sat
[2024-05-23 01:16:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:16:56] [INFO ] [Nat]Absence check using state equation in 4133 ms returned unknown
[2024-05-23 01:16:57] [INFO ] [Real]Absence check using 65 positive place invariants in 101 ms returned sat
[2024-05-23 01:16:57] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 144 ms returned sat
[2024-05-23 01:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:17:00] [INFO ] [Real]Absence check using state equation in 3251 ms returned sat
[2024-05-23 01:17:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:17:01] [INFO ] [Nat]Absence check using 65 positive place invariants in 101 ms returned sat
[2024-05-23 01:17:01] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 149 ms returned sat
[2024-05-23 01:17:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:17:04] [INFO ] [Nat]Absence check using state equation in 2913 ms returned sat
[2024-05-23 01:17:06] [INFO ] Deduced a trap composed of 23 places in 1497 ms of which 8 ms to minimize.
[2024-05-23 01:17:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 01:17:07] [INFO ] [Real]Absence check using 65 positive place invariants in 98 ms returned sat
[2024-05-23 01:17:07] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 135 ms returned sat
[2024-05-23 01:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:17:10] [INFO ] [Real]Absence check using state equation in 3097 ms returned sat
[2024-05-23 01:17:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:17:11] [INFO ] [Nat]Absence check using 65 positive place invariants in 105 ms returned sat
[2024-05-23 01:17:11] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 141 ms returned sat
[2024-05-23 01:17:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:17:15] [INFO ] [Nat]Absence check using state equation in 4171 ms returned unknown
[2024-05-23 01:17:16] [INFO ] [Real]Absence check using 65 positive place invariants in 95 ms returned sat
[2024-05-23 01:17:16] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 131 ms returned sat
[2024-05-23 01:17:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:17:20] [INFO ] [Real]Absence check using state equation in 3299 ms returned sat
[2024-05-23 01:17:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:17:20] [INFO ] [Nat]Absence check using 65 positive place invariants in 104 ms returned sat
[2024-05-23 01:17:21] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 157 ms returned sat
[2024-05-23 01:17:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:17:24] [INFO ] [Nat]Absence check using state equation in 3179 ms returned sat
[2024-05-23 01:17:26] [INFO ] Deduced a trap composed of 23 places in 1676 ms of which 6 ms to minimize.
[2024-05-23 01:17: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-23 01:17:26] [INFO ] [Real]Absence check using 65 positive place invariants in 101 ms returned sat
[2024-05-23 01:17:27] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 148 ms returned sat
[2024-05-23 01:17:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:17:30] [INFO ] [Real]Absence check using state equation in 3545 ms returned sat
[2024-05-23 01:17:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:17:31] [INFO ] [Nat]Absence check using 65 positive place invariants in 105 ms returned sat
[2024-05-23 01:17:31] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 138 ms returned sat
[2024-05-23 01:17:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:17:35] [INFO ] [Nat]Absence check using state equation in 4161 ms returned unknown
[2024-05-23 01:17:36] [INFO ] [Real]Absence check using 65 positive place invariants in 101 ms returned sat
[2024-05-23 01:17:36] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 142 ms returned sat
[2024-05-23 01:17:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:17:39] [INFO ] [Real]Absence check using state equation in 2759 ms returned sat
[2024-05-23 01:17:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:17:40] [INFO ] [Nat]Absence check using 65 positive place invariants in 103 ms returned sat
[2024-05-23 01:17:40] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 148 ms returned sat
[2024-05-23 01:17:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:17:44] [INFO ] [Nat]Absence check using state equation in 4171 ms returned unknown
[2024-05-23 01:17:45] [INFO ] [Real]Absence check using 65 positive place invariants in 102 ms returned sat
[2024-05-23 01:17:45] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 165 ms returned sat
[2024-05-23 01:17:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:17:48] [INFO ] [Real]Absence check using state equation in 2807 ms returned sat
[2024-05-23 01:17:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:17:49] [INFO ] [Nat]Absence check using 65 positive place invariants in 98 ms returned sat
[2024-05-23 01:17:49] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 120 ms returned sat
[2024-05-23 01:17:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:17:53] [INFO ] [Nat]Absence check using state equation in 4206 ms returned unknown
[2024-05-23 01:17:54] [INFO ] [Real]Absence check using 65 positive place invariants in 99 ms returned sat
[2024-05-23 01:17:54] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 144 ms returned sat
[2024-05-23 01:17:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:17:57] [INFO ] [Real]Absence check using state equation in 2983 ms returned sat
[2024-05-23 01:17:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:17:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 103 ms returned sat
[2024-05-23 01:17:58] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 142 ms returned sat
[2024-05-23 01:17:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:18:01] [INFO ] [Nat]Absence check using state equation in 2795 ms returned sat
[2024-05-23 01:18:01] [INFO ] Computed and/alt/rep : 2957/6472/2957 causal constraints (skipped 555 transitions) in 303 ms.
[2024-05-23 01:18:05] [INFO ] Deduced a trap composed of 18 places in 2887 ms of which 3 ms to minimize.
[2024-05-23 01:18: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 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 2826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Drop transitions removed 650 transitions
Trivial Post-agglo rules discarded 650 transitions
Performed 650 trivial Post agglomeration. Transition count delta: 650
Iterating post reduction 0 with 650 rules applied. Total rules applied 650 place count 2826 transition count 2863
Reduce places removed 650 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 680 rules applied. Total rules applied 1330 place count 2176 transition count 2833
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 1340 place count 2168 transition count 2831
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1342 place count 2166 transition count 2831
Performed 656 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 656 Pre rules applied. Total rules applied 1342 place count 2166 transition count 2175
Deduced a syphon composed of 656 places in 9 ms
Ensure Unique test removed 63 places
Reduce places removed 719 places and 0 transitions.
Iterating global reduction 4 with 1375 rules applied. Total rules applied 2717 place count 1447 transition count 2175
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 4 with 45 rules applied. Total rules applied 2762 place count 1441 transition count 2136
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 5 with 39 rules applied. Total rules applied 2801 place count 1402 transition count 2136
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2801 place count 1402 transition count 2112
Deduced a syphon composed of 24 places in 15 ms
Ensure Unique test removed 24 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 2873 place count 1354 transition count 2112
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2873 place count 1354 transition count 2088
Deduced a syphon composed of 24 places in 14 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2921 place count 1330 transition count 2088
Discarding 88 places :
Symmetric choice reduction at 6 with 88 rule applications. Total rules 3009 place count 1242 transition count 2000
Iterating global reduction 6 with 88 rules applied. Total rules applied 3097 place count 1242 transition count 2000
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3098 place count 1242 transition count 1999
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 29 Pre rules applied. Total rules applied 3098 place count 1242 transition count 1970
Deduced a syphon composed of 29 places in 14 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 59 rules applied. Total rules applied 3157 place count 1212 transition count 1970
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3157 place count 1212 transition count 1969
Deduced a syphon composed of 1 places in 14 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 3160 place count 1210 transition count 1969
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 3167 place count 1203 transition count 1924
Iterating global reduction 7 with 7 rules applied. Total rules applied 3174 place count 1203 transition count 1924
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 3174 place count 1203 transition count 1919
Deduced a syphon composed of 5 places in 14 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 3184 place count 1198 transition count 1919
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3185 place count 1197 transition count 1911
Iterating global reduction 7 with 1 rules applied. Total rules applied 3186 place count 1197 transition count 1911
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3187 place count 1196 transition count 1903
Iterating global reduction 7 with 1 rules applied. Total rules applied 3188 place count 1196 transition count 1903
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3189 place count 1195 transition count 1895
Iterating global reduction 7 with 1 rules applied. Total rules applied 3190 place count 1195 transition count 1895
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3191 place count 1194 transition count 1887
Iterating global reduction 7 with 1 rules applied. Total rules applied 3192 place count 1194 transition count 1887
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3193 place count 1193 transition count 1879
Iterating global reduction 7 with 1 rules applied. Total rules applied 3194 place count 1193 transition count 1879
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3195 place count 1192 transition count 1871
Iterating global reduction 7 with 1 rules applied. Total rules applied 3196 place count 1192 transition count 1871
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3197 place count 1191 transition count 1863
Iterating global reduction 7 with 1 rules applied. Total rules applied 3198 place count 1191 transition count 1863
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3199 place count 1190 transition count 1855
Iterating global reduction 7 with 1 rules applied. Total rules applied 3200 place count 1190 transition count 1855
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3201 place count 1189 transition count 1847
Iterating global reduction 7 with 1 rules applied. Total rules applied 3202 place count 1189 transition count 1847
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3203 place count 1188 transition count 1839
Iterating global reduction 7 with 1 rules applied. Total rules applied 3204 place count 1188 transition count 1839
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3205 place count 1187 transition count 1831
Iterating global reduction 7 with 1 rules applied. Total rules applied 3206 place count 1187 transition count 1831
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3207 place count 1186 transition count 1823
Iterating global reduction 7 with 1 rules applied. Total rules applied 3208 place count 1186 transition count 1823
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3209 place count 1185 transition count 1815
Iterating global reduction 7 with 1 rules applied. Total rules applied 3210 place count 1185 transition count 1815
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3211 place count 1184 transition count 1807
Iterating global reduction 7 with 1 rules applied. Total rules applied 3212 place count 1184 transition count 1807
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3213 place count 1183 transition count 1799
Iterating global reduction 7 with 1 rules applied. Total rules applied 3214 place count 1183 transition count 1799
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3215 place count 1182 transition count 1791
Iterating global reduction 7 with 1 rules applied. Total rules applied 3216 place count 1182 transition count 1791
Performed 161 Post agglomeration using F-continuation condition.Transition count delta: 161
Deduced a syphon composed of 161 places in 3 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 7 with 322 rules applied. Total rules applied 3538 place count 1021 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3539 place count 1020 transition count 1629
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 3541 place count 1019 transition count 1629
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3542 place count 1018 transition count 1628
Iterating global reduction 7 with 1 rules applied. Total rules applied 3543 place count 1018 transition count 1628
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 3545 place count 1018 transition count 1626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3546 place count 1017 transition count 1626
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3548 place count 1016 transition count 1635
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 3555 place count 1016 transition count 1628
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 3562 place count 1009 transition count 1628
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 3568 place count 1009 transition count 1622
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3574 place count 1003 transition count 1622
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3575 place count 1002 transition count 1621
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 18 rules applied. Total rules applied 3593 place count 990 transition count 1615
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3599 place count 984 transition count 1615
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 18 Pre rules applied. Total rules applied 3599 place count 984 transition count 1597
Deduced a syphon composed of 18 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 13 with 37 rules applied. Total rules applied 3636 place count 965 transition count 1597
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 13 with 8 rules applied. Total rules applied 3644 place count 957 transition count 1597
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 3644 place count 957 transition count 1596
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 3646 place count 956 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 3647 place count 955 transition count 1595
Iterating global reduction 14 with 1 rules applied. Total rules applied 3648 place count 955 transition count 1595
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 3649 place count 954 transition count 1594
Iterating global reduction 14 with 1 rules applied. Total rules applied 3650 place count 954 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 3651 place count 953 transition count 1593
Iterating global reduction 14 with 1 rules applied. Total rules applied 3652 place count 953 transition count 1593
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 3653 place count 953 transition count 1592
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 15 with 26 rules applied. Total rules applied 3679 place count 940 transition count 1579
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 3684 place count 935 transition count 1574
Iterating global reduction 15 with 5 rules applied. Total rules applied 3689 place count 935 transition count 1574
Free-agglomeration rule applied 6 times.
Iterating global reduction 15 with 6 rules applied. Total rules applied 3695 place count 935 transition count 1568
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 3701 place count 929 transition count 1568
Applied a total of 3701 rules in 3519 ms. Remains 929 /2826 variables (removed 1897) and now considering 1568/3513 (removed 1945) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3521 ms. Remains : 929/2826 places, 1568/3513 transitions.
// Phase 1: matrix 1568 rows 929 cols
[2024-05-23 01:18:09] [INFO ] Computed 160 invariants in 52 ms
Incomplete random walk after 1000000 steps, including 11292 resets, run finished after 3780 ms. (steps per millisecond=264 ) properties (out of 8) seen :4
FORMULA ASLink-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1882 resets, run finished after 1571 ms. (steps per millisecond=636 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1887 resets, run finished after 1602 ms. (steps per millisecond=624 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1869 resets, run finished after 1611 ms. (steps per millisecond=620 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1848 resets, run finished after 1617 ms. (steps per millisecond=618 ) properties (out of 4) seen :0
[2024-05-23 01:18:19] [INFO ] Invariant cache hit.
[2024-05-23 01:18:19] [INFO ] [Real]Absence check using 40 positive place invariants in 24 ms returned sat
[2024-05-23 01:18:19] [INFO ] [Real]Absence check using 40 positive and 120 generalized place invariants in 42 ms returned sat
[2024-05-23 01:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:18:20] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2024-05-23 01:18:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:18:20] [INFO ] [Nat]Absence check using 40 positive place invariants in 24 ms returned sat
[2024-05-23 01:18:20] [INFO ] [Nat]Absence check using 40 positive and 120 generalized place invariants in 46 ms returned sat
[2024-05-23 01:18:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:18:21] [INFO ] [Nat]Absence check using state equation in 911 ms returned sat
[2024-05-23 01:18:21] [INFO ] Computed and/alt/rep : 625/2408/625 causal constraints (skipped 910 transitions) in 132 ms.
[2024-05-23 01:18:30] [INFO ] Added : 430 causal constraints over 86 iterations in 9203 ms. Result :sat
Minimization took 855 ms.
[2024-05-23 01:18:31] [INFO ] [Real]Absence check using 40 positive place invariants in 22 ms returned sat
[2024-05-23 01:18:32] [INFO ] [Real]Absence check using 40 positive and 120 generalized place invariants in 45 ms returned sat
[2024-05-23 01:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:18:32] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2024-05-23 01:18:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:18:33] [INFO ] [Nat]Absence check using 40 positive place invariants in 22 ms returned sat
[2024-05-23 01:18:33] [INFO ] [Nat]Absence check using 40 positive and 120 generalized place invariants in 45 ms returned sat
[2024-05-23 01:18:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:18:33] [INFO ] [Nat]Absence check using state equation in 787 ms returned sat
[2024-05-23 01:18:34] [INFO ] Computed and/alt/rep : 625/2408/625 causal constraints (skipped 910 transitions) in 117 ms.
[2024-05-23 01:18:44] [INFO ] Added : 472 causal constraints over 95 iterations in 10372 ms. Result :sat
Minimization took 1015 ms.
[2024-05-23 01:18:45] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-23 01:18:45] [INFO ] [Real]Absence check using 40 positive and 120 generalized place invariants in 42 ms returned sat
[2024-05-23 01:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:18:46] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2024-05-23 01:18:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:18:46] [INFO ] [Nat]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-23 01:18:46] [INFO ] [Nat]Absence check using 40 positive and 120 generalized place invariants in 42 ms returned sat
[2024-05-23 01:18:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:18:47] [INFO ] [Nat]Absence check using state equation in 856 ms returned sat
[2024-05-23 01:18:47] [INFO ] Computed and/alt/rep : 625/2408/625 causal constraints (skipped 910 transitions) in 103 ms.
[2024-05-23 01:18:51] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 5 ms to minimize.
[2024-05-23 01:18:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2024-05-23 01:18:51] [INFO ] Added : 131 causal constraints over 27 iterations in 3738 ms. Result :sat
Minimization took 930 ms.
[2024-05-23 01:18:52] [INFO ] [Real]Absence check using 40 positive place invariants in 33 ms returned sat
[2024-05-23 01:18:52] [INFO ] [Real]Absence check using 40 positive and 120 generalized place invariants in 209 ms returned sat
[2024-05-23 01:18:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:18:53] [INFO ] [Real]Absence check using state equation in 753 ms returned sat
[2024-05-23 01:18:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:18:53] [INFO ] [Nat]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-23 01:18:53] [INFO ] [Nat]Absence check using 40 positive and 120 generalized place invariants in 43 ms returned sat
[2024-05-23 01:18:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:18:54] [INFO ] [Nat]Absence check using state equation in 710 ms returned sat
[2024-05-23 01:18:54] [INFO ] Computed and/alt/rep : 625/2408/625 causal constraints (skipped 910 transitions) in 255 ms.
[2024-05-23 01:19:04] [INFO ] Added : 470 causal constraints over 94 iterations in 10302 ms. Result :sat
Minimization took 888 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 929 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 929/929 places, 1568/1568 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 929 transition count 1566
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 927 transition count 1566
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 927 transition count 1563
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 924 transition count 1563
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 923 transition count 1562
Applied a total of 12 rules in 78 ms. Remains 923 /929 variables (removed 6) and now considering 1562/1568 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 923/929 places, 1562/1568 transitions.
// Phase 1: matrix 1562 rows 923 cols
[2024-05-23 01:19:10] [INFO ] Computed 160 invariants in 26 ms
Incomplete random walk after 1000000 steps, including 11436 resets, run finished after 3583 ms. (steps per millisecond=279 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1870 resets, run finished after 2224 ms. (steps per millisecond=449 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1865 resets, run finished after 1481 ms. (steps per millisecond=675 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1847 resets, run finished after 1436 ms. (steps per millisecond=696 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1841 resets, run finished after 1446 ms. (steps per millisecond=691 ) properties (out of 4) seen :0
[2024-05-23 01:19:20] [INFO ] Invariant cache hit.
[2024-05-23 01:19:20] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-23 01:19:20] [INFO ] [Real]Absence check using 40 positive and 120 generalized place invariants in 42 ms returned sat
[2024-05-23 01:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:19:21] [INFO ] [Real]Absence check using state equation in 873 ms returned sat
[2024-05-23 01:19:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:19:22] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2024-05-23 01:19:22] [INFO ] [Nat]Absence check using 40 positive and 120 generalized place invariants in 56 ms returned sat
[2024-05-23 01:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:19:23] [INFO ] [Nat]Absence check using state equation in 1097 ms returned sat
[2024-05-23 01:19:23] [INFO ] Computed and/alt/rep : 618/2392/618 causal constraints (skipped 911 transitions) in 106 ms.
[2024-05-23 01:19:37] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 2 ms to minimize.
[2024-05-23 01:19:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 476 ms
[2024-05-23 01:19:37] [INFO ] Added : 423 causal constraints over 86 iterations in 14508 ms. Result :sat
Minimization took 870 ms.
[2024-05-23 01:19:38] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-23 01:19:39] [INFO ] [Real]Absence check using 40 positive and 120 generalized place invariants in 62 ms returned sat
[2024-05-23 01:19:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:19:40] [INFO ] [Real]Absence check using state equation in 1061 ms returned sat
[2024-05-23 01:19:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:19:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 36 ms returned sat
[2024-05-23 01:19:40] [INFO ] [Nat]Absence check using 40 positive and 120 generalized place invariants in 63 ms returned sat
[2024-05-23 01:19:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:19:41] [INFO ] [Nat]Absence check using state equation in 953 ms returned sat
[2024-05-23 01:19:41] [INFO ] Computed and/alt/rep : 618/2392/618 causal constraints (skipped 911 transitions) in 105 ms.
[2024-05-23 01:19:50] [INFO ] Added : 373 causal constraints over 75 iterations in 9320 ms. Result :sat
Minimization took 548 ms.
[2024-05-23 01:19:51] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-23 01:19:51] [INFO ] [Real]Absence check using 40 positive and 120 generalized place invariants in 43 ms returned sat
[2024-05-23 01:19:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:19:52] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2024-05-23 01:19:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:19:52] [INFO ] [Nat]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-23 01:19:52] [INFO ] [Nat]Absence check using 40 positive and 120 generalized place invariants in 44 ms returned sat
[2024-05-23 01:19:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:19:53] [INFO ] [Nat]Absence check using state equation in 818 ms returned sat
[2024-05-23 01:19:53] [INFO ] Computed and/alt/rep : 618/2392/618 causal constraints (skipped 911 transitions) in 108 ms.
[2024-05-23 01:19:56] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 1 ms to minimize.
[2024-05-23 01:19:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
[2024-05-23 01:19:56] [INFO ] Added : 106 causal constraints over 22 iterations in 2886 ms. Result :sat
Minimization took 945 ms.
[2024-05-23 01:19:57] [INFO ] [Real]Absence check using 40 positive place invariants in 20 ms returned sat
[2024-05-23 01:19:57] [INFO ] [Real]Absence check using 40 positive and 120 generalized place invariants in 43 ms returned sat
[2024-05-23 01:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:19:58] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2024-05-23 01:19:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:19:58] [INFO ] [Nat]Absence check using 40 positive place invariants in 21 ms returned sat
[2024-05-23 01:19:58] [INFO ] [Nat]Absence check using 40 positive and 120 generalized place invariants in 44 ms returned sat
[2024-05-23 01:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:19:59] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2024-05-23 01:19:59] [INFO ] Computed and/alt/rep : 618/2392/618 causal constraints (skipped 911 transitions) in 108 ms.
[2024-05-23 01:20:11] [INFO ] Deduced a trap composed of 95 places in 394 ms of which 3 ms to minimize.
[2024-05-23 01:20:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 578 ms
[2024-05-23 01:20:11] [INFO ] Added : 454 causal constraints over 92 iterations in 11726 ms. Result :sat
Minimization took 824 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 923 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 923/923 places, 1562/1562 transitions.
Applied a total of 0 rules in 42 ms. Remains 923 /923 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 923/923 places, 1562/1562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 923/923 places, 1562/1562 transitions.
Applied a total of 0 rules in 40 ms. Remains 923 /923 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2024-05-23 01:20:17] [INFO ] Invariant cache hit.
[2024-05-23 01:20:18] [INFO ] Implicit Places using invariants in 1479 ms returned [1, 18, 19, 31, 48, 66, 137, 141, 150, 151, 153, 170, 188, 257, 261, 262, 273, 274, 276, 293, 311, 381, 385, 386, 397, 398, 400, 417, 435, 506, 510, 511, 523, 526, 543, 561, 580, 630, 631, 642, 643, 645, 662, 680, 749, 753, 754, 757, 768, 769, 770, 788, 790, 794, 812, 813, 814, 815, 827, 833, 839, 845, 851, 857, 863, 869, 875, 881, 887]
Discarding 69 places :
Implicit Place search using SMT only with invariants took 1492 ms to find 69 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 854/923 places, 1562/1562 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 854 transition count 1438
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 129 rules applied. Total rules applied 253 place count 730 transition count 1433
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 253 place count 730 transition count 1406
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 308 place count 702 transition count 1406
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 320 place count 698 transition count 1398
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 328 place count 690 transition count 1398
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 344 place count 674 transition count 1382
Iterating global reduction 4 with 16 rules applied. Total rules applied 360 place count 674 transition count 1382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 363 place count 674 transition count 1379
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 363 place count 674 transition count 1378
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 365 place count 673 transition count 1378
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 369 place count 669 transition count 1371
Iterating global reduction 5 with 4 rules applied. Total rules applied 373 place count 669 transition count 1371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 374 place count 669 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 375 place count 668 transition count 1369
Iterating global reduction 6 with 1 rules applied. Total rules applied 376 place count 668 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 377 place count 667 transition count 1367
Iterating global reduction 6 with 1 rules applied. Total rules applied 378 place count 667 transition count 1367
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 6 with 92 rules applied. Total rules applied 470 place count 621 transition count 1321
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 474 place count 617 transition count 1317
Iterating global reduction 6 with 4 rules applied. Total rules applied 478 place count 617 transition count 1317
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 482 place count 617 transition count 1313
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 486 place count 615 transition count 1314
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 502 place count 615 transition count 1298
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 519 place count 598 transition count 1298
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 535 place count 598 transition count 1298
Applied a total of 535 rules in 371 ms. Remains 598 /854 variables (removed 256) and now considering 1298/1562 (removed 264) transitions.
// Phase 1: matrix 1298 rows 598 cols
[2024-05-23 01:20:19] [INFO ] Computed 85 invariants in 16 ms
[2024-05-23 01:20:20] [INFO ] Implicit Places using invariants in 904 ms returned [72, 89, 96, 99, 101, 104, 105, 157, 174, 180, 183, 185, 190, 191, 243, 261, 267, 270, 272, 277, 278, 331, 360, 368, 369, 437, 443, 446, 448, 453, 454, 506, 523, 529, 532, 534]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 908 ms to find 36 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 562/923 places, 1298/1562 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 549 transition count 1285
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 549 transition count 1285
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 546 transition count 1282
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 546 transition count 1282
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 50 place count 537 transition count 1273
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 65 place count 537 transition count 1258
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 80 place count 522 transition count 1258
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 85 place count 522 transition count 1253
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 90 place count 517 transition count 1253
Applied a total of 90 rules in 130 ms. Remains 517 /562 variables (removed 45) and now considering 1253/1298 (removed 45) transitions.
// Phase 1: matrix 1253 rows 517 cols
[2024-05-23 01:20:20] [INFO ] Computed 49 invariants in 14 ms
[2024-05-23 01:20:20] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-05-23 01:20:20] [INFO ] Invariant cache hit.
[2024-05-23 01:20:22] [INFO ] Implicit Places using invariants and state equation in 1557 ms returned []
Implicit Place search using SMT with State Equation took 2075 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 517/923 places, 1253/1562 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5016 ms. Remains : 517/923 places, 1253/1562 transitions.
Successfully produced net in file /tmp/petri1000_799919461937536272.dot
Successfully produced net in file /tmp/petri1001_3302264988087490869.dot
Successfully produced net in file /tmp/petri1002_6155298140746731126.dot
Successfully produced net in file /tmp/petri1003_8164480532525164580.dot
Successfully produced net in file /tmp/petri1004_3072000326136100098.dot
Drop transitions removed 5 transitions
Dominated transitions for bounds rules discarded 5 transitions
// Phase 1: matrix 1248 rows 517 cols
[2024-05-23 01:20:22] [INFO ] Computed 49 invariants in 17 ms
Incomplete random walk after 1000000 steps, including 17243 resets, run finished after 2545 ms. (steps per millisecond=392 ) properties (out of 4) seen :1
FORMULA ASLink-PT-06b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3504 resets, run finished after 923 ms. (steps per millisecond=1083 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3502 resets, run finished after 921 ms. (steps per millisecond=1085 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3528 resets, run finished after 918 ms. (steps per millisecond=1089 ) properties (out of 3) seen :0
[2024-05-23 01:20:27] [INFO ] Invariant cache hit.
[2024-05-23 01:20:27] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-23 01:20:27] [INFO ] [Real]Absence check using 13 positive and 36 generalized place invariants in 16 ms returned sat
[2024-05-23 01:20:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:20:28] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2024-05-23 01:20:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:20:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-23 01:20:28] [INFO ] [Nat]Absence check using 13 positive and 36 generalized place invariants in 20 ms returned sat
[2024-05-23 01:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:20:28] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2024-05-23 01:20:28] [INFO ] Computed and/alt/rep : 290/1268/290 causal constraints (skipped 925 transitions) in 93 ms.
[2024-05-23 01:20:29] [INFO ] Added : 41 causal constraints over 9 iterations in 788 ms. Result :sat
Minimization took 257 ms.
[2024-05-23 01:20:30] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-23 01:20:30] [INFO ] [Real]Absence check using 13 positive and 36 generalized place invariants in 16 ms returned sat
[2024-05-23 01:20:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:20:30] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2024-05-23 01:20:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:20:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-23 01:20:30] [INFO ] [Nat]Absence check using 13 positive and 36 generalized place invariants in 19 ms returned sat
[2024-05-23 01:20:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:20:31] [INFO ] [Nat]Absence check using state equation in 993 ms returned sat
[2024-05-23 01:20:31] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 0 ms to minimize.
[2024-05-23 01:20:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2024-05-23 01:20:31] [INFO ] Computed and/alt/rep : 290/1268/290 causal constraints (skipped 925 transitions) in 89 ms.
[2024-05-23 01:20:32] [INFO ] Added : 19 causal constraints over 4 iterations in 552 ms. Result :sat
Minimization took 289 ms.
[2024-05-23 01:20:32] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-23 01:20:32] [INFO ] [Real]Absence check using 13 positive and 36 generalized place invariants in 17 ms returned sat
[2024-05-23 01:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:20:33] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2024-05-23 01:20:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:20:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-23 01:20:33] [INFO ] [Nat]Absence check using 13 positive and 36 generalized place invariants in 18 ms returned sat
[2024-05-23 01:20:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:20:34] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2024-05-23 01:20:34] [INFO ] Computed and/alt/rep : 290/1268/290 causal constraints (skipped 925 transitions) in 72 ms.
[2024-05-23 01:20:34] [INFO ] Added : 15 causal constraints over 3 iterations in 512 ms. Result :sat
Minimization took 229 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA ASLink-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 1248/1248 transitions.
Graph (complete) has 3079 edges and 517 vertex of which 512 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output 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 2 place count 512 transition count 1247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 511 transition count 1247
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 6 place count 509 transition count 1246
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 509 transition count 1242
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 505 transition count 1242
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 505 transition count 1241
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 20 place count 505 transition count 1241
Applied a total of 20 rules in 90 ms. Remains 505 /517 variables (removed 12) and now considering 1241/1248 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 505/517 places, 1241/1248 transitions.
Successfully produced net in file /tmp/petri1005_9735263219309141186.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
// Phase 1: matrix 1240 rows 505 cols
[2024-05-23 01:20:35] [INFO ] Computed 48 invariants in 14 ms
Incomplete random walk after 1000000 steps, including 17262 resets, run finished after 2583 ms. (steps per millisecond=387 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3654 resets, run finished after 926 ms. (steps per millisecond=1079 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3631 resets, run finished after 930 ms. (steps per millisecond=1075 ) properties (out of 2) seen :0
[2024-05-23 01:20:40] [INFO ] Invariant cache hit.
[2024-05-23 01:20:40] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-23 01:20:40] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 18 ms returned sat
[2024-05-23 01:20:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:20:40] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2024-05-23 01:20:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:20:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-23 01:20:41] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 16 ms returned sat
[2024-05-23 01:20:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:20:41] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2024-05-23 01:20:41] [INFO ] Computed and/alt/rep : 282/1250/282 causal constraints (skipped 925 transitions) in 94 ms.
[2024-05-23 01:20:43] [INFO ] Added : 42 causal constraints over 9 iterations in 1467 ms. Result :sat
Minimization took 400 ms.
[2024-05-23 01:20:43] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-23 01:20:43] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 17 ms returned sat
[2024-05-23 01:20:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:20:44] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2024-05-23 01:20:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:20:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-23 01:20:44] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 16 ms returned sat
[2024-05-23 01:20:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:20:44] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2024-05-23 01:20:44] [INFO ] Computed and/alt/rep : 282/1250/282 causal constraints (skipped 925 transitions) in 86 ms.
[2024-05-23 01:20:45] [INFO ] Added : 14 causal constraints over 3 iterations in 656 ms. Result :sat
Minimization took 245 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA ASLink-PT-06b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1240/1240 transitions.
Graph (complete) has 3068 edges and 505 vertex of which 504 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 502 transition count 1238
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 502 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 501 transition count 1237
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 501 transition count 1237
Applied a total of 8 rules in 72 ms. Remains 501 /505 variables (removed 4) and now considering 1237/1240 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 501/505 places, 1237/1240 transitions.
// Phase 1: matrix 1237 rows 501 cols
[2024-05-23 01:20:46] [INFO ] Computed 48 invariants in 12 ms
Incomplete random walk after 1000000 steps, including 17524 resets, run finished after 2570 ms. (steps per millisecond=389 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3636 resets, run finished after 905 ms. (steps per millisecond=1104 ) properties (out of 1) seen :0
[2024-05-23 01:20:49] [INFO ] Invariant cache hit.
[2024-05-23 01:20:49] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-23 01:20:49] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 17 ms returned sat
[2024-05-23 01:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:20:50] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2024-05-23 01:20:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:20:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-23 01:20:50] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 17 ms returned sat
[2024-05-23 01:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:20:51] [INFO ] [Nat]Absence check using state equation in 743 ms returned sat
[2024-05-23 01:20:51] [INFO ] Computed and/alt/rep : 279/1238/279 causal constraints (skipped 925 transitions) in 90 ms.
[2024-05-23 01:20:52] [INFO ] Added : 55 causal constraints over 11 iterations in 913 ms. Result :sat
Minimization took 253 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 1237/1237 transitions.
Applied a total of 0 rules in 21 ms. Remains 501 /501 variables (removed 0) and now considering 1237/1237 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 501/501 places, 1237/1237 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 1237/1237 transitions.
Applied a total of 0 rules in 21 ms. Remains 501 /501 variables (removed 0) and now considering 1237/1237 (removed 0) transitions.
[2024-05-23 01:20:53] [INFO ] Invariant cache hit.
[2024-05-23 01:20:54] [INFO ] Implicit Places using invariants in 540 ms returned [291, 297]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 542 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 499/501 places, 1237/1237 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 497 transition count 1235
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 497 transition count 1235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 496 transition count 1234
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 496 transition count 1234
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 8 place count 495 transition count 1233
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 495 transition count 1231
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 493 transition count 1231
Applied a total of 12 rules in 81 ms. Remains 493 /499 variables (removed 6) and now considering 1231/1237 (removed 6) transitions.
// Phase 1: matrix 1231 rows 493 cols
[2024-05-23 01:20:54] [INFO ] Computed 46 invariants in 13 ms
[2024-05-23 01:20:55] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-05-23 01:20:55] [INFO ] Invariant cache hit.
[2024-05-23 01:20:56] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 1979 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 493/501 places, 1231/1237 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2624 ms. Remains : 493/501 places, 1231/1237 transitions.
[2024-05-23 01:20:56] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 17504 resets, run finished after 2666 ms. (steps per millisecond=375 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3685 resets, run finished after 949 ms. (steps per millisecond=1053 ) properties (out of 1) seen :0
[2024-05-23 01:21:00] [INFO ] Invariant cache hit.
[2024-05-23 01:21:00] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-23 01:21:00] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 16 ms returned sat
[2024-05-23 01:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 01:21:00] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2024-05-23 01:21:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 01:21:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-23 01:21:00] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 17 ms returned sat
[2024-05-23 01:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 01:21:01] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2024-05-23 01:21:01] [INFO ] Computed and/alt/rep : 273/1226/273 causal constraints (skipped 925 transitions) in 88 ms.
[2024-05-23 01:21:02] [INFO ] Added : 36 causal constraints over 9 iterations in 919 ms. Result :sat
Minimization took 137 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA ASLink-PT-06b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 257527 ms.

BK_STOP 1716427263794

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-06b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ASLink-PT-06b, 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 r021-smll-171620127800061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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