MCC'2022- Execution of r323-tall-165472292600034

About the Execution of 2021-gold for BugTracking-PT-q8m016

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16247.796	3600000.00	3252796.00	284975.00	1 0 0 1 0 ? 0 1 0 0 ? ? ? 0 ? 0	normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.5K Jun 7 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Jun 7 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 7 16:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 7 16:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Jun 7 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 7 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Jun 7 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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-q8m016-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654737675034

Running Version 0
[2022-06-09 01:21:16] [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 01:21:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 01:21:17] [INFO ] Load time of PNML (sax parser for PT used): 665 ms
[2022-06-09 01:21:17] [INFO ] Transformed 754 places.
[2022-06-09 01:21:17] [INFO ] Transformed 27370 transitions.
[2022-06-09 01:21:17] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 808 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 474 places in 125 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m016-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 01:21:17] [INFO ] Computed 10 place invariants in 58 ms
Incomplete random walk after 10000 steps, including 48 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 8) seen :66
FORMULA BugTracking-PT-q8m016-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q8m016-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q8m016-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :13
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :14
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :17
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :14
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :8
[2022-06-09 01:21:18] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 01:21:18] [INFO ] Computed 10 place invariants in 29 ms
[2022-06-09 01:21:18] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-06-09 01:21:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:18] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2022-06-09 01:21:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:21:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:19] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2022-06-09 01:21:19] [INFO ] State equation strengthened by 316 read => feed constraints.
[2022-06-09 01:21:19] [INFO ] [Nat]Added 316 Read/Feed constraints in 214 ms returned sat
[2022-06-09 01:21:20] [INFO ] Deduced a trap composed of 25 places in 560 ms of which 8 ms to minimize.
[2022-06-09 01:21:20] [INFO ] Deduced a trap composed of 42 places in 464 ms of which 2 ms to minimize.
[2022-06-09 01:21:21] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 0 ms to minimize.
[2022-06-09 01:21:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1648 ms
[2022-06-09 01:21:21] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 459 ms.
[2022-06-09 01:21:23] [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.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 01:21:24] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:24] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2022-06-09 01:21:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:21:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:25] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2022-06-09 01:21:25] [INFO ] [Nat]Added 316 Read/Feed constraints in 194 ms returned sat
[2022-06-09 01:21:25] [INFO ] Deduced a trap composed of 65 places in 354 ms of which 2 ms to minimize.
[2022-06-09 01:21:26] [INFO ] Deduced a trap composed of 85 places in 362 ms of which 1 ms to minimize.
[2022-06-09 01:21:26] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 0 ms to minimize.
[2022-06-09 01:21:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1298 ms
[2022-06-09 01:21:26] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 433 ms.
[2022-06-09 01:21:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 01:21:29] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 01:21:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:30] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2022-06-09 01:21:30] [INFO ] [Real]Added 316 Read/Feed constraints in 202 ms returned sat
[2022-06-09 01:21:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:21:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:31] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2022-06-09 01:21:31] [INFO ] [Nat]Added 316 Read/Feed constraints in 194 ms returned sat
[2022-06-09 01:21:31] [INFO ] Deduced a trap composed of 15 places in 435 ms of which 1 ms to minimize.
[2022-06-09 01:21:32] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 1 ms to minimize.
[2022-06-09 01:21:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 951 ms
[2022-06-09 01:21:32] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 203 ms.
[2022-06-09 01:21:36] [INFO ] Deduced a trap composed of 15 places in 516 ms of which 0 ms to minimize.
[2022-06-09 01:21: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 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)
[2022-06-09 01:21:36] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:36] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2022-06-09 01:21:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:37] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2022-06-09 01:21:37] [INFO ] [Nat]Added 316 Read/Feed constraints in 185 ms returned sat
[2022-06-09 01:21:37] [INFO ] Deduced a trap composed of 57 places in 495 ms of which 0 ms to minimize.
[2022-06-09 01:21:38] [INFO ] Deduced a trap composed of 73 places in 468 ms of which 0 ms to minimize.
[2022-06-09 01:21:39] [INFO ] Deduced a trap composed of 102 places in 448 ms of which 1 ms to minimize.
[2022-06-09 01:21:39] [INFO ] Deduced a trap composed of 12 places in 381 ms of which 0 ms to minimize.
[2022-06-09 01:21:40] [INFO ] Deduced a trap composed of 25 places in 479 ms of which 2 ms to minimize.
[2022-06-09 01:21:40] [INFO ] Deduced a trap composed of 103 places in 452 ms of which 0 ms to minimize.
[2022-06-09 01:21:41] [INFO ] Deduced a trap composed of 12 places in 358 ms of which 2 ms to minimize.
[2022-06-09 01:21:41] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2022-06-09 01:21:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3954 ms
[2022-06-09 01:21:41] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 276 ms.
[2022-06-09 01:21:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 01:21:41] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 01:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:42] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2022-06-09 01:21:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:21:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:42] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2022-06-09 01:21:42] [INFO ] [Nat]Added 316 Read/Feed constraints in 198 ms returned sat
[2022-06-09 01:21:43] [INFO ] Deduced a trap composed of 33 places in 349 ms of which 2 ms to minimize.
[2022-06-09 01:21:43] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 1 ms to minimize.
[2022-06-09 01:21:43] [INFO ] Deduced a trap composed of 60 places in 235 ms of which 1 ms to minimize.
[2022-06-09 01:21:44] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 0 ms to minimize.
[2022-06-09 01:21:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1479 ms
[2022-06-09 01:21:44] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 202 ms.
[2022-06-09 01:21:47] [INFO ] Added : 95 causal constraints over 19 iterations in 2870 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, -1, -1, 1, 1] Max seen :[0, 0, 63, 0, 0]
Incomplete Parikh walk after 1550800 steps, including 1003 resets, run finished after 6608 ms. (steps per millisecond=234 ) properties (out of 5) seen :20 could not realise parikh vector
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 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 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 364 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:21:54] [INFO ] Computed 8 place invariants in 19 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 2330 ms. (steps per millisecond=429 ) properties (out of 5) seen :5605
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1989 ms. (steps per millisecond=502 ) properties (out of 5) seen :4281
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1866 ms. (steps per millisecond=535 ) properties (out of 5) seen :4403
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1560 ms. (steps per millisecond=641 ) properties (out of 5) seen :16241
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1793 ms. (steps per millisecond=557 ) properties (out of 5) seen :4358
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1805 ms. (steps per millisecond=554 ) properties (out of 5) seen :4399
[2022-06-09 01:22:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:05] [INFO ] Computed 8 place invariants in 22 ms
[2022-06-09 01:22:05] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:06] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2022-06-09 01:22:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:22:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:22:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:06] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2022-06-09 01:22:06] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:22:06] [INFO ] [Nat]Added 296 Read/Feed constraints in 196 ms returned sat
[2022-06-09 01:22:07] [INFO ] Deduced a trap composed of 5 places in 438 ms of which 0 ms to minimize.
[2022-06-09 01:22:07] [INFO ] Deduced a trap composed of 14 places in 403 ms of which 0 ms to minimize.
[2022-06-09 01:22:08] [INFO ] Deduced a trap composed of 9 places in 356 ms of which 0 ms to minimize.
[2022-06-09 01:22:08] [INFO ] Deduced a trap composed of 81 places in 296 ms of which 1 ms to minimize.
[2022-06-09 01:22:09] [INFO ] Deduced a trap composed of 43 places in 292 ms of which 1 ms to minimize.
[2022-06-09 01:22:09] [INFO ] Deduced a trap composed of 74 places in 275 ms of which 0 ms to minimize.
[2022-06-09 01:22:09] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 1 ms to minimize.
[2022-06-09 01:22:10] [INFO ] Deduced a trap composed of 73 places in 287 ms of which 0 ms to minimize.
[2022-06-09 01:22:10] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 0 ms to minimize.
[2022-06-09 01:22:10] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 1 ms to minimize.
[2022-06-09 01:22:11] [INFO ] Deduced a trap composed of 81 places in 286 ms of which 1 ms to minimize.
[2022-06-09 01:22:11] [INFO ] Deduced a trap composed of 81 places in 271 ms of which 1 ms to minimize.
[2022-06-09 01:22:12] [INFO ] Deduced a trap composed of 81 places in 290 ms of which 1 ms to minimize.
[2022-06-09 01:22:12] [INFO ] Deduced a trap composed of 81 places in 282 ms of which 4 ms to minimize.
[2022-06-09 01:22:12] [INFO ] Deduced a trap composed of 84 places in 278 ms of which 0 ms to minimize.
[2022-06-09 01:22:13] [INFO ] Deduced a trap composed of 71 places in 273 ms of which 0 ms to minimize.
[2022-06-09 01:22:13] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6335 ms
[2022-06-09 01:22:13] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 200 ms.
[2022-06-09 01:22:17] [INFO ] Deduced a trap composed of 84 places in 274 ms of which 1 ms to minimize.
[2022-06-09 01:22:17] [INFO ] Deduced a trap composed of 83 places in 274 ms of which 0 ms to minimize.
[2022-06-09 01:22:17] [INFO ] Deduced a trap composed of 84 places in 275 ms of which 1 ms to minimize.
[2022-06-09 01:22:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1292 ms
[2022-06-09 01:22:18] [INFO ] Added : 108 causal constraints over 22 iterations in 4991 ms. Result :sat
[2022-06-09 01:22:18] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2022-06-09 01:22:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:18] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2022-06-09 01:22:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:22:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:19] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2022-06-09 01:22:19] [INFO ] [Nat]Added 296 Read/Feed constraints in 194 ms returned sat
[2022-06-09 01:22:19] [INFO ] Deduced a trap composed of 64 places in 309 ms of which 1 ms to minimize.
[2022-06-09 01:22:20] [INFO ] Deduced a trap composed of 97 places in 303 ms of which 0 ms to minimize.
[2022-06-09 01:22:20] [INFO ] Deduced a trap composed of 89 places in 318 ms of which 1 ms to minimize.
[2022-06-09 01:22:21] [INFO ] Deduced a trap composed of 90 places in 326 ms of which 2 ms to minimize.
[2022-06-09 01:22:21] [INFO ] Deduced a trap composed of 74 places in 316 ms of which 1 ms to minimize.
[2022-06-09 01:22:21] [INFO ] Deduced a trap composed of 89 places in 343 ms of which 0 ms to minimize.
[2022-06-09 01:22:22] [INFO ] Deduced a trap composed of 89 places in 338 ms of which 1 ms to minimize.
[2022-06-09 01:22:22] [INFO ] Deduced a trap composed of 90 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:22:23] [INFO ] Deduced a trap composed of 48 places in 330 ms of which 0 ms to minimize.
[2022-06-09 01:22:23] [INFO ] Deduced a trap composed of 16 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:22:24] [INFO ] Deduced a trap composed of 58 places in 326 ms of which 1 ms to minimize.
[2022-06-09 01:22:24] [INFO ] Deduced a trap composed of 58 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:22:24] [INFO ] Deduced a trap composed of 59 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:22:25] [INFO ] Deduced a trap composed of 59 places in 328 ms of which 3 ms to minimize.
[2022-06-09 01:22:25] [INFO ] Deduced a trap composed of 14 places in 317 ms of which 1 ms to minimize.
[2022-06-09 01:22:26] [INFO ] Deduced a trap composed of 64 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:22:26] [INFO ] Deduced a trap composed of 87 places in 330 ms of which 3 ms to minimize.
[2022-06-09 01:22:26] [INFO ] Deduced a trap composed of 58 places in 325 ms of which 1 ms to minimize.
[2022-06-09 01:22:27] [INFO ] Deduced a trap composed of 59 places in 314 ms of which 0 ms to minimize.
[2022-06-09 01:22:27] [INFO ] Deduced a trap composed of 87 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:22:28] [INFO ] Deduced a trap composed of 86 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:22:28] [INFO ] Deduced a trap composed of 59 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:22:29] [INFO ] Deduced a trap composed of 66 places in 317 ms of which 1 ms to minimize.
[2022-06-09 01:22:29] [INFO ] Deduced a trap composed of 67 places in 313 ms of which 0 ms to minimize.
[2022-06-09 01:22:29] [INFO ] Deduced a trap composed of 64 places in 350 ms of which 2 ms to minimize.
[2022-06-09 01:22:30] [INFO ] Deduced a trap composed of 67 places in 314 ms of which 0 ms to minimize.
[2022-06-09 01:22:30] [INFO ] Deduced a trap composed of 64 places in 313 ms of which 4 ms to minimize.
[2022-06-09 01:22:31] [INFO ] Deduced a trap composed of 64 places in 320 ms of which 13 ms to minimize.
[2022-06-09 01:22:31] [INFO ] Deduced a trap composed of 80 places in 313 ms of which 3 ms to minimize.
[2022-06-09 01:22:31] [INFO ] Deduced a trap composed of 79 places in 317 ms of which 0 ms to minimize.
[2022-06-09 01:22:32] [INFO ] Deduced a trap composed of 10 places in 318 ms of which 0 ms to minimize.
[2022-06-09 01:22:32] [INFO ] Deduced a trap composed of 94 places in 320 ms of which 1 ms to minimize.
[2022-06-09 01:22:33] [INFO ] Deduced a trap composed of 96 places in 314 ms of which 0 ms to minimize.
[2022-06-09 01:22:33] [INFO ] Deduced a trap composed of 95 places in 312 ms of which 1 ms to minimize.
[2022-06-09 01:22:33] [INFO ] Deduced a trap composed of 93 places in 319 ms of which 0 ms to minimize.
[2022-06-09 01:22:34] [INFO ] Deduced a trap composed of 88 places in 308 ms of which 0 ms to minimize.
[2022-06-09 01:22:34] [INFO ] Deduced a trap composed of 88 places in 318 ms of which 12 ms to minimize.
[2022-06-09 01:22:35] [INFO ] Deduced a trap composed of 93 places in 313 ms of which 0 ms to minimize.
[2022-06-09 01:22:35] [INFO ] Deduced a trap composed of 95 places in 309 ms of which 0 ms to minimize.
[2022-06-09 01:22:35] [INFO ] Deduced a trap composed of 89 places in 305 ms of which 0 ms to minimize.
[2022-06-09 01:22:36] [INFO ] Deduced a trap composed of 91 places in 305 ms of which 1 ms to minimize.
[2022-06-09 01:22:36] [INFO ] Deduced a trap composed of 89 places in 305 ms of which 0 ms to minimize.
[2022-06-09 01:22:37] [INFO ] Deduced a trap composed of 90 places in 309 ms of which 1 ms to minimize.
[2022-06-09 01:22:37] [INFO ] Deduced a trap composed of 89 places in 297 ms of which 0 ms to minimize.
[2022-06-09 01:22:37] [INFO ] Deduced a trap composed of 91 places in 303 ms of which 0 ms to minimize.
[2022-06-09 01:22:38] [INFO ] Deduced a trap composed of 89 places in 307 ms of which 1 ms to minimize.
[2022-06-09 01:22:38] [INFO ] Deduced a trap composed of 90 places in 307 ms of which 1 ms to minimize.
[2022-06-09 01:22:39] [INFO ] Deduced a trap composed of 95 places in 311 ms of which 0 ms to minimize.
[2022-06-09 01:22:39] [INFO ] Deduced a trap composed of 95 places in 298 ms of which 0 ms to minimize.
[2022-06-09 01:22:39] [INFO ] Deduced a trap composed of 91 places in 304 ms of which 0 ms to minimize.
[2022-06-09 01:22:40] [INFO ] Deduced a trap composed of 95 places in 298 ms of which 0 ms to minimize.
[2022-06-09 01:22:40] [INFO ] Deduced a trap composed of 95 places in 304 ms of which 1 ms to minimize.
[2022-06-09 01:22:41] [INFO ] Deduced a trap composed of 95 places in 306 ms of which 1 ms to minimize.
[2022-06-09 01:22:41] [INFO ] Deduced a trap composed of 95 places in 303 ms of which 1 ms to minimize.
[2022-06-09 01:22:41] [INFO ] Deduced a trap composed of 90 places in 311 ms of which 0 ms to minimize.
[2022-06-09 01:22:42] [INFO ] Deduced a trap composed of 75 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:22:42] [INFO ] Deduced a trap composed of 46 places in 302 ms of which 0 ms to minimize.
[2022-06-09 01:22:43] [INFO ] Deduced a trap composed of 45 places in 307 ms of which 0 ms to minimize.
[2022-06-09 01:22:43] [INFO ] Deduced a trap composed of 76 places in 314 ms of which 0 ms to minimize.
[2022-06-09 01:22:43] [INFO ] Deduced a trap composed of 76 places in 296 ms of which 1 ms to minimize.
[2022-06-09 01:22:44] [INFO ] Deduced a trap composed of 77 places in 316 ms of which 0 ms to minimize.
[2022-06-09 01:22:44] [INFO ] Deduced a trap composed of 77 places in 309 ms of which 1 ms to minimize.
[2022-06-09 01:22:45] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 0 ms to minimize.
[2022-06-09 01:22:45] [INFO ] Deduced a trap composed of 92 places in 310 ms of which 0 ms to minimize.
[2022-06-09 01:22:45] [INFO ] Deduced a trap composed of 91 places in 302 ms of which 0 ms to minimize.
[2022-06-09 01:22:46] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 1 ms to minimize.
[2022-06-09 01:22:46] [INFO ] Deduced a trap composed of 66 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:22:47] [INFO ] Deduced a trap composed of 64 places in 311 ms of which 0 ms to minimize.
[2022-06-09 01:22:47] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 27578 ms
[2022-06-09 01:22:47] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 200 ms.
[2022-06-09 01:22:50] [INFO ] Added : 108 causal constraints over 22 iterations in 3698 ms. Result :sat
[2022-06-09 01:22:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:51] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2022-06-09 01:22:51] [INFO ] [Real]Added 296 Read/Feed constraints in 178 ms returned sat
[2022-06-09 01:22:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:22:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:22:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:52] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2022-06-09 01:22:52] [INFO ] [Nat]Added 296 Read/Feed constraints in 188 ms returned sat
[2022-06-09 01:22:52] [INFO ] Deduced a trap composed of 89 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:22:53] [INFO ] Deduced a trap composed of 70 places in 337 ms of which 1 ms to minimize.
[2022-06-09 01:22:53] [INFO ] Deduced a trap composed of 5 places in 350 ms of which 1 ms to minimize.
[2022-06-09 01:22:54] [INFO ] Deduced a trap composed of 83 places in 325 ms of which 1 ms to minimize.
[2022-06-09 01:22:54] [INFO ] Deduced a trap composed of 33 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:22:54] [INFO ] Deduced a trap composed of 32 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:22:55] [INFO ] Deduced a trap composed of 17 places in 333 ms of which 0 ms to minimize.
[2022-06-09 01:22:55] [INFO ] Deduced a trap composed of 96 places in 331 ms of which 0 ms to minimize.
[2022-06-09 01:22:56] [INFO ] Deduced a trap composed of 16 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:22:56] [INFO ] Deduced a trap composed of 91 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:22:57] [INFO ] Deduced a trap composed of 88 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:22:57] [INFO ] Deduced a trap composed of 87 places in 323 ms of which 1 ms to minimize.
[2022-06-09 01:22:57] [INFO ] Deduced a trap composed of 93 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:22:58] [INFO ] Deduced a trap composed of 83 places in 323 ms of which 1 ms to minimize.
[2022-06-09 01:22:58] [INFO ] Deduced a trap composed of 83 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:22:59] [INFO ] Deduced a trap composed of 84 places in 328 ms of which 1 ms to minimize.
[2022-06-09 01:22:59] [INFO ] Deduced a trap composed of 90 places in 314 ms of which 1 ms to minimize.
[2022-06-09 01:22:59] [INFO ] Deduced a trap composed of 96 places in 340 ms of which 1 ms to minimize.
[2022-06-09 01:23:00] [INFO ] Deduced a trap composed of 87 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:23:00] [INFO ] Deduced a trap composed of 80 places in 319 ms of which 1 ms to minimize.
[2022-06-09 01:23:01] [INFO ] Deduced a trap composed of 93 places in 336 ms of which 0 ms to minimize.
[2022-06-09 01:23:01] [INFO ] Deduced a trap composed of 93 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:23:02] [INFO ] Deduced a trap composed of 90 places in 331 ms of which 0 ms to minimize.
[2022-06-09 01:23:02] [INFO ] Deduced a trap composed of 84 places in 325 ms of which 1 ms to minimize.
[2022-06-09 01:23:02] [INFO ] Deduced a trap composed of 90 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:23:03] [INFO ] Deduced a trap composed of 93 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:23:03] [INFO ] Deduced a trap composed of 90 places in 324 ms of which 1 ms to minimize.
[2022-06-09 01:23:04] [INFO ] Deduced a trap composed of 88 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:23:04] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 11735 ms
[2022-06-09 01:23:04] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 199 ms.
[2022-06-09 01:23:06] [INFO ] Deduced a trap composed of 58 places in 343 ms of which 1 ms to minimize.
[2022-06-09 01:23:06] [INFO ] Deduced a trap composed of 59 places in 329 ms of which 1 ms to minimize.
[2022-06-09 01:23:07] [INFO ] Deduced a trap composed of 89 places in 326 ms of which 1 ms to minimize.
[2022-06-09 01:23:07] [INFO ] Deduced a trap composed of 65 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:23:08] [INFO ] Deduced a trap composed of 63 places in 343 ms of which 0 ms to minimize.
[2022-06-09 01:23:08] [INFO ] Deduced a trap composed of 63 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:23:09] [INFO ] Deduced a trap composed of 63 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:23:09] [INFO ] Deduced a trap composed of 97 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:23:10] [INFO ] Deduced a trap composed of 68 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:23:10] [INFO ] Deduced a trap composed of 64 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:23:11] [INFO ] Deduced a trap composed of 58 places in 338 ms of which 1 ms to minimize.
[2022-06-09 01:23:11] [INFO ] Deduced a trap composed of 52 places in 340 ms of which 0 ms to minimize.
[2022-06-09 01:23:11] [INFO ] Deduced a trap composed of 86 places in 329 ms of which 1 ms to minimize.
[2022-06-09 01:23:12] [INFO ] Deduced a trap composed of 89 places in 330 ms of which 0 ms to minimize.
[2022-06-09 01:23:12] [INFO ] Deduced a trap composed of 89 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:23:13] [INFO ] Deduced a trap composed of 48 places in 334 ms of which 3 ms to minimize.
[2022-06-09 01:23:13] [INFO ] Deduced a trap composed of 50 places in 365 ms of which 1 ms to minimize.
[2022-06-09 01:23:14] [INFO ] Deduced a trap composed of 43 places in 333 ms of which 0 ms to minimize.
[2022-06-09 01:23:14] [INFO ] Deduced a trap composed of 55 places in 334 ms of which 1 ms to minimize.
[2022-06-09 01:23:15] [INFO ] Deduced a trap composed of 44 places in 336 ms of which 1 ms to minimize.
[2022-06-09 01:23:15] [INFO ] Deduced a trap composed of 58 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:23:16] [INFO ] Deduced a trap composed of 36 places in 334 ms of which 0 ms to minimize.
[2022-06-09 01:23:16] [INFO ] Deduced a trap composed of 26 places in 319 ms of which 0 ms to minimize.
[2022-06-09 01:23:17] [INFO ] Deduced a trap composed of 56 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:23:17] [INFO ] Deduced a trap composed of 7 places in 352 ms of which 0 ms to minimize.
[2022-06-09 01:23:18] [INFO ] Deduced a trap composed of 68 places in 319 ms of which 0 ms to minimize.
[2022-06-09 01:23:18] [INFO ] Deduced a trap composed of 19 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:23:18] [INFO ] Deduced a trap composed of 99 places in 338 ms of which 1 ms to minimize.
[2022-06-09 01:23:19] [INFO ] Deduced a trap composed of 57 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:23:19] [INFO ] Deduced a trap composed of 58 places in 312 ms of which 0 ms to minimize.
[2022-06-09 01:23:20] [INFO ] Deduced a trap composed of 50 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:23:20] [INFO ] Deduced a trap composed of 14 places in 323 ms of which 1 ms to minimize.
[2022-06-09 01:23:21] [INFO ] Deduced a trap composed of 71 places in 357 ms of which 3 ms to minimize.
[2022-06-09 01:23:21] [INFO ] Deduced a trap composed of 70 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:23:22] [INFO ] Deduced a trap composed of 60 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:23:22] [INFO ] Deduced a trap composed of 42 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:23:23] [INFO ] Deduced a trap composed of 61 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:23:23] [INFO ] Deduced a trap composed of 104 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:23:23] [INFO ] Deduced a trap composed of 97 places in 314 ms of which 0 ms to minimize.
[2022-06-09 01:23:24] [INFO ] Deduced a trap composed of 46 places in 311 ms of which 0 ms to minimize.
[2022-06-09 01:23:24] [INFO ] Deduced a trap composed of 94 places in 311 ms of which 1 ms to minimize.
[2022-06-09 01:23:25] [INFO ] Deduced a trap composed of 58 places in 313 ms of which 0 ms to minimize.
[2022-06-09 01:23:25] [INFO ] Deduced a trap composed of 60 places in 309 ms of which 0 ms to minimize.
[2022-06-09 01:23:26] [INFO ] Deduced a trap composed of 88 places in 306 ms of which 1 ms to minimize.
[2022-06-09 01:23:26] [INFO ] Deduced a trap composed of 93 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:23:27] [INFO ] Deduced a trap composed of 78 places in 333 ms of which 0 ms to minimize.
[2022-06-09 01:23:27] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 21076 ms
[2022-06-09 01:23:27] [INFO ] Added : 51 causal constraints over 11 iterations in 23184 ms. Result :sat
[2022-06-09 01:23:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:27] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2022-06-09 01:23:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:23:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:23:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:28] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2022-06-09 01:23:28] [INFO ] [Nat]Added 296 Read/Feed constraints in 193 ms returned sat
[2022-06-09 01:23:29] [INFO ] Deduced a trap composed of 99 places in 439 ms of which 1 ms to minimize.
[2022-06-09 01:23:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 598 ms
[2022-06-09 01:23:29] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 200 ms.
[2022-06-09 01:23:34] [INFO ] Deduced a trap composed of 18 places in 430 ms of which 1 ms to minimize.
[2022-06-09 01:23:34] [INFO ] Deduced a trap composed of 17 places in 323 ms of which 1 ms to minimize.
[2022-06-09 01:23:35] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 0 ms to minimize.
[2022-06-09 01:23:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1429 ms
[2022-06-09 01:23:35] [INFO ] Added : 155 causal constraints over 32 iterations in 6443 ms. Result :sat
[2022-06-09 01:23:35] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:36] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2022-06-09 01:23:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:23:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:23:36] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2022-06-09 01:23:37] [INFO ] [Nat]Added 296 Read/Feed constraints in 201 ms returned sat
[2022-06-09 01:23:37] [INFO ] Deduced a trap composed of 104 places in 353 ms of which 1 ms to minimize.
[2022-06-09 01:23:37] [INFO ] Deduced a trap composed of 98 places in 347 ms of which 0 ms to minimize.
[2022-06-09 01:23:38] [INFO ] Deduced a trap composed of 76 places in 344 ms of which 0 ms to minimize.
[2022-06-09 01:23:38] [INFO ] Deduced a trap composed of 5 places in 342 ms of which 1 ms to minimize.
[2022-06-09 01:23:39] [INFO ] Deduced a trap composed of 89 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:23:39] [INFO ] Deduced a trap composed of 34 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:23:39] [INFO ] Deduced a trap composed of 32 places in 311 ms of which 0 ms to minimize.
[2022-06-09 01:23:40] [INFO ] Deduced a trap composed of 95 places in 310 ms of which 0 ms to minimize.
[2022-06-09 01:23:40] [INFO ] Deduced a trap composed of 94 places in 315 ms of which 0 ms to minimize.
[2022-06-09 01:23:41] [INFO ] Deduced a trap composed of 80 places in 323 ms of which 1 ms to minimize.
[2022-06-09 01:23:41] [INFO ] Deduced a trap composed of 79 places in 319 ms of which 0 ms to minimize.
[2022-06-09 01:23:42] [INFO ] Deduced a trap composed of 34 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:23:42] [INFO ] Deduced a trap composed of 79 places in 317 ms of which 0 ms to minimize.
[2022-06-09 01:23:42] [INFO ] Deduced a trap composed of 37 places in 326 ms of which 1 ms to minimize.
[2022-06-09 01:23:43] [INFO ] Deduced a trap composed of 93 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:23:43] [INFO ] Deduced a trap composed of 26 places in 357 ms of which 0 ms to minimize.
[2022-06-09 01:23:44] [INFO ] Deduced a trap composed of 32 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:23:44] [INFO ] Deduced a trap composed of 36 places in 307 ms of which 0 ms to minimize.
[2022-06-09 01:23:44] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 0 ms to minimize.
[2022-06-09 01:23:44] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 7812 ms
[2022-06-09 01:23:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 197 ms.
[2022-06-09 01:23:49] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 0 ms to minimize.
[2022-06-09 01:23:50] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 0 ms to minimize.
[2022-06-09 01:23:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 750 ms
[2022-06-09 01:23:50] [INFO ] Added : 152 causal constraints over 31 iterations in 5629 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, -1, -1, 1, 1] Max seen :[0, 0, 16241, 0, 0]
Incomplete Parikh walk after 1331000 steps, including 1000 resets, run finished after 10548 ms. (steps per millisecond=126 ) properties (out of 5) seen :72526 could not realise parikh vector
Incomplete Parikh walk after 1313800 steps, including 1000 resets, run finished after 10351 ms. (steps per millisecond=126 ) properties (out of 5) seen :74837 could not realise parikh vector
Interrupted Parikh walk after 3907062 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=130 ) properties (out of 5) seen :234422
Incomplete Parikh walk after 1189800 steps, including 1000 resets, run finished after 9366 ms. (steps per millisecond=127 ) properties (out of 5) seen :51 could not realise parikh vector
Incomplete Parikh walk after 1214400 steps, including 1000 resets, run finished after 9540 ms. (steps per millisecond=127 ) properties (out of 5) seen :67973 could not realise parikh vector
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 62 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 83 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:25:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:25:00] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 01:25:01] [INFO ] Implicit Places using invariants in 665 ms returned []
[2022-06-09 01:25:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:25:01] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 01:25:01] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:25:07] [INFO ] Implicit Places using invariants and state equation in 6638 ms returned []
Implicit Place search using SMT with State Equation took 7306 ms to find 0 implicit places.
[2022-06-09 01:25:08] [INFO ] Redundant transitions in 304 ms returned []
[2022-06-09 01:25:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:25:08] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 01:25:09] [INFO ] Dead Transitions using invariants and state equation in 983 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:25:09] [INFO ] Computed 8 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2346 ms. (steps per millisecond=426 ) properties (out of 5) seen :5655
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1817 ms. (steps per millisecond=550 ) properties (out of 5) seen :4616
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1836 ms. (steps per millisecond=544 ) properties (out of 5) seen :4644
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1538 ms. (steps per millisecond=650 ) properties (out of 5) seen :16217
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1834 ms. (steps per millisecond=545 ) properties (out of 5) seen :4599
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1817 ms. (steps per millisecond=550 ) properties (out of 5) seen :4388
[2022-06-09 01:25:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:25:20] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 01:25:20] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:25:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:20] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2022-06-09 01:25:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:25:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:25:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:21] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2022-06-09 01:25:21] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:25:21] [INFO ] [Nat]Added 296 Read/Feed constraints in 198 ms returned sat
[2022-06-09 01:25:22] [INFO ] Deduced a trap composed of 5 places in 420 ms of which 0 ms to minimize.
[2022-06-09 01:25:22] [INFO ] Deduced a trap composed of 14 places in 398 ms of which 1 ms to minimize.
[2022-06-09 01:25:23] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 0 ms to minimize.
[2022-06-09 01:25:23] [INFO ] Deduced a trap composed of 81 places in 263 ms of which 1 ms to minimize.
[2022-06-09 01:25:23] [INFO ] Deduced a trap composed of 43 places in 276 ms of which 0 ms to minimize.
[2022-06-09 01:25:24] [INFO ] Deduced a trap composed of 74 places in 279 ms of which 1 ms to minimize.
[2022-06-09 01:25:24] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 0 ms to minimize.
[2022-06-09 01:25:24] [INFO ] Deduced a trap composed of 73 places in 271 ms of which 1 ms to minimize.
[2022-06-09 01:25:25] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 1 ms to minimize.
[2022-06-09 01:25:25] [INFO ] Deduced a trap composed of 10 places in 274 ms of which 1 ms to minimize.
[2022-06-09 01:25:25] [INFO ] Deduced a trap composed of 81 places in 269 ms of which 0 ms to minimize.
[2022-06-09 01:25:26] [INFO ] Deduced a trap composed of 81 places in 275 ms of which 0 ms to minimize.
[2022-06-09 01:25:26] [INFO ] Deduced a trap composed of 81 places in 270 ms of which 0 ms to minimize.
[2022-06-09 01:25:27] [INFO ] Deduced a trap composed of 81 places in 268 ms of which 1 ms to minimize.
[2022-06-09 01:25:27] [INFO ] Deduced a trap composed of 84 places in 260 ms of which 1 ms to minimize.
[2022-06-09 01:25:27] [INFO ] Deduced a trap composed of 71 places in 278 ms of which 1 ms to minimize.
[2022-06-09 01:25:27] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6197 ms
[2022-06-09 01:25:28] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 225 ms.
[2022-06-09 01:25:31] [INFO ] Deduced a trap composed of 84 places in 276 ms of which 0 ms to minimize.
[2022-06-09 01:25:32] [INFO ] Deduced a trap composed of 83 places in 271 ms of which 0 ms to minimize.
[2022-06-09 01:25:32] [INFO ] Deduced a trap composed of 84 places in 268 ms of which 0 ms to minimize.
[2022-06-09 01:25:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1282 ms
[2022-06-09 01:25:32] [INFO ] Added : 108 causal constraints over 22 iterations in 5012 ms. Result :sat
[2022-06-09 01:25:32] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:33] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2022-06-09 01:25:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:25:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:25:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:25:33] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2022-06-09 01:25:34] [INFO ] [Nat]Added 296 Read/Feed constraints in 243 ms returned sat
[2022-06-09 01:25:34] [INFO ] Deduced a trap composed of 64 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:25:35] [INFO ] Deduced a trap composed of 97 places in 313 ms of which 1 ms to minimize.
[2022-06-09 01:25:35] [INFO ] Deduced a trap composed of 89 places in 314 ms of which 0 ms to minimize.
[2022-06-09 01:25:35] [INFO ] Deduced a trap composed of 90 places in 338 ms of which 1 ms to minimize.
[2022-06-09 01:25:36] [INFO ] Deduced a trap composed of 74 places in 334 ms of which 0 ms to minimize.
[2022-06-09 01:25:36] [INFO ] Deduced a trap composed of 89 places in 314 ms of which 3 ms to minimize.
[2022-06-09 01:25:37] [INFO ] Deduced a trap composed of 89 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:25:37] [INFO ] Deduced a trap composed of 90 places in 330 ms of which 0 ms to minimize.
[2022-06-09 01:25:37] [INFO ] Deduced a trap composed of 48 places in 334 ms of which 1 ms to minimize.
[2022-06-09 01:25:38] [INFO ] Deduced a trap composed of 16 places in 318 ms of which 1 ms to minimize.
[2022-06-09 01:25:38] [INFO ] Deduced a trap composed of 58 places in 314 ms of which 0 ms to minimize.
[2022-06-09 01:25:39] [INFO ] Deduced a trap composed of 58 places in 313 ms of which 1 ms to minimize.
[2022-06-09 01:25:39] [INFO ] Deduced a trap composed of 59 places in 312 ms of which 0 ms to minimize.
[2022-06-09 01:25:39] [INFO ] Deduced a trap composed of 59 places in 318 ms of which 1 ms to minimize.
[2022-06-09 01:25:40] [INFO ] Deduced a trap composed of 14 places in 310 ms of which 0 ms to minimize.
[2022-06-09 01:25:40] [INFO ] Deduced a trap composed of 64 places in 325 ms of which 1 ms to minimize.
[2022-06-09 01:25:41] [INFO ] Deduced a trap composed of 87 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:25:41] [INFO ] Deduced a trap composed of 58 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:25:42] [INFO ] Deduced a trap composed of 59 places in 319 ms of which 0 ms to minimize.
[2022-06-09 01:25:42] [INFO ] Deduced a trap composed of 87 places in 316 ms of which 1 ms to minimize.
[2022-06-09 01:25:42] [INFO ] Deduced a trap composed of 86 places in 314 ms of which 1 ms to minimize.
[2022-06-09 01:25:43] [INFO ] Deduced a trap composed of 59 places in 318 ms of which 1 ms to minimize.
[2022-06-09 01:25:43] [INFO ] Deduced a trap composed of 66 places in 310 ms of which 1 ms to minimize.
[2022-06-09 01:25:44] [INFO ] Deduced a trap composed of 67 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:25:44] [INFO ] Deduced a trap composed of 64 places in 312 ms of which 0 ms to minimize.
[2022-06-09 01:25:44] [INFO ] Deduced a trap composed of 67 places in 318 ms of which 0 ms to minimize.
[2022-06-09 01:25:45] [INFO ] Deduced a trap composed of 64 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:25:45] [INFO ] Deduced a trap composed of 64 places in 318 ms of which 0 ms to minimize.
[2022-06-09 01:25:46] [INFO ] Deduced a trap composed of 80 places in 326 ms of which 1 ms to minimize.
[2022-06-09 01:25:46] [INFO ] Deduced a trap composed of 79 places in 330 ms of which 3 ms to minimize.
[2022-06-09 01:25:46] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 1 ms to minimize.
[2022-06-09 01:25:47] [INFO ] Deduced a trap composed of 94 places in 314 ms of which 0 ms to minimize.
[2022-06-09 01:25:47] [INFO ] Deduced a trap composed of 96 places in 322 ms of which 0 ms to minimize.
[2022-06-09 01:25:48] [INFO ] Deduced a trap composed of 95 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:25:48] [INFO ] Deduced a trap composed of 93 places in 302 ms of which 1 ms to minimize.
[2022-06-09 01:25:48] [INFO ] Deduced a trap composed of 88 places in 311 ms of which 0 ms to minimize.
[2022-06-09 01:25:49] [INFO ] Deduced a trap composed of 88 places in 317 ms of which 0 ms to minimize.
[2022-06-09 01:25:49] [INFO ] Deduced a trap composed of 93 places in 323 ms of which 1 ms to minimize.
[2022-06-09 01:25:50] [INFO ] Deduced a trap composed of 95 places in 316 ms of which 0 ms to minimize.
[2022-06-09 01:25:50] [INFO ] Deduced a trap composed of 89 places in 316 ms of which 1 ms to minimize.
[2022-06-09 01:25:51] [INFO ] Deduced a trap composed of 91 places in 308 ms of which 0 ms to minimize.
[2022-06-09 01:25:51] [INFO ] Deduced a trap composed of 89 places in 310 ms of which 0 ms to minimize.
[2022-06-09 01:25:51] [INFO ] Deduced a trap composed of 90 places in 311 ms of which 1 ms to minimize.
[2022-06-09 01:25:52] [INFO ] Deduced a trap composed of 89 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:25:52] [INFO ] Deduced a trap composed of 91 places in 311 ms of which 0 ms to minimize.
[2022-06-09 01:25:53] [INFO ] Deduced a trap composed of 89 places in 301 ms of which 0 ms to minimize.
[2022-06-09 01:25:53] [INFO ] Deduced a trap composed of 90 places in 306 ms of which 0 ms to minimize.
[2022-06-09 01:25:53] [INFO ] Deduced a trap composed of 95 places in 315 ms of which 0 ms to minimize.
[2022-06-09 01:25:54] [INFO ] Deduced a trap composed of 95 places in 318 ms of which 0 ms to minimize.
[2022-06-09 01:25:54] [INFO ] Deduced a trap composed of 91 places in 308 ms of which 1 ms to minimize.
[2022-06-09 01:25:55] [INFO ] Deduced a trap composed of 95 places in 312 ms of which 0 ms to minimize.
[2022-06-09 01:25:55] [INFO ] Deduced a trap composed of 95 places in 304 ms of which 0 ms to minimize.
[2022-06-09 01:25:55] [INFO ] Deduced a trap composed of 95 places in 316 ms of which 0 ms to minimize.
[2022-06-09 01:25:56] [INFO ] Deduced a trap composed of 95 places in 313 ms of which 0 ms to minimize.
[2022-06-09 01:25:56] [INFO ] Deduced a trap composed of 90 places in 320 ms of which 1 ms to minimize.
[2022-06-09 01:25:57] [INFO ] Deduced a trap composed of 75 places in 308 ms of which 0 ms to minimize.
[2022-06-09 01:25:57] [INFO ] Deduced a trap composed of 46 places in 308 ms of which 1 ms to minimize.
[2022-06-09 01:25:57] [INFO ] Deduced a trap composed of 45 places in 312 ms of which 0 ms to minimize.
[2022-06-09 01:25:58] [INFO ] Deduced a trap composed of 76 places in 324 ms of which 1 ms to minimize.
[2022-06-09 01:25:58] [INFO ] Deduced a trap composed of 76 places in 321 ms of which 1 ms to minimize.
[2022-06-09 01:25:59] [INFO ] Deduced a trap composed of 77 places in 315 ms of which 1 ms to minimize.
[2022-06-09 01:25:59] [INFO ] Deduced a trap composed of 77 places in 297 ms of which 0 ms to minimize.
[2022-06-09 01:25:59] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 1 ms to minimize.
[2022-06-09 01:26:00] [INFO ] Deduced a trap composed of 92 places in 315 ms of which 1 ms to minimize.
[2022-06-09 01:26:00] [INFO ] Deduced a trap composed of 91 places in 300 ms of which 0 ms to minimize.
[2022-06-09 01:26:01] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 1 ms to minimize.
[2022-06-09 01:26:01] [INFO ] Deduced a trap composed of 66 places in 310 ms of which 0 ms to minimize.
[2022-06-09 01:26:01] [INFO ] Deduced a trap composed of 64 places in 323 ms of which 1 ms to minimize.
[2022-06-09 01:26:02] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 27791 ms
[2022-06-09 01:26:02] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 199 ms.
[2022-06-09 01:26:05] [INFO ] Added : 108 causal constraints over 22 iterations in 3725 ms. Result :sat
[2022-06-09 01:26:05] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:26:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:26:06] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2022-06-09 01:26:06] [INFO ] [Real]Added 296 Read/Feed constraints in 183 ms returned sat
[2022-06-09 01:26:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:26:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:26:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:26:07] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2022-06-09 01:26:07] [INFO ] [Nat]Added 296 Read/Feed constraints in 195 ms returned sat
[2022-06-09 01:26:07] [INFO ] Deduced a trap composed of 89 places in 354 ms of which 1 ms to minimize.
[2022-06-09 01:26:08] [INFO ] Deduced a trap composed of 70 places in 351 ms of which 0 ms to minimize.
[2022-06-09 01:26:08] [INFO ] Deduced a trap composed of 5 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:26:09] [INFO ] Deduced a trap composed of 83 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:26:09] [INFO ] Deduced a trap composed of 33 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:26:09] [INFO ] Deduced a trap composed of 32 places in 335 ms of which 1 ms to minimize.
[2022-06-09 01:26:10] [INFO ] Deduced a trap composed of 17 places in 337 ms of which 1 ms to minimize.
[2022-06-09 01:26:10] [INFO ] Deduced a trap composed of 96 places in 350 ms of which 0 ms to minimize.
[2022-06-09 01:26:11] [INFO ] Deduced a trap composed of 16 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:26:11] [INFO ] Deduced a trap composed of 91 places in 330 ms of which 0 ms to minimize.
[2022-06-09 01:26:12] [INFO ] Deduced a trap composed of 88 places in 330 ms of which 0 ms to minimize.
[2022-06-09 01:26:12] [INFO ] Deduced a trap composed of 87 places in 330 ms of which 0 ms to minimize.
[2022-06-09 01:26:12] [INFO ] Deduced a trap composed of 93 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:26:13] [INFO ] Deduced a trap composed of 83 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:26:13] [INFO ] Deduced a trap composed of 83 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:26:14] [INFO ] Deduced a trap composed of 84 places in 352 ms of which 0 ms to minimize.
[2022-06-09 01:26:14] [INFO ] Deduced a trap composed of 90 places in 327 ms of which 1 ms to minimize.
[2022-06-09 01:26:14] [INFO ] Deduced a trap composed of 96 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:26:15] [INFO ] Deduced a trap composed of 87 places in 340 ms of which 0 ms to minimize.
[2022-06-09 01:26:15] [INFO ] Deduced a trap composed of 80 places in 341 ms of which 1 ms to minimize.
[2022-06-09 01:26:16] [INFO ] Deduced a trap composed of 93 places in 348 ms of which 0 ms to minimize.
[2022-06-09 01:26:16] [INFO ] Deduced a trap composed of 93 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:26:17] [INFO ] Deduced a trap composed of 90 places in 350 ms of which 1 ms to minimize.
[2022-06-09 01:26:17] [INFO ] Deduced a trap composed of 84 places in 343 ms of which 0 ms to minimize.
[2022-06-09 01:26:18] [INFO ] Deduced a trap composed of 90 places in 348 ms of which 0 ms to minimize.
[2022-06-09 01:26:18] [INFO ] Deduced a trap composed of 93 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:26:18] [INFO ] Deduced a trap composed of 90 places in 340 ms of which 0 ms to minimize.
[2022-06-09 01:26:19] [INFO ] Deduced a trap composed of 88 places in 349 ms of which 1 ms to minimize.
[2022-06-09 01:26:19] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 12108 ms
[2022-06-09 01:26:19] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 209 ms.
[2022-06-09 01:26:21] [INFO ] Deduced a trap composed of 58 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:26:22] [INFO ] Deduced a trap composed of 59 places in 339 ms of which 0 ms to minimize.
[2022-06-09 01:26:22] [INFO ] Deduced a trap composed of 89 places in 339 ms of which 0 ms to minimize.
[2022-06-09 01:26:23] [INFO ] Deduced a trap composed of 65 places in 355 ms of which 0 ms to minimize.
[2022-06-09 01:26:23] [INFO ] Deduced a trap composed of 63 places in 331 ms of which 0 ms to minimize.
[2022-06-09 01:26:24] [INFO ] Deduced a trap composed of 63 places in 336 ms of which 0 ms to minimize.
[2022-06-09 01:26:24] [INFO ] Deduced a trap composed of 63 places in 356 ms of which 0 ms to minimize.
[2022-06-09 01:26:25] [INFO ] Deduced a trap composed of 97 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:26:25] [INFO ] Deduced a trap composed of 68 places in 330 ms of which 1 ms to minimize.
[2022-06-09 01:26:26] [INFO ] Deduced a trap composed of 64 places in 339 ms of which 0 ms to minimize.
[2022-06-09 01:26:26] [INFO ] Deduced a trap composed of 58 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:26:27] [INFO ] Deduced a trap composed of 52 places in 345 ms of which 1 ms to minimize.
[2022-06-09 01:26:27] [INFO ] Deduced a trap composed of 86 places in 345 ms of which 0 ms to minimize.
[2022-06-09 01:26:28] [INFO ] Deduced a trap composed of 89 places in 361 ms of which 0 ms to minimize.
[2022-06-09 01:26:28] [INFO ] Deduced a trap composed of 89 places in 334 ms of which 1 ms to minimize.
[2022-06-09 01:26:28] [INFO ] Deduced a trap composed of 48 places in 338 ms of which 1 ms to minimize.
[2022-06-09 01:26:29] [INFO ] Deduced a trap composed of 50 places in 333 ms of which 0 ms to minimize.
[2022-06-09 01:26:29] [INFO ] Deduced a trap composed of 43 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:26:30] [INFO ] Deduced a trap composed of 55 places in 336 ms of which 0 ms to minimize.
[2022-06-09 01:26:30] [INFO ] Deduced a trap composed of 44 places in 339 ms of which 1 ms to minimize.
[2022-06-09 01:26:31] [INFO ] Deduced a trap composed of 58 places in 343 ms of which 0 ms to minimize.
[2022-06-09 01:26:31] [INFO ] Deduced a trap composed of 36 places in 346 ms of which 0 ms to minimize.
[2022-06-09 01:26:32] [INFO ] Deduced a trap composed of 26 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:26:32] [INFO ] Deduced a trap composed of 56 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:26:33] [INFO ] Deduced a trap composed of 7 places in 358 ms of which 1 ms to minimize.
[2022-06-09 01:26:33] [INFO ] Deduced a trap composed of 68 places in 335 ms of which 1 ms to minimize.
[2022-06-09 01:26:34] [INFO ] Deduced a trap composed of 19 places in 343 ms of which 0 ms to minimize.
[2022-06-09 01:26:34] [INFO ] Deduced a trap composed of 99 places in 336 ms of which 0 ms to minimize.
[2022-06-09 01:26:35] [INFO ] Deduced a trap composed of 57 places in 321 ms of which 1 ms to minimize.
[2022-06-09 01:26:35] [INFO ] Deduced a trap composed of 58 places in 341 ms of which 1 ms to minimize.
[2022-06-09 01:26:35] [INFO ] Deduced a trap composed of 50 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:26:36] [INFO ] Deduced a trap composed of 14 places in 322 ms of which 0 ms to minimize.
[2022-06-09 01:26:36] [INFO ] Deduced a trap composed of 71 places in 332 ms of which 0 ms to minimize.
[2022-06-09 01:26:37] [INFO ] Deduced a trap composed of 70 places in 331 ms of which 0 ms to minimize.
[2022-06-09 01:26:37] [INFO ] Deduced a trap composed of 60 places in 331 ms of which 0 ms to minimize.
[2022-06-09 01:26:38] [INFO ] Deduced a trap composed of 42 places in 327 ms of which 1 ms to minimize.
[2022-06-09 01:26:38] [INFO ] Deduced a trap composed of 61 places in 339 ms of which 0 ms to minimize.
[2022-06-09 01:26:39] [INFO ] Deduced a trap composed of 104 places in 344 ms of which 0 ms to minimize.
[2022-06-09 01:26:39] [INFO ] Deduced a trap composed of 97 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:26:40] [INFO ] Deduced a trap composed of 46 places in 328 ms of which 1 ms to minimize.
[2022-06-09 01:26:40] [INFO ] Deduced a trap composed of 94 places in 314 ms of which 1 ms to minimize.
[2022-06-09 01:26:41] [INFO ] Deduced a trap composed of 58 places in 316 ms of which 0 ms to minimize.
[2022-06-09 01:26:41] [INFO ] Deduced a trap composed of 60 places in 314 ms of which 0 ms to minimize.
[2022-06-09 01:26:41] [INFO ] Deduced a trap composed of 88 places in 328 ms of which 1 ms to minimize.
[2022-06-09 01:26:42] [INFO ] Deduced a trap composed of 93 places in 330 ms of which 1 ms to minimize.
[2022-06-09 01:26:42] [INFO ] Deduced a trap composed of 78 places in 356 ms of which 0 ms to minimize.
[2022-06-09 01:26:43] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 21590 ms
[2022-06-09 01:26:43] [INFO ] Added : 51 causal constraints over 11 iterations in 23770 ms. Result :sat
[2022-06-09 01:26:43] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:26:43] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2022-06-09 01:26:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:26:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:26:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:26:44] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2022-06-09 01:26:44] [INFO ] [Nat]Added 296 Read/Feed constraints in 202 ms returned sat
[2022-06-09 01:26:45] [INFO ] Deduced a trap composed of 99 places in 425 ms of which 0 ms to minimize.
[2022-06-09 01:26:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 583 ms
[2022-06-09 01:26:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 204 ms.
[2022-06-09 01:26:50] [INFO ] Deduced a trap composed of 18 places in 444 ms of which 0 ms to minimize.
[2022-06-09 01:26:50] [INFO ] Deduced a trap composed of 17 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:26:51] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 1 ms to minimize.
[2022-06-09 01:26:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1474 ms
[2022-06-09 01:26:51] [INFO ] Added : 155 causal constraints over 32 iterations in 6555 ms. Result :sat
[2022-06-09 01:26:51] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:26:52] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2022-06-09 01:26:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:26:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:26:52] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2022-06-09 01:26:53] [INFO ] [Nat]Added 296 Read/Feed constraints in 229 ms returned sat
[2022-06-09 01:26:53] [INFO ] Deduced a trap composed of 104 places in 330 ms of which 1 ms to minimize.
[2022-06-09 01:26:53] [INFO ] Deduced a trap composed of 98 places in 347 ms of which 1 ms to minimize.
[2022-06-09 01:26:54] [INFO ] Deduced a trap composed of 76 places in 353 ms of which 1 ms to minimize.
[2022-06-09 01:26:54] [INFO ] Deduced a trap composed of 5 places in 372 ms of which 0 ms to minimize.
[2022-06-09 01:26:55] [INFO ] Deduced a trap composed of 89 places in 327 ms of which 1 ms to minimize.
[2022-06-09 01:26:55] [INFO ] Deduced a trap composed of 34 places in 320 ms of which 1 ms to minimize.
[2022-06-09 01:26:56] [INFO ] Deduced a trap composed of 32 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:26:56] [INFO ] Deduced a trap composed of 95 places in 329 ms of which 1 ms to minimize.
[2022-06-09 01:26:56] [INFO ] Deduced a trap composed of 94 places in 330 ms of which 1 ms to minimize.
[2022-06-09 01:26:57] [INFO ] Deduced a trap composed of 80 places in 321 ms of which 1 ms to minimize.
[2022-06-09 01:26:57] [INFO ] Deduced a trap composed of 79 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:26:58] [INFO ] Deduced a trap composed of 34 places in 345 ms of which 0 ms to minimize.
[2022-06-09 01:26:58] [INFO ] Deduced a trap composed of 79 places in 322 ms of which 0 ms to minimize.
[2022-06-09 01:26:59] [INFO ] Deduced a trap composed of 37 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:26:59] [INFO ] Deduced a trap composed of 93 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:26:59] [INFO ] Deduced a trap composed of 26 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:27:00] [INFO ] Deduced a trap composed of 32 places in 313 ms of which 0 ms to minimize.
[2022-06-09 01:27:00] [INFO ] Deduced a trap composed of 36 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:27:00] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 0 ms to minimize.
[2022-06-09 01:27:01] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 7947 ms
[2022-06-09 01:27:01] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 204 ms.
[2022-06-09 01:27:06] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 0 ms to minimize.
[2022-06-09 01:27:06] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 0 ms to minimize.
[2022-06-09 01:27:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 728 ms
[2022-06-09 01:27:06] [INFO ] Added : 152 causal constraints over 31 iterations in 5797 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, -1, -1, 1, 1] Max seen :[0, 0, 234422, 0, 0]
Incomplete Parikh walk after 1331000 steps, including 1000 resets, run finished after 10911 ms. (steps per millisecond=121 ) properties (out of 5) seen :24640 could not realise parikh vector
Incomplete Parikh walk after 1313800 steps, including 1000 resets, run finished after 10463 ms. (steps per millisecond=125 ) properties (out of 5) seen :75104 could not realise parikh vector
Interrupted Parikh walk after 3716745 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=123 ) properties (out of 5) seen :262
Incomplete Parikh walk after 1189800 steps, including 1000 resets, run finished after 9451 ms. (steps per millisecond=125 ) properties (out of 5) seen :66371 could not realise parikh vector
Incomplete Parikh walk after 1214400 steps, including 1000 resets, run finished after 9756 ms. (steps per millisecond=124 ) properties (out of 5) seen :68004 could not realise parikh vector
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 73 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 58 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:28:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:28:17] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:28:18] [INFO ] Implicit Places using invariants in 419 ms returned []
[2022-06-09 01:28:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:28:18] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 01:28:18] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:28:24] [INFO ] Implicit Places using invariants and state equation in 6866 ms returned []
Implicit Place search using SMT with State Equation took 7286 ms to find 0 implicit places.
[2022-06-09 01:28:25] [INFO ] Redundant transitions in 243 ms returned []
[2022-06-09 01:28:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:28:25] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 01:28:26] [INFO ] Dead Transitions using invariants and state equation in 1000 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-05
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:28:26] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2022-06-09 01:28:26] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:28:26] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 01:28:26] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:28:26] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2022-06-09 01:28:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:28:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:28:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:28:27] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2022-06-09 01:28:27] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:28:27] [INFO ] [Nat]Added 296 Read/Feed constraints in 204 ms returned sat
[2022-06-09 01:28:28] [INFO ] Deduced a trap composed of 5 places in 441 ms of which 1 ms to minimize.
[2022-06-09 01:28:28] [INFO ] Deduced a trap composed of 14 places in 419 ms of which 1 ms to minimize.
[2022-06-09 01:28:29] [INFO ] Deduced a trap composed of 9 places in 379 ms of which 0 ms to minimize.
[2022-06-09 01:28:29] [INFO ] Deduced a trap composed of 81 places in 285 ms of which 1 ms to minimize.
[2022-06-09 01:28:29] [INFO ] Deduced a trap composed of 43 places in 284 ms of which 1 ms to minimize.
[2022-06-09 01:28:30] [INFO ] Deduced a trap composed of 74 places in 282 ms of which 0 ms to minimize.
[2022-06-09 01:28:30] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 0 ms to minimize.
[2022-06-09 01:28:30] [INFO ] Deduced a trap composed of 73 places in 284 ms of which 0 ms to minimize.
[2022-06-09 01:28:31] [INFO ] Deduced a trap composed of 15 places in 284 ms of which 0 ms to minimize.
[2022-06-09 01:28:31] [INFO ] Deduced a trap composed of 10 places in 287 ms of which 1 ms to minimize.
[2022-06-09 01:28:32] [INFO ] Deduced a trap composed of 81 places in 284 ms of which 0 ms to minimize.
[2022-06-09 01:28:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 56 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:28:32] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 2288 ms. (steps per millisecond=437 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1850 ms. (steps per millisecond=540 ) properties (out of 1) seen :0
[2022-06-09 01:28:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:28:36] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 01:28:36] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:28:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:28:36] [INFO ] [Real]Absence check using state equation in 481 ms returned sat
[2022-06-09 01:28:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:28:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:28:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:28:37] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2022-06-09 01:28:37] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:28:37] [INFO ] [Nat]Added 296 Read/Feed constraints in 205 ms returned sat
[2022-06-09 01:28:38] [INFO ] Deduced a trap composed of 5 places in 451 ms of which 0 ms to minimize.
[2022-06-09 01:28:38] [INFO ] Deduced a trap composed of 14 places in 432 ms of which 0 ms to minimize.
[2022-06-09 01:28:39] [INFO ] Deduced a trap composed of 9 places in 379 ms of which 0 ms to minimize.
[2022-06-09 01:28:39] [INFO ] Deduced a trap composed of 81 places in 285 ms of which 0 ms to minimize.
[2022-06-09 01:28:39] [INFO ] Deduced a trap composed of 43 places in 309 ms of which 1 ms to minimize.
[2022-06-09 01:28:40] [INFO ] Deduced a trap composed of 74 places in 292 ms of which 1 ms to minimize.
[2022-06-09 01:28:40] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 0 ms to minimize.
[2022-06-09 01:28:41] [INFO ] Deduced a trap composed of 73 places in 283 ms of which 0 ms to minimize.
[2022-06-09 01:28:41] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 0 ms to minimize.
[2022-06-09 01:28:41] [INFO ] Deduced a trap composed of 10 places in 283 ms of which 0 ms to minimize.
[2022-06-09 01:28:42] [INFO ] Deduced a trap composed of 81 places in 284 ms of which 0 ms to minimize.
[2022-06-09 01:28:42] [INFO ] Deduced a trap composed of 81 places in 280 ms of which 0 ms to minimize.
[2022-06-09 01:28:42] [INFO ] Deduced a trap composed of 81 places in 280 ms of which 0 ms to minimize.
[2022-06-09 01:28:43] [INFO ] Deduced a trap composed of 81 places in 282 ms of which 0 ms to minimize.
[2022-06-09 01:28:43] [INFO ] Deduced a trap composed of 84 places in 283 ms of which 0 ms to minimize.
[2022-06-09 01:28:44] [INFO ] Deduced a trap composed of 71 places in 276 ms of which 1 ms to minimize.
[2022-06-09 01:28:44] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6517 ms
[2022-06-09 01:28:44] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 212 ms.
[2022-06-09 01:28:48] [INFO ] Deduced a trap composed of 84 places in 286 ms of which 0 ms to minimize.
[2022-06-09 01:28:48] [INFO ] Deduced a trap composed of 83 places in 284 ms of which 1 ms to minimize.
[2022-06-09 01:28:49] [INFO ] Deduced a trap composed of 84 places in 282 ms of which 0 ms to minimize.
[2022-06-09 01:28:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1331 ms
[2022-06-09 01:28:49] [INFO ] Added : 108 causal constraints over 22 iterations in 5198 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1214400 steps, including 1000 resets, run finished after 9632 ms. (steps per millisecond=126 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 55 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 55 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:28:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:28:59] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 01:28:59] [INFO ] Implicit Places using invariants in 438 ms returned []
[2022-06-09 01:28:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:28:59] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:29:00] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:29:07] [INFO ] Implicit Places using invariants and state equation in 7626 ms returned []
Implicit Place search using SMT with State Equation took 8066 ms to find 0 implicit places.
[2022-06-09 01:29:07] [INFO ] Redundant transitions in 126 ms returned []
[2022-06-09 01:29:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:29:07] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 01:29:08] [INFO ] Dead Transitions using invariants and state equation in 1002 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-05 in 42188 ms.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-10
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:29:08] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 10005 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2022-06-09 01:29:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:29:08] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 01:29:08] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:29:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:29:09] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2022-06-09 01:29:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:29:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:29:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:29:09] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2022-06-09 01:29:09] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:29:09] [INFO ] [Nat]Added 296 Read/Feed constraints in 218 ms returned sat
[2022-06-09 01:29:10] [INFO ] Deduced a trap composed of 64 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:29:10] [INFO ] Deduced a trap composed of 97 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:29:11] [INFO ] Deduced a trap composed of 89 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:29:11] [INFO ] Deduced a trap composed of 90 places in 332 ms of which 0 ms to minimize.
[2022-06-09 01:29:11] [INFO ] Deduced a trap composed of 74 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:29:12] [INFO ] Deduced a trap composed of 89 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:29:12] [INFO ] Deduced a trap composed of 89 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:29:13] [INFO ] Deduced a trap composed of 90 places in 339 ms of which 1 ms to minimize.
[2022-06-09 01:29:13] [INFO ] Deduced a trap composed of 48 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:29:14] [INFO ] Deduced a trap composed of 16 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:29:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 54 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:29:14] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000010 steps, including 2 resets, run finished after 2388 ms. (steps per millisecond=418 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1837 ms. (steps per millisecond=544 ) properties (out of 1) seen :0
[2022-06-09 01:29:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:29:18] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 01:29:18] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:29:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:29:18] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2022-06-09 01:29:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:29:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:29:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:29:19] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2022-06-09 01:29:19] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:29:19] [INFO ] [Nat]Added 296 Read/Feed constraints in 214 ms returned sat
[2022-06-09 01:29:20] [INFO ] Deduced a trap composed of 64 places in 337 ms of which 0 ms to minimize.
[2022-06-09 01:29:20] [INFO ] Deduced a trap composed of 97 places in 335 ms of which 1 ms to minimize.
[2022-06-09 01:29:21] [INFO ] Deduced a trap composed of 89 places in 351 ms of which 0 ms to minimize.
[2022-06-09 01:29:21] [INFO ] Deduced a trap composed of 90 places in 336 ms of which 0 ms to minimize.
[2022-06-09 01:29:21] [INFO ] Deduced a trap composed of 74 places in 335 ms of which 1 ms to minimize.
[2022-06-09 01:29:22] [INFO ] Deduced a trap composed of 89 places in 334 ms of which 1 ms to minimize.
[2022-06-09 01:29:22] [INFO ] Deduced a trap composed of 89 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:29:23] [INFO ] Deduced a trap composed of 90 places in 334 ms of which 1 ms to minimize.
[2022-06-09 01:29:23] [INFO ] Deduced a trap composed of 48 places in 335 ms of which 1 ms to minimize.
[2022-06-09 01:29:24] [INFO ] Deduced a trap composed of 16 places in 336 ms of which 1 ms to minimize.
[2022-06-09 01:29:24] [INFO ] Deduced a trap composed of 58 places in 333 ms of which 0 ms to minimize.
[2022-06-09 01:29:24] [INFO ] Deduced a trap composed of 58 places in 329 ms of which 1 ms to minimize.
[2022-06-09 01:29:25] [INFO ] Deduced a trap composed of 59 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:29:25] [INFO ] Deduced a trap composed of 59 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:29:26] [INFO ] Deduced a trap composed of 14 places in 330 ms of which 0 ms to minimize.
[2022-06-09 01:29:26] [INFO ] Deduced a trap composed of 64 places in 332 ms of which 0 ms to minimize.
[2022-06-09 01:29:27] [INFO ] Deduced a trap composed of 87 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:29:27] [INFO ] Deduced a trap composed of 58 places in 333 ms of which 1 ms to minimize.
[2022-06-09 01:29:27] [INFO ] Deduced a trap composed of 59 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:29:28] [INFO ] Deduced a trap composed of 87 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:29:28] [INFO ] Deduced a trap composed of 86 places in 325 ms of which 1 ms to minimize.
[2022-06-09 01:29:29] [INFO ] Deduced a trap composed of 59 places in 375 ms of which 1 ms to minimize.
[2022-06-09 01:29:29] [INFO ] Deduced a trap composed of 66 places in 326 ms of which 1 ms to minimize.
[2022-06-09 01:29:30] [INFO ] Deduced a trap composed of 67 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:29:30] [INFO ] Deduced a trap composed of 64 places in 332 ms of which 1 ms to minimize.
[2022-06-09 01:29:30] [INFO ] Deduced a trap composed of 67 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:29:31] [INFO ] Deduced a trap composed of 64 places in 325 ms of which 1 ms to minimize.
[2022-06-09 01:29:31] [INFO ] Deduced a trap composed of 64 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:29:32] [INFO ] Deduced a trap composed of 80 places in 337 ms of which 0 ms to minimize.
[2022-06-09 01:29:32] [INFO ] Deduced a trap composed of 79 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:29:32] [INFO ] Deduced a trap composed of 10 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:29:33] [INFO ] Deduced a trap composed of 94 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:29:33] [INFO ] Deduced a trap composed of 96 places in 342 ms of which 1 ms to minimize.
[2022-06-09 01:29:34] [INFO ] Deduced a trap composed of 95 places in 337 ms of which 0 ms to minimize.
[2022-06-09 01:29:34] [INFO ] Deduced a trap composed of 93 places in 330 ms of which 0 ms to minimize.
[2022-06-09 01:29:35] [INFO ] Deduced a trap composed of 88 places in 332 ms of which 0 ms to minimize.
[2022-06-09 01:29:35] [INFO ] Deduced a trap composed of 88 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:29:35] [INFO ] Deduced a trap composed of 93 places in 331 ms of which 0 ms to minimize.
[2022-06-09 01:29:36] [INFO ] Deduced a trap composed of 95 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:29:36] [INFO ] Deduced a trap composed of 89 places in 323 ms of which 1 ms to minimize.
[2022-06-09 01:29:37] [INFO ] Deduced a trap composed of 91 places in 346 ms of which 0 ms to minimize.
[2022-06-09 01:29:37] [INFO ] Deduced a trap composed of 89 places in 331 ms of which 1 ms to minimize.
[2022-06-09 01:29:38] [INFO ] Deduced a trap composed of 90 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:29:38] [INFO ] Deduced a trap composed of 89 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:29:38] [INFO ] Deduced a trap composed of 91 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:29:39] [INFO ] Deduced a trap composed of 89 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:29:39] [INFO ] Deduced a trap composed of 90 places in 311 ms of which 1 ms to minimize.
[2022-06-09 01:29:40] [INFO ] Deduced a trap composed of 95 places in 319 ms of which 0 ms to minimize.
[2022-06-09 01:29:40] [INFO ] Deduced a trap composed of 95 places in 323 ms of which 1 ms to minimize.
[2022-06-09 01:29:41] [INFO ] Deduced a trap composed of 91 places in 324 ms of which 1 ms to minimize.
[2022-06-09 01:29:41] [INFO ] Deduced a trap composed of 95 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:29:41] [INFO ] Deduced a trap composed of 95 places in 319 ms of which 1 ms to minimize.
[2022-06-09 01:29:42] [INFO ] Deduced a trap composed of 95 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:29:42] [INFO ] Deduced a trap composed of 95 places in 320 ms of which 0 ms to minimize.
[2022-06-09 01:29:43] [INFO ] Deduced a trap composed of 90 places in 328 ms of which 1 ms to minimize.
[2022-06-09 01:29:43] [INFO ] Deduced a trap composed of 75 places in 330 ms of which 1 ms to minimize.
[2022-06-09 01:29:44] [INFO ] Deduced a trap composed of 46 places in 322 ms of which 0 ms to minimize.
[2022-06-09 01:29:44] [INFO ] Deduced a trap composed of 45 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:29:44] [INFO ] Deduced a trap composed of 76 places in 347 ms of which 0 ms to minimize.
[2022-06-09 01:29:45] [INFO ] Deduced a trap composed of 76 places in 332 ms of which 0 ms to minimize.
[2022-06-09 01:29:45] [INFO ] Deduced a trap composed of 77 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:29:46] [INFO ] Deduced a trap composed of 77 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:29:46] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 0 ms to minimize.
[2022-06-09 01:29:46] [INFO ] Deduced a trap composed of 92 places in 328 ms of which 1 ms to minimize.
[2022-06-09 01:29:47] [INFO ] Deduced a trap composed of 91 places in 330 ms of which 1 ms to minimize.
[2022-06-09 01:29:47] [INFO ] Deduced a trap composed of 13 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:29:48] [INFO ] Deduced a trap composed of 66 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:29:48] [INFO ] Deduced a trap composed of 64 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:29:48] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 29011 ms
[2022-06-09 01:29:48] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 202 ms.
[2022-06-09 01:29:52] [INFO ] Added : 108 causal constraints over 22 iterations in 3888 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 1189800 steps, including 1000 resets, run finished after 9328 ms. (steps per millisecond=127 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 54 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:30:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:30:02] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 01:30:02] [INFO ] Implicit Places using invariants in 389 ms returned []
[2022-06-09 01:30:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:30:02] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:30:03] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:30:09] [INFO ] Implicit Places using invariants and state equation in 7083 ms returned []
Implicit Place search using SMT with State Equation took 7473 ms to find 0 implicit places.
[2022-06-09 01:30:09] [INFO ] Redundant transitions in 126 ms returned []
[2022-06-09 01:30:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:30:09] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 01:30:10] [INFO ] Dead Transitions using invariants and state equation in 1025 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-10 in 62391 ms.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-11
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:30:10] [INFO ] Computed 8 place invariants in 19 ms
Incomplete random walk after 10011 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :163
[2022-06-09 01:30:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:30:10] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 01:30:10] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:11] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2022-06-09 01:30:11] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:30:11] [INFO ] [Real]Added 296 Read/Feed constraints in 193 ms returned sat
[2022-06-09 01:30:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:30:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:12] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2022-06-09 01:30:12] [INFO ] [Nat]Added 296 Read/Feed constraints in 201 ms returned sat
[2022-06-09 01:30:12] [INFO ] Deduced a trap composed of 89 places in 346 ms of which 0 ms to minimize.
[2022-06-09 01:30:13] [INFO ] Deduced a trap composed of 70 places in 366 ms of which 1 ms to minimize.
[2022-06-09 01:30:13] [INFO ] Deduced a trap composed of 5 places in 354 ms of which 0 ms to minimize.
[2022-06-09 01:30:14] [INFO ] Deduced a trap composed of 83 places in 352 ms of which 0 ms to minimize.
[2022-06-09 01:30:14] [INFO ] Deduced a trap composed of 33 places in 353 ms of which 1 ms to minimize.
[2022-06-09 01:30:15] [INFO ] Deduced a trap composed of 32 places in 339 ms of which 0 ms to minimize.
[2022-06-09 01:30:15] [INFO ] Deduced a trap composed of 17 places in 347 ms of which 0 ms to minimize.
[2022-06-09 01:30:16] [INFO ] Deduced a trap composed of 96 places in 354 ms of which 1 ms to minimize.
[2022-06-09 01:30:16] [INFO ] Deduced a trap composed of 16 places in 351 ms of which 0 ms to minimize.
[2022-06-09 01:30:16] [INFO ] Deduced a trap composed of 91 places in 355 ms of which 0 ms to minimize.
[2022-06-09 01:30:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[163]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:30:17] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 1000011 steps, including 2 resets, run finished after 2622 ms. (steps per millisecond=381 ) properties (out of 1) seen :4639
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1550 ms. (steps per millisecond=645 ) properties (out of 1) seen :16244
[2022-06-09 01:30:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:30:21] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 01:30:21] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:21] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2022-06-09 01:30:21] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:30:22] [INFO ] [Real]Added 296 Read/Feed constraints in 193 ms returned sat
[2022-06-09 01:30:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:30:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:22] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2022-06-09 01:30:22] [INFO ] [Nat]Added 296 Read/Feed constraints in 202 ms returned sat
[2022-06-09 01:30:23] [INFO ] Deduced a trap composed of 89 places in 381 ms of which 19 ms to minimize.
[2022-06-09 01:30:23] [INFO ] Deduced a trap composed of 70 places in 361 ms of which 1 ms to minimize.
[2022-06-09 01:30:24] [INFO ] Deduced a trap composed of 5 places in 360 ms of which 0 ms to minimize.
[2022-06-09 01:30:24] [INFO ] Deduced a trap composed of 83 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:30:25] [INFO ] Deduced a trap composed of 33 places in 342 ms of which 1 ms to minimize.
[2022-06-09 01:30:25] [INFO ] Deduced a trap composed of 32 places in 339 ms of which 0 ms to minimize.
[2022-06-09 01:30:25] [INFO ] Deduced a trap composed of 17 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:30:26] [INFO ] Deduced a trap composed of 96 places in 351 ms of which 1 ms to minimize.
[2022-06-09 01:30:26] [INFO ] Deduced a trap composed of 16 places in 344 ms of which 0 ms to minimize.
[2022-06-09 01:30:27] [INFO ] Deduced a trap composed of 91 places in 356 ms of which 0 ms to minimize.
[2022-06-09 01:30:27] [INFO ] Deduced a trap composed of 88 places in 351 ms of which 0 ms to minimize.
[2022-06-09 01:30:28] [INFO ] Deduced a trap composed of 87 places in 350 ms of which 0 ms to minimize.
[2022-06-09 01:30:28] [INFO ] Deduced a trap composed of 93 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:30:29] [INFO ] Deduced a trap composed of 83 places in 344 ms of which 0 ms to minimize.
[2022-06-09 01:30:29] [INFO ] Deduced a trap composed of 83 places in 348 ms of which 0 ms to minimize.
[2022-06-09 01:30:29] [INFO ] Deduced a trap composed of 84 places in 339 ms of which 1 ms to minimize.
[2022-06-09 01:30:30] [INFO ] Deduced a trap composed of 90 places in 349 ms of which 0 ms to minimize.
[2022-06-09 01:30:30] [INFO ] Deduced a trap composed of 96 places in 344 ms of which 0 ms to minimize.
[2022-06-09 01:30:31] [INFO ] Deduced a trap composed of 87 places in 348 ms of which 0 ms to minimize.
[2022-06-09 01:30:31] [INFO ] Deduced a trap composed of 80 places in 347 ms of which 1 ms to minimize.
[2022-06-09 01:30:32] [INFO ] Deduced a trap composed of 93 places in 345 ms of which 1 ms to minimize.
[2022-06-09 01:30:32] [INFO ] Deduced a trap composed of 93 places in 342 ms of which 1 ms to minimize.
[2022-06-09 01:30:32] [INFO ] Deduced a trap composed of 90 places in 332 ms of which 1 ms to minimize.
[2022-06-09 01:30:33] [INFO ] Deduced a trap composed of 84 places in 340 ms of which 0 ms to minimize.
[2022-06-09 01:30:33] [INFO ] Deduced a trap composed of 90 places in 344 ms of which 1 ms to minimize.
[2022-06-09 01:30:34] [INFO ] Deduced a trap composed of 93 places in 358 ms of which 0 ms to minimize.
[2022-06-09 01:30:34] [INFO ] Deduced a trap composed of 90 places in 345 ms of which 0 ms to minimize.
[2022-06-09 01:30:35] [INFO ] Deduced a trap composed of 88 places in 353 ms of which 0 ms to minimize.
[2022-06-09 01:30:35] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 12441 ms
[2022-06-09 01:30:35] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 212 ms.
[2022-06-09 01:30:37] [INFO ] Deduced a trap composed of 58 places in 346 ms of which 0 ms to minimize.
[2022-06-09 01:30:38] [INFO ] Deduced a trap composed of 59 places in 347 ms of which 0 ms to minimize.
[2022-06-09 01:30:38] [INFO ] Deduced a trap composed of 89 places in 343 ms of which 0 ms to minimize.
[2022-06-09 01:30:39] [INFO ] Deduced a trap composed of 65 places in 349 ms of which 0 ms to minimize.
[2022-06-09 01:30:39] [INFO ] Deduced a trap composed of 63 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:30:40] [INFO ] Deduced a trap composed of 63 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:30:40] [INFO ] Deduced a trap composed of 63 places in 340 ms of which 1 ms to minimize.
[2022-06-09 01:30:41] [INFO ] Deduced a trap composed of 97 places in 349 ms of which 0 ms to minimize.
[2022-06-09 01:30:41] [INFO ] Deduced a trap composed of 68 places in 340 ms of which 0 ms to minimize.
[2022-06-09 01:30:41] [INFO ] Deduced a trap composed of 64 places in 333 ms of which 0 ms to minimize.
[2022-06-09 01:30:42] [INFO ] Deduced a trap composed of 58 places in 338 ms of which 1 ms to minimize.
[2022-06-09 01:30:42] [INFO ] Deduced a trap composed of 52 places in 351 ms of which 0 ms to minimize.
[2022-06-09 01:30:43] [INFO ] Deduced a trap composed of 86 places in 352 ms of which 1 ms to minimize.
[2022-06-09 01:30:43] [INFO ] Deduced a trap composed of 89 places in 337 ms of which 1 ms to minimize.
[2022-06-09 01:30:44] [INFO ] Deduced a trap composed of 89 places in 345 ms of which 0 ms to minimize.
[2022-06-09 01:30:44] [INFO ] Deduced a trap composed of 48 places in 350 ms of which 0 ms to minimize.
[2022-06-09 01:30:45] [INFO ] Deduced a trap composed of 50 places in 340 ms of which 0 ms to minimize.
[2022-06-09 01:30:45] [INFO ] Deduced a trap composed of 43 places in 337 ms of which 0 ms to minimize.
[2022-06-09 01:30:46] [INFO ] Deduced a trap composed of 55 places in 354 ms of which 0 ms to minimize.
[2022-06-09 01:30:46] [INFO ] Deduced a trap composed of 44 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:30:47] [INFO ] Deduced a trap composed of 58 places in 344 ms of which 0 ms to minimize.
[2022-06-09 01:30:47] [INFO ] Deduced a trap composed of 36 places in 345 ms of which 0 ms to minimize.
[2022-06-09 01:30:48] [INFO ] Deduced a trap composed of 26 places in 333 ms of which 0 ms to minimize.
[2022-06-09 01:30:48] [INFO ] Deduced a trap composed of 56 places in 346 ms of which 0 ms to minimize.
[2022-06-09 01:30:49] [INFO ] Deduced a trap composed of 7 places in 367 ms of which 0 ms to minimize.
[2022-06-09 01:30:49] [INFO ] Deduced a trap composed of 68 places in 350 ms of which 0 ms to minimize.
[2022-06-09 01:30:50] [INFO ] Deduced a trap composed of 19 places in 337 ms of which 1 ms to minimize.
[2022-06-09 01:30:50] [INFO ] Deduced a trap composed of 99 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:30:51] [INFO ] Deduced a trap composed of 57 places in 318 ms of which 0 ms to minimize.
[2022-06-09 01:30:51] [INFO ] Deduced a trap composed of 58 places in 322 ms of which 1 ms to minimize.
[2022-06-09 01:30:51] [INFO ] Deduced a trap composed of 50 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:30:52] [INFO ] Deduced a trap composed of 14 places in 344 ms of which 0 ms to minimize.
[2022-06-09 01:30:52] [INFO ] Deduced a trap composed of 71 places in 338 ms of which 1 ms to minimize.
[2022-06-09 01:30:53] [INFO ] Deduced a trap composed of 70 places in 349 ms of which 0 ms to minimize.
[2022-06-09 01:30:53] [INFO ] Deduced a trap composed of 60 places in 330 ms of which 0 ms to minimize.
[2022-06-09 01:30:54] [INFO ] Deduced a trap composed of 42 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:30:54] [INFO ] Deduced a trap composed of 61 places in 340 ms of which 0 ms to minimize.
[2022-06-09 01:30:55] [INFO ] Deduced a trap composed of 104 places in 347 ms of which 1 ms to minimize.
[2022-06-09 01:30:55] [INFO ] Deduced a trap composed of 97 places in 332 ms of which 0 ms to minimize.
[2022-06-09 01:30:56] [INFO ] Deduced a trap composed of 46 places in 329 ms of which 0 ms to minimize.
[2022-06-09 01:30:56] [INFO ] Deduced a trap composed of 94 places in 317 ms of which 1 ms to minimize.
[2022-06-09 01:30:57] [INFO ] Deduced a trap composed of 58 places in 329 ms of which 1 ms to minimize.
[2022-06-09 01:30:57] [INFO ] Deduced a trap composed of 60 places in 318 ms of which 0 ms to minimize.
[2022-06-09 01:30:58] [INFO ] Deduced a trap composed of 88 places in 317 ms of which 0 ms to minimize.
[2022-06-09 01:30:58] [INFO ] Deduced a trap composed of 93 places in 337 ms of which 0 ms to minimize.
[2022-06-09 01:30:58] [INFO ] Deduced a trap composed of 78 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:30:59] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 21839 ms
[2022-06-09 01:30:59] [INFO ] Added : 51 causal constraints over 11 iterations in 24026 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[16244]
Interrupted Parikh walk after 3727945 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=124 ) properties (out of 1) seen :244
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 65 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:31:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:31:29] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 01:31:29] [INFO ] Implicit Places using invariants in 421 ms returned []
[2022-06-09 01:31:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:31:29] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:31:30] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:31:37] [INFO ] Implicit Places using invariants and state equation in 7254 ms returned []
Implicit Place search using SMT with State Equation took 7675 ms to find 0 implicit places.
[2022-06-09 01:31:37] [INFO ] Redundant transitions in 126 ms returned []
[2022-06-09 01:31:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:31:37] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 01:31:38] [INFO ] Dead Transitions using invariants and state equation in 1007 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:31:38] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 2609 ms. (steps per millisecond=383 ) properties (out of 1) seen :5716
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1558 ms. (steps per millisecond=641 ) properties (out of 1) seen :16232
[2022-06-09 01:31:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:31:42] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 01:31:42] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:31:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:31:43] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2022-06-09 01:31:43] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:31:43] [INFO ] [Real]Added 296 Read/Feed constraints in 201 ms returned sat
[2022-06-09 01:31:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:31:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:31:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:31:43] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2022-06-09 01:31:44] [INFO ] [Nat]Added 296 Read/Feed constraints in 209 ms returned sat
[2022-06-09 01:31:44] [INFO ] Deduced a trap composed of 89 places in 354 ms of which 1 ms to minimize.
[2022-06-09 01:31:45] [INFO ] Deduced a trap composed of 70 places in 355 ms of which 1 ms to minimize.
[2022-06-09 01:31:45] [INFO ] Deduced a trap composed of 5 places in 352 ms of which 0 ms to minimize.
[2022-06-09 01:31:45] [INFO ] Deduced a trap composed of 83 places in 351 ms of which 1 ms to minimize.
[2022-06-09 01:31:46] [INFO ] Deduced a trap composed of 33 places in 355 ms of which 1 ms to minimize.
[2022-06-09 01:31:46] [INFO ] Deduced a trap composed of 32 places in 348 ms of which 1 ms to minimize.
[2022-06-09 01:31:47] [INFO ] Deduced a trap composed of 17 places in 351 ms of which 0 ms to minimize.
[2022-06-09 01:31:47] [INFO ] Deduced a trap composed of 96 places in 346 ms of which 0 ms to minimize.
[2022-06-09 01:31:48] [INFO ] Deduced a trap composed of 16 places in 347 ms of which 1 ms to minimize.
[2022-06-09 01:31:48] [INFO ] Deduced a trap composed of 91 places in 345 ms of which 0 ms to minimize.
[2022-06-09 01:31:48] [INFO ] Deduced a trap composed of 88 places in 343 ms of which 0 ms to minimize.
[2022-06-09 01:31:49] [INFO ] Deduced a trap composed of 87 places in 357 ms of which 1 ms to minimize.
[2022-06-09 01:31:49] [INFO ] Deduced a trap composed of 93 places in 346 ms of which 0 ms to minimize.
[2022-06-09 01:31:50] [INFO ] Deduced a trap composed of 83 places in 343 ms of which 0 ms to minimize.
[2022-06-09 01:31:50] [INFO ] Deduced a trap composed of 83 places in 341 ms of which 1 ms to minimize.
[2022-06-09 01:31:51] [INFO ] Deduced a trap composed of 84 places in 343 ms of which 1 ms to minimize.
[2022-06-09 01:31:51] [INFO ] Deduced a trap composed of 90 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:31:52] [INFO ] Deduced a trap composed of 96 places in 347 ms of which 1 ms to minimize.
[2022-06-09 01:31:52] [INFO ] Deduced a trap composed of 87 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:31:52] [INFO ] Deduced a trap composed of 80 places in 348 ms of which 0 ms to minimize.
[2022-06-09 01:31:53] [INFO ] Deduced a trap composed of 93 places in 344 ms of which 0 ms to minimize.
[2022-06-09 01:31:53] [INFO ] Deduced a trap composed of 93 places in 354 ms of which 0 ms to minimize.
[2022-06-09 01:31:54] [INFO ] Deduced a trap composed of 90 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:31:54] [INFO ] Deduced a trap composed of 84 places in 348 ms of which 1 ms to minimize.
[2022-06-09 01:31:55] [INFO ] Deduced a trap composed of 90 places in 347 ms of which 0 ms to minimize.
[2022-06-09 01:31:55] [INFO ] Deduced a trap composed of 93 places in 336 ms of which 1 ms to minimize.
[2022-06-09 01:31:56] [INFO ] Deduced a trap composed of 90 places in 337 ms of which 1 ms to minimize.
[2022-06-09 01:31:56] [INFO ] Deduced a trap composed of 88 places in 350 ms of which 1 ms to minimize.
[2022-06-09 01:31:56] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 12422 ms
[2022-06-09 01:31:56] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 210 ms.
[2022-06-09 01:31:59] [INFO ] Deduced a trap composed of 58 places in 360 ms of which 1 ms to minimize.
[2022-06-09 01:31:59] [INFO ] Deduced a trap composed of 59 places in 347 ms of which 0 ms to minimize.
[2022-06-09 01:31:59] [INFO ] Deduced a trap composed of 89 places in 352 ms of which 0 ms to minimize.
[2022-06-09 01:32:00] [INFO ] Deduced a trap composed of 65 places in 345 ms of which 1 ms to minimize.
[2022-06-09 01:32:00] [INFO ] Deduced a trap composed of 63 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:32:01] [INFO ] Deduced a trap composed of 63 places in 342 ms of which 1 ms to minimize.
[2022-06-09 01:32:01] [INFO ] Deduced a trap composed of 63 places in 342 ms of which 1 ms to minimize.
[2022-06-09 01:32:02] [INFO ] Deduced a trap composed of 97 places in 364 ms of which 0 ms to minimize.
[2022-06-09 01:32:02] [INFO ] Deduced a trap composed of 68 places in 343 ms of which 1 ms to minimize.
[2022-06-09 01:32:03] [INFO ] Deduced a trap composed of 64 places in 334 ms of which 0 ms to minimize.
[2022-06-09 01:32:03] [INFO ] Deduced a trap composed of 58 places in 352 ms of which 0 ms to minimize.
[2022-06-09 01:32:04] [INFO ] Deduced a trap composed of 52 places in 351 ms of which 1 ms to minimize.
[2022-06-09 01:32:04] [INFO ] Deduced a trap composed of 86 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:32:05] [INFO ] Deduced a trap composed of 89 places in 357 ms of which 0 ms to minimize.
[2022-06-09 01:32:05] [INFO ] Deduced a trap composed of 89 places in 348 ms of which 0 ms to minimize.
[2022-06-09 01:32:06] [INFO ] Deduced a trap composed of 48 places in 354 ms of which 1 ms to minimize.
[2022-06-09 01:32:06] [INFO ] Deduced a trap composed of 50 places in 344 ms of which 0 ms to minimize.
[2022-06-09 01:32:07] [INFO ] Deduced a trap composed of 43 places in 342 ms of which 1 ms to minimize.
[2022-06-09 01:32:07] [INFO ] Deduced a trap composed of 55 places in 348 ms of which 0 ms to minimize.
[2022-06-09 01:32:08] [INFO ] Deduced a trap composed of 44 places in 340 ms of which 0 ms to minimize.
[2022-06-09 01:32:08] [INFO ] Deduced a trap composed of 58 places in 341 ms of which 1 ms to minimize.
[2022-06-09 01:32:09] [INFO ] Deduced a trap composed of 36 places in 356 ms of which 1 ms to minimize.
[2022-06-09 01:32:09] [INFO ] Deduced a trap composed of 26 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:32:10] [INFO ] Deduced a trap composed of 56 places in 342 ms of which 1 ms to minimize.
[2022-06-09 01:32:10] [INFO ] Deduced a trap composed of 7 places in 367 ms of which 0 ms to minimize.
[2022-06-09 01:32:11] [INFO ] Deduced a trap composed of 68 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:32:11] [INFO ] Deduced a trap composed of 19 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:32:11] [INFO ] Deduced a trap composed of 99 places in 344 ms of which 1 ms to minimize.
[2022-06-09 01:32:12] [INFO ] Deduced a trap composed of 57 places in 313 ms of which 0 ms to minimize.
[2022-06-09 01:32:12] [INFO ] Deduced a trap composed of 58 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:32:13] [INFO ] Deduced a trap composed of 50 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:32:13] [INFO ] Deduced a trap composed of 14 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:32:14] [INFO ] Deduced a trap composed of 71 places in 352 ms of which 0 ms to minimize.
[2022-06-09 01:32:14] [INFO ] Deduced a trap composed of 70 places in 327 ms of which 1 ms to minimize.
[2022-06-09 01:32:15] [INFO ] Deduced a trap composed of 60 places in 325 ms of which 1 ms to minimize.
[2022-06-09 01:32:15] [INFO ] Deduced a trap composed of 42 places in 330 ms of which 0 ms to minimize.
[2022-06-09 01:32:16] [INFO ] Deduced a trap composed of 61 places in 337 ms of which 0 ms to minimize.
[2022-06-09 01:32:16] [INFO ] Deduced a trap composed of 104 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:32:17] [INFO ] Deduced a trap composed of 97 places in 321 ms of which 0 ms to minimize.
[2022-06-09 01:32:17] [INFO ] Deduced a trap composed of 46 places in 318 ms of which 0 ms to minimize.
[2022-06-09 01:32:18] [INFO ] Deduced a trap composed of 94 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:32:18] [INFO ] Deduced a trap composed of 58 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:32:18] [INFO ] Deduced a trap composed of 60 places in 315 ms of which 0 ms to minimize.
[2022-06-09 01:32:19] [INFO ] Deduced a trap composed of 88 places in 318 ms of which 0 ms to minimize.
[2022-06-09 01:32:19] [INFO ] Deduced a trap composed of 93 places in 335 ms of which 1 ms to minimize.
[2022-06-09 01:32:20] [INFO ] Deduced a trap composed of 78 places in 346 ms of which 0 ms to minimize.
[2022-06-09 01:32:20] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 21894 ms
[2022-06-09 01:32:20] [INFO ] Added : 51 causal constraints over 11 iterations in 24091 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[16244]
Interrupted Parikh walk after 3781092 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=126 ) properties (out of 1) seen :224570
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 51 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:32:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:32:50] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 01:32:51] [INFO ] Implicit Places using invariants in 414 ms returned []
[2022-06-09 01:32:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:32:51] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-09 01:32:51] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:32:58] [INFO ] Implicit Places using invariants and state equation in 6874 ms returned []
Implicit Place search using SMT with State Equation took 7288 ms to find 0 implicit places.
[2022-06-09 01:32:58] [INFO ] Redundant transitions in 124 ms returned []
[2022-06-09 01:32:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:32:58] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-09 01:32:59] [INFO ] Dead Transitions using invariants and state equation in 980 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:32:59] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 1000010 steps, including 2 resets, run finished after 2476 ms. (steps per millisecond=403 ) properties (out of 1) seen :6753
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1532 ms. (steps per millisecond=652 ) properties (out of 1) seen :16226
[2022-06-09 01:33:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:33:03] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 01:33:03] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:33:03] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2022-06-09 01:33:03] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:33:04] [INFO ] [Real]Added 296 Read/Feed constraints in 189 ms returned sat
[2022-06-09 01:33:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:33:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:33:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:33:04] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2022-06-09 01:33:04] [INFO ] [Nat]Added 296 Read/Feed constraints in 208 ms returned sat
[2022-06-09 01:33:05] [INFO ] Deduced a trap composed of 89 places in 339 ms of which 0 ms to minimize.
[2022-06-09 01:33:05] [INFO ] Deduced a trap composed of 70 places in 351 ms of which 1 ms to minimize.
[2022-06-09 01:33:06] [INFO ] Deduced a trap composed of 5 places in 352 ms of which 1 ms to minimize.
[2022-06-09 01:33:06] [INFO ] Deduced a trap composed of 83 places in 354 ms of which 1 ms to minimize.
[2022-06-09 01:33:07] [INFO ] Deduced a trap composed of 33 places in 349 ms of which 0 ms to minimize.
[2022-06-09 01:33:07] [INFO ] Deduced a trap composed of 32 places in 371 ms of which 0 ms to minimize.
[2022-06-09 01:33:08] [INFO ] Deduced a trap composed of 17 places in 345 ms of which 0 ms to minimize.
[2022-06-09 01:33:08] [INFO ] Deduced a trap composed of 96 places in 336 ms of which 1 ms to minimize.
[2022-06-09 01:33:08] [INFO ] Deduced a trap composed of 16 places in 341 ms of which 1 ms to minimize.
[2022-06-09 01:33:09] [INFO ] Deduced a trap composed of 91 places in 356 ms of which 1 ms to minimize.
[2022-06-09 01:33:09] [INFO ] Deduced a trap composed of 88 places in 340 ms of which 1 ms to minimize.
[2022-06-09 01:33:10] [INFO ] Deduced a trap composed of 87 places in 348 ms of which 0 ms to minimize.
[2022-06-09 01:33:10] [INFO ] Deduced a trap composed of 93 places in 347 ms of which 0 ms to minimize.
[2022-06-09 01:33:11] [INFO ] Deduced a trap composed of 83 places in 347 ms of which 1 ms to minimize.
[2022-06-09 01:33:11] [INFO ] Deduced a trap composed of 83 places in 348 ms of which 0 ms to minimize.
[2022-06-09 01:33:11] [INFO ] Deduced a trap composed of 84 places in 345 ms of which 0 ms to minimize.
[2022-06-09 01:33:12] [INFO ] Deduced a trap composed of 90 places in 333 ms of which 1 ms to minimize.
[2022-06-09 01:33:12] [INFO ] Deduced a trap composed of 96 places in 336 ms of which 0 ms to minimize.
[2022-06-09 01:33:13] [INFO ] Deduced a trap composed of 87 places in 343 ms of which 0 ms to minimize.
[2022-06-09 01:33:13] [INFO ] Deduced a trap composed of 80 places in 340 ms of which 0 ms to minimize.
[2022-06-09 01:33:14] [INFO ] Deduced a trap composed of 93 places in 345 ms of which 1 ms to minimize.
[2022-06-09 01:33:14] [INFO ] Deduced a trap composed of 93 places in 344 ms of which 0 ms to minimize.
[2022-06-09 01:33:15] [INFO ] Deduced a trap composed of 90 places in 336 ms of which 0 ms to minimize.
[2022-06-09 01:33:15] [INFO ] Deduced a trap composed of 84 places in 326 ms of which 1 ms to minimize.
[2022-06-09 01:33:15] [INFO ] Deduced a trap composed of 90 places in 331 ms of which 0 ms to minimize.
[2022-06-09 01:33:16] [INFO ] Deduced a trap composed of 93 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:33:16] [INFO ] Deduced a trap composed of 90 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:33:17] [INFO ] Deduced a trap composed of 88 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:33:17] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 12373 ms
[2022-06-09 01:33:17] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 210 ms.
[2022-06-09 01:33:19] [INFO ] Deduced a trap composed of 58 places in 341 ms of which 1 ms to minimize.
[2022-06-09 01:33:20] [INFO ] Deduced a trap composed of 59 places in 347 ms of which 0 ms to minimize.
[2022-06-09 01:33:20] [INFO ] Deduced a trap composed of 89 places in 337 ms of which 1 ms to minimize.
[2022-06-09 01:33:21] [INFO ] Deduced a trap composed of 65 places in 349 ms of which 0 ms to minimize.
[2022-06-09 01:33:21] [INFO ] Deduced a trap composed of 63 places in 345 ms of which 1 ms to minimize.
[2022-06-09 01:33:22] [INFO ] Deduced a trap composed of 63 places in 356 ms of which 1 ms to minimize.
[2022-06-09 01:33:22] [INFO ] Deduced a trap composed of 63 places in 365 ms of which 1 ms to minimize.
[2022-06-09 01:33:23] [INFO ] Deduced a trap composed of 97 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:33:23] [INFO ] Deduced a trap composed of 68 places in 349 ms of which 1 ms to minimize.
[2022-06-09 01:33:24] [INFO ] Deduced a trap composed of 64 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:33:24] [INFO ] Deduced a trap composed of 58 places in 325 ms of which 1 ms to minimize.
[2022-06-09 01:33:25] [INFO ] Deduced a trap composed of 52 places in 346 ms of which 0 ms to minimize.
[2022-06-09 01:33:25] [INFO ] Deduced a trap composed of 86 places in 360 ms of which 1 ms to minimize.
[2022-06-09 01:33:25] [INFO ] Deduced a trap composed of 89 places in 339 ms of which 0 ms to minimize.
[2022-06-09 01:33:26] [INFO ] Deduced a trap composed of 89 places in 345 ms of which 0 ms to minimize.
[2022-06-09 01:33:26] [INFO ] Deduced a trap composed of 48 places in 343 ms of which 0 ms to minimize.
[2022-06-09 01:33:27] [INFO ] Deduced a trap composed of 50 places in 343 ms of which 0 ms to minimize.
[2022-06-09 01:33:27] [INFO ] Deduced a trap composed of 43 places in 345 ms of which 0 ms to minimize.
[2022-06-09 01:33:28] [INFO ] Deduced a trap composed of 55 places in 339 ms of which 0 ms to minimize.
[2022-06-09 01:33:28] [INFO ] Deduced a trap composed of 44 places in 340 ms of which 0 ms to minimize.
[2022-06-09 01:33:29] [INFO ] Deduced a trap composed of 58 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:33:29] [INFO ] Deduced a trap composed of 36 places in 351 ms of which 0 ms to minimize.
[2022-06-09 01:33:30] [INFO ] Deduced a trap composed of 26 places in 339 ms of which 0 ms to minimize.
[2022-06-09 01:33:30] [INFO ] Deduced a trap composed of 56 places in 340 ms of which 0 ms to minimize.
[2022-06-09 01:33:31] [INFO ] Deduced a trap composed of 7 places in 365 ms of which 0 ms to minimize.
[2022-06-09 01:33:31] [INFO ] Deduced a trap composed of 68 places in 341 ms of which 1 ms to minimize.
[2022-06-09 01:33:32] [INFO ] Deduced a trap composed of 19 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:33:32] [INFO ] Deduced a trap composed of 99 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:33:33] [INFO ] Deduced a trap composed of 57 places in 325 ms of which 0 ms to minimize.
[2022-06-09 01:33:33] [INFO ] Deduced a trap composed of 58 places in 314 ms of which 1 ms to minimize.
[2022-06-09 01:33:34] [INFO ] Deduced a trap composed of 50 places in 334 ms of which 0 ms to minimize.
[2022-06-09 01:33:34] [INFO ] Deduced a trap composed of 14 places in 331 ms of which 1 ms to minimize.
[2022-06-09 01:33:34] [INFO ] Deduced a trap composed of 71 places in 342 ms of which 0 ms to minimize.
[2022-06-09 01:33:35] [INFO ] Deduced a trap composed of 70 places in 334 ms of which 1 ms to minimize.
[2022-06-09 01:33:35] [INFO ] Deduced a trap composed of 60 places in 340 ms of which 0 ms to minimize.
[2022-06-09 01:33:36] [INFO ] Deduced a trap composed of 42 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:33:36] [INFO ] Deduced a trap composed of 61 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:33:37] [INFO ] Deduced a trap composed of 104 places in 346 ms of which 0 ms to minimize.
[2022-06-09 01:33:37] [INFO ] Deduced a trap composed of 97 places in 355 ms of which 1 ms to minimize.
[2022-06-09 01:33:38] [INFO ] Deduced a trap composed of 46 places in 324 ms of which 0 ms to minimize.
[2022-06-09 01:33:38] [INFO ] Deduced a trap composed of 94 places in 317 ms of which 0 ms to minimize.
[2022-06-09 01:33:39] [INFO ] Deduced a trap composed of 58 places in 317 ms of which 1 ms to minimize.
[2022-06-09 01:33:39] [INFO ] Deduced a trap composed of 60 places in 320 ms of which 1 ms to minimize.
[2022-06-09 01:33:40] [INFO ] Deduced a trap composed of 88 places in 311 ms of which 0 ms to minimize.
[2022-06-09 01:33:40] [INFO ] Deduced a trap composed of 93 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:33:41] [INFO ] Deduced a trap composed of 78 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:33:41] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 21870 ms
[2022-06-09 01:33:41] [INFO ] Added : 51 causal constraints over 11 iterations in 24069 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[224570]
Interrupted Parikh walk after 3761289 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=125 ) properties (out of 1) seen :176
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 54 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:34:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:34:11] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 01:34:11] [INFO ] Implicit Places using invariants in 404 ms returned []
[2022-06-09 01:34:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:34:12] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 01:34:12] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:34:19] [INFO ] Implicit Places using invariants and state equation in 7269 ms returned []
Implicit Place search using SMT with State Equation took 7674 ms to find 0 implicit places.
[2022-06-09 01:34:19] [INFO ] Redundant transitions in 129 ms returned []
[2022-06-09 01:34:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:34:19] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:34:20] [INFO ] Dead Transitions using invariants and state equation in 1040 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-11 in 249624 ms.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-12
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:34:20] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2022-06-09 01:34:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:34:20] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 01:34:20] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:34:21] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2022-06-09 01:34:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:34:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:34:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:34:21] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2022-06-09 01:34:21] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:34:21] [INFO ] [Nat]Added 296 Read/Feed constraints in 203 ms returned sat
[2022-06-09 01:34:22] [INFO ] Deduced a trap composed of 99 places in 449 ms of which 1 ms to minimize.
[2022-06-09 01:34:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 611 ms
[2022-06-09 01:34:22] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 230 ms.
[2022-06-09 01:34:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:34:26] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2782 ms. (steps per millisecond=359 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1895 ms. (steps per millisecond=527 ) properties (out of 1) seen :0
[2022-06-09 01:34:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:34:30] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 01:34:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:34:31] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2022-06-09 01:34:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:34:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:34:32] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2022-06-09 01:34:32] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:34:32] [INFO ] [Nat]Added 296 Read/Feed constraints in 212 ms returned sat
[2022-06-09 01:34:32] [INFO ] Deduced a trap composed of 99 places in 436 ms of which 0 ms to minimize.
[2022-06-09 01:34:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 606 ms
[2022-06-09 01:34:33] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 216 ms.
[2022-06-09 01:34:38] [INFO ] Deduced a trap composed of 18 places in 449 ms of which 0 ms to minimize.
[2022-06-09 01:34:38] [INFO ] Deduced a trap composed of 17 places in 331 ms of which 0 ms to minimize.
[2022-06-09 01:34:38] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 0 ms to minimize.
[2022-06-09 01:34:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1472 ms
[2022-06-09 01:34:39] [INFO ] Added : 155 causal constraints over 32 iterations in 6691 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1313800 steps, including 1000 resets, run finished after 10621 ms. (steps per millisecond=123 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 52 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 51 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:34:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:34:50] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 01:34:50] [INFO ] Implicit Places using invariants in 409 ms returned []
[2022-06-09 01:34:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:34:50] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:34:51] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:34:57] [INFO ] Implicit Places using invariants and state equation in 7097 ms returned []
Implicit Place search using SMT with State Equation took 7508 ms to find 0 implicit places.
[2022-06-09 01:34:58] [INFO ] Redundant transitions in 127 ms returned []
[2022-06-09 01:34:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:34:58] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-09 01:34:59] [INFO ] Dead Transitions using invariants and state equation in 1030 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-12 in 38617 ms.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-14
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:34:59] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2022-06-09 01:34:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:34:59] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 01:34:59] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:34:59] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2022-06-09 01:34:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:34:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:35:00] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2022-06-09 01:35:00] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:35:00] [INFO ] [Nat]Added 296 Read/Feed constraints in 219 ms returned sat
[2022-06-09 01:35:00] [INFO ] Deduced a trap composed of 104 places in 360 ms of which 1 ms to minimize.
[2022-06-09 01:35:01] [INFO ] Deduced a trap composed of 98 places in 362 ms of which 0 ms to minimize.
[2022-06-09 01:35:01] [INFO ] Deduced a trap composed of 76 places in 363 ms of which 1 ms to minimize.
[2022-06-09 01:35:02] [INFO ] Deduced a trap composed of 5 places in 374 ms of which 0 ms to minimize.
[2022-06-09 01:35:02] [INFO ] Deduced a trap composed of 89 places in 337 ms of which 0 ms to minimize.
[2022-06-09 01:35:03] [INFO ] Deduced a trap composed of 34 places in 335 ms of which 1 ms to minimize.
[2022-06-09 01:35:03] [INFO ] Deduced a trap composed of 32 places in 336 ms of which 0 ms to minimize.
[2022-06-09 01:35:04] [INFO ] Deduced a trap composed of 95 places in 345 ms of which 0 ms to minimize.
[2022-06-09 01:35:04] [INFO ] Deduced a trap composed of 94 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:35:04] [INFO ] Deduced a trap composed of 80 places in 333 ms of which 0 ms to minimize.
[2022-06-09 01:35:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 51 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:35:04] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2485 ms. (steps per millisecond=402 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1902 ms. (steps per millisecond=525 ) properties (out of 1) seen :0
[2022-06-09 01:35:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:35:09] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 01:35:09] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:35:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:35:09] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2022-06-09 01:35:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:35:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:35:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:35:10] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2022-06-09 01:35:10] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:35:10] [INFO ] [Nat]Added 296 Read/Feed constraints in 223 ms returned sat
[2022-06-09 01:35:11] [INFO ] Deduced a trap composed of 104 places in 361 ms of which 0 ms to minimize.
[2022-06-09 01:35:11] [INFO ] Deduced a trap composed of 98 places in 366 ms of which 0 ms to minimize.
[2022-06-09 01:35:12] [INFO ] Deduced a trap composed of 76 places in 363 ms of which 0 ms to minimize.
[2022-06-09 01:35:12] [INFO ] Deduced a trap composed of 5 places in 360 ms of which 1 ms to minimize.
[2022-06-09 01:35:12] [INFO ] Deduced a trap composed of 89 places in 344 ms of which 0 ms to minimize.
[2022-06-09 01:35:13] [INFO ] Deduced a trap composed of 34 places in 325 ms of which 1 ms to minimize.
[2022-06-09 01:35:13] [INFO ] Deduced a trap composed of 32 places in 347 ms of which 1 ms to minimize.
[2022-06-09 01:35:14] [INFO ] Deduced a trap composed of 95 places in 346 ms of which 0 ms to minimize.
[2022-06-09 01:35:14] [INFO ] Deduced a trap composed of 94 places in 332 ms of which 0 ms to minimize.
[2022-06-09 01:35:15] [INFO ] Deduced a trap composed of 80 places in 345 ms of which 1 ms to minimize.
[2022-06-09 01:35:15] [INFO ] Deduced a trap composed of 79 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:35:15] [INFO ] Deduced a trap composed of 34 places in 331 ms of which 1 ms to minimize.
[2022-06-09 01:35:16] [INFO ] Deduced a trap composed of 79 places in 341 ms of which 0 ms to minimize.
[2022-06-09 01:35:16] [INFO ] Deduced a trap composed of 37 places in 330 ms of which 0 ms to minimize.
[2022-06-09 01:35:17] [INFO ] Deduced a trap composed of 93 places in 336 ms of which 0 ms to minimize.
[2022-06-09 01:35:17] [INFO ] Deduced a trap composed of 26 places in 335 ms of which 0 ms to minimize.
[2022-06-09 01:35:18] [INFO ] Deduced a trap composed of 32 places in 338 ms of which 0 ms to minimize.
[2022-06-09 01:35:18] [INFO ] Deduced a trap composed of 36 places in 336 ms of which 1 ms to minimize.
[2022-06-09 01:35:18] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 0 ms to minimize.
[2022-06-09 01:35:18] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 8220 ms
[2022-06-09 01:35:19] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 207 ms.
[2022-06-09 01:35:24] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 0 ms to minimize.
[2022-06-09 01:35:24] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 1 ms to minimize.
[2022-06-09 01:35:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 746 ms
[2022-06-09 01:35:24] [INFO ] Added : 152 causal constraints over 31 iterations in 5938 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1331000 steps, including 1000 resets, run finished after 10847 ms. (steps per millisecond=122 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 62 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 50 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:35:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:35:35] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 01:35:36] [INFO ] Implicit Places using invariants in 422 ms returned []
[2022-06-09 01:35:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:35:36] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 01:35:36] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:35:43] [INFO ] Implicit Places using invariants and state equation in 7241 ms returned []
Implicit Place search using SMT with State Equation took 7665 ms to find 0 implicit places.
[2022-06-09 01:35:43] [INFO ] Redundant transitions in 125 ms returned []
[2022-06-09 01:35:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:35:43] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 01:35:44] [INFO ] Dead Transitions using invariants and state equation in 982 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-14 in 45632 ms.
[2022-06-09 01:35:45] [INFO ] Flatten gal took : 396 ms
[2022-06-09 01:35:45] [INFO ] Applying decomposition
[2022-06-09 01:35:45] [INFO ] Flatten gal took : 194 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/graph12545277034415711098.txt, -o, /tmp/graph12545277034415711098.bin, -w, /tmp/graph12545277034415711098.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/graph12545277034415711098.bin, -l, -1, -v, -w, /tmp/graph12545277034415711098.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 01:35:46] [INFO ] Decomposing Gal with order
[2022-06-09 01:35:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 01:35:46] [INFO ] Removed a total of 424 redundant transitions.
[2022-06-09 01:35:46] [INFO ] Flatten gal took : 463 ms
[2022-06-09 01:35:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 30 ms.
[2022-06-09 01:35:46] [INFO ] Time to serialize gal into /tmp/UpperBounds13119968233742136357.gal : 71 ms
[2022-06-09 01:35:46] [INFO ] Time to serialize properties into /tmp/UpperBounds14216560243664560122.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/UpperBounds13119968233742136357.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14216560243664560122.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/UpperBounds13119968233742136357.gal -t CGAL -reachable-file /tmp/UpperBounds14216560243664560122.prop --nowitness
Loading property file /tmp/UpperBounds14216560243664560122.prop.
Detected timeout of ITS tools.
[2022-06-09 02:00:43] [INFO ] Flatten gal took : 4296 ms
[2022-06-09 02:00:44] [INFO ] Time to serialize gal into /tmp/UpperBounds4055905022234223446.gal : 432 ms
[2022-06-09 02:00:44] [INFO ] Time to serialize properties into /tmp/UpperBounds12356213896139861690.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/UpperBounds4055905022234223446.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12356213896139861690.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/UpperBounds4055905022234223446.gal -t CGAL -reachable-file /tmp/UpperBounds12356213896139861690.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds12356213896139861690.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-q8m016"
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-q8m016, 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-165472292600034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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