Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r323-tall-165472292500016.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is BugTracking-PT-q3m064, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292500016
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 10K Jun 7 16:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 7 16:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 7 16:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 7 16:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Jun 6 15:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Jun 7 16:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Jun 7 16:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 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 BugTracking-PT-q3m064-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654730227158

Running Version 0
[2022-06-08 23:17:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-08 23:17:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 23:17:09] [INFO ] Load time of PNML (sax parser for PT used): 860 ms
[2022-06-08 23:17:09] [INFO ] Transformed 754 places.
[2022-06-08 23:17:09] [INFO ] Transformed 27370 transitions.
[2022-06-08 23:17:09] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 1009 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 514 places in 124 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m064-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2642 out of 2769 initially.
// Phase 1: matrix 2642 rows 240 cols
[2022-06-08 23:17:10] [INFO ] Computed 10 place invariants in 43 ms
Incomplete random walk after 10000 steps, including 13 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :1
[2022-06-08 23:17:10] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2022-06-08 23:17:10] [INFO ] Computed 10 place invariants in 25 ms
[2022-06-08 23:17:10] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-06-08 23:17:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:10] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2022-06-08 23:17:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:17:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-08 23:17:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:11] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2022-06-08 23:17:11] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-08 23:17:11] [INFO ] [Nat]Added 268 Read/Feed constraints in 142 ms returned sat
[2022-06-08 23:17:11] [INFO ] Deduced a trap composed of 12 places in 390 ms of which 5 ms to minimize.
[2022-06-08 23:17:12] [INFO ] Deduced a trap composed of 48 places in 404 ms of which 1 ms to minimize.
[2022-06-08 23:17:12] [INFO ] Deduced a trap composed of 68 places in 297 ms of which 1 ms to minimize.
[2022-06-08 23:17:13] [INFO ] Deduced a trap composed of 86 places in 300 ms of which 1 ms to minimize.
[2022-06-08 23:17:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1767 ms
[2022-06-08 23:17:13] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 214 ms.
[2022-06-08 23:17:16] [INFO ] Deduced a trap composed of 50 places in 211 ms of which 1 ms to minimize.
[2022-06-08 23:17:16] [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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 23:17:16] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:16] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2022-06-08 23:17:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:17:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:16] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2022-06-08 23:17:17] [INFO ] [Nat]Added 268 Read/Feed constraints in 123 ms returned sat
[2022-06-08 23:17:17] [INFO ] Deduced a trap composed of 72 places in 369 ms of which 1 ms to minimize.
[2022-06-08 23:17:17] [INFO ] Deduced a trap composed of 19 places in 278 ms of which 1 ms to minimize.
[2022-06-08 23:17:18] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 1 ms to minimize.
[2022-06-08 23:17:18] [INFO ] Deduced a trap composed of 18 places in 333 ms of which 0 ms to minimize.
[2022-06-08 23:17:18] [INFO ] Deduced a trap composed of 11 places in 340 ms of which 0 ms to minimize.
[2022-06-08 23:17:19] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 1 ms to minimize.
[2022-06-08 23:17:19] [INFO ] Deduced a trap composed of 55 places in 230 ms of which 0 ms to minimize.
[2022-06-08 23:17:19] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 1 ms to minimize.
[2022-06-08 23:17:20] [INFO ] Deduced a trap composed of 75 places in 213 ms of which 1 ms to minimize.
[2022-06-08 23:17:20] [INFO ] Deduced a trap composed of 75 places in 224 ms of which 0 ms to minimize.
[2022-06-08 23:17:20] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 0 ms to minimize.
[2022-06-08 23:17:20] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 0 ms to minimize.
[2022-06-08 23:17:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3981 ms
[2022-06-08 23:17:21] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 210 ms.
[2022-06-08 23:17:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 23:17:21] [INFO ] [Real]Absence check using 10 positive place invariants in 63 ms returned sat
[2022-06-08 23:17:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:22] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2022-06-08 23:17:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:17:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:22] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2022-06-08 23:17:22] [INFO ] [Nat]Added 268 Read/Feed constraints in 138 ms returned sat
[2022-06-08 23:17:23] [INFO ] Deduced a trap composed of 12 places in 311 ms of which 0 ms to minimize.
[2022-06-08 23:17:23] [INFO ] Deduced a trap composed of 86 places in 322 ms of which 0 ms to minimize.
[2022-06-08 23:17:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 834 ms
[2022-06-08 23:17:23] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 155 ms.
[2022-06-08 23:17:26] [INFO ] Deduced a trap composed of 54 places in 354 ms of which 1 ms to minimize.
[2022-06-08 23:17:26] [INFO ] Deduced a trap composed of 54 places in 341 ms of which 1 ms to minimize.
[2022-06-08 23:17:27] [INFO ] Deduced a trap composed of 55 places in 306 ms of which 1 ms to minimize.
[2022-06-08 23:17:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[1, 0, 0]
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
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 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 238 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/240 places, 2747/2769 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:17:27] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 1000026 steps, including 2 resets, run finished after 1164 ms. (steps per millisecond=859 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2369 ms. (steps per millisecond=422 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2244 ms. (steps per millisecond=445 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2277 ms. (steps per millisecond=439 ) properties (out of 3) seen :1
[2022-06-08 23:17:35] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:17:35] [INFO ] Computed 8 place invariants in 19 ms
[2022-06-08 23:17:35] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:35] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2022-06-08 23:17:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:17:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:36] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2022-06-08 23:17:36] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:17:36] [INFO ] [Nat]Added 254 Read/Feed constraints in 144 ms returned sat
[2022-06-08 23:17:36] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 1 ms to minimize.
[2022-06-08 23:17:36] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2022-06-08 23:17:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 431 ms
[2022-06-08 23:17:37] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 178 ms.
[2022-06-08 23:17:39] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 0 ms to minimize.
[2022-06-08 23:17:39] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 0 ms to minimize.
[2022-06-08 23:17:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 548 ms
[2022-06-08 23:17:39] [INFO ] Added : 95 causal constraints over 19 iterations in 2982 ms. Result :sat
Minimization took 303 ms.
[2022-06-08 23:17:40] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:40] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2022-06-08 23:17:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:17:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-08 23:17:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:17:41] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2022-06-08 23:17:41] [INFO ] [Nat]Added 254 Read/Feed constraints in 134 ms returned sat
[2022-06-08 23:17:41] [INFO ] Deduced a trap composed of 71 places in 232 ms of which 1 ms to minimize.
[2022-06-08 23:17:41] [INFO ] Deduced a trap composed of 78 places in 222 ms of which 0 ms to minimize.
[2022-06-08 23:17:42] [INFO ] Deduced a trap composed of 78 places in 228 ms of which 0 ms to minimize.
[2022-06-08 23:17:42] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 0 ms to minimize.
[2022-06-08 23:17:42] [INFO ] Deduced a trap composed of 69 places in 253 ms of which 0 ms to minimize.
[2022-06-08 23:17:42] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 0 ms to minimize.
[2022-06-08 23:17:43] [INFO ] Deduced a trap composed of 70 places in 217 ms of which 0 ms to minimize.
[2022-06-08 23:17:43] [INFO ] Deduced a trap composed of 67 places in 227 ms of which 1 ms to minimize.
[2022-06-08 23:17:43] [INFO ] Deduced a trap composed of 76 places in 233 ms of which 5 ms to minimize.
[2022-06-08 23:17:44] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 1 ms to minimize.
[2022-06-08 23:17:44] [INFO ] Deduced a trap composed of 21 places in 213 ms of which 0 ms to minimize.
[2022-06-08 23:17:44] [INFO ] Deduced a trap composed of 88 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:17:44] [INFO ] Deduced a trap composed of 70 places in 206 ms of which 1 ms to minimize.
[2022-06-08 23:17:45] [INFO ] Deduced a trap composed of 69 places in 200 ms of which 1 ms to minimize.
[2022-06-08 23:17:45] [INFO ] Deduced a trap composed of 69 places in 188 ms of which 1 ms to minimize.
[2022-06-08 23:17:45] [INFO ] Deduced a trap composed of 75 places in 225 ms of which 0 ms to minimize.
[2022-06-08 23:17:46] [INFO ] Deduced a trap composed of 72 places in 204 ms of which 1 ms to minimize.
[2022-06-08 23:17:46] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 1 ms to minimize.
[2022-06-08 23:17:46] [INFO ] Deduced a trap composed of 71 places in 190 ms of which 1 ms to minimize.
[2022-06-08 23:17:46] [INFO ] Deduced a trap composed of 72 places in 183 ms of which 1 ms to minimize.
[2022-06-08 23:17:47] [INFO ] Deduced a trap composed of 76 places in 186 ms of which 0 ms to minimize.
[2022-06-08 23:17:47] [INFO ] Deduced a trap composed of 73 places in 183 ms of which 1 ms to minimize.
[2022-06-08 23:17:47] [INFO ] Deduced a trap composed of 73 places in 187 ms of which 0 ms to minimize.
[2022-06-08 23:17:47] [INFO ] Deduced a trap composed of 73 places in 187 ms of which 1 ms to minimize.
[2022-06-08 23:17:48] [INFO ] Deduced a trap composed of 74 places in 186 ms of which 1 ms to minimize.
[2022-06-08 23:17:48] [INFO ] Deduced a trap composed of 68 places in 210 ms of which 0 ms to minimize.
[2022-06-08 23:17:48] [INFO ] Deduced a trap composed of 85 places in 223 ms of which 1 ms to minimize.
[2022-06-08 23:17:49] [INFO ] Deduced a trap composed of 74 places in 199 ms of which 1 ms to minimize.
[2022-06-08 23:17:49] [INFO ] Deduced a trap composed of 67 places in 216 ms of which 1 ms to minimize.
[2022-06-08 23:17:49] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 1 ms to minimize.
[2022-06-08 23:17:49] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 0 ms to minimize.
[2022-06-08 23:17:50] [INFO ] Deduced a trap composed of 76 places in 225 ms of which 1 ms to minimize.
[2022-06-08 23:17:50] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 0 ms to minimize.
[2022-06-08 23:17:50] [INFO ] Deduced a trap composed of 75 places in 198 ms of which 1 ms to minimize.
[2022-06-08 23:17:51] [INFO ] Deduced a trap composed of 75 places in 197 ms of which 0 ms to minimize.
[2022-06-08 23:17:51] [INFO ] Deduced a trap composed of 73 places in 208 ms of which 2 ms to minimize.
[2022-06-08 23:17:51] [INFO ] Deduced a trap composed of 75 places in 197 ms of which 1 ms to minimize.
[2022-06-08 23:17:51] [INFO ] Deduced a trap composed of 75 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:17:52] [INFO ] Deduced a trap composed of 73 places in 196 ms of which 0 ms to minimize.
[2022-06-08 23:17:52] [INFO ] Deduced a trap composed of 71 places in 210 ms of which 2 ms to minimize.
[2022-06-08 23:17:52] [INFO ] Deduced a trap composed of 74 places in 205 ms of which 2 ms to minimize.
[2022-06-08 23:17:52] [INFO ] Deduced a trap composed of 72 places in 216 ms of which 2 ms to minimize.
[2022-06-08 23:17:53] [INFO ] Deduced a trap composed of 70 places in 221 ms of which 2 ms to minimize.
[2022-06-08 23:17:53] [INFO ] Deduced a trap composed of 70 places in 207 ms of which 0 ms to minimize.
[2022-06-08 23:17:53] [INFO ] Deduced a trap composed of 70 places in 204 ms of which 0 ms to minimize.
[2022-06-08 23:17:54] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:17:54] [INFO ] Deduced a trap composed of 66 places in 215 ms of which 1 ms to minimize.
[2022-06-08 23:17:54] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 1 ms to minimize.
[2022-06-08 23:17:54] [INFO ] Deduced a trap composed of 77 places in 220 ms of which 0 ms to minimize.
[2022-06-08 23:17:55] [INFO ] Deduced a trap composed of 87 places in 221 ms of which 0 ms to minimize.
[2022-06-08 23:17:55] [INFO ] Deduced a trap composed of 83 places in 213 ms of which 0 ms to minimize.
[2022-06-08 23:17:55] [INFO ] Deduced a trap composed of 75 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:17:56] [INFO ] Deduced a trap composed of 78 places in 233 ms of which 0 ms to minimize.
[2022-06-08 23:17:56] [INFO ] Deduced a trap composed of 72 places in 206 ms of which 0 ms to minimize.
[2022-06-08 23:17:56] [INFO ] Deduced a trap composed of 71 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:17:56] [INFO ] Deduced a trap composed of 75 places in 185 ms of which 1 ms to minimize.
[2022-06-08 23:17:57] [INFO ] Deduced a trap composed of 72 places in 203 ms of which 2 ms to minimize.
[2022-06-08 23:17:57] [INFO ] Deduced a trap composed of 73 places in 193 ms of which 0 ms to minimize.
[2022-06-08 23:17:57] [INFO ] Deduced a trap composed of 70 places in 215 ms of which 1 ms to minimize.
[2022-06-08 23:17:57] [INFO ] Deduced a trap composed of 87 places in 213 ms of which 1 ms to minimize.
[2022-06-08 23:17:58] [INFO ] Deduced a trap composed of 86 places in 233 ms of which 0 ms to minimize.
[2022-06-08 23:17:58] [INFO ] Deduced a trap composed of 75 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:17:58] [INFO ] Deduced a trap composed of 86 places in 209 ms of which 0 ms to minimize.
[2022-06-08 23:17:59] [INFO ] Deduced a trap composed of 85 places in 201 ms of which 1 ms to minimize.
[2022-06-08 23:17:59] [INFO ] Deduced a trap composed of 72 places in 183 ms of which 1 ms to minimize.
[2022-06-08 23:17:59] [INFO ] Deduced a trap composed of 74 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:17:59] [INFO ] Deduced a trap composed of 74 places in 211 ms of which 0 ms to minimize.
[2022-06-08 23:18:00] [INFO ] Deduced a trap composed of 74 places in 234 ms of which 0 ms to minimize.
[2022-06-08 23:18:00] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:18:00] [INFO ] Deduced a trap composed of 74 places in 213 ms of which 0 ms to minimize.
[2022-06-08 23:18:01] [INFO ] Deduced a trap composed of 71 places in 185 ms of which 1 ms to minimize.
[2022-06-08 23:18:01] [INFO ] Deduced a trap composed of 69 places in 187 ms of which 0 ms to minimize.
[2022-06-08 23:18:01] [INFO ] Deduced a trap composed of 70 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:18:01] [INFO ] Deduced a trap composed of 69 places in 182 ms of which 0 ms to minimize.
[2022-06-08 23:18:02] [INFO ] Deduced a trap composed of 72 places in 184 ms of which 1 ms to minimize.
[2022-06-08 23:18:02] [INFO ] Deduced a trap composed of 72 places in 182 ms of which 1 ms to minimize.
[2022-06-08 23:18:02] [INFO ] Deduced a trap composed of 73 places in 210 ms of which 0 ms to minimize.
[2022-06-08 23:18:02] [INFO ] Deduced a trap composed of 72 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:18:03] [INFO ] Deduced a trap composed of 74 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:18:03] [INFO ] Deduced a trap composed of 74 places in 195 ms of which 1 ms to minimize.
[2022-06-08 23:18:03] [INFO ] Deduced a trap composed of 73 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:18:03] [INFO ] Deduced a trap composed of 75 places in 216 ms of which 0 ms to minimize.
[2022-06-08 23:18:04] [INFO ] Deduced a trap composed of 75 places in 227 ms of which 1 ms to minimize.
[2022-06-08 23:18:04] [INFO ] Deduced a trap composed of 77 places in 201 ms of which 1 ms to minimize.
[2022-06-08 23:18:04] [INFO ] Deduced a trap composed of 71 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:18:05] [INFO ] Deduced a trap composed of 71 places in 215 ms of which 1 ms to minimize.
[2022-06-08 23:18:05] [INFO ] Deduced a trap composed of 90 places in 220 ms of which 0 ms to minimize.
[2022-06-08 23:18:05] [INFO ] Deduced a trap composed of 89 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:18:05] [INFO ] Deduced a trap composed of 88 places in 197 ms of which 0 ms to minimize.
[2022-06-08 23:18:06] [INFO ] Deduced a trap composed of 78 places in 207 ms of which 1 ms to minimize.
[2022-06-08 23:18:06] [INFO ] Deduced a trap composed of 76 places in 211 ms of which 1 ms to minimize.
[2022-06-08 23:18:06] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:18:06] [INFO ] Deduced a trap composed of 75 places in 196 ms of which 1 ms to minimize.
[2022-06-08 23:18:07] [INFO ] Deduced a trap composed of 79 places in 219 ms of which 0 ms to minimize.
[2022-06-08 23:18:07] [INFO ] Deduced a trap composed of 74 places in 212 ms of which 0 ms to minimize.
[2022-06-08 23:18:07] [INFO ] Deduced a trap composed of 77 places in 217 ms of which 0 ms to minimize.
[2022-06-08 23:18:08] [INFO ] Deduced a trap composed of 66 places in 211 ms of which 0 ms to minimize.
[2022-06-08 23:18:08] [INFO ] Deduced a trap composed of 70 places in 220 ms of which 1 ms to minimize.
[2022-06-08 23:18:08] [INFO ] Deduced a trap composed of 75 places in 212 ms of which 0 ms to minimize.
[2022-06-08 23:18:08] [INFO ] Deduced a trap composed of 75 places in 209 ms of which 1 ms to minimize.
[2022-06-08 23:18:09] [INFO ] Deduced a trap composed of 76 places in 211 ms of which 0 ms to minimize.
[2022-06-08 23:18:09] [INFO ] Deduced a trap composed of 81 places in 210 ms of which 1 ms to minimize.
[2022-06-08 23:18:09] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 1 ms to minimize.
[2022-06-08 23:18:10] [INFO ] Deduced a trap composed of 72 places in 213 ms of which 1 ms to minimize.
[2022-06-08 23:18:10] [INFO ] Deduced a trap composed of 72 places in 215 ms of which 1 ms to minimize.
[2022-06-08 23:18:10] [INFO ] Deduced a trap composed of 73 places in 209 ms of which 0 ms to minimize.
[2022-06-08 23:18:10] [INFO ] Deduced a trap composed of 78 places in 208 ms of which 0 ms to minimize.
[2022-06-08 23:18:11] [INFO ] Deduced a trap composed of 75 places in 218 ms of which 0 ms to minimize.
[2022-06-08 23:18:11] [INFO ] Deduced a trap composed of 72 places in 212 ms of which 0 ms to minimize.
[2022-06-08 23:18:11] [INFO ] Deduced a trap composed of 74 places in 215 ms of which 1 ms to minimize.
[2022-06-08 23:18:12] [INFO ] Deduced a trap composed of 80 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:18:12] [INFO ] Deduced a trap composed of 80 places in 211 ms of which 0 ms to minimize.
[2022-06-08 23:18:12] [INFO ] Deduced a trap composed of 78 places in 206 ms of which 1 ms to minimize.
[2022-06-08 23:18:12] [INFO ] Deduced a trap composed of 70 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:18:13] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:18:13] [INFO ] Deduced a trap composed of 70 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:18:13] [INFO ] Deduced a trap composed of 72 places in 210 ms of which 1 ms to minimize.
[2022-06-08 23:18:14] [INFO ] Deduced a trap composed of 71 places in 215 ms of which 0 ms to minimize.
[2022-06-08 23:18:14] [INFO ] Deduced a trap composed of 77 places in 206 ms of which 0 ms to minimize.
[2022-06-08 23:18:14] [INFO ] Deduced a trap composed of 72 places in 218 ms of which 0 ms to minimize.
[2022-06-08 23:18:14] [INFO ] Deduced a trap composed of 69 places in 207 ms of which 0 ms to minimize.
[2022-06-08 23:18:15] [INFO ] Deduced a trap composed of 71 places in 224 ms of which 1 ms to minimize.
[2022-06-08 23:18:15] [INFO ] Deduced a trap composed of 68 places in 212 ms of which 1 ms to minimize.
[2022-06-08 23:18:15] [INFO ] Deduced a trap composed of 67 places in 218 ms of which 1 ms to minimize.
[2022-06-08 23:18:16] [INFO ] Deduced a trap composed of 76 places in 211 ms of which 0 ms to minimize.
[2022-06-08 23:18:16] [INFO ] Deduced a trap composed of 51 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:18:16] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 1 ms to minimize.
[2022-06-08 23:18:16] [INFO ] Deduced a trap composed of 76 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:18:17] [INFO ] Deduced a trap composed of 75 places in 221 ms of which 0 ms to minimize.
[2022-06-08 23:18:17] [INFO ] Deduced a trap composed of 69 places in 215 ms of which 1 ms to minimize.
[2022-06-08 23:18:17] [INFO ] Deduced a trap composed of 50 places in 215 ms of which 1 ms to minimize.
[2022-06-08 23:18:18] [INFO ] Deduced a trap composed of 69 places in 213 ms of which 0 ms to minimize.
[2022-06-08 23:18:18] [INFO ] Deduced a trap composed of 52 places in 208 ms of which 0 ms to minimize.
[2022-06-08 23:18:18] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:18:18] [INFO ] Deduced a trap composed of 76 places in 207 ms of which 0 ms to minimize.
[2022-06-08 23:18:19] [INFO ] Deduced a trap composed of 86 places in 214 ms of which 1 ms to minimize.
[2022-06-08 23:18:19] [INFO ] Deduced a trap composed of 86 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:18:19] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 1 ms to minimize.
[2022-06-08 23:18:20] [INFO ] Deduced a trap composed of 56 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:18:20] [INFO ] Deduced a trap composed of 76 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:18:20] [INFO ] Deduced a trap composed of 75 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:18:20] [INFO ] Deduced a trap composed of 75 places in 187 ms of which 0 ms to minimize.
[2022-06-08 23:18:21] [INFO ] Deduced a trap composed of 70 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:18:21] [INFO ] Deduced a trap composed of 74 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:18:21] [INFO ] Deduced a trap composed of 76 places in 201 ms of which 1 ms to minimize.
[2022-06-08 23:18:21] [INFO ] Deduced a trap composed of 76 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:18:22] [INFO ] Deduced a trap composed of 75 places in 208 ms of which 0 ms to minimize.
[2022-06-08 23:18:22] [INFO ] Deduced a trap composed of 72 places in 205 ms of which 1 ms to minimize.
[2022-06-08 23:18:22] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:18:22] [INFO ] Deduced a trap composed of 69 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:18:23] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:18:23] [INFO ] Deduced a trap composed of 52 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:18:23] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 0 ms to minimize.
[2022-06-08 23:18:24] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:18:24] [INFO ] Deduced a trap composed of 69 places in 207 ms of which 0 ms to minimize.
[2022-06-08 23:18:24] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:18:24] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 1 ms to minimize.
[2022-06-08 23:18:25] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:18:25] [INFO ] Deduced a trap composed of 50 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:18:25] [INFO ] Deduced a trap composed of 67 places in 181 ms of which 1 ms to minimize.
[2022-06-08 23:18:25] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 0 ms to minimize.
[2022-06-08 23:18:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 23:18:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:18:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:26] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2022-06-08 23:18:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:18:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:18:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:26] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2022-06-08 23:18:26] [INFO ] [Nat]Added 254 Read/Feed constraints in 129 ms returned sat
[2022-06-08 23:18:27] [INFO ] Deduced a trap composed of 74 places in 210 ms of which 0 ms to minimize.
[2022-06-08 23:18:27] [INFO ] Deduced a trap composed of 47 places in 211 ms of which 0 ms to minimize.
[2022-06-08 23:18:27] [INFO ] Deduced a trap composed of 69 places in 203 ms of which 1 ms to minimize.
[2022-06-08 23:18:27] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 0 ms to minimize.
[2022-06-08 23:18:27] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2022-06-08 23:18:28] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 0 ms to minimize.
[2022-06-08 23:18:28] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 1 ms to minimize.
[2022-06-08 23:18:28] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 0 ms to minimize.
[2022-06-08 23:18:29] [INFO ] Deduced a trap composed of 72 places in 204 ms of which 0 ms to minimize.
[2022-06-08 23:18:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2391 ms
[2022-06-08 23:18:29] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 155 ms.
[2022-06-08 23:18:31] [INFO ] Added : 84 causal constraints over 17 iterations in 2068 ms. Result :sat
Minimization took 453 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[1, 0, 0]
Incomplete Parikh walk after 676100 steps, including 1000 resets, run finished after 6878 ms. (steps per millisecond=98 ) properties (out of 3) seen :2 could not realise parikh vector
Incomplete Parikh walk after 667100 steps, including 1000 resets, run finished after 6823 ms. (steps per millisecond=97 ) properties (out of 3) seen :1 could not realise parikh vector
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 66 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 41 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 23:18:45] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:18:45] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-08 23:18:45] [INFO ] Implicit Places using invariants in 310 ms returned []
[2022-06-08 23:18:45] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:18:45] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-08 23:18:46] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:18:50] [INFO ] Implicit Places using invariants and state equation in 4430 ms returned []
Implicit Place search using SMT with State Equation took 4742 ms to find 0 implicit places.
[2022-06-08 23:18:50] [INFO ] Redundant transitions in 208 ms returned []
[2022-06-08 23:18:50] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:18:50] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-08 23:18:51] [INFO ] Dead Transitions using invariants and state equation in 792 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:18:51] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000037 steps, including 2 resets, run finished after 1159 ms. (steps per millisecond=862 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2253 ms. (steps per millisecond=443 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2277 ms. (steps per millisecond=439 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2288 ms. (steps per millisecond=437 ) properties (out of 3) seen :1
[2022-06-08 23:18:59] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:18:59] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-08 23:18:59] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:18:59] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2022-06-08 23:18:59] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:18:59] [INFO ] [Real]Added 254 Read/Feed constraints in 114 ms returned sat
[2022-06-08 23:18:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:19:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:19:00] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2022-06-08 23:19:00] [INFO ] [Nat]Added 254 Read/Feed constraints in 126 ms returned sat
[2022-06-08 23:19:00] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 0 ms to minimize.
[2022-06-08 23:19:01] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 1 ms to minimize.
[2022-06-08 23:19:01] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 0 ms to minimize.
[2022-06-08 23:19:01] [INFO ] Deduced a trap composed of 74 places in 209 ms of which 0 ms to minimize.
[2022-06-08 23:19:01] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 0 ms to minimize.
[2022-06-08 23:19:02] [INFO ] Deduced a trap composed of 47 places in 207 ms of which 0 ms to minimize.
[2022-06-08 23:19:02] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:19:02] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:19:02] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2296 ms
[2022-06-08 23:19:02] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 159 ms.
[2022-06-08 23:19:05] [INFO ] Deduced a trap composed of 76 places in 340 ms of which 0 ms to minimize.
[2022-06-08 23:19:05] [INFO ] Deduced a trap composed of 11 places in 312 ms of which 1 ms to minimize.
[2022-06-08 23:19:06] [INFO ] Deduced a trap composed of 52 places in 307 ms of which 0 ms to minimize.
[2022-06-08 23:19:06] [INFO ] Deduced a trap composed of 11 places in 317 ms of which 0 ms to minimize.
[2022-06-08 23:19:07] [INFO ] Deduced a trap composed of 112 places in 306 ms of which 1 ms to minimize.
[2022-06-08 23:19:07] [INFO ] Deduced a trap composed of 108 places in 308 ms of which 1 ms to minimize.
[2022-06-08 23:19:07] [INFO ] Deduced a trap composed of 55 places in 299 ms of which 0 ms to minimize.
[2022-06-08 23:19:08] [INFO ] Deduced a trap composed of 57 places in 309 ms of which 0 ms to minimize.
[2022-06-08 23:19:08] [INFO ] Deduced a trap composed of 57 places in 309 ms of which 1 ms to minimize.
[2022-06-08 23:19:09] [INFO ] Deduced a trap composed of 57 places in 317 ms of which 0 ms to minimize.
[2022-06-08 23:19:09] [INFO ] Deduced a trap composed of 57 places in 270 ms of which 1 ms to minimize.
[2022-06-08 23:19:09] [INFO ] Deduced a trap composed of 19 places in 272 ms of which 0 ms to minimize.
[2022-06-08 23:19:10] [INFO ] Deduced a trap composed of 30 places in 338 ms of which 0 ms to minimize.
[2022-06-08 23:19:10] [INFO ] Deduced a trap composed of 74 places in 304 ms of which 1 ms to minimize.
[2022-06-08 23:19:11] [INFO ] Deduced a trap composed of 70 places in 300 ms of which 0 ms to minimize.
[2022-06-08 23:19:11] [INFO ] Deduced a trap composed of 14 places in 266 ms of which 0 ms to minimize.
[2022-06-08 23:19:11] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 0 ms to minimize.
[2022-06-08 23:19:11] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6758 ms
[2022-06-08 23:19:11] [INFO ] Added : 97 causal constraints over 20 iterations in 9205 ms. Result :sat
Minimization took 429 ms.
[2022-06-08 23:19:12] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:19:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:19:12] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2022-06-08 23:19:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:19:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:19:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:19:13] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2022-06-08 23:19:13] [INFO ] [Nat]Added 254 Read/Feed constraints in 134 ms returned sat
[2022-06-08 23:19:13] [INFO ] Deduced a trap composed of 71 places in 216 ms of which 1 ms to minimize.
[2022-06-08 23:19:13] [INFO ] Deduced a trap composed of 78 places in 219 ms of which 0 ms to minimize.
[2022-06-08 23:19:14] [INFO ] Deduced a trap composed of 78 places in 227 ms of which 0 ms to minimize.
[2022-06-08 23:19:14] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 1 ms to minimize.
[2022-06-08 23:19:14] [INFO ] Deduced a trap composed of 69 places in 226 ms of which 0 ms to minimize.
[2022-06-08 23:19:15] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 1 ms to minimize.
[2022-06-08 23:19:15] [INFO ] Deduced a trap composed of 70 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:19:15] [INFO ] Deduced a trap composed of 67 places in 196 ms of which 1 ms to minimize.
[2022-06-08 23:19:15] [INFO ] Deduced a trap composed of 76 places in 197 ms of which 1 ms to minimize.
[2022-06-08 23:19:16] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 0 ms to minimize.
[2022-06-08 23:19:16] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 3 ms to minimize.
[2022-06-08 23:19:16] [INFO ] Deduced a trap composed of 88 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:19:17] [INFO ] Deduced a trap composed of 70 places in 207 ms of which 1 ms to minimize.
[2022-06-08 23:19:17] [INFO ] Deduced a trap composed of 69 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:19:17] [INFO ] Deduced a trap composed of 69 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:19:17] [INFO ] Deduced a trap composed of 75 places in 181 ms of which 1 ms to minimize.
[2022-06-08 23:19:18] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:19:18] [INFO ] Deduced a trap composed of 71 places in 178 ms of which 0 ms to minimize.
[2022-06-08 23:19:18] [INFO ] Deduced a trap composed of 71 places in 182 ms of which 0 ms to minimize.
[2022-06-08 23:19:18] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:19:19] [INFO ] Deduced a trap composed of 76 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:19:19] [INFO ] Deduced a trap composed of 73 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:19:19] [INFO ] Deduced a trap composed of 73 places in 180 ms of which 0 ms to minimize.
[2022-06-08 23:19:19] [INFO ] Deduced a trap composed of 73 places in 187 ms of which 1 ms to minimize.
[2022-06-08 23:19:20] [INFO ] Deduced a trap composed of 74 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:19:20] [INFO ] Deduced a trap composed of 68 places in 219 ms of which 0 ms to minimize.
[2022-06-08 23:19:20] [INFO ] Deduced a trap composed of 85 places in 202 ms of which 1 ms to minimize.
[2022-06-08 23:19:20] [INFO ] Deduced a trap composed of 74 places in 186 ms of which 1 ms to minimize.
[2022-06-08 23:19:21] [INFO ] Deduced a trap composed of 67 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:19:21] [INFO ] Deduced a trap composed of 36 places in 193 ms of which 1 ms to minimize.
[2022-06-08 23:19:21] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 1 ms to minimize.
[2022-06-08 23:19:21] [INFO ] Deduced a trap composed of 76 places in 196 ms of which 0 ms to minimize.
[2022-06-08 23:19:22] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 0 ms to minimize.
[2022-06-08 23:19:22] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:19:22] [INFO ] Deduced a trap composed of 75 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:19:23] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 0 ms to minimize.
[2022-06-08 23:19:23] [INFO ] Deduced a trap composed of 75 places in 180 ms of which 0 ms to minimize.
[2022-06-08 23:19:23] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:19:23] [INFO ] Deduced a trap composed of 73 places in 177 ms of which 0 ms to minimize.
[2022-06-08 23:19:23] [INFO ] Deduced a trap composed of 71 places in 177 ms of which 1 ms to minimize.
[2022-06-08 23:19:24] [INFO ] Deduced a trap composed of 74 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:19:24] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:19:24] [INFO ] Deduced a trap composed of 70 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:19:25] [INFO ] Deduced a trap composed of 70 places in 223 ms of which 1 ms to minimize.
[2022-06-08 23:19:25] [INFO ] Deduced a trap composed of 70 places in 209 ms of which 1 ms to minimize.
[2022-06-08 23:19:25] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:19:25] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:19:26] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:19:26] [INFO ] Deduced a trap composed of 77 places in 220 ms of which 0 ms to minimize.
[2022-06-08 23:19:26] [INFO ] Deduced a trap composed of 87 places in 220 ms of which 0 ms to minimize.
[2022-06-08 23:19:27] [INFO ] Deduced a trap composed of 83 places in 223 ms of which 1 ms to minimize.
[2022-06-08 23:19:27] [INFO ] Deduced a trap composed of 75 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:19:27] [INFO ] Deduced a trap composed of 78 places in 223 ms of which 0 ms to minimize.
[2022-06-08 23:19:27] [INFO ] Deduced a trap composed of 72 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:19:28] [INFO ] Deduced a trap composed of 71 places in 211 ms of which 0 ms to minimize.
[2022-06-08 23:19:28] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 0 ms to minimize.
[2022-06-08 23:19:28] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 0 ms to minimize.
[2022-06-08 23:19:28] [INFO ] Deduced a trap composed of 73 places in 174 ms of which 1 ms to minimize.
[2022-06-08 23:19:29] [INFO ] Deduced a trap composed of 70 places in 227 ms of which 1 ms to minimize.
[2022-06-08 23:19:29] [INFO ] Deduced a trap composed of 87 places in 222 ms of which 0 ms to minimize.
[2022-06-08 23:19:29] [INFO ] Deduced a trap composed of 86 places in 223 ms of which 1 ms to minimize.
[2022-06-08 23:19:30] [INFO ] Deduced a trap composed of 75 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:19:30] [INFO ] Deduced a trap composed of 86 places in 215 ms of which 0 ms to minimize.
[2022-06-08 23:19:30] [INFO ] Deduced a trap composed of 85 places in 210 ms of which 1 ms to minimize.
[2022-06-08 23:19:30] [INFO ] Deduced a trap composed of 72 places in 206 ms of which 0 ms to minimize.
[2022-06-08 23:19:31] [INFO ] Deduced a trap composed of 74 places in 206 ms of which 1 ms to minimize.
[2022-06-08 23:19:31] [INFO ] Deduced a trap composed of 74 places in 202 ms of which 1 ms to minimize.
[2022-06-08 23:19:31] [INFO ] Deduced a trap composed of 74 places in 208 ms of which 0 ms to minimize.
[2022-06-08 23:19:32] [INFO ] Deduced a trap composed of 71 places in 208 ms of which 0 ms to minimize.
[2022-06-08 23:19:32] [INFO ] Deduced a trap composed of 74 places in 211 ms of which 1 ms to minimize.
[2022-06-08 23:19:32] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 0 ms to minimize.
[2022-06-08 23:19:32] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 0 ms to minimize.
[2022-06-08 23:19:33] [INFO ] Deduced a trap composed of 70 places in 197 ms of which 1 ms to minimize.
[2022-06-08 23:19:33] [INFO ] Deduced a trap composed of 69 places in 199 ms of which 1 ms to minimize.
[2022-06-08 23:19:33] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 0 ms to minimize.
[2022-06-08 23:19:33] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:19:34] [INFO ] Deduced a trap composed of 73 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:19:34] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 0 ms to minimize.
[2022-06-08 23:19:34] [INFO ] Deduced a trap composed of 74 places in 191 ms of which 1 ms to minimize.
[2022-06-08 23:19:35] [INFO ] Deduced a trap composed of 74 places in 212 ms of which 0 ms to minimize.
[2022-06-08 23:19:35] [INFO ] Deduced a trap composed of 73 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:19:35] [INFO ] Deduced a trap composed of 75 places in 217 ms of which 0 ms to minimize.
[2022-06-08 23:19:35] [INFO ] Deduced a trap composed of 75 places in 212 ms of which 0 ms to minimize.
[2022-06-08 23:19:36] [INFO ] Deduced a trap composed of 77 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:19:36] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 0 ms to minimize.
[2022-06-08 23:19:36] [INFO ] Deduced a trap composed of 71 places in 206 ms of which 0 ms to minimize.
[2022-06-08 23:19:37] [INFO ] Deduced a trap composed of 90 places in 213 ms of which 1 ms to minimize.
[2022-06-08 23:19:37] [INFO ] Deduced a trap composed of 89 places in 206 ms of which 0 ms to minimize.
[2022-06-08 23:19:37] [INFO ] Deduced a trap composed of 88 places in 207 ms of which 1 ms to minimize.
[2022-06-08 23:19:37] [INFO ] Deduced a trap composed of 78 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:19:38] [INFO ] Deduced a trap composed of 76 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:19:38] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 0 ms to minimize.
[2022-06-08 23:19:38] [INFO ] Deduced a trap composed of 75 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:19:38] [INFO ] Deduced a trap composed of 79 places in 217 ms of which 0 ms to minimize.
[2022-06-08 23:19:39] [INFO ] Deduced a trap composed of 74 places in 216 ms of which 1 ms to minimize.
[2022-06-08 23:19:39] [INFO ] Deduced a trap composed of 77 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:19:39] [INFO ] Deduced a trap composed of 66 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:19:40] [INFO ] Deduced a trap composed of 70 places in 209 ms of which 1 ms to minimize.
[2022-06-08 23:19:40] [INFO ] Deduced a trap composed of 75 places in 211 ms of which 1 ms to minimize.
[2022-06-08 23:19:40] [INFO ] Deduced a trap composed of 75 places in 212 ms of which 0 ms to minimize.
[2022-06-08 23:19:40] [INFO ] Deduced a trap composed of 76 places in 215 ms of which 1 ms to minimize.
[2022-06-08 23:19:41] [INFO ] Deduced a trap composed of 81 places in 216 ms of which 1 ms to minimize.
[2022-06-08 23:19:41] [INFO ] Deduced a trap composed of 75 places in 213 ms of which 1 ms to minimize.
[2022-06-08 23:19:41] [INFO ] Deduced a trap composed of 72 places in 227 ms of which 0 ms to minimize.
[2022-06-08 23:19:42] [INFO ] Deduced a trap composed of 72 places in 208 ms of which 0 ms to minimize.
[2022-06-08 23:19:42] [INFO ] Deduced a trap composed of 73 places in 209 ms of which 1 ms to minimize.
[2022-06-08 23:19:42] [INFO ] Deduced a trap composed of 78 places in 209 ms of which 0 ms to minimize.
[2022-06-08 23:19:43] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 0 ms to minimize.
[2022-06-08 23:19:43] [INFO ] Deduced a trap composed of 72 places in 212 ms of which 0 ms to minimize.
[2022-06-08 23:19:43] [INFO ] Deduced a trap composed of 74 places in 212 ms of which 0 ms to minimize.
[2022-06-08 23:19:43] [INFO ] Deduced a trap composed of 80 places in 214 ms of which 1 ms to minimize.
[2022-06-08 23:19:44] [INFO ] Deduced a trap composed of 80 places in 214 ms of which 1 ms to minimize.
[2022-06-08 23:19:44] [INFO ] Deduced a trap composed of 78 places in 219 ms of which 1 ms to minimize.
[2022-06-08 23:19:44] [INFO ] Deduced a trap composed of 70 places in 227 ms of which 0 ms to minimize.
[2022-06-08 23:19:45] [INFO ] Deduced a trap composed of 70 places in 207 ms of which 1 ms to minimize.
[2022-06-08 23:19:45] [INFO ] Deduced a trap composed of 70 places in 215 ms of which 1 ms to minimize.
[2022-06-08 23:19:45] [INFO ] Deduced a trap composed of 72 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:19:45] [INFO ] Deduced a trap composed of 71 places in 209 ms of which 0 ms to minimize.
[2022-06-08 23:19:46] [INFO ] Deduced a trap composed of 77 places in 212 ms of which 0 ms to minimize.
[2022-06-08 23:19:46] [INFO ] Deduced a trap composed of 72 places in 214 ms of which 1 ms to minimize.
[2022-06-08 23:19:46] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 0 ms to minimize.
[2022-06-08 23:19:47] [INFO ] Deduced a trap composed of 71 places in 209 ms of which 1 ms to minimize.
[2022-06-08 23:19:47] [INFO ] Deduced a trap composed of 68 places in 221 ms of which 0 ms to minimize.
[2022-06-08 23:19:47] [INFO ] Deduced a trap composed of 67 places in 223 ms of which 0 ms to minimize.
[2022-06-08 23:19:47] [INFO ] Deduced a trap composed of 76 places in 216 ms of which 0 ms to minimize.
[2022-06-08 23:19:48] [INFO ] Deduced a trap composed of 51 places in 214 ms of which 1 ms to minimize.
[2022-06-08 23:19:48] [INFO ] Deduced a trap composed of 48 places in 212 ms of which 1 ms to minimize.
[2022-06-08 23:19:48] [INFO ] Deduced a trap composed of 76 places in 214 ms of which 1 ms to minimize.
[2022-06-08 23:19:49] [INFO ] Deduced a trap composed of 75 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:19:49] [INFO ] Deduced a trap composed of 69 places in 219 ms of which 0 ms to minimize.
[2022-06-08 23:19:49] [INFO ] Deduced a trap composed of 50 places in 218 ms of which 1 ms to minimize.
[2022-06-08 23:19:49] [INFO ] Deduced a trap composed of 69 places in 217 ms of which 1 ms to minimize.
[2022-06-08 23:19:50] [INFO ] Deduced a trap composed of 52 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:19:50] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 0 ms to minimize.
[2022-06-08 23:19:50] [INFO ] Deduced a trap composed of 76 places in 211 ms of which 0 ms to minimize.
[2022-06-08 23:19:51] [INFO ] Deduced a trap composed of 86 places in 211 ms of which 1 ms to minimize.
[2022-06-08 23:19:51] [INFO ] Deduced a trap composed of 86 places in 216 ms of which 0 ms to minimize.
[2022-06-08 23:19:51] [INFO ] Deduced a trap composed of 55 places in 209 ms of which 0 ms to minimize.
[2022-06-08 23:19:51] [INFO ] Deduced a trap composed of 56 places in 229 ms of which 1 ms to minimize.
[2022-06-08 23:19:52] [INFO ] Deduced a trap composed of 76 places in 219 ms of which 1 ms to minimize.
[2022-06-08 23:19:52] [INFO ] Deduced a trap composed of 75 places in 223 ms of which 0 ms to minimize.
[2022-06-08 23:19:52] [INFO ] Deduced a trap composed of 75 places in 215 ms of which 0 ms to minimize.
[2022-06-08 23:19:53] [INFO ] Deduced a trap composed of 70 places in 210 ms of which 0 ms to minimize.
[2022-06-08 23:19:53] [INFO ] Deduced a trap composed of 74 places in 212 ms of which 1 ms to minimize.
[2022-06-08 23:19:53] [INFO ] Deduced a trap composed of 76 places in 200 ms of which 1 ms to minimize.
[2022-06-08 23:19:54] [INFO ] Deduced a trap composed of 76 places in 203 ms of which 1 ms to minimize.
[2022-06-08 23:19:54] [INFO ] Deduced a trap composed of 75 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:19:54] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:19:54] [INFO ] Deduced a trap composed of 75 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:19:55] [INFO ] Deduced a trap composed of 69 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:19:55] [INFO ] Deduced a trap composed of 50 places in 209 ms of which 0 ms to minimize.
[2022-06-08 23:19:55] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 1 ms to minimize.
[2022-06-08 23:19:55] [INFO ] Deduced a trap composed of 51 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:19:56] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 0 ms to minimize.
[2022-06-08 23:19:56] [INFO ] Deduced a trap composed of 69 places in 207 ms of which 1 ms to minimize.
[2022-06-08 23:19:56] [INFO ] Deduced a trap composed of 53 places in 212 ms of which 0 ms to minimize.
[2022-06-08 23:19:57] [INFO ] Deduced a trap composed of 49 places in 222 ms of which 0 ms to minimize.
[2022-06-08 23:19:57] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 0 ms to minimize.
[2022-06-08 23:19:57] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:19:57] [INFO ] Deduced a trap composed of 67 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:19:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 23:19:58] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-08 23:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:19:58] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2022-06-08 23:19:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:19:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:19:58] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2022-06-08 23:19:58] [INFO ] [Nat]Added 254 Read/Feed constraints in 138 ms returned sat
[2022-06-08 23:19:59] [INFO ] Deduced a trap composed of 74 places in 226 ms of which 1 ms to minimize.
[2022-06-08 23:19:59] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 0 ms to minimize.
[2022-06-08 23:19:59] [INFO ] Deduced a trap composed of 69 places in 219 ms of which 0 ms to minimize.
[2022-06-08 23:20:00] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2022-06-08 23:20:00] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2022-06-08 23:20:00] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 0 ms to minimize.
[2022-06-08 23:20:00] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 0 ms to minimize.
[2022-06-08 23:20:01] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 1 ms to minimize.
[2022-06-08 23:20:01] [INFO ] Deduced a trap composed of 72 places in 207 ms of which 0 ms to minimize.
[2022-06-08 23:20:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2551 ms
[2022-06-08 23:20:01] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 188 ms.
[2022-06-08 23:20:03] [INFO ] Added : 84 causal constraints over 17 iterations in 2172 ms. Result :sat
Minimization took 462 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[2, 0, 0]
Incomplete Parikh walk after 676100 steps, including 1000 resets, run finished after 6872 ms. (steps per millisecond=98 ) properties (out of 3) seen :1 could not realise parikh vector
Incomplete Parikh walk after 379700 steps, including 1000 resets, run finished after 3849 ms. (steps per millisecond=98 ) properties (out of 3) seen :2 could not realise parikh vector
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 46 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 40 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 23:20:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:15] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 23:20:15] [INFO ] Implicit Places using invariants in 345 ms returned []
[2022-06-08 23:20:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:15] [INFO ] Computed 8 place invariants in 20 ms
[2022-06-08 23:20:15] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:20:20] [INFO ] Implicit Places using invariants and state equation in 5057 ms returned []
Implicit Place search using SMT with State Equation took 5405 ms to find 0 implicit places.
[2022-06-08 23:20:20] [INFO ] Redundant transitions in 190 ms returned []
[2022-06-08 23:20:20] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:20] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-08 23:20:21] [INFO ] Dead Transitions using invariants and state equation in 864 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting property specific reduction for BugTracking-PT-q3m064-UpperBounds-06
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:21] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10014 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=834 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :1
[2022-06-08 23:20:21] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:21] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-08 23:20:21] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:20:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:21] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2022-06-08 23:20:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:20:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:20:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:22] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2022-06-08 23:20:22] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:20:22] [INFO ] [Nat]Added 254 Read/Feed constraints in 138 ms returned sat
[2022-06-08 23:20:22] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 1 ms to minimize.
[2022-06-08 23:20:23] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2022-06-08 23:20:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 504 ms
[2022-06-08 23:20:23] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 161 ms.
[2022-06-08 23:20:25] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2022-06-08 23:20:25] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 1 ms to minimize.
[2022-06-08 23:20:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 540 ms
[2022-06-08 23:20:26] [INFO ] Added : 95 causal constraints over 19 iterations in 3023 ms. Result :sat
Minimization took 337 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 667100 steps, including 1000 resets, run finished after 6767 ms. (steps per millisecond=98 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 46 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:33] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 1000044 steps, including 2 resets, run finished after 1186 ms. (steps per millisecond=843 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2305 ms. (steps per millisecond=433 ) properties (out of 1) seen :0
[2022-06-08 23:20:36] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:36] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 23:20:36] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-08 23:20:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:37] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2022-06-08 23:20:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:20:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:20:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:37] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2022-06-08 23:20:37] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:20:37] [INFO ] [Nat]Added 254 Read/Feed constraints in 129 ms returned sat
[2022-06-08 23:20:38] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 0 ms to minimize.
[2022-06-08 23:20:38] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 1 ms to minimize.
[2022-06-08 23:20:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 475 ms
[2022-06-08 23:20:38] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 156 ms.
[2022-06-08 23:20:40] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2022-06-08 23:20:41] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 0 ms to minimize.
[2022-06-08 23:20:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 559 ms
[2022-06-08 23:20:41] [INFO ] Added : 95 causal constraints over 19 iterations in 3028 ms. Result :sat
Minimization took 317 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 667100 steps, including 1000 resets, run finished after 6480 ms. (steps per millisecond=102 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 39 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 39 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 23:20:48] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:48] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-08 23:20:48] [INFO ] Implicit Places using invariants in 313 ms returned []
[2022-06-08 23:20:48] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:48] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-08 23:20:49] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:20:53] [INFO ] Implicit Places using invariants and state equation in 4776 ms returned []
Implicit Place search using SMT with State Equation took 5090 ms to find 0 implicit places.
[2022-06-08 23:20:53] [INFO ] Redundant transitions in 65 ms returned []
[2022-06-08 23:20:53] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:53] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 23:20:54] [INFO ] Dead Transitions using invariants and state equation in 775 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:54] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 1000041 steps, including 2 resets, run finished after 1150 ms. (steps per millisecond=869 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2249 ms. (steps per millisecond=444 ) properties (out of 1) seen :0
[2022-06-08 23:20:57] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:20:57] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-08 23:20:57] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:58] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2022-06-08 23:20:58] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:20:58] [INFO ] [Real]Added 254 Read/Feed constraints in 126 ms returned sat
[2022-06-08 23:20:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:20:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:20:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:20:58] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2022-06-08 23:20:58] [INFO ] [Nat]Added 254 Read/Feed constraints in 153 ms returned sat
[2022-06-08 23:20:59] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 1 ms to minimize.
[2022-06-08 23:20:59] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 0 ms to minimize.
[2022-06-08 23:20:59] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 0 ms to minimize.
[2022-06-08 23:21:00] [INFO ] Deduced a trap composed of 74 places in 222 ms of which 1 ms to minimize.
[2022-06-08 23:21:00] [INFO ] Deduced a trap composed of 40 places in 217 ms of which 0 ms to minimize.
[2022-06-08 23:21:00] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 0 ms to minimize.
[2022-06-08 23:21:00] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:21:01] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 0 ms to minimize.
[2022-06-08 23:21:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2399 ms
[2022-06-08 23:21:01] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 156 ms.
[2022-06-08 23:21:04] [INFO ] Deduced a trap composed of 76 places in 343 ms of which 1 ms to minimize.
[2022-06-08 23:21:04] [INFO ] Deduced a trap composed of 11 places in 340 ms of which 1 ms to minimize.
[2022-06-08 23:21:05] [INFO ] Deduced a trap composed of 52 places in 353 ms of which 1 ms to minimize.
[2022-06-08 23:21:05] [INFO ] Deduced a trap composed of 11 places in 340 ms of which 0 ms to minimize.
[2022-06-08 23:21:05] [INFO ] Deduced a trap composed of 112 places in 317 ms of which 0 ms to minimize.
[2022-06-08 23:21:06] [INFO ] Deduced a trap composed of 108 places in 317 ms of which 0 ms to minimize.
[2022-06-08 23:21:06] [INFO ] Deduced a trap composed of 55 places in 316 ms of which 0 ms to minimize.
[2022-06-08 23:21:07] [INFO ] Deduced a trap composed of 57 places in 311 ms of which 0 ms to minimize.
[2022-06-08 23:21:07] [INFO ] Deduced a trap composed of 57 places in 305 ms of which 0 ms to minimize.
[2022-06-08 23:21:07] [INFO ] Deduced a trap composed of 57 places in 314 ms of which 0 ms to minimize.
[2022-06-08 23:21:08] [INFO ] Deduced a trap composed of 57 places in 299 ms of which 0 ms to minimize.
[2022-06-08 23:21:08] [INFO ] Deduced a trap composed of 19 places in 301 ms of which 0 ms to minimize.
[2022-06-08 23:21:09] [INFO ] Deduced a trap composed of 30 places in 338 ms of which 0 ms to minimize.
[2022-06-08 23:21:09] [INFO ] Deduced a trap composed of 74 places in 291 ms of which 0 ms to minimize.
[2022-06-08 23:21:09] [INFO ] Deduced a trap composed of 70 places in 296 ms of which 0 ms to minimize.
[2022-06-08 23:21:10] [INFO ] Deduced a trap composed of 14 places in 295 ms of which 1 ms to minimize.
[2022-06-08 23:21:10] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 0 ms to minimize.
[2022-06-08 23:21:10] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6962 ms
[2022-06-08 23:21:10] [INFO ] Added : 97 causal constraints over 20 iterations in 9515 ms. Result :sat
Minimization took 438 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 379700 steps, including 1000 resets, run finished after 3645 ms. (steps per millisecond=104 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 36 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 36 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 23:21:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:15] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 23:21:15] [INFO ] Implicit Places using invariants in 359 ms returned []
[2022-06-08 23:21:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:15] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-08 23:21:15] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:21:20] [INFO ] Implicit Places using invariants and state equation in 5052 ms returned []
Implicit Place search using SMT with State Equation took 5425 ms to find 0 implicit places.
[2022-06-08 23:21:20] [INFO ] Redundant transitions in 66 ms returned []
[2022-06-08 23:21:20] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:20] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-08 23:21:21] [INFO ] Dead Transitions using invariants and state equation in 728 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m064-UpperBounds-06 in 59789 ms.
Starting property specific reduction for BugTracking-PT-q3m064-UpperBounds-08
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:21] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 10028 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=716 ) properties (out of 1) 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 1) seen :0
[2022-06-08 23:21:21] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:21] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-08 23:21:21] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:21] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2022-06-08 23:21:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:21:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:22] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2022-06-08 23:21:22] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:21:22] [INFO ] [Nat]Added 254 Read/Feed constraints in 156 ms returned sat
[2022-06-08 23:21:22] [INFO ] Deduced a trap composed of 71 places in 248 ms of which 1 ms to minimize.
[2022-06-08 23:21:23] [INFO ] Deduced a trap composed of 78 places in 250 ms of which 0 ms to minimize.
[2022-06-08 23:21:23] [INFO ] Deduced a trap composed of 78 places in 252 ms of which 0 ms to minimize.
[2022-06-08 23:21:23] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 0 ms to minimize.
[2022-06-08 23:21:23] [INFO ] Deduced a trap composed of 69 places in 224 ms of which 0 ms to minimize.
[2022-06-08 23:21:24] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 0 ms to minimize.
[2022-06-08 23:21:24] [INFO ] Deduced a trap composed of 70 places in 226 ms of which 1 ms to minimize.
[2022-06-08 23:21:24] [INFO ] Deduced a trap composed of 67 places in 219 ms of which 0 ms to minimize.
[2022-06-08 23:21:25] [INFO ] Deduced a trap composed of 76 places in 221 ms of which 0 ms to minimize.
[2022-06-08 23:21:25] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 1 ms to minimize.
[2022-06-08 23:21:25] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:21:26] [INFO ] Deduced a trap composed of 88 places in 234 ms of which 1 ms to minimize.
[2022-06-08 23:21:26] [INFO ] Deduced a trap composed of 70 places in 213 ms of which 0 ms to minimize.
[2022-06-08 23:21:26] [INFO ] Deduced a trap composed of 69 places in 215 ms of which 0 ms to minimize.
[2022-06-08 23:21:26] [INFO ] Deduced a trap composed of 69 places in 210 ms of which 0 ms to minimize.
[2022-06-08 23:21: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 50 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:26] [INFO ] Computed 8 place invariants in 21 ms
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 1147 ms. (steps per millisecond=871 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2245 ms. (steps per millisecond=445 ) properties (out of 1) seen :0
[2022-06-08 23:21:30] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:21:30] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 23:21:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:30] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2022-06-08 23:21:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:21:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:21:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:21:31] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2022-06-08 23:21:31] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:21:31] [INFO ] [Nat]Added 254 Read/Feed constraints in 160 ms returned sat
[2022-06-08 23:21:31] [INFO ] Deduced a trap composed of 71 places in 226 ms of which 0 ms to minimize.
[2022-06-08 23:21:31] [INFO ] Deduced a trap composed of 78 places in 236 ms of which 0 ms to minimize.
[2022-06-08 23:21:32] [INFO ] Deduced a trap composed of 78 places in 231 ms of which 0 ms to minimize.
[2022-06-08 23:21:32] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 0 ms to minimize.
[2022-06-08 23:21:32] [INFO ] Deduced a trap composed of 69 places in 224 ms of which 0 ms to minimize.
[2022-06-08 23:21:33] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 0 ms to minimize.
[2022-06-08 23:21:33] [INFO ] Deduced a trap composed of 70 places in 227 ms of which 0 ms to minimize.
[2022-06-08 23:21:33] [INFO ] Deduced a trap composed of 67 places in 229 ms of which 1 ms to minimize.
[2022-06-08 23:21:34] [INFO ] Deduced a trap composed of 76 places in 226 ms of which 0 ms to minimize.
[2022-06-08 23:21:34] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 0 ms to minimize.
[2022-06-08 23:21:34] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 1 ms to minimize.
[2022-06-08 23:21:35] [INFO ] Deduced a trap composed of 88 places in 212 ms of which 0 ms to minimize.
[2022-06-08 23:21:35] [INFO ] Deduced a trap composed of 70 places in 193 ms of which 0 ms to minimize.
[2022-06-08 23:21:35] [INFO ] Deduced a trap composed of 69 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:21:35] [INFO ] Deduced a trap composed of 69 places in 208 ms of which 1 ms to minimize.
[2022-06-08 23:21:36] [INFO ] Deduced a trap composed of 75 places in 204 ms of which 0 ms to minimize.
[2022-06-08 23:21:36] [INFO ] Deduced a trap composed of 72 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:21:36] [INFO ] Deduced a trap composed of 71 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:21:36] [INFO ] Deduced a trap composed of 71 places in 206 ms of which 1 ms to minimize.
[2022-06-08 23:21:37] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:21:37] [INFO ] Deduced a trap composed of 76 places in 208 ms of which 0 ms to minimize.
[2022-06-08 23:21:37] [INFO ] Deduced a trap composed of 73 places in 207 ms of which 0 ms to minimize.
[2022-06-08 23:21:38] [INFO ] Deduced a trap composed of 73 places in 213 ms of which 0 ms to minimize.
[2022-06-08 23:21:38] [INFO ] Deduced a trap composed of 73 places in 192 ms of which 0 ms to minimize.
[2022-06-08 23:21:38] [INFO ] Deduced a trap composed of 74 places in 207 ms of which 1 ms to minimize.
[2022-06-08 23:21:38] [INFO ] Deduced a trap composed of 68 places in 226 ms of which 1 ms to minimize.
[2022-06-08 23:21:39] [INFO ] Deduced a trap composed of 85 places in 220 ms of which 0 ms to minimize.
[2022-06-08 23:21:39] [INFO ] Deduced a trap composed of 74 places in 226 ms of which 0 ms to minimize.
[2022-06-08 23:21:39] [INFO ] Deduced a trap composed of 67 places in 215 ms of which 0 ms to minimize.
[2022-06-08 23:21:40] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 0 ms to minimize.
[2022-06-08 23:21:40] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:21:40] [INFO ] Deduced a trap composed of 76 places in 220 ms of which 0 ms to minimize.
[2022-06-08 23:21:40] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 0 ms to minimize.
[2022-06-08 23:21:41] [INFO ] Deduced a trap composed of 75 places in 204 ms of which 0 ms to minimize.
[2022-06-08 23:21:41] [INFO ] Deduced a trap composed of 75 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:21:41] [INFO ] Deduced a trap composed of 73 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:21:42] [INFO ] Deduced a trap composed of 75 places in 208 ms of which 0 ms to minimize.
[2022-06-08 23:21:42] [INFO ] Deduced a trap composed of 75 places in 202 ms of which 1 ms to minimize.
[2022-06-08 23:21:42] [INFO ] Deduced a trap composed of 73 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:21:42] [INFO ] Deduced a trap composed of 71 places in 210 ms of which 1 ms to minimize.
[2022-06-08 23:21:43] [INFO ] Deduced a trap composed of 74 places in 201 ms of which 1 ms to minimize.
[2022-06-08 23:21:43] [INFO ] Deduced a trap composed of 72 places in 229 ms of which 0 ms to minimize.
[2022-06-08 23:21:43] [INFO ] Deduced a trap composed of 70 places in 221 ms of which 0 ms to minimize.
[2022-06-08 23:21:44] [INFO ] Deduced a trap composed of 70 places in 221 ms of which 1 ms to minimize.
[2022-06-08 23:21:44] [INFO ] Deduced a trap composed of 70 places in 208 ms of which 1 ms to minimize.
[2022-06-08 23:21:44] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 0 ms to minimize.
[2022-06-08 23:21:44] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:21:45] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 0 ms to minimize.
[2022-06-08 23:21:45] [INFO ] Deduced a trap composed of 77 places in 228 ms of which 0 ms to minimize.
[2022-06-08 23:21:45] [INFO ] Deduced a trap composed of 87 places in 222 ms of which 1 ms to minimize.
[2022-06-08 23:21:46] [INFO ] Deduced a trap composed of 83 places in 235 ms of which 0 ms to minimize.
[2022-06-08 23:21:46] [INFO ] Deduced a trap composed of 75 places in 216 ms of which 0 ms to minimize.
[2022-06-08 23:21:46] [INFO ] Deduced a trap composed of 78 places in 231 ms of which 0 ms to minimize.
[2022-06-08 23:21:47] [INFO ] Deduced a trap composed of 72 places in 208 ms of which 1 ms to minimize.
[2022-06-08 23:21:47] [INFO ] Deduced a trap composed of 71 places in 208 ms of which 0 ms to minimize.
[2022-06-08 23:21:47] [INFO ] Deduced a trap composed of 75 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:21:47] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:21:48] [INFO ] Deduced a trap composed of 73 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:21:48] [INFO ] Deduced a trap composed of 70 places in 227 ms of which 0 ms to minimize.
[2022-06-08 23:21:48] [INFO ] Deduced a trap composed of 87 places in 230 ms of which 0 ms to minimize.
[2022-06-08 23:21:49] [INFO ] Deduced a trap composed of 86 places in 220 ms of which 1 ms to minimize.
[2022-06-08 23:21:49] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 0 ms to minimize.
[2022-06-08 23:21:49] [INFO ] Deduced a trap composed of 86 places in 217 ms of which 0 ms to minimize.
[2022-06-08 23:21:49] [INFO ] Deduced a trap composed of 85 places in 212 ms of which 1 ms to minimize.
[2022-06-08 23:21:50] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:21:50] [INFO ] Deduced a trap composed of 74 places in 204 ms of which 0 ms to minimize.
[2022-06-08 23:21:50] [INFO ] Deduced a trap composed of 74 places in 195 ms of which 0 ms to minimize.
[2022-06-08 23:21:51] [INFO ] Deduced a trap composed of 74 places in 218 ms of which 0 ms to minimize.
[2022-06-08 23:21:51] [INFO ] Deduced a trap composed of 71 places in 215 ms of which 1 ms to minimize.
[2022-06-08 23:21:51] [INFO ] Deduced a trap composed of 74 places in 218 ms of which 0 ms to minimize.
[2022-06-08 23:21:51] [INFO ] Deduced a trap composed of 71 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:21:52] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 0 ms to minimize.
[2022-06-08 23:21:52] [INFO ] Deduced a trap composed of 70 places in 202 ms of which 1 ms to minimize.
[2022-06-08 23:21:52] [INFO ] Deduced a trap composed of 69 places in 210 ms of which 20 ms to minimize.
[2022-06-08 23:21:53] [INFO ] Deduced a trap composed of 72 places in 203 ms of which 1 ms to minimize.
[2022-06-08 23:21:53] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 0 ms to minimize.
[2022-06-08 23:21:53] [INFO ] Deduced a trap composed of 73 places in 224 ms of which 0 ms to minimize.
[2022-06-08 23:21:53] [INFO ] Deduced a trap composed of 72 places in 208 ms of which 0 ms to minimize.
[2022-06-08 23:21:54] [INFO ] Deduced a trap composed of 74 places in 209 ms of which 0 ms to minimize.
[2022-06-08 23:21:54] [INFO ] Deduced a trap composed of 74 places in 218 ms of which 0 ms to minimize.
[2022-06-08 23:21:54] [INFO ] Deduced a trap composed of 73 places in 212 ms of which 0 ms to minimize.
[2022-06-08 23:21:55] [INFO ] Deduced a trap composed of 75 places in 208 ms of which 0 ms to minimize.
[2022-06-08 23:21:55] [INFO ] Deduced a trap composed of 75 places in 212 ms of which 1 ms to minimize.
[2022-06-08 23:21:55] [INFO ] Deduced a trap composed of 77 places in 219 ms of which 1 ms to minimize.
[2022-06-08 23:21:55] [INFO ] Deduced a trap composed of 71 places in 212 ms of which 1 ms to minimize.
[2022-06-08 23:21:56] [INFO ] Deduced a trap composed of 71 places in 215 ms of which 0 ms to minimize.
[2022-06-08 23:21:56] [INFO ] Deduced a trap composed of 90 places in 215 ms of which 0 ms to minimize.
[2022-06-08 23:21:56] [INFO ] Deduced a trap composed of 89 places in 210 ms of which 0 ms to minimize.
[2022-06-08 23:21:57] [INFO ] Deduced a trap composed of 88 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:21:57] [INFO ] Deduced a trap composed of 78 places in 189 ms of which 1 ms to minimize.
[2022-06-08 23:21:57] [INFO ] Deduced a trap composed of 76 places in 184 ms of which 0 ms to minimize.
[2022-06-08 23:21:57] [INFO ] Deduced a trap composed of 71 places in 185 ms of which 1 ms to minimize.
[2022-06-08 23:21:58] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 0 ms to minimize.
[2022-06-08 23:21:58] [INFO ] Deduced a trap composed of 79 places in 219 ms of which 0 ms to minimize.
[2022-06-08 23:21:58] [INFO ] Deduced a trap composed of 74 places in 202 ms of which 1 ms to minimize.
[2022-06-08 23:21:59] [INFO ] Deduced a trap composed of 77 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:21:59] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 0 ms to minimize.
[2022-06-08 23:21:59] [INFO ] Deduced a trap composed of 70 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:21:59] [INFO ] Deduced a trap composed of 75 places in 206 ms of which 0 ms to minimize.
[2022-06-08 23:22:00] [INFO ] Deduced a trap composed of 75 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:22:00] [INFO ] Deduced a trap composed of 76 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:22:00] [INFO ] Deduced a trap composed of 81 places in 202 ms of which 1 ms to minimize.
[2022-06-08 23:22:00] [INFO ] Deduced a trap composed of 75 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:22:01] [INFO ] Deduced a trap composed of 72 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:22:01] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 1 ms to minimize.
[2022-06-08 23:22:01] [INFO ] Deduced a trap composed of 73 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:22:02] [INFO ] Deduced a trap composed of 78 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:22:02] [INFO ] Deduced a trap composed of 75 places in 200 ms of which 0 ms to minimize.
[2022-06-08 23:22:02] [INFO ] Deduced a trap composed of 72 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:22:02] [INFO ] Deduced a trap composed of 74 places in 201 ms of which 0 ms to minimize.
[2022-06-08 23:22:03] [INFO ] Deduced a trap composed of 80 places in 204 ms of which 0 ms to minimize.
[2022-06-08 23:22:03] [INFO ] Deduced a trap composed of 80 places in 200 ms of which 1 ms to minimize.
[2022-06-08 23:22:03] [INFO ] Deduced a trap composed of 78 places in 203 ms of which 1 ms to minimize.
[2022-06-08 23:22:04] [INFO ] Deduced a trap composed of 70 places in 203 ms of which 1 ms to minimize.
[2022-06-08 23:22:04] [INFO ] Deduced a trap composed of 70 places in 220 ms of which 1 ms to minimize.
[2022-06-08 23:22:04] [INFO ] Deduced a trap composed of 70 places in 202 ms of which 0 ms to minimize.
[2022-06-08 23:22:04] [INFO ] Deduced a trap composed of 72 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:22:05] [INFO ] Deduced a trap composed of 71 places in 202 ms of which 1 ms to minimize.
[2022-06-08 23:22:05] [INFO ] Deduced a trap composed of 77 places in 196 ms of which 0 ms to minimize.
[2022-06-08 23:22:05] [INFO ] Deduced a trap composed of 72 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:22:06] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 0 ms to minimize.
[2022-06-08 23:22:06] [INFO ] Deduced a trap composed of 71 places in 217 ms of which 1 ms to minimize.
[2022-06-08 23:22:06] [INFO ] Deduced a trap composed of 68 places in 224 ms of which 0 ms to minimize.
[2022-06-08 23:22:06] [INFO ] Deduced a trap composed of 67 places in 222 ms of which 0 ms to minimize.
[2022-06-08 23:22:07] [INFO ] Deduced a trap composed of 76 places in 223 ms of which 0 ms to minimize.
[2022-06-08 23:22:07] [INFO ] Deduced a trap composed of 51 places in 205 ms of which 0 ms to minimize.
[2022-06-08 23:22:07] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 0 ms to minimize.
[2022-06-08 23:22:08] [INFO ] Deduced a trap composed of 76 places in 218 ms of which 1 ms to minimize.
[2022-06-08 23:22:08] [INFO ] Deduced a trap composed of 75 places in 208 ms of which 1 ms to minimize.
[2022-06-08 23:22:08] [INFO ] Deduced a trap composed of 69 places in 230 ms of which 1 ms to minimize.
[2022-06-08 23:22:09] [INFO ] Deduced a trap composed of 50 places in 207 ms of which 1 ms to minimize.
[2022-06-08 23:22:09] [INFO ] Deduced a trap composed of 69 places in 210 ms of which 0 ms to minimize.
[2022-06-08 23:22:09] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 0 ms to minimize.
[2022-06-08 23:22:09] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:22:10] [INFO ] Deduced a trap composed of 76 places in 200 ms of which 1 ms to minimize.
[2022-06-08 23:22:10] [INFO ] Deduced a trap composed of 86 places in 203 ms of which 0 ms to minimize.
[2022-06-08 23:22:10] [INFO ] Deduced a trap composed of 86 places in 220 ms of which 0 ms to minimize.
[2022-06-08 23:22:11] [INFO ] Deduced a trap composed of 55 places in 222 ms of which 0 ms to minimize.
[2022-06-08 23:22:11] [INFO ] Deduced a trap composed of 56 places in 220 ms of which 1 ms to minimize.
[2022-06-08 23:22:11] [INFO ] Deduced a trap composed of 76 places in 222 ms of which 0 ms to minimize.
[2022-06-08 23:22:11] [INFO ] Deduced a trap composed of 75 places in 222 ms of which 0 ms to minimize.
[2022-06-08 23:22:12] [INFO ] Deduced a trap composed of 75 places in 203 ms of which 1 ms to minimize.
[2022-06-08 23:22:12] [INFO ] Deduced a trap composed of 70 places in 200 ms of which 1 ms to minimize.
[2022-06-08 23:22:12] [INFO ] Deduced a trap composed of 74 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:22:13] [INFO ] Deduced a trap composed of 76 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:22:13] [INFO ] Deduced a trap composed of 76 places in 210 ms of which 0 ms to minimize.
[2022-06-08 23:22:13] [INFO ] Deduced a trap composed of 75 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:22:13] [INFO ] Deduced a trap composed of 72 places in 199 ms of which 0 ms to minimize.
[2022-06-08 23:22:14] [INFO ] Deduced a trap composed of 75 places in 196 ms of which 1 ms to minimize.
[2022-06-08 23:22:14] [INFO ] Deduced a trap composed of 69 places in 198 ms of which 0 ms to minimize.
[2022-06-08 23:22:14] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 0 ms to minimize.
[2022-06-08 23:22:15] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 0 ms to minimize.
[2022-06-08 23:22:15] [INFO ] Deduced a trap composed of 51 places in 222 ms of which 0 ms to minimize.
[2022-06-08 23:22:15] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 0 ms to minimize.
[2022-06-08 23:22:15] [INFO ] Deduced a trap composed of 69 places in 222 ms of which 0 ms to minimize.
[2022-06-08 23:22:15] [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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 35 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 34 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 23:22:16] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:16] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-08 23:22:16] [INFO ] Implicit Places using invariants in 298 ms returned []
[2022-06-08 23:22:16] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:16] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 23:22:16] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:22:21] [INFO ] Implicit Places using invariants and state equation in 5313 ms returned []
Implicit Place search using SMT with State Equation took 5648 ms to find 0 implicit places.
[2022-06-08 23:22:21] [INFO ] Redundant transitions in 64 ms returned []
[2022-06-08 23:22:21] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:21] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 23:22:22] [INFO ] Dead Transitions using invariants and state equation in 743 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m064-UpperBounds-08 in 61222 ms.
Starting property specific reduction for BugTracking-PT-q3m064-UpperBounds-15
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:22] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10051 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=837 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
[2022-06-08 23:22:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:22] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-08 23:22:22] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:22:22] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2022-06-08 23:22:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:22:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:22:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:22:23] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2022-06-08 23:22:23] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:22:23] [INFO ] [Nat]Added 254 Read/Feed constraints in 141 ms returned sat
[2022-06-08 23:22:23] [INFO ] Deduced a trap composed of 74 places in 196 ms of which 0 ms to minimize.
[2022-06-08 23:22:24] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 0 ms to minimize.
[2022-06-08 23:22:24] [INFO ] Deduced a trap composed of 69 places in 218 ms of which 0 ms to minimize.
[2022-06-08 23:22:24] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2022-06-08 23:22:24] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2022-06-08 23:22:25] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 1 ms to minimize.
[2022-06-08 23:22:25] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 0 ms to minimize.
[2022-06-08 23:22:25] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 0 ms to minimize.
[2022-06-08 23:22:25] [INFO ] Deduced a trap composed of 72 places in 224 ms of which 0 ms to minimize.
[2022-06-08 23:22:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2493 ms
[2022-06-08 23:22:26] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 150 ms.
[2022-06-08 23:22:28] [INFO ] Deduced a trap composed of 9 places in 455 ms of which 0 ms to minimize.
[2022-06-08 23:22:28] [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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 49 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:28] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 1000027 steps, including 2 resets, run finished after 1010 ms. (steps per millisecond=990 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2276 ms. (steps per millisecond=439 ) properties (out of 1) seen :0
[2022-06-08 23:22:31] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:31] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 23:22:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:22:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:22:32] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2022-06-08 23:22:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:22:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-08 23:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:22:32] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2022-06-08 23:22:32] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:22:32] [INFO ] [Nat]Added 254 Read/Feed constraints in 139 ms returned sat
[2022-06-08 23:22:33] [INFO ] Deduced a trap composed of 74 places in 209 ms of which 0 ms to minimize.
[2022-06-08 23:22:33] [INFO ] Deduced a trap composed of 47 places in 217 ms of which 0 ms to minimize.
[2022-06-08 23:22:33] [INFO ] Deduced a trap composed of 69 places in 223 ms of which 0 ms to minimize.
[2022-06-08 23:22:34] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 0 ms to minimize.
[2022-06-08 23:22:34] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 0 ms to minimize.
[2022-06-08 23:22:34] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 0 ms to minimize.
[2022-06-08 23:22:34] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 0 ms to minimize.
[2022-06-08 23:22:35] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 0 ms to minimize.
[2022-06-08 23:22:35] [INFO ] Deduced a trap composed of 72 places in 225 ms of which 0 ms to minimize.
[2022-06-08 23:22:35] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2581 ms
[2022-06-08 23:22:35] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 150 ms.
[2022-06-08 23:22:37] [INFO ] Added : 84 causal constraints over 17 iterations in 2305 ms. Result :sat
Minimization took 523 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 676100 steps, including 1000 resets, run finished after 6632 ms. (steps per millisecond=101 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 33 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 35 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-08 23:22:45] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:45] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-08 23:22:45] [INFO ] Implicit Places using invariants in 295 ms returned []
[2022-06-08 23:22:45] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:45] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 23:22:45] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-08 23:22:50] [INFO ] Implicit Places using invariants and state equation in 5047 ms returned []
Implicit Place search using SMT with State Equation took 5367 ms to find 0 implicit places.
[2022-06-08 23:22:50] [INFO ] Redundant transitions in 70 ms returned []
[2022-06-08 23:22:50] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-08 23:22:50] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-08 23:22:51] [INFO ] Dead Transitions using invariants and state equation in 910 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m064-UpperBounds-15 in 28995 ms.
[2022-06-08 23:22:52] [INFO ] Flatten gal took : 515 ms
[2022-06-08 23:22:52] [INFO ] Applying decomposition
[2022-06-08 23:22:52] [INFO ] Flatten gal took : 287 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15089208601923470987.txt, -o, /tmp/graph15089208601923470987.bin, -w, /tmp/graph15089208601923470987.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15089208601923470987.bin, -l, -1, -v, -w, /tmp/graph15089208601923470987.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 23:22:53] [INFO ] Decomposing Gal with order
[2022-06-08 23:22:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 23:22:54] [INFO ] Removed a total of 280 redundant transitions.
[2022-06-08 23:22:54] [INFO ] Flatten gal took : 670 ms
[2022-06-08 23:22:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 33 ms.
[2022-06-08 23:22:54] [INFO ] Time to serialize gal into /tmp/UpperBounds9113588798684420394.gal : 57 ms
[2022-06-08 23:22:54] [INFO ] Time to serialize properties into /tmp/UpperBounds834597860498835776.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds9113588798684420394.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds834597860498835776.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds9113588798684420394.gal -t CGAL -reachable-file /tmp/UpperBounds834597860498835776.prop --nowitness
Loading property file /tmp/UpperBounds834597860498835776.prop.
Detected timeout of ITS tools.
[2022-06-08 23:45:01] [INFO ] Flatten gal took : 918 ms
[2022-06-08 23:45:01] [INFO ] Time to serialize gal into /tmp/UpperBounds10104406714670653343.gal : 243 ms
[2022-06-08 23:45:01] [INFO ] Time to serialize properties into /tmp/UpperBounds16116985577781360704.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds10104406714670653343.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds16116985577781360704.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds10104406714670653343.gal -t CGAL -reachable-file /tmp/UpperBounds16116985577781360704.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds16116985577781360704.prop.
Detected timeout of ITS tools.
[2022-06-09 00:06:56] [INFO ] Flatten gal took : 670 ms
[2022-06-09 00:07:00] [INFO ] Input system was already deterministic with 2747 transitions.
[2022-06-09 00:07:00] [INFO ] Transformed 229 places.
[2022-06-09 00:07:00] [INFO ] Transformed 2747 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 00:07:01] [INFO ] Time to serialize gal into /tmp/UpperBounds10613854117752179671.gal : 42 ms
[2022-06-09 00:07:01] [INFO ] Time to serialize properties into /tmp/UpperBounds1542414642092098638.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds10613854117752179671.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds1542414642092098638.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is BugTracking-PT-q3m064, 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 r323-tall-165472292500016"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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