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-165472292500022.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-q3m256, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292500022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.9K Jun 7 17:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 17:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 7 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 7 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Jun 6 15:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 7 17:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 7 17:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Jun 7 17:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:23 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-q3m256-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654733860452

Running Version 0
[2022-06-09 00:17:42] [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-09 00:17:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 00:17:42] [INFO ] Load time of PNML (sax parser for PT used): 777 ms
[2022-06-09 00:17:43] [INFO ] Transformed 754 places.
[2022-06-09 00:17:43] [INFO ] Transformed 27370 transitions.
[2022-06-09 00:17:43] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 964 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Deduced a syphon composed of 514 places in 140 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2642 out of 2769 initially.
// Phase 1: matrix 2642 rows 240 cols
[2022-06-09 00:17:43] [INFO ] Computed 10 place invariants in 45 ms
Incomplete random walk after 10058 steps, including 5 resets, run finished after 72 ms. (steps per millisecond=139 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :6
FORMULA BugTracking-PT-q3m256-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :4
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 :13
[2022-06-09 00:17:43] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2022-06-09 00:17:43] [INFO ] Computed 10 place invariants in 13 ms
[2022-06-09 00:17:43] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-06-09 00:17:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:17:44] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2022-06-09 00:17:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:17:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 00:17:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:17:44] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2022-06-09 00:17:44] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-09 00:17:44] [INFO ] [Nat]Added 268 Read/Feed constraints in 124 ms returned sat
[2022-06-09 00:17:45] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 3 ms to minimize.
[2022-06-09 00:17:45] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 1 ms to minimize.
[2022-06-09 00:17:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 678 ms
[2022-06-09 00:17:45] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 208 ms.
[2022-06-09 00:17:48] [INFO ] Deduced a trap composed of 100 places in 288 ms of which 3 ms to minimize.
[2022-06-09 00:17:49] [INFO ] Deduced a trap composed of 36 places in 305 ms of which 1 ms to minimize.
[2022-06-09 00:17:49] [INFO ] Deduced a trap composed of 55 places in 229 ms of which 1 ms to minimize.
[2022-06-09 00:17:49] [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-09 00:17:49] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 00:17:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:17:49] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2022-06-09 00:17:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:17:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 00:17:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:17:50] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2022-06-09 00:17:50] [INFO ] [Nat]Added 268 Read/Feed constraints in 127 ms returned sat
[2022-06-09 00:17:50] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 1 ms to minimize.
[2022-06-09 00:17:50] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 1 ms to minimize.
[2022-06-09 00:17:51] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 5 ms to minimize.
[2022-06-09 00:17:51] [INFO ] Deduced a trap composed of 77 places in 186 ms of which 0 ms to minimize.
[2022-06-09 00:17:51] [INFO ] Deduced a trap composed of 76 places in 204 ms of which 0 ms to minimize.
[2022-06-09 00:17:51] [INFO ] Deduced a trap composed of 74 places in 196 ms of which 0 ms to minimize.
[2022-06-09 00:17:52] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 0 ms to minimize.
[2022-06-09 00:17:52] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 0 ms to minimize.
[2022-06-09 00:17:52] [INFO ] Deduced a trap composed of 74 places in 203 ms of which 1 ms to minimize.
[2022-06-09 00:17:52] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 1 ms to minimize.
[2022-06-09 00:17:53] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 1 ms to minimize.
[2022-06-09 00:17:53] [INFO ] Deduced a trap composed of 79 places in 189 ms of which 4 ms to minimize.
[2022-06-09 00:17:53] [INFO ] Deduced a trap composed of 76 places in 191 ms of which 0 ms to minimize.
[2022-06-09 00:17:53] [INFO ] Deduced a trap composed of 74 places in 182 ms of which 0 ms to minimize.
[2022-06-09 00:17:54] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 0 ms to minimize.
[2022-06-09 00:17:54] [INFO ] Deduced a trap composed of 79 places in 186 ms of which 0 ms to minimize.
[2022-06-09 00:17:54] [INFO ] Deduced a trap composed of 79 places in 190 ms of which 1 ms to minimize.
[2022-06-09 00:17:54] [INFO ] Deduced a trap composed of 82 places in 207 ms of which 0 ms to minimize.
[2022-06-09 00:17:54] [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-09 00:17:54] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 00:17:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:17:55] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2022-06-09 00:17:55] [INFO ] [Real]Added 268 Read/Feed constraints in 135 ms returned sat
[2022-06-09 00:17:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:17:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 00:17:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:17:55] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2022-06-09 00:17:55] [INFO ] [Nat]Added 268 Read/Feed constraints in 130 ms returned sat
[2022-06-09 00:17:56] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 0 ms to minimize.
[2022-06-09 00:17:56] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 0 ms to minimize.
[2022-06-09 00:17:56] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2022-06-09 00:17:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 729 ms
[2022-06-09 00:17:56] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 153 ms.
[2022-06-09 00:17:58] [INFO ] Deduced a trap composed of 9 places in 333 ms of which 0 ms to minimize.
[2022-06-09 00:17:59] [INFO ] Deduced a trap composed of 74 places in 300 ms of which 0 ms to minimize.
[2022-06-09 00:17:59] [INFO ] Deduced a trap composed of 74 places in 310 ms of which 0 ms to minimize.
[2022-06-09 00:18:00] [INFO ] Deduced a trap composed of 39 places in 322 ms of which 1 ms to minimize.
[2022-06-09 00:18:00] [INFO ] Deduced a trap composed of 32 places in 304 ms of which 0 ms to minimize.
[2022-06-09 00:18:00] [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 :[0, 0, 13]
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 259 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-09 00:18:00] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 1000219 steps, including 2 resets, run finished after 513 ms. (steps per millisecond=1949 ) properties (out of 3) seen :479
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2108 ms. (steps per millisecond=474 ) properties (out of 3) seen :35
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2180 ms. (steps per millisecond=458 ) properties (out of 3) seen :30
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2001 ms. (steps per millisecond=499 ) properties (out of 3) seen :5698
[2022-06-09 00:18:07] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:18:07] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 00:18:07] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2022-06-09 00:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:18:08] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2022-06-09 00:18:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:18:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:18:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:18:08] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2022-06-09 00:18:08] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:18:08] [INFO ] [Nat]Added 254 Read/Feed constraints in 134 ms returned sat
[2022-06-09 00:18:08] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 0 ms to minimize.
[2022-06-09 00:18:09] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 0 ms to minimize.
[2022-06-09 00:18:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 579 ms
[2022-06-09 00:18:09] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 196 ms.
[2022-06-09 00:18:11] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 1 ms to minimize.
[2022-06-09 00:18:11] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2022-06-09 00:18:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 430 ms
[2022-06-09 00:18:11] [INFO ] Added : 83 causal constraints over 17 iterations in 2716 ms. Result :sat
Minimization took 385 ms.
[2022-06-09 00:18:12] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:18:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:18:12] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2022-06-09 00:18:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:18:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:18:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:18:13] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2022-06-09 00:18:13] [INFO ] [Nat]Added 254 Read/Feed constraints in 134 ms returned sat
[2022-06-09 00:18:13] [INFO ] Deduced a trap composed of 76 places in 230 ms of which 1 ms to minimize.
[2022-06-09 00:18:13] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 0 ms to minimize.
[2022-06-09 00:18:14] [INFO ] Deduced a trap composed of 76 places in 219 ms of which 0 ms to minimize.
[2022-06-09 00:18:14] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 0 ms to minimize.
[2022-06-09 00:18:14] [INFO ] Deduced a trap composed of 16 places in 213 ms of which 1 ms to minimize.
[2022-06-09 00:18:15] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 0 ms to minimize.
[2022-06-09 00:18:15] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 0 ms to minimize.
[2022-06-09 00:18:15] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2022-06-09 00:18:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2311 ms
[2022-06-09 00:18:15] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 175 ms.
[2022-06-09 00:18:17] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 3 ms to minimize.
[2022-06-09 00:18:17] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 0 ms to minimize.
[2022-06-09 00:18:18] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 1 ms to minimize.
[2022-06-09 00:18:18] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 0 ms to minimize.
[2022-06-09 00:18:18] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 1 ms to minimize.
[2022-06-09 00:18:18] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 0 ms to minimize.
[2022-06-09 00:18:19] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 1 ms to minimize.
[2022-06-09 00:18:19] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 1 ms to minimize.
[2022-06-09 00:18:19] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 1 ms to minimize.
[2022-06-09 00:18:19] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 0 ms to minimize.
[2022-06-09 00:18:20] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 0 ms to minimize.
[2022-06-09 00:18:20] [INFO ] Deduced a trap composed of 50 places in 170 ms of which 0 ms to minimize.
[2022-06-09 00:18:20] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 1 ms to minimize.
[2022-06-09 00:18:20] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 0 ms to minimize.
[2022-06-09 00:18:21] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 0 ms to minimize.
[2022-06-09 00:18:21] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 0 ms to minimize.
[2022-06-09 00:18:21] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 0 ms to minimize.
[2022-06-09 00:18:22] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 0 ms to minimize.
[2022-06-09 00:18:22] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 1 ms to minimize.
[2022-06-09 00:18:22] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 0 ms to minimize.
[2022-06-09 00:18:22] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5476 ms
[2022-06-09 00:18:23] [INFO ] Added : 59 causal constraints over 13 iterations in 7330 ms. Result :sat
Minimization took 432 ms.
[2022-06-09 00:18:23] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:18:23] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2022-06-09 00:18:24] [INFO ] [Real]Added 254 Read/Feed constraints in 113 ms returned sat
[2022-06-09 00:18:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:18:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:18:24] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2022-06-09 00:18:24] [INFO ] [Nat]Added 254 Read/Feed constraints in 125 ms returned sat
[2022-06-09 00:18:24] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 1 ms to minimize.
[2022-06-09 00:18:25] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 0 ms to minimize.
[2022-06-09 00:18:25] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 2 ms to minimize.
[2022-06-09 00:18:25] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 1 ms to minimize.
[2022-06-09 00:18:25] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 3 ms to minimize.
[2022-06-09 00:18:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1314 ms
[2022-06-09 00:18:26] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 163 ms.
[2022-06-09 00:18:28] [INFO ] Deduced a trap composed of 10 places in 312 ms of which 2 ms to minimize.
[2022-06-09 00:18:29] [INFO ] Deduced a trap composed of 70 places in 308 ms of which 0 ms to minimize.
[2022-06-09 00:18:29] [INFO ] Deduced a trap composed of 70 places in 312 ms of which 0 ms to minimize.
[2022-06-09 00:18:29] [INFO ] Deduced a trap composed of 70 places in 303 ms of which 0 ms to minimize.
[2022-06-09 00:18:30] [INFO ] Deduced a trap composed of 30 places in 305 ms of which 0 ms to minimize.
[2022-06-09 00:18:30] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 1 ms to minimize.
[2022-06-09 00:18:30] [INFO ] Deduced a trap composed of 53 places in 260 ms of which 1 ms to minimize.
[2022-06-09 00:18:31] [INFO ] Deduced a trap composed of 86 places in 267 ms of which 0 ms to minimize.
[2022-06-09 00:18:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3207 ms
[2022-06-09 00:18:31] [INFO ] Added : 99 causal constraints over 20 iterations in 5714 ms. Result :sat
Minimization took 373 ms.
Current structural bounds on expressions (after SMT) : [1, 1, -1] Max seen :[0, 0, 5698]
Incomplete Parikh walk after 2072200 steps, including 1000 resets, run finished after 21420 ms. (steps per millisecond=96 ) properties (out of 3) seen :330 could not realise parikh vector
Incomplete Parikh walk after 507800 steps, including 1000 resets, run finished after 3992 ms. (steps per millisecond=127 ) properties (out of 3) seen :243 could not realise parikh vector
Incomplete Parikh walk after 760800 steps, including 1000 resets, run finished after 6496 ms. (steps per millisecond=117 ) properties (out of 3) seen :217 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 47 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 43 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-09 00:19:04] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:19:04] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 00:19:04] [INFO ] Implicit Places using invariants in 441 ms returned []
[2022-06-09 00:19:04] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:19:04] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-09 00:19:04] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:19:08] [INFO ] Implicit Places using invariants and state equation in 4359 ms returned []
Implicit Place search using SMT with State Equation took 4802 ms to find 0 implicit places.
[2022-06-09 00:19:09] [INFO ] Redundant transitions in 241 ms returned []
[2022-06-09 00:19:09] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:19:09] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 00:19:09] [INFO ] Dead Transitions using invariants and state equation in 699 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-09 00:19:09] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 1000036 steps, including 2 resets, run finished after 538 ms. (steps per millisecond=1858 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2206 ms. (steps per millisecond=453 ) properties (out of 3) seen :28
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2168 ms. (steps per millisecond=461 ) properties (out of 3) seen :32
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2089 ms. (steps per millisecond=478 ) properties (out of 3) seen :6103
[2022-06-09 00:19:16] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:19:16] [INFO ] Computed 8 place invariants in 23 ms
[2022-06-09 00:19:16] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 00:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:17] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2022-06-09 00:19:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:19:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:19:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:17] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2022-06-09 00:19:17] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:19:17] [INFO ] [Nat]Added 254 Read/Feed constraints in 138 ms returned sat
[2022-06-09 00:19:17] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 0 ms to minimize.
[2022-06-09 00:19:18] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 0 ms to minimize.
[2022-06-09 00:19:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 546 ms
[2022-06-09 00:19:18] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 149 ms.
[2022-06-09 00:19:20] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2022-06-09 00:19:20] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2022-06-09 00:19:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 405 ms
[2022-06-09 00:19:20] [INFO ] Added : 83 causal constraints over 17 iterations in 2592 ms. Result :sat
Minimization took 359 ms.
[2022-06-09 00:19:21] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:21] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2022-06-09 00:19:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:19:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:19:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:22] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2022-06-09 00:19:22] [INFO ] [Nat]Added 254 Read/Feed constraints in 134 ms returned sat
[2022-06-09 00:19:22] [INFO ] Deduced a trap composed of 76 places in 191 ms of which 0 ms to minimize.
[2022-06-09 00:19:22] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 1 ms to minimize.
[2022-06-09 00:19:22] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 0 ms to minimize.
[2022-06-09 00:19:23] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 0 ms to minimize.
[2022-06-09 00:19:23] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 1 ms to minimize.
[2022-06-09 00:19:23] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 0 ms to minimize.
[2022-06-09 00:19:23] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 1 ms to minimize.
[2022-06-09 00:19:24] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2022-06-09 00:19:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2101 ms
[2022-06-09 00:19:24] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 181 ms.
[2022-06-09 00:19:25] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 0 ms to minimize.
[2022-06-09 00:19:26] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 0 ms to minimize.
[2022-06-09 00:19:26] [INFO ] Deduced a trap composed of 54 places in 172 ms of which 0 ms to minimize.
[2022-06-09 00:19:26] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 0 ms to minimize.
[2022-06-09 00:19:26] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 0 ms to minimize.
[2022-06-09 00:19:27] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 1 ms to minimize.
[2022-06-09 00:19:27] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 1 ms to minimize.
[2022-06-09 00:19:27] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 1 ms to minimize.
[2022-06-09 00:19:28] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 0 ms to minimize.
[2022-06-09 00:19:28] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 0 ms to minimize.
[2022-06-09 00:19:28] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 1 ms to minimize.
[2022-06-09 00:19:28] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 1 ms to minimize.
[2022-06-09 00:19:29] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 1 ms to minimize.
[2022-06-09 00:19:29] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 1 ms to minimize.
[2022-06-09 00:19:29] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 0 ms to minimize.
[2022-06-09 00:19:29] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 0 ms to minimize.
[2022-06-09 00:19:30] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 1 ms to minimize.
[2022-06-09 00:19:30] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 0 ms to minimize.
[2022-06-09 00:19:30] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 1 ms to minimize.
[2022-06-09 00:19:30] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 0 ms to minimize.
[2022-06-09 00:19:31] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5305 ms
[2022-06-09 00:19:31] [INFO ] Added : 59 causal constraints over 13 iterations in 7088 ms. Result :sat
Minimization took 454 ms.
[2022-06-09 00:19:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:19:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:32] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2022-06-09 00:19:32] [INFO ] [Real]Added 254 Read/Feed constraints in 118 ms returned sat
[2022-06-09 00:19:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:19:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:19:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:19:32] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2022-06-09 00:19:32] [INFO ] [Nat]Added 254 Read/Feed constraints in 130 ms returned sat
[2022-06-09 00:19:33] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 1 ms to minimize.
[2022-06-09 00:19:33] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 0 ms to minimize.
[2022-06-09 00:19:33] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 0 ms to minimize.
[2022-06-09 00:19:33] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 0 ms to minimize.
[2022-06-09 00:19:34] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 1 ms to minimize.
[2022-06-09 00:19:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1370 ms
[2022-06-09 00:19:34] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 153 ms.
[2022-06-09 00:19:37] [INFO ] Deduced a trap composed of 10 places in 315 ms of which 1 ms to minimize.
[2022-06-09 00:19:37] [INFO ] Deduced a trap composed of 70 places in 311 ms of which 0 ms to minimize.
[2022-06-09 00:19:37] [INFO ] Deduced a trap composed of 70 places in 321 ms of which 0 ms to minimize.
[2022-06-09 00:19:38] [INFO ] Deduced a trap composed of 70 places in 311 ms of which 0 ms to minimize.
[2022-06-09 00:19:38] [INFO ] Deduced a trap composed of 30 places in 317 ms of which 1 ms to minimize.
[2022-06-09 00:19:39] [INFO ] Deduced a trap composed of 64 places in 278 ms of which 0 ms to minimize.
[2022-06-09 00:19:39] [INFO ] Deduced a trap composed of 53 places in 270 ms of which 0 ms to minimize.
[2022-06-09 00:19:39] [INFO ] Deduced a trap composed of 86 places in 275 ms of which 1 ms to minimize.
[2022-06-09 00:19:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3257 ms
[2022-06-09 00:19:40] [INFO ] Added : 99 causal constraints over 20 iterations in 5749 ms. Result :sat
Minimization took 392 ms.
Current structural bounds on expressions (after SMT) : [1, 1, -1] Max seen :[0, 0, 6103]
Incomplete Parikh walk after 2153200 steps, including 1000 resets, run finished after 21455 ms. (steps per millisecond=100 ) properties (out of 3) seen :308 could not realise parikh vector
Incomplete Parikh walk after 507800 steps, including 1000 resets, run finished after 3774 ms. (steps per millisecond=134 ) properties (out of 3) seen :290 could not realise parikh vector
Incomplete Parikh walk after 760800 steps, including 1000 resets, run finished after 6196 ms. (steps per millisecond=122 ) properties (out of 3) seen :91 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 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 36 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-09 00:20:12] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:20:12] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-09 00:20:12] [INFO ] Implicit Places using invariants in 371 ms returned []
[2022-06-09 00:20:12] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:20:12] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 00:20:12] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:20:16] [INFO ] Implicit Places using invariants and state equation in 3777 ms returned []
Implicit Place search using SMT with State Equation took 4150 ms to find 0 implicit places.
[2022-06-09 00:20:16] [INFO ] Redundant transitions in 85 ms returned []
[2022-06-09 00:20:16] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:20:16] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-09 00:20:16] [INFO ] Dead Transitions using invariants and state equation in 697 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-09 00:20:16] [INFO ] Computed 8 place invariants in 6 ms
Incomplete random walk after 1000071 steps, including 2 resets, run finished after 480 ms. (steps per millisecond=2083 ) properties (out of 3) seen :255
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2084 ms. (steps per millisecond=479 ) properties (out of 3) seen :29
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2052 ms. (steps per millisecond=487 ) properties (out of 3) seen :35
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1996 ms. (steps per millisecond=501 ) properties (out of 3) seen :6156
[2022-06-09 00:20:23] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:20:23] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 00:20:23] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 00:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:20:23] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2022-06-09 00:20:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:20:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:20:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:20:24] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2022-06-09 00:20:24] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:20:24] [INFO ] [Nat]Added 254 Read/Feed constraints in 133 ms returned sat
[2022-06-09 00:20:24] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 1 ms to minimize.
[2022-06-09 00:20:24] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 0 ms to minimize.
[2022-06-09 00:20:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 553 ms
[2022-06-09 00:20:25] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 139 ms.
[2022-06-09 00:20:27] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2022-06-09 00:20:27] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2022-06-09 00:20:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 409 ms
[2022-06-09 00:20:27] [INFO ] Added : 83 causal constraints over 17 iterations in 2504 ms. Result :sat
Minimization took 359 ms.
[2022-06-09 00:20:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:20:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:20:28] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2022-06-09 00:20:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:20:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:20:28] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2022-06-09 00:20:28] [INFO ] [Nat]Added 254 Read/Feed constraints in 133 ms returned sat
[2022-06-09 00:20:29] [INFO ] Deduced a trap composed of 76 places in 189 ms of which 1 ms to minimize.
[2022-06-09 00:20:29] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 1 ms to minimize.
[2022-06-09 00:20:29] [INFO ] Deduced a trap composed of 76 places in 178 ms of which 0 ms to minimize.
[2022-06-09 00:20:29] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 0 ms to minimize.
[2022-06-09 00:20:30] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 1 ms to minimize.
[2022-06-09 00:20:30] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 0 ms to minimize.
[2022-06-09 00:20:30] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 0 ms to minimize.
[2022-06-09 00:20:30] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2022-06-09 00:20:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2037 ms
[2022-06-09 00:20:30] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 138 ms.
[2022-06-09 00:20:32] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 0 ms to minimize.
[2022-06-09 00:20:32] [INFO ] Deduced a trap composed of 49 places in 155 ms of which 0 ms to minimize.
[2022-06-09 00:20:32] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 0 ms to minimize.
[2022-06-09 00:20:33] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 1 ms to minimize.
[2022-06-09 00:20:33] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 0 ms to minimize.
[2022-06-09 00:20:33] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 0 ms to minimize.
[2022-06-09 00:20:34] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 0 ms to minimize.
[2022-06-09 00:20:34] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 0 ms to minimize.
[2022-06-09 00:20:34] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 0 ms to minimize.
[2022-06-09 00:20:34] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 0 ms to minimize.
[2022-06-09 00:20:35] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 0 ms to minimize.
[2022-06-09 00:20:35] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 1 ms to minimize.
[2022-06-09 00:20:35] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 0 ms to minimize.
[2022-06-09 00:20:35] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 0 ms to minimize.
[2022-06-09 00:20:36] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 0 ms to minimize.
[2022-06-09 00:20:36] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 0 ms to minimize.
[2022-06-09 00:20:36] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 1 ms to minimize.
[2022-06-09 00:20:36] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 0 ms to minimize.
[2022-06-09 00:20:37] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 1 ms to minimize.
[2022-06-09 00:20:37] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 0 ms to minimize.
[2022-06-09 00:20:37] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5120 ms
[2022-06-09 00:20:37] [INFO ] Added : 59 causal constraints over 13 iterations in 6862 ms. Result :sat
Minimization took 452 ms.
[2022-06-09 00:20:38] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 00:20:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:20:38] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2022-06-09 00:20:38] [INFO ] [Real]Added 254 Read/Feed constraints in 114 ms returned sat
[2022-06-09 00:20:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:20:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:20:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:20:39] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2022-06-09 00:20:39] [INFO ] [Nat]Added 254 Read/Feed constraints in 127 ms returned sat
[2022-06-09 00:20:39] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 0 ms to minimize.
[2022-06-09 00:20:39] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 1 ms to minimize.
[2022-06-09 00:20:40] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 0 ms to minimize.
[2022-06-09 00:20:40] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 1 ms to minimize.
[2022-06-09 00:20:40] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 1 ms to minimize.
[2022-06-09 00:20:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1317 ms
[2022-06-09 00:20:40] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 146 ms.
[2022-06-09 00:20:43] [INFO ] Deduced a trap composed of 10 places in 292 ms of which 0 ms to minimize.
[2022-06-09 00:20:43] [INFO ] Deduced a trap composed of 70 places in 314 ms of which 0 ms to minimize.
[2022-06-09 00:20:44] [INFO ] Deduced a trap composed of 70 places in 313 ms of which 0 ms to minimize.
[2022-06-09 00:20:44] [INFO ] Deduced a trap composed of 70 places in 304 ms of which 1 ms to minimize.
[2022-06-09 00:20:44] [INFO ] Deduced a trap composed of 30 places in 313 ms of which 0 ms to minimize.
[2022-06-09 00:20:45] [INFO ] Deduced a trap composed of 64 places in 273 ms of which 0 ms to minimize.
[2022-06-09 00:20:45] [INFO ] Deduced a trap composed of 53 places in 266 ms of which 1 ms to minimize.
[2022-06-09 00:20:46] [INFO ] Deduced a trap composed of 86 places in 277 ms of which 1 ms to minimize.
[2022-06-09 00:20:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3210 ms
[2022-06-09 00:20:46] [INFO ] Added : 99 causal constraints over 20 iterations in 5712 ms. Result :sat
Minimization took 384 ms.
Current structural bounds on expressions (after SMT) : [1, 1, -1] Max seen :[0, 0, 6156]
Incomplete Parikh walk after 2163800 steps, including 1000 resets, run finished after 21600 ms. (steps per millisecond=100 ) properties (out of 3) seen :219 could not realise parikh vector
Incomplete Parikh walk after 507800 steps, including 1000 resets, run finished after 3798 ms. (steps per millisecond=133 ) properties (out of 3) seen :328 could not realise parikh vector
Incomplete Parikh walk after 760800 steps, including 1000 resets, run finished after 6190 ms. (steps per millisecond=122 ) properties (out of 3) seen :236 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 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 65 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-09 00:21:18] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:21:18] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 00:21:18] [INFO ] Implicit Places using invariants in 295 ms returned []
[2022-06-09 00:21:18] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:21:18] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-09 00:21:19] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:21:23] [INFO ] Implicit Places using invariants and state equation in 4477 ms returned []
Implicit Place search using SMT with State Equation took 4774 ms to find 0 implicit places.
[2022-06-09 00:21:23] [INFO ] Redundant transitions in 67 ms returned []
[2022-06-09 00:21:23] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:21:23] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 00:21:24] [INFO ] Dead Transitions using invariants and state equation in 712 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-09 00:21:24] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 1000235 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=2037 ) properties (out of 3) seen :411
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2082 ms. (steps per millisecond=480 ) properties (out of 3) seen :29
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2072 ms. (steps per millisecond=482 ) properties (out of 3) seen :30
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2063 ms. (steps per millisecond=484 ) properties (out of 3) seen :5977
[2022-06-09 00:21:30] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:21:30] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 00:21:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:21:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:21:31] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2022-06-09 00:21:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:21:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:21:31] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2022-06-09 00:21:31] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:21:31] [INFO ] [Nat]Added 254 Read/Feed constraints in 139 ms returned sat
[2022-06-09 00:21:31] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 0 ms to minimize.
[2022-06-09 00:21:32] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 1 ms to minimize.
[2022-06-09 00:21:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 579 ms
[2022-06-09 00:21:32] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 137 ms.
[2022-06-09 00:21:34] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2022-06-09 00:21:34] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2022-06-09 00:21:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 414 ms
[2022-06-09 00:21:34] [INFO ] Added : 83 causal constraints over 17 iterations in 2619 ms. Result :sat
Minimization took 387 ms.
[2022-06-09 00:21:35] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:21:35] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2022-06-09 00:21:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:21:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:21:36] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2022-06-09 00:21:36] [INFO ] [Nat]Added 254 Read/Feed constraints in 139 ms returned sat
[2022-06-09 00:21:36] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 1 ms to minimize.
[2022-06-09 00:21:36] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 1 ms to minimize.
[2022-06-09 00:21:36] [INFO ] Deduced a trap composed of 76 places in 198 ms of which 1 ms to minimize.
[2022-06-09 00:21:37] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 0 ms to minimize.
[2022-06-09 00:21:37] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 0 ms to minimize.
[2022-06-09 00:21:37] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 1 ms to minimize.
[2022-06-09 00:21:38] [INFO ] Deduced a trap composed of 25 places in 226 ms of which 1 ms to minimize.
[2022-06-09 00:21:38] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2022-06-09 00:21:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2155 ms
[2022-06-09 00:21:38] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 149 ms.
[2022-06-09 00:21:40] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 0 ms to minimize.
[2022-06-09 00:21:40] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 0 ms to minimize.
[2022-06-09 00:21:40] [INFO ] Deduced a trap composed of 54 places in 167 ms of which 1 ms to minimize.
[2022-06-09 00:21:40] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 0 ms to minimize.
[2022-06-09 00:21:41] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 0 ms to minimize.
[2022-06-09 00:21:41] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 0 ms to minimize.
[2022-06-09 00:21:41] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 0 ms to minimize.
[2022-06-09 00:21:41] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 0 ms to minimize.
[2022-06-09 00:21:42] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 1 ms to minimize.
[2022-06-09 00:21:42] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 0 ms to minimize.
[2022-06-09 00:21:42] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 0 ms to minimize.
[2022-06-09 00:21:42] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 0 ms to minimize.
[2022-06-09 00:21:43] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 0 ms to minimize.
[2022-06-09 00:21:43] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 0 ms to minimize.
[2022-06-09 00:21:43] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 0 ms to minimize.
[2022-06-09 00:21:43] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 0 ms to minimize.
[2022-06-09 00:21:44] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2022-06-09 00:21:44] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 0 ms to minimize.
[2022-06-09 00:21:44] [INFO ] Deduced a trap composed of 47 places in 160 ms of which 0 ms to minimize.
[2022-06-09 00:21:44] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 1 ms to minimize.
[2022-06-09 00:21:45] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5284 ms
[2022-06-09 00:21:45] [INFO ] Added : 59 causal constraints over 13 iterations in 7079 ms. Result :sat
Minimization took 462 ms.
[2022-06-09 00:21:45] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:21:46] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2022-06-09 00:21:46] [INFO ] [Real]Added 254 Read/Feed constraints in 117 ms returned sat
[2022-06-09 00:21:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:21:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:21:46] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2022-06-09 00:21:47] [INFO ] [Nat]Added 254 Read/Feed constraints in 133 ms returned sat
[2022-06-09 00:21:47] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 0 ms to minimize.
[2022-06-09 00:21:47] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 0 ms to minimize.
[2022-06-09 00:21:47] [INFO ] Deduced a trap composed of 67 places in 203 ms of which 1 ms to minimize.
[2022-06-09 00:21:48] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 1 ms to minimize.
[2022-06-09 00:21:48] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 0 ms to minimize.
[2022-06-09 00:21:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1387 ms
[2022-06-09 00:21:48] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 146 ms.
[2022-06-09 00:21:51] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 0 ms to minimize.
[2022-06-09 00:21:51] [INFO ] Deduced a trap composed of 70 places in 319 ms of which 1 ms to minimize.
[2022-06-09 00:21:52] [INFO ] Deduced a trap composed of 70 places in 320 ms of which 0 ms to minimize.
[2022-06-09 00:21:52] [INFO ] Deduced a trap composed of 70 places in 309 ms of which 0 ms to minimize.
[2022-06-09 00:21:52] [INFO ] Deduced a trap composed of 30 places in 318 ms of which 0 ms to minimize.
[2022-06-09 00:21:53] [INFO ] Deduced a trap composed of 64 places in 276 ms of which 0 ms to minimize.
[2022-06-09 00:21:53] [INFO ] Deduced a trap composed of 53 places in 274 ms of which 0 ms to minimize.
[2022-06-09 00:21:53] [INFO ] Deduced a trap composed of 86 places in 280 ms of which 0 ms to minimize.
[2022-06-09 00:21:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3302 ms
[2022-06-09 00:21:54] [INFO ] Added : 99 causal constraints over 20 iterations in 5844 ms. Result :sat
Minimization took 398 ms.
Current structural bounds on expressions (after SMT) : [1, 1, -1] Max seen :[0, 0, 6156]
Incomplete Parikh walk after 2163800 steps, including 1000 resets, run finished after 22023 ms. (steps per millisecond=98 ) properties (out of 3) seen :497 could not realise parikh vector
Incomplete Parikh walk after 507800 steps, including 1000 resets, run finished after 3819 ms. (steps per millisecond=132 ) properties (out of 3) seen :271 could not realise parikh vector
Incomplete Parikh walk after 760800 steps, including 1000 resets, run finished after 6264 ms. (steps per millisecond=121 ) properties (out of 3) seen :205 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 40 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-09 00:22:26] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:22:26] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-09 00:22:27] [INFO ] Implicit Places using invariants in 278 ms returned []
[2022-06-09 00:22:27] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:22:27] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-09 00:22:27] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:22:31] [INFO ] Implicit Places using invariants and state equation in 4255 ms returned []
Implicit Place search using SMT with State Equation took 4535 ms to find 0 implicit places.
[2022-06-09 00:22:31] [INFO ] Redundant transitions in 62 ms returned []
[2022-06-09 00:22:31] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:22:31] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-09 00:22:32] [INFO ] Dead Transitions using invariants and state equation in 690 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting property specific reduction for BugTracking-PT-q3m256-UpperBounds-01
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:22:32] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10099 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1683 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2022-06-09 00:22:32] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:22:32] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 00:22:32] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 00:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:22:32] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2022-06-09 00:22:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:22:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:22:32] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2022-06-09 00:22:33] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:22:33] [INFO ] [Nat]Added 254 Read/Feed constraints in 139 ms returned sat
[2022-06-09 00:22:33] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 0 ms to minimize.
[2022-06-09 00:22:33] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 0 ms to minimize.
[2022-06-09 00:22:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 542 ms
[2022-06-09 00:22:33] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 138 ms.
[2022-06-09 00:22:35] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2022-06-09 00:22:35] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2022-06-09 00:22:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 432 ms
[2022-06-09 00:22:36] [INFO ] Added : 83 causal constraints over 17 iterations in 2562 ms. Result :sat
Minimization took 376 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 760800 steps, including 1000 resets, run finished after 6274 ms. (steps per millisecond=121 ) 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 58 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-09 00:22:43] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 1000124 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1995 ms. (steps per millisecond=501 ) properties (out of 1) seen :0
[2022-06-09 00:22:45] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:22:45] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 00:22:45] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:22:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:22:45] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2022-06-09 00:22:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:22:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:22:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:22:46] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2022-06-09 00:22:46] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:22:46] [INFO ] [Nat]Added 254 Read/Feed constraints in 137 ms returned sat
[2022-06-09 00:22:46] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 0 ms to minimize.
[2022-06-09 00:22:46] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 0 ms to minimize.
[2022-06-09 00:22:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 554 ms
[2022-06-09 00:22:47] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 141 ms.
[2022-06-09 00:22:49] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2022-06-09 00:22:49] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2022-06-09 00:22:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 399 ms
[2022-06-09 00:22:49] [INFO ] Added : 83 causal constraints over 17 iterations in 2602 ms. Result :sat
Minimization took 375 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 760800 steps, including 1000 resets, run finished after 6208 ms. (steps per millisecond=122 ) 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 34 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 32 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-09 00:22:56] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:22:56] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-09 00:22:56] [INFO ] Implicit Places using invariants in 304 ms returned []
[2022-06-09 00:22:56] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:22:56] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-09 00:22:56] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:23:01] [INFO ] Implicit Places using invariants and state equation in 4823 ms returned []
Implicit Place search using SMT with State Equation took 5127 ms to find 0 implicit places.
[2022-06-09 00:23:01] [INFO ] Redundant transitions in 60 ms returned []
[2022-06-09 00:23:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:23:01] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 00:23:02] [INFO ] Dead Transitions using invariants and state equation in 700 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m256-UpperBounds-01 in 29997 ms.
Starting property specific reduction for BugTracking-PT-q3m256-UpperBounds-05
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:23:02] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10119 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1445 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2022-06-09 00:23:02] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:23:02] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-09 00:23:02] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:23:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:23:02] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2022-06-09 00:23:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:23:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 00:23:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:23:03] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2022-06-09 00:23:03] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:23:03] [INFO ] [Nat]Added 254 Read/Feed constraints in 139 ms returned sat
[2022-06-09 00:23:03] [INFO ] Deduced a trap composed of 76 places in 198 ms of which 0 ms to minimize.
[2022-06-09 00:23:03] [INFO ] Deduced a trap composed of 47 places in 185 ms of which 0 ms to minimize.
[2022-06-09 00:23:03] [INFO ] Deduced a trap composed of 76 places in 195 ms of which 0 ms to minimize.
[2022-06-09 00:23:04] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 0 ms to minimize.
[2022-06-09 00:23:04] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 0 ms to minimize.
[2022-06-09 00:23:04] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 0 ms to minimize.
[2022-06-09 00:23:05] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 1 ms to minimize.
[2022-06-09 00:23:05] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2022-06-09 00:23:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2116 ms
[2022-06-09 00:23:05] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 143 ms.
[2022-06-09 00:23:06] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 0 ms to minimize.
[2022-06-09 00:23:07] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 1 ms to minimize.
[2022-06-09 00:23:07] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 0 ms to minimize.
[2022-06-09 00:23:07] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 0 ms to minimize.
[2022-06-09 00:23:07] [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 34 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-09 00:23:07] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=2032 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2113 ms. (steps per millisecond=473 ) properties (out of 1) seen :0
[2022-06-09 00:23:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:23:10] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 00:23:10] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-09 00:23:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:23:10] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2022-06-09 00:23:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:23:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:23:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:23:11] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2022-06-09 00:23:11] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:23:11] [INFO ] [Nat]Added 254 Read/Feed constraints in 141 ms returned sat
[2022-06-09 00:23:11] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 1 ms to minimize.
[2022-06-09 00:23:11] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 0 ms to minimize.
[2022-06-09 00:23:12] [INFO ] Deduced a trap composed of 76 places in 203 ms of which 0 ms to minimize.
[2022-06-09 00:23:12] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 0 ms to minimize.
[2022-06-09 00:23:12] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 0 ms to minimize.
[2022-06-09 00:23:12] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 1 ms to minimize.
[2022-06-09 00:23:13] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 0 ms to minimize.
[2022-06-09 00:23:13] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2022-06-09 00:23:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2103 ms
[2022-06-09 00:23:13] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 145 ms.
[2022-06-09 00:23:15] [INFO ] Deduced a trap composed of 49 places in 162 ms of which 0 ms to minimize.
[2022-06-09 00:23:15] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 0 ms to minimize.
[2022-06-09 00:23:15] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 0 ms to minimize.
[2022-06-09 00:23:15] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 0 ms to minimize.
[2022-06-09 00:23:16] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 0 ms to minimize.
[2022-06-09 00:23:16] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 0 ms to minimize.
[2022-06-09 00:23:16] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 0 ms to minimize.
[2022-06-09 00:23:17] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 0 ms to minimize.
[2022-06-09 00:23:17] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 1 ms to minimize.
[2022-06-09 00:23:17] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 1 ms to minimize.
[2022-06-09 00:23:17] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 0 ms to minimize.
[2022-06-09 00:23:18] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 0 ms to minimize.
[2022-06-09 00:23:18] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 1 ms to minimize.
[2022-06-09 00:23:18] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 1 ms to minimize.
[2022-06-09 00:23:18] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 0 ms to minimize.
[2022-06-09 00:23:19] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 1 ms to minimize.
[2022-06-09 00:23:19] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 3 ms to minimize.
[2022-06-09 00:23:19] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 0 ms to minimize.
[2022-06-09 00:23:19] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 0 ms to minimize.
[2022-06-09 00:23:20] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 1 ms to minimize.
[2022-06-09 00:23:20] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5374 ms
[2022-06-09 00:23:20] [INFO ] Added : 59 causal constraints over 13 iterations in 7195 ms. Result :sat
Minimization took 480 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 507800 steps, including 1000 resets, run finished after 3868 ms. (steps per millisecond=131 ) 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 34 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 33 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-09 00:23:25] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:23:25] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-09 00:23:25] [INFO ] Implicit Places using invariants in 302 ms returned []
[2022-06-09 00:23:25] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:23:25] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 00:23:25] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:23:29] [INFO ] Implicit Places using invariants and state equation in 4502 ms returned []
Implicit Place search using SMT with State Equation took 4809 ms to find 0 implicit places.
[2022-06-09 00:23:30] [INFO ] Redundant transitions in 62 ms returned []
[2022-06-09 00:23:30] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:23:30] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 00:23:30] [INFO ] Dead Transitions using invariants and state equation in 729 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m256-UpperBounds-05 in 28546 ms.
Starting property specific reduction for BugTracking-PT-q3m256-UpperBounds-10
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:23:30] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 10145 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1449 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :80
[2022-06-09 00:23:30] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:23:30] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 00:23:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:23:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:23:31] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2022-06-09 00:23:31] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:23:31] [INFO ] [Real]Added 254 Read/Feed constraints in 120 ms returned sat
[2022-06-09 00:23:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:23:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:23:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:23:31] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2022-06-09 00:23:31] [INFO ] [Nat]Added 254 Read/Feed constraints in 136 ms returned sat
[2022-06-09 00:23:32] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 0 ms to minimize.
[2022-06-09 00:23:32] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 0 ms to minimize.
[2022-06-09 00:23:32] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 0 ms to minimize.
[2022-06-09 00:23:32] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 0 ms to minimize.
[2022-06-09 00:23:33] [INFO ] Deduced a trap composed of 45 places in 201 ms of which 0 ms to minimize.
[2022-06-09 00:23:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1393 ms
[2022-06-09 00:23:33] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 142 ms.
[2022-06-09 00:23:36] [INFO ] Deduced a trap composed of 10 places in 329 ms of which 1 ms to minimize.
[2022-06-09 00:23:36] [INFO ] Deduced a trap composed of 70 places in 319 ms of which 0 ms to minimize.
[2022-06-09 00:23:36] [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 :[80]
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.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:23:36] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000125 steps, including 2 resets, run finished after 519 ms. (steps per millisecond=1927 ) properties (out of 1) seen :254
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2020 ms. (steps per millisecond=495 ) properties (out of 1) seen :5689
[2022-06-09 00:23:39] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:23:39] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 00:23:39] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:23:39] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2022-06-09 00:23:39] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:23:39] [INFO ] [Real]Added 254 Read/Feed constraints in 125 ms returned sat
[2022-06-09 00:23:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:23:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:23:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:23:40] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2022-06-09 00:23:40] [INFO ] [Nat]Added 254 Read/Feed constraints in 135 ms returned sat
[2022-06-09 00:23:40] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 0 ms to minimize.
[2022-06-09 00:23:40] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 0 ms to minimize.
[2022-06-09 00:23:41] [INFO ] Deduced a trap composed of 67 places in 196 ms of which 1 ms to minimize.
[2022-06-09 00:23:41] [INFO ] Deduced a trap composed of 37 places in 196 ms of which 0 ms to minimize.
[2022-06-09 00:23:41] [INFO ] Deduced a trap composed of 45 places in 192 ms of which 1 ms to minimize.
[2022-06-09 00:23:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1394 ms
[2022-06-09 00:23:41] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 145 ms.
[2022-06-09 00:23:44] [INFO ] Deduced a trap composed of 10 places in 315 ms of which 0 ms to minimize.
[2022-06-09 00:23:44] [INFO ] Deduced a trap composed of 70 places in 319 ms of which 0 ms to minimize.
[2022-06-09 00:23:45] [INFO ] Deduced a trap composed of 70 places in 318 ms of which 1 ms to minimize.
[2022-06-09 00:23:45] [INFO ] Deduced a trap composed of 70 places in 318 ms of which 0 ms to minimize.
[2022-06-09 00:23:46] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 0 ms to minimize.
[2022-06-09 00:23:46] [INFO ] Deduced a trap composed of 64 places in 283 ms of which 1 ms to minimize.
[2022-06-09 00:23:46] [INFO ] Deduced a trap composed of 53 places in 280 ms of which 0 ms to minimize.
[2022-06-09 00:23:47] [INFO ] Deduced a trap composed of 86 places in 273 ms of which 0 ms to minimize.
[2022-06-09 00:23:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3303 ms
[2022-06-09 00:23:47] [INFO ] Added : 99 causal constraints over 20 iterations in 5889 ms. Result :sat
Minimization took 402 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5689]
Incomplete Parikh walk after 2070400 steps, including 1000 resets, run finished after 21041 ms. (steps per millisecond=98 ) properties (out of 1) seen :230 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 33 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-09 00:24:09] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:24:09] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 00:24:09] [INFO ] Implicit Places using invariants in 287 ms returned []
[2022-06-09 00:24:09] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:24:09] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-09 00:24:09] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:24:14] [INFO ] Implicit Places using invariants and state equation in 4878 ms returned []
Implicit Place search using SMT with State Equation took 5167 ms to find 0 implicit places.
[2022-06-09 00:24:14] [INFO ] Redundant transitions in 64 ms returned []
[2022-06-09 00:24:14] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:24:14] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 00:24:15] [INFO ] Dead Transitions using invariants and state equation in 689 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-09 00:24:15] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000220 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=2000 ) properties (out of 1) seen :844
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2070 ms. (steps per millisecond=483 ) properties (out of 1) seen :6411
[2022-06-09 00:24:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:24:17] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-09 00:24:17] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:24:17] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2022-06-09 00:24:18] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:24:18] [INFO ] [Real]Added 254 Read/Feed constraints in 121 ms returned sat
[2022-06-09 00:24:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:24:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:24:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:24:18] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2022-06-09 00:24:18] [INFO ] [Nat]Added 254 Read/Feed constraints in 137 ms returned sat
[2022-06-09 00:24:19] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 0 ms to minimize.
[2022-06-09 00:24:19] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 0 ms to minimize.
[2022-06-09 00:24:19] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 1 ms to minimize.
[2022-06-09 00:24:19] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 1 ms to minimize.
[2022-06-09 00:24:20] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 0 ms to minimize.
[2022-06-09 00:24:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1401 ms
[2022-06-09 00:24:20] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 144 ms.
[2022-06-09 00:24:22] [INFO ] Deduced a trap composed of 10 places in 319 ms of which 0 ms to minimize.
[2022-06-09 00:24:23] [INFO ] Deduced a trap composed of 70 places in 315 ms of which 1 ms to minimize.
[2022-06-09 00:24:23] [INFO ] Deduced a trap composed of 70 places in 307 ms of which 0 ms to minimize.
[2022-06-09 00:24:24] [INFO ] Deduced a trap composed of 70 places in 322 ms of which 0 ms to minimize.
[2022-06-09 00:24:24] [INFO ] Deduced a trap composed of 30 places in 315 ms of which 0 ms to minimize.
[2022-06-09 00:24:24] [INFO ] Deduced a trap composed of 64 places in 277 ms of which 0 ms to minimize.
[2022-06-09 00:24:25] [INFO ] Deduced a trap composed of 53 places in 285 ms of which 1 ms to minimize.
[2022-06-09 00:24:25] [INFO ] Deduced a trap composed of 86 places in 283 ms of which 1 ms to minimize.
[2022-06-09 00:24:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3297 ms
[2022-06-09 00:24:25] [INFO ] Added : 99 causal constraints over 20 iterations in 5829 ms. Result :sat
Minimization took 405 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[6411]
Incomplete Parikh walk after 2214800 steps, including 1000 resets, run finished after 22388 ms. (steps per millisecond=98 ) properties (out of 1) seen :584 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 32 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 32 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-09 00:24:48] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:24:48] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-09 00:24:49] [INFO ] Implicit Places using invariants in 284 ms returned []
[2022-06-09 00:24:49] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:24:49] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-09 00:24:49] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:24:54] [INFO ] Implicit Places using invariants and state equation in 4984 ms returned []
Implicit Place search using SMT with State Equation took 5269 ms to find 0 implicit places.
[2022-06-09 00:24:54] [INFO ] Redundant transitions in 62 ms returned []
[2022-06-09 00:24:54] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:24:54] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 00:24:54] [INFO ] Dead Transitions using invariants and state equation in 692 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-09 00:24:54] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 1000219 steps, including 2 resets, run finished after 477 ms. (steps per millisecond=2096 ) properties (out of 1) seen :430
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1994 ms. (steps per millisecond=501 ) properties (out of 1) seen :6062
[2022-06-09 00:24:57] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:24:57] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-09 00:24:57] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 00:24:57] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2022-06-09 00:24:57] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:24:57] [INFO ] [Real]Added 254 Read/Feed constraints in 120 ms returned sat
[2022-06-09 00:24:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 00:24:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 00:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 00:24:58] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2022-06-09 00:24:58] [INFO ] [Nat]Added 254 Read/Feed constraints in 140 ms returned sat
[2022-06-09 00:24:58] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 0 ms to minimize.
[2022-06-09 00:24:59] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 1 ms to minimize.
[2022-06-09 00:24:59] [INFO ] Deduced a trap composed of 67 places in 207 ms of which 1 ms to minimize.
[2022-06-09 00:24:59] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 1 ms to minimize.
[2022-06-09 00:24:59] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 1 ms to minimize.
[2022-06-09 00:24:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1383 ms
[2022-06-09 00:25:00] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 140 ms.
[2022-06-09 00:25:02] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 0 ms to minimize.
[2022-06-09 00:25:03] [INFO ] Deduced a trap composed of 70 places in 310 ms of which 0 ms to minimize.
[2022-06-09 00:25:03] [INFO ] Deduced a trap composed of 70 places in 314 ms of which 0 ms to minimize.
[2022-06-09 00:25:03] [INFO ] Deduced a trap composed of 70 places in 323 ms of which 0 ms to minimize.
[2022-06-09 00:25:04] [INFO ] Deduced a trap composed of 30 places in 333 ms of which 0 ms to minimize.
[2022-06-09 00:25:04] [INFO ] Deduced a trap composed of 64 places in 280 ms of which 1 ms to minimize.
[2022-06-09 00:25:05] [INFO ] Deduced a trap composed of 53 places in 275 ms of which 1 ms to minimize.
[2022-06-09 00:25:05] [INFO ] Deduced a trap composed of 86 places in 278 ms of which 0 ms to minimize.
[2022-06-09 00:25:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3302 ms
[2022-06-09 00:25:05] [INFO ] Added : 99 causal constraints over 20 iterations in 5831 ms. Result :sat
Minimization took 398 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[6411]
Incomplete Parikh walk after 2214800 steps, including 1000 resets, run finished after 22254 ms. (steps per millisecond=99 ) properties (out of 1) seen :327 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 32 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 33 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-09 00:25:28] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:25:28] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-09 00:25:28] [INFO ] Implicit Places using invariants in 301 ms returned []
[2022-06-09 00:25:28] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:25:28] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 00:25:29] [INFO ] State equation strengthened by 254 read => feed constraints.
[2022-06-09 00:25:33] [INFO ] Implicit Places using invariants and state equation in 4887 ms returned []
Implicit Place search using SMT with State Equation took 5190 ms to find 0 implicit places.
[2022-06-09 00:25:33] [INFO ] Redundant transitions in 63 ms returned []
[2022-06-09 00:25:33] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 00:25:33] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 00:25:34] [INFO ] Dead Transitions using invariants and state equation in 680 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m256-UpperBounds-10 in 123739 ms.
[2022-06-09 00:25:34] [INFO ] Flatten gal took : 289 ms
[2022-06-09 00:25:35] [INFO ] Applying decomposition
[2022-06-09 00:25:35] [INFO ] Flatten gal took : 198 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/graph4711589560761323246.txt, -o, /tmp/graph4711589560761323246.bin, -w, /tmp/graph4711589560761323246.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/graph4711589560761323246.bin, -l, -1, -v, -w, /tmp/graph4711589560761323246.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 00:25:35] [INFO ] Decomposing Gal with order
[2022-06-09 00:25:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 00:25:36] [INFO ] Removed a total of 280 redundant transitions.
[2022-06-09 00:25:36] [INFO ] Flatten gal took : 365 ms
[2022-06-09 00:25:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 17 ms.
[2022-06-09 00:25:36] [INFO ] Time to serialize gal into /tmp/UpperBounds16150934061300095352.gal : 30 ms
[2022-06-09 00:25:36] [INFO ] Time to serialize properties into /tmp/UpperBounds5400604052906237297.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/UpperBounds16150934061300095352.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds5400604052906237297.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/UpperBounds16150934061300095352.gal -t CGAL -reachable-file /tmp/UpperBounds5400604052906237297.prop --nowitness
Loading property file /tmp/UpperBounds5400604052906237297.prop.
Detected timeout of ITS tools.
[2022-06-09 00:48:25] [INFO ] Flatten gal took : 623 ms
[2022-06-09 00:48:25] [INFO ] Time to serialize gal into /tmp/UpperBounds16572409110305256055.gal : 84 ms
[2022-06-09 00:48:25] [INFO ] Time to serialize properties into /tmp/UpperBounds6371413028787201700.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/UpperBounds16572409110305256055.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6371413028787201700.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/UpperBounds16572409110305256055.gal -t CGAL -reachable-file /tmp/UpperBounds6371413028787201700.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds6371413028787201700.prop.
Detected timeout of ITS tools.
[2022-06-09 01:11:03] [INFO ] Flatten gal took : 480 ms
[2022-06-09 01:11:07] [INFO ] Input system was already deterministic with 2747 transitions.
[2022-06-09 01:11:07] [INFO ] Transformed 229 places.
[2022-06-09 01:11:07] [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 01:11:07] [INFO ] Time to serialize gal into /tmp/UpperBounds16149179899430403000.gal : 31 ms
[2022-06-09 01:11:07] [INFO ] Time to serialize properties into /tmp/UpperBounds7747998773401195885.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/UpperBounds16149179899430403000.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7747998773401195885.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/UpperBounds16149179899430403000.gal -t CGAL -reachable-file /tmp/UpperBounds7747998773401195885.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/UpperBounds7747998773401195885.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-q3m256"
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-q3m256, 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-165472292500022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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