MCC'2022- Execution of r143-tall-165271830200073

About the Execution of 2021-gold for JoinFreeModules-PT-0200

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
860.188	294631.00	321019.00	826.60	202 202 202 203 200 201 200 201 201 200 200 203 202 201 201 200	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.r143-tall-165271830200073.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 JoinFreeModules-PT-0200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-tall-165271830200073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 840K
-rw-r--r-- 1 mcc users 7.7K Apr 30 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 02:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 613K May 10 09:34 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 JoinFreeModules-PT-0200-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652739606778

Running Version 0
[2022-05-16 22:20:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 22:20:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 22:20:08] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2022-05-16 22:20:08] [INFO ] Transformed 1001 places.
[2022-05-16 22:20:08] [INFO ] Transformed 1601 transitions.
[2022-05-16 22:20:08] [INFO ] Parsed PT model containing 1001 places and 1601 transitions in 166 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 109 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2022-05-16 22:20:08] [INFO ] Computed 200 place invariants in 31 ms
Incomplete random walk after 10046 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=85 ) properties (out of 16) seen :1009
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 16) seen :1010
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 16) seen :1018
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 16) seen :1010
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 16) seen :1021
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 16) seen :1009
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 16) seen :1018
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 16) seen :1009
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 16) seen :1018
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 16) seen :1018
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :1010
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 16) seen :1009
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 16) seen :1021
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 16) seen :1018
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 16) seen :1018
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :1018
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :1010
// Phase 1: matrix 1601 rows 1000 cols
[2022-05-16 22:20:10] [INFO ] Computed 200 place invariants in 18 ms
[2022-05-16 22:20:10] [INFO ] [Real]Absence check using 200 positive place invariants in 56 ms returned sat
[2022-05-16 22:20:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:11] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2022-05-16 22:20:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:11] [INFO ] [Nat]Absence check using 200 positive place invariants in 38 ms returned sat
[2022-05-16 22:20:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:13] [INFO ] [Nat]Absence check using state equation in 1767 ms returned sat
[2022-05-16 22:20:13] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 4 ms to minimize.
[2022-05-16 22:20:13] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2022-05-16 22:20:13] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2022-05-16 22:20:13] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-16 22:20:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-16 22:20:13] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:20:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-16 22:20:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-16 22:20:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 777 ms
[2022-05-16 22:20:13] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 103 ms.
[2022-05-16 22:20:16] [INFO ] Deduced a trap composed of 3 places in 400 ms of which 1 ms to minimize.
[2022-05-16 22:20:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-16 22:20:16] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2022-05-16 22:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:17] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2022-05-16 22:20:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:17] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2022-05-16 22:20:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:18] [INFO ] [Nat]Absence check using state equation in 1572 ms returned sat
[2022-05-16 22:20:18] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-16 22:20:18] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-16 22:20:18] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-16 22:20:19] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-16 22:20:19] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:20:19] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:20:19] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-16 22:20:19] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-16 22:20:19] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-16 22:20:19] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:20:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 805 ms
[2022-05-16 22:20:19] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 70 ms.
[2022-05-16 22:20:22] [INFO ] Deduced a trap composed of 3 places in 402 ms of which 1 ms to minimize.
[2022-05-16 22:20:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-05-16 22:20:22] [INFO ] [Real]Absence check using 200 positive place invariants in 43 ms returned sat
[2022-05-16 22:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:23] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2022-05-16 22:20:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:23] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2022-05-16 22:20:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:25] [INFO ] [Nat]Absence check using state equation in 1812 ms returned sat
[2022-05-16 22:20:25] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-16 22:20:25] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-16 22:20:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-05-16 22:20:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-16 22:20:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-16 22:20:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-16 22:20:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-16 22:20:25] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:20:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 684 ms
[2022-05-16 22:20:25] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 76 ms.
[2022-05-16 22:20:28] [INFO ] Deduced a trap composed of 3 places in 384 ms of which 1 ms to minimize.
[2022-05-16 22:20:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-05-16 22:20:28] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2022-05-16 22:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:29] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2022-05-16 22:20:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:29] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2022-05-16 22:20:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:30] [INFO ] [Nat]Absence check using state equation in 1589 ms returned sat
[2022-05-16 22:20:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-16 22:20:30] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-16 22:20:30] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:20:31] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:20:31] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2022-05-16 22:20:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 6 ms to minimize.
[2022-05-16 22:20:31] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:20:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:20:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 705 ms
[2022-05-16 22:20:31] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 76 ms.
[2022-05-16 22:20:34] [INFO ] Added : 135 causal constraints over 27 iterations in 2586 ms. Result :unknown
[2022-05-16 22:20:34] [INFO ] [Real]Absence check using 200 positive place invariants in 37 ms returned sat
[2022-05-16 22:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:34] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2022-05-16 22:20:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:34] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2022-05-16 22:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:36] [INFO ] [Nat]Absence check using state equation in 1370 ms returned sat
[2022-05-16 22:20:36] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:20:36] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-16 22:20:36] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-16 22:20:36] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-16 22:20:36] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:20:36] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:20:36] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:20:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-16 22:20:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 701 ms
[2022-05-16 22:20:36] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 70 ms.
[2022-05-16 22:20:39] [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 4
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-05-16 22:20:39] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2022-05-16 22:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:40] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2022-05-16 22:20:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:40] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2022-05-16 22:20:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:42] [INFO ] [Nat]Absence check using state equation in 2568 ms returned sat
[2022-05-16 22:20:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-16 22:20:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-16 22:20:43] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-16 22:20:43] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:20:43] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:20:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-16 22:20:43] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:20:43] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:20:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 727 ms
[2022-05-16 22:20:43] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 87 ms.
[2022-05-16 22:20:45] [INFO ] Added : 45 causal constraints over 9 iterations in 1584 ms. Result :unknown
[2022-05-16 22:20:45] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2022-05-16 22:20:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:45] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2022-05-16 22:20:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:45] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2022-05-16 22:20:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:48] [INFO ] [Nat]Absence check using state equation in 2057 ms returned sat
[2022-05-16 22:20:48] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-16 22:20:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-16 22:20:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-16 22:20:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 9 ms to minimize.
[2022-05-16 22:20:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:20:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-16 22:20:48] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2022-05-16 22:20:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-16 22:20:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-16 22:20:48] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-16 22:20:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:20:49] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2022-05-16 22:20:49] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:20:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-16 22:20:49] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-16 22:20:50] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2011 ms
[2022-05-16 22:20:50] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 77 ms.
[2022-05-16 22:20:51] [INFO ] Deduced a trap composed of 3 places in 390 ms of which 1 ms to minimize.
[2022-05-16 22:20:51] [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 6
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-05-16 22:20:51] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2022-05-16 22:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:51] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2022-05-16 22:20:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:51] [INFO ] [Nat]Absence check using 200 positive place invariants in 38 ms returned sat
[2022-05-16 22:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:53] [INFO ] [Nat]Absence check using state equation in 1930 ms returned sat
[2022-05-16 22:20:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-16 22:20:53] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:20:54] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2022-05-16 22:20:54] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:20:54] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:20:54] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:20:54] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2022-05-16 22:20:54] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:20:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 656 ms
[2022-05-16 22:20:54] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 67 ms.
[2022-05-16 22:20:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-05-16 22:20:56] [INFO ] [Real]Absence check using 200 positive place invariants in 46 ms returned sat
[2022-05-16 22:20:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:57] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2022-05-16 22:20:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:57] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2022-05-16 22:20:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:59] [INFO ] [Nat]Absence check using state equation in 1604 ms returned sat
[2022-05-16 22:20:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-16 22:20:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-16 22:20:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-16 22:20:59] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:20:59] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:20:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-16 22:20:59] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-16 22:20:59] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-05-16 22:20:59] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:20:59] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:20:59] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:21:00] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-05-16 22:21:00] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1010 ms
[2022-05-16 22:21:00] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 67 ms.
[2022-05-16 22:21:02] [INFO ] Deduced a trap composed of 3 places in 397 ms of which 3 ms to minimize.
[2022-05-16 22:21:02] [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 8
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-05-16 22:21:02] [INFO ] [Real]Absence check using 200 positive place invariants in 40 ms returned sat
[2022-05-16 22:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:03] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2022-05-16 22:21:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:21:03] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2022-05-16 22:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:04] [INFO ] [Nat]Absence check using state equation in 1347 ms returned sat
[2022-05-16 22:21:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-16 22:21:04] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-16 22:21:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-16 22:21:05] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:21:05] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:21:05] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-05-16 22:21:05] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:21:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 694 ms
[2022-05-16 22:21:05] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 69 ms.
[2022-05-16 22:21:08] [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 9
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-05-16 22:21:08] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2022-05-16 22:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:08] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2022-05-16 22:21:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:21:09] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2022-05-16 22:21:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:10] [INFO ] [Nat]Absence check using state equation in 1301 ms returned sat
[2022-05-16 22:21:10] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-16 22:21:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-16 22:21:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-16 22:21:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-16 22:21:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-16 22:21:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-16 22:21:10] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:21:10] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:21:10] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:21:11] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:21:11] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-16 22:21:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 843 ms
[2022-05-16 22:21:11] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 65 ms.
[2022-05-16 22:21:14] [INFO ] Deduced a trap composed of 3 places in 366 ms of which 1 ms to minimize.
[2022-05-16 22:21: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 10
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-05-16 22:21:14] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2022-05-16 22:21:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:14] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2022-05-16 22:21:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:21:14] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2022-05-16 22:21:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:16] [INFO ] [Nat]Absence check using state equation in 1800 ms returned sat
[2022-05-16 22:21:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-16 22:21:16] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:21:16] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:21:17] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-16 22:21:17] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:21:17] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-16 22:21:17] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:21:17] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:21:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 666 ms
[2022-05-16 22:21:17] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 70 ms.
[2022-05-16 22:21:19] [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 11
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-05-16 22:21:20] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2022-05-16 22:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:20] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2022-05-16 22:21:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:21:20] [INFO ] [Nat]Absence check using 200 positive place invariants in 43 ms returned sat
[2022-05-16 22:21:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:22] [INFO ] [Nat]Absence check using state equation in 1426 ms returned sat
[2022-05-16 22:21:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-16 22:21:22] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:21:22] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-16 22:21:22] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-16 22:21:22] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:21:22] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-16 22:21:22] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-16 22:21:22] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:21:22] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-05-16 22:21:22] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:21:22] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 801 ms
[2022-05-16 22:21:22] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 70 ms.
[2022-05-16 22:21:25] [INFO ] Deduced a trap composed of 3 places in 364 ms of which 0 ms to minimize.
[2022-05-16 22:21:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
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-05-16 22:21:25] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2022-05-16 22:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:26] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2022-05-16 22:21:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:21:26] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2022-05-16 22:21:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:28] [INFO ] [Nat]Absence check using state equation in 1563 ms returned sat
[2022-05-16 22:21:28] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-16 22:21:28] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:21:28] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-16 22:21:28] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:21:28] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-05-16 22:21:28] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:21:28] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-16 22:21:28] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:21:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 633 ms
[2022-05-16 22:21:28] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 72 ms.
[2022-05-16 22:21:31] [INFO ] Added : 155 causal constraints over 31 iterations in 2687 ms. Result :unknown
[2022-05-16 22:21:31] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2022-05-16 22:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:31] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2022-05-16 22:21:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:21:32] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2022-05-16 22:21:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:33] [INFO ] [Nat]Absence check using state equation in 1412 ms returned sat
[2022-05-16 22:21:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-16 22:21:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-16 22:21:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-16 22:21:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-16 22:21:33] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-16 22:21:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-16 22:21:33] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-16 22:21:34] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:21:34] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:21:34] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:21:34] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-16 22:21:34] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:21:34] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:21:34] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-05-16 22:21:34] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1144 ms
[2022-05-16 22:21:34] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 72 ms.
[2022-05-16 22: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 14
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-05-16 22:21:37] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2022-05-16 22:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:37] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2022-05-16 22:21:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:21:37] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2022-05-16 22:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:21:38] [INFO ] [Nat]Absence check using state equation in 1226 ms returned sat
[2022-05-16 22:21:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-16 22:21:39] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:21:39] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:21:39] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-16 22:21:39] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:21:39] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-16 22:21:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 468 ms
[2022-05-16 22:21:39] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 63 ms.
[2022-05-16 22:21:42] [INFO ] Added : 170 causal constraints over 34 iterations in 3190 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[2, 9, 2, 12, 200, 10, 200, 10, 10, 200, 200, 12, 9, 10, 10, 200]
Interrupted Parikh walk after 1496143 steps, including 76 resets, run timeout after 30001 ms. (steps per millisecond=49 ) properties (out of 16) seen :1559
Interrupted Parikh walk after 1589719 steps, including 79 resets, run timeout after 30001 ms. (steps per millisecond=52 ) properties (out of 16) seen :1777
Interrupted Parikh walk after 1759560 steps, including 96 resets, run timeout after 30001 ms. (steps per millisecond=58 ) properties (out of 16) seen :1477
Interrupted Parikh walk after 1553397 steps, including 86 resets, run timeout after 30001 ms. (steps per millisecond=51 ) properties (out of 16) seen :1491
Support contains 16 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Graph (complete) has 2400 edges and 1000 vertex of which 80 are kept as prefixes of interest. Removing 920 places using SCC suffix rule.5 ms
Discarding 920 places :
Also discarding 1472 output transitions
Drop transitions removed 1472 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 39 ms. Remains 80 /1000 variables (removed 920) and now considering 128/1601 (removed 1473) transitions.
// Phase 1: matrix 128 rows 80 cols
[2022-05-16 22:23:42] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-16 22:23:42] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/1000 places, 128/1601 transitions.
// Phase 1: matrix 128 rows 80 cols
[2022-05-16 22:23:42] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 1000022 steps, including 2 resets, run finished after 1051 ms. (steps per millisecond=951 ) properties (out of 16) seen :3201
FORMULA JoinFreeModules-PT-0200-UpperBounds-11 203 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1097 ms. (steps per millisecond=911 ) properties (out of 15) seen :1461
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1088 ms. (steps per millisecond=919 ) properties (out of 15) seen :1577
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1081 ms. (steps per millisecond=925 ) properties (out of 15) seen :1449
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1096 ms. (steps per millisecond=912 ) properties (out of 15) seen :1588
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1082 ms. (steps per millisecond=924 ) properties (out of 15) seen :1402
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1061 ms. (steps per millisecond=942 ) properties (out of 15) seen :1512
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1079 ms. (steps per millisecond=926 ) properties (out of 15) seen :1376
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1048 ms. (steps per millisecond=954 ) properties (out of 15) seen :1537
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1117 ms. (steps per millisecond=895 ) properties (out of 15) seen :1549
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1082 ms. (steps per millisecond=924 ) properties (out of 15) seen :1392
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1072 ms. (steps per millisecond=932 ) properties (out of 15) seen :1370
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1105 ms. (steps per millisecond=904 ) properties (out of 15) seen :1501
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1078 ms. (steps per millisecond=927 ) properties (out of 15) seen :1500
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1066 ms. (steps per millisecond=938 ) properties (out of 15) seen :1550
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1088 ms. (steps per millisecond=919 ) properties (out of 15) seen :1413
// Phase 1: matrix 128 rows 80 cols
[2022-05-16 22:23:59] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-16 22:24:00] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:00] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-16 22:24:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:00] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2022-05-16 22:24:00] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-05-16 22:24:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2022-05-16 22:24:00] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:24:00] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:24:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-05-16 22:24:00] [INFO ] Added : 47 causal constraints over 10 iterations in 172 ms. Result :sat
Minimization took 42 ms.
[2022-05-16 22:24:00] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:00] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-16 22:24:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:00] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2022-05-16 22:24:00] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:24:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-16 22:24:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 49 ms
[2022-05-16 22:24:00] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:24:00] [INFO ] Added : 50 causal constraints over 11 iterations in 138 ms. Result :sat
Minimization took 45 ms.
[2022-05-16 22:24:00] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:00] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 22:24:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:00] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2022-05-16 22:24:00] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:24:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2022-05-16 22:24:00] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:24:01] [INFO ] Added : 53 causal constraints over 11 iterations in 153 ms. Result :sat
Minimization took 39 ms.
[2022-05-16 22:24:01] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:01] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 22:24:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:01] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2022-05-16 22:24:01] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:24:01] [INFO ] Added : 40 causal constraints over 9 iterations in 228 ms. Result :sat
Minimization took 47 ms.
[2022-05-16 22:24:01] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:01] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 22:24:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:01] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2022-05-16 22:24:01] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:24:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-16 22:24:01] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:24:01] [INFO ] Added : 57 causal constraints over 12 iterations in 139 ms. Result :sat
Minimization took 54 ms.
[2022-05-16 22:24:02] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:02] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 22:24:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:02] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2022-05-16 22:24:02] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-05-16 22:24:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2022-05-16 22:24:02] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 22:24:02] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:24:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-16 22:24:02] [INFO ] Added : 53 causal constraints over 12 iterations in 178 ms. Result :sat
Minimization took 51 ms.
[2022-05-16 22:24:02] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:02] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 22:24:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:02] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-05-16 22:24:02] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2022-05-16 22:24:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-16 22:24:02] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:24:02] [INFO ] Added : 45 causal constraints over 10 iterations in 135 ms. Result :sat
Minimization took 39 ms.
[2022-05-16 22:24:02] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:02] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 22:24:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:02] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2022-05-16 22:24:02] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2022-05-16 22:24:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2022-05-16 22:24:02] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:24:03] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-16 22:24:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-16 22:24:03] [INFO ] Added : 51 causal constraints over 11 iterations in 174 ms. Result :sat
Minimization took 41 ms.
[2022-05-16 22:24:03] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:03] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 22:24:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:03] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-05-16 22:24:03] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:24:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-16 22:24:03] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:24:03] [INFO ] Added : 37 causal constraints over 9 iterations in 122 ms. Result :sat
Minimization took 32 ms.
[2022-05-16 22:24:03] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:03] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 22:24:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2022-05-16 22:24:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:03] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2022-05-16 22:24:03] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:24:03] [INFO ] Added : 46 causal constraints over 10 iterations in 131 ms. Result :sat
Minimization took 45 ms.
[2022-05-16 22:24:03] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:03] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 22:24:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:03] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-16 22:24:03] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-05-16 22:24:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 22:24:04] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:24:04] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:24:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 51 ms
[2022-05-16 22:24:04] [INFO ] Added : 55 causal constraints over 12 iterations in 199 ms. Result :sat
Minimization took 47 ms.
[2022-05-16 22:24:04] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:04] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 22:24:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:04] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2022-05-16 22:24:04] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2022-05-16 22:24:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:24:04] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-16 22:24:04] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2022-05-16 22:24:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 51 ms
[2022-05-16 22:24:04] [INFO ] Added : 51 causal constraints over 11 iterations in 164 ms. Result :sat
Minimization took 45 ms.
[2022-05-16 22:24:04] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:04] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 22:24:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:04] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2022-05-16 22:24:04] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-16 22:24:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:24:05] [INFO ] Added : 48 causal constraints over 11 iterations in 183 ms. Result :sat
Minimization took 30 ms.
[2022-05-16 22:24:05] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:05] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-16 22:24:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:05] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-05-16 22:24:05] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2022-05-16 22:24:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2022-05-16 22:24:05] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:24:05] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-16 22:24:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-05-16 22:24:05] [INFO ] Added : 47 causal constraints over 11 iterations in 166 ms. Result :sat
Minimization took 53 ms.
[2022-05-16 22:24:05] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 22:24:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:05] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-16 22:24:05] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:24:05] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:24:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 37 ms
[2022-05-16 22:24:05] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:24:05] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-16 22:24:05] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:24:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2022-05-16 22:24:05] [INFO ] Added : 43 causal constraints over 10 iterations in 193 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[198, 199, 199, 202, 200, 201, 200, 201, 201, 200, 200, 200, 201, 201, 200]
Incomplete Parikh walk after 8300 steps, including 120 resets, run finished after 28 ms. (steps per millisecond=296 ) properties (out of 15) seen :1034 could not realise parikh vector
Incomplete Parikh walk after 31600 steps, including 104 resets, run finished after 59 ms. (steps per millisecond=535 ) properties (out of 15) seen :1237 could not realise parikh vector
Incomplete Parikh walk after 30200 steps, including 106 resets, run finished after 50 ms. (steps per millisecond=604 ) properties (out of 15) seen :1236 could not realise parikh vector
Incomplete Parikh walk after 75300 steps, including 104 resets, run finished after 128 ms. (steps per millisecond=588 ) properties (out of 15) seen :1226 could not realise parikh vector
Incomplete Parikh walk after 11700 steps, including 125 resets, run finished after 29 ms. (steps per millisecond=403 ) properties (out of 15) seen :1039 could not realise parikh vector
Incomplete Parikh walk after 10200 steps, including 124 resets, run finished after 26 ms. (steps per millisecond=392 ) properties (out of 15) seen :1036 could not realise parikh vector
Incomplete Parikh walk after 29100 steps, including 106 resets, run finished after 48 ms. (steps per millisecond=606 ) properties (out of 15) seen :1222 could not realise parikh vector
Incomplete Parikh walk after 33600 steps, including 109 resets, run finished after 63 ms. (steps per millisecond=533 ) properties (out of 15) seen :1233 could not realise parikh vector
Incomplete Parikh walk after 14500 steps, including 113 resets, run finished after 30 ms. (steps per millisecond=483 ) properties (out of 15) seen :1031 could not realise parikh vector
Incomplete Parikh walk after 32900 steps, including 106 resets, run finished after 72 ms. (steps per millisecond=456 ) properties (out of 15) seen :1239 could not realise parikh vector
Incomplete Parikh walk after 13300 steps, including 129 resets, run finished after 34 ms. (steps per millisecond=391 ) properties (out of 15) seen :1041 could not realise parikh vector
Incomplete Parikh walk after 33900 steps, including 103 resets, run finished after 59 ms. (steps per millisecond=574 ) properties (out of 15) seen :1221 could not realise parikh vector
FORMULA JoinFreeModules-PT-0200-UpperBounds-03 203 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 78600 steps, including 104 resets, run finished after 132 ms. (steps per millisecond=595 ) properties (out of 14) seen :1227 could not realise parikh vector
Incomplete Parikh walk after 75200 steps, including 106 resets, run finished after 131 ms. (steps per millisecond=574 ) properties (out of 14) seen :1222 could not realise parikh vector
Incomplete Parikh walk after 69300 steps, including 102 resets, run finished after 116 ms. (steps per millisecond=597 ) properties (out of 14) seen :1223 could not realise parikh vector
Support contains 14 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 70 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 4 ms. Remains 70 /80 variables (removed 10) and now considering 112/128 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 70/80 places, 112/128 transitions.
// Phase 1: matrix 112 rows 70 cols
[2022-05-16 22:24:06] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000021 steps, including 2 resets, run finished after 911 ms. (steps per millisecond=1097 ) properties (out of 14) seen :2789
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 981 ms. (steps per millisecond=1019 ) properties (out of 14) seen :1498
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 960 ms. (steps per millisecond=1041 ) properties (out of 14) seen :1621
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 973 ms. (steps per millisecond=1027 ) properties (out of 14) seen :1509
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 966 ms. (steps per millisecond=1035 ) properties (out of 14) seen :1508
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 956 ms. (steps per millisecond=1046 ) properties (out of 14) seen :1628
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 967 ms. (steps per millisecond=1034 ) properties (out of 14) seen :1430
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 954 ms. (steps per millisecond=1048 ) properties (out of 14) seen :1561
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 950 ms. (steps per millisecond=1052 ) properties (out of 14) seen :1604
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 964 ms. (steps per millisecond=1037 ) properties (out of 14) seen :1481
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 967 ms. (steps per millisecond=1034 ) properties (out of 14) seen :1463
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 988 ms. (steps per millisecond=1012 ) properties (out of 14) seen :1619
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 951 ms. (steps per millisecond=1051 ) properties (out of 14) seen :1560
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 948 ms. (steps per millisecond=1054 ) properties (out of 14) seen :1547
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 978 ms. (steps per millisecond=1022 ) properties (out of 14) seen :1469
// Phase 1: matrix 112 rows 70 cols
[2022-05-16 22:24:21] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-16 22:24:21] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:21] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-16 22:24:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:21] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2022-05-16 22:24:21] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:24:21] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:24:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 32 ms
[2022-05-16 22:24:21] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:21] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:24:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:21] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-16 22:24:21] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 22:24:22] [INFO ] Added : 34 causal constraints over 8 iterations in 208 ms. Result :sat
Minimization took 52 ms.
[2022-05-16 22:24:22] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:22] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 22:24:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:22] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2022-05-16 22:24:22] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:24:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2022-05-16 22:24:22] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:22] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:24:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:22] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-05-16 22:24:22] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:24:22] [INFO ] Added : 29 causal constraints over 6 iterations in 106 ms. Result :sat
Minimization took 36 ms.
[2022-05-16 22:24:22] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:22] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:24:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:22] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2022-05-16 22:24:22] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-16 22:24:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-16 22:24:22] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:24:22] [INFO ] Added : 35 causal constraints over 7 iterations in 72 ms. Result :sat
Minimization took 55 ms.
[2022-05-16 22:24:22] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:22] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 22:24:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:23] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-05-16 22:24:23] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-16 22:24:23] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2022-05-16 22:24:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 43 ms
[2022-05-16 22:24:23] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:24:23] [INFO ] Added : 34 causal constraints over 7 iterations in 101 ms. Result :sat
Minimization took 32 ms.
[2022-05-16 22:24:23] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 22:24:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:23] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-16 22:24:23] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2022-05-16 22:24:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-05-16 22:24:23] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:24:23] [INFO ] Added : 40 causal constraints over 9 iterations in 90 ms. Result :sat
Minimization took 51 ms.
[2022-05-16 22:24:23] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:23] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-16 22:24:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:23] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-16 22:24:23] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:24:23] [INFO ] Added : 42 causal constraints over 11 iterations in 140 ms. Result :sat
Minimization took 31 ms.
[2022-05-16 22:24:23] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:23] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-16 22:24:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:24] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2022-05-16 22:24:24] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:24:24] [INFO ] Added : 35 causal constraints over 9 iterations in 129 ms. Result :sat
Minimization took 49 ms.
[2022-05-16 22:24:24] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:24] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-16 22:24:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:24] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2022-05-16 22:24:24] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-16 22:24:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-16 22:24:24] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:24:24] [INFO ] Added : 46 causal constraints over 10 iterations in 209 ms. Result :sat
Minimization took 37 ms.
[2022-05-16 22:24:24] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:24] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 22:24:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:24] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-16 22:24:24] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2022-05-16 22:24:24] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:24:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 37 ms
[2022-05-16 22:24:24] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:24:24] [INFO ] Added : 38 causal constraints over 8 iterations in 91 ms. Result :sat
Minimization took 40 ms.
[2022-05-16 22:24:24] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 22:24:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-16 22:24:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:25] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2022-05-16 22:24:25] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:24:25] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:24:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 40 ms
[2022-05-16 22:24:25] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:24:25] [INFO ] Added : 23 causal constraints over 5 iterations in 88 ms. Result :sat
Minimization took 28 ms.
[2022-05-16 22:24:25] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:24:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:25] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-16 22:24:25] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:24:25] [INFO ] Added : 34 causal constraints over 7 iterations in 71 ms. Result :sat
Minimization took 40 ms.
[2022-05-16 22:24:25] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:25] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 22:24:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:25] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2022-05-16 22:24:25] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 22:24:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-16 22:24:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-16 22:24:25] [INFO ] Added : 32 causal constraints over 7 iterations in 131 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [202, 203, 202, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[202, 201, 202, 200, 201, 200, 201, 201, 200, 200, 201, 201, 201, 200]
FORMULA JoinFreeModules-PT-0200-UpperBounds-02 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-00 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 6900 steps, including 136 resets, run finished after 17 ms. (steps per millisecond=405 ) properties (out of 12) seen :1011 could not realise parikh vector
Incomplete Parikh walk after 28900 steps, including 105 resets, run finished after 42 ms. (steps per millisecond=688 ) properties (out of 12) seen :1216 could not realise parikh vector
Incomplete Parikh walk after 30600 steps, including 104 resets, run finished after 42 ms. (steps per millisecond=728 ) properties (out of 12) seen :1217 could not realise parikh vector
Incomplete Parikh walk after 75500 steps, including 105 resets, run finished after 105 ms. (steps per millisecond=719 ) properties (out of 12) seen :1218 could not realise parikh vector
Incomplete Parikh walk after 10100 steps, including 147 resets, run finished after 23 ms. (steps per millisecond=439 ) properties (out of 12) seen :1017 could not realise parikh vector
Incomplete Parikh walk after 6500 steps, including 125 resets, run finished after 13 ms. (steps per millisecond=500 ) properties (out of 12) seen :1013 could not realise parikh vector
Incomplete Parikh walk after 28700 steps, including 104 resets, run finished after 43 ms. (steps per millisecond=667 ) properties (out of 12) seen :1210 could not realise parikh vector
Incomplete Parikh walk after 45300 steps, including 106 resets, run finished after 69 ms. (steps per millisecond=656 ) properties (out of 12) seen :1221 could not realise parikh vector
Incomplete Parikh walk after 8100 steps, including 130 resets, run finished after 17 ms. (steps per millisecond=476 ) properties (out of 12) seen :1009 could not realise parikh vector
Incomplete Parikh walk after 31000 steps, including 108 resets, run finished after 45 ms. (steps per millisecond=688 ) properties (out of 12) seen :1218 could not realise parikh vector
Incomplete Parikh walk after 11800 steps, including 121 resets, run finished after 20 ms. (steps per millisecond=590 ) properties (out of 12) seen :1037 could not realise parikh vector
Incomplete Parikh walk after 81000 steps, including 113 resets, run finished after 114 ms. (steps per millisecond=710 ) properties (out of 12) seen :1215 could not realise parikh vector
Support contains 12 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 60 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 3 ms. Remains 60 /70 variables (removed 10) and now considering 96/112 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/70 places, 96/112 transitions.
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:26] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 12) seen :2395
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 853 ms. (steps per millisecond=1172 ) properties (out of 12) seen :1668
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 842 ms. (steps per millisecond=1187 ) properties (out of 12) seen :1563
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 818 ms. (steps per millisecond=1222 ) properties (out of 12) seen :1663
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 844 ms. (steps per millisecond=1184 ) properties (out of 12) seen :1567
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 840 ms. (steps per millisecond=1190 ) properties (out of 12) seen :1621
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 836 ms. (steps per millisecond=1196 ) properties (out of 12) seen :1636
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 851 ms. (steps per millisecond=1175 ) properties (out of 12) seen :1532
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 851 ms. (steps per millisecond=1175 ) properties (out of 12) seen :1550
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 856 ms. (steps per millisecond=1168 ) properties (out of 12) seen :1686
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 838 ms. (steps per millisecond=1193 ) properties (out of 12) seen :1611
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 828 ms. (steps per millisecond=1207 ) properties (out of 12) seen :1593
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 859 ms. (steps per millisecond=1164 ) properties (out of 12) seen :1494
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:37] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 22:24:37] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:24:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2022-05-16 22:24:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:37] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-05-16 22:24:37] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:24:37] [INFO ] Added : 29 causal constraints over 7 iterations in 52 ms. Result :sat
Minimization took 30 ms.
[2022-05-16 22:24:37] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:24:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:37] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2022-05-16 22:24:37] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:24:37] [INFO ] Added : 28 causal constraints over 7 iterations in 103 ms. Result :sat
Minimization took 33 ms.
[2022-05-16 22:24:37] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:37] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:24:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:37] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2022-05-16 22:24:37] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 22:24:38] [INFO ] Added : 29 causal constraints over 6 iterations in 64 ms. Result :sat
Minimization took 26 ms.
[2022-05-16 22:24:38] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:38] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:24:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:38] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-05-16 22:24:38] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:24:38] [INFO ] Added : 27 causal constraints over 6 iterations in 178 ms. Result :sat
Minimization took 36 ms.
[2022-05-16 22:24:38] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:38] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:24:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:38] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2022-05-16 22:24:38] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 22:24:38] [INFO ] Added : 40 causal constraints over 9 iterations in 116 ms. Result :sat
Minimization took 36 ms.
[2022-05-16 22:24:38] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:38] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:24:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:38] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2022-05-16 22:24:38] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2022-05-16 22:24:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-16 22:24:38] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:24:38] [INFO ] Added : 33 causal constraints over 7 iterations in 97 ms. Result :sat
Minimization took 31 ms.
[2022-05-16 22:24:39] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:39] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:24:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:39] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2022-05-16 22:24:39] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:24:39] [INFO ] Added : 44 causal constraints over 10 iterations in 218 ms. Result :sat
Minimization took 40 ms.
[2022-05-16 22:24:39] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:39] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:24:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:39] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2022-05-16 22:24:39] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:24:39] [INFO ] Added : 34 causal constraints over 7 iterations in 58 ms. Result :sat
Minimization took 28 ms.
[2022-05-16 22:24:39] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:39] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:24:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:39] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2022-05-16 22:24:39] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:24:39] [INFO ] Added : 28 causal constraints over 7 iterations in 88 ms. Result :sat
Minimization took 37 ms.
[2022-05-16 22:24:39] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2022-05-16 22:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:40] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 22:24:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:40] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-05-16 22:24:40] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:24:40] [INFO ] Added : 39 causal constraints over 9 iterations in 112 ms. Result :sat
Minimization took 31 ms.
[2022-05-16 22:24:40] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:40] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-16 22:24:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2022-05-16 22:24:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:40] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2022-05-16 22:24:40] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 22:24:40] [INFO ] Added : 33 causal constraints over 7 iterations in 106 ms. Result :sat
Minimization took 36 ms.
[2022-05-16 22:24:40] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:40] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:24:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2022-05-16 22:24:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:40] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-16 22:24:40] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:24:40] [INFO ] Added : 42 causal constraints over 10 iterations in 119 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[201, 200, 201, 200, 201, 201, 200, 200, 201, 201, 201, 200]
Incomplete Parikh walk after 70800 steps, including 104 resets, run finished after 98 ms. (steps per millisecond=722 ) properties (out of 12) seen :1023 could not realise parikh vector
Incomplete Parikh walk after 28300 steps, including 108 resets, run finished after 36 ms. (steps per millisecond=786 ) properties (out of 12) seen :1217 could not realise parikh vector
Incomplete Parikh walk after 28000 steps, including 105 resets, run finished after 35 ms. (steps per millisecond=800 ) properties (out of 12) seen :1214 could not realise parikh vector
Incomplete Parikh walk after 73200 steps, including 104 resets, run finished after 80 ms. (steps per millisecond=915 ) properties (out of 12) seen :1213 could not realise parikh vector
Incomplete Parikh walk after 28000 steps, including 101 resets, run finished after 35 ms. (steps per millisecond=800 ) properties (out of 12) seen :1219 could not realise parikh vector
Incomplete Parikh walk after 12000 steps, including 115 resets, run finished after 25 ms. (steps per millisecond=480 ) properties (out of 12) seen :1028 could not realise parikh vector
Incomplete Parikh walk after 28800 steps, including 104 resets, run finished after 39 ms. (steps per millisecond=738 ) properties (out of 12) seen :1223 could not realise parikh vector
Incomplete Parikh walk after 27300 steps, including 100 resets, run finished after 42 ms. (steps per millisecond=650 ) properties (out of 12) seen :1218 could not realise parikh vector
Incomplete Parikh walk after 5100 steps, including 115 resets, run finished after 9 ms. (steps per millisecond=566 ) properties (out of 12) seen :1021 could not realise parikh vector
Incomplete Parikh walk after 26800 steps, including 104 resets, run finished after 31 ms. (steps per millisecond=864 ) properties (out of 12) seen :1216 could not realise parikh vector
Incomplete Parikh walk after 12400 steps, including 114 resets, run finished after 21 ms. (steps per millisecond=590 ) properties (out of 12) seen :1015 could not realise parikh vector
Incomplete Parikh walk after 99600 steps, including 101 resets, run finished after 115 ms. (steps per millisecond=866 ) properties (out of 12) seen :1211 could not realise parikh vector
Support contains 12 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 96/96 transitions.
Starting structural reductions, iteration 0 : 60/60 places, 96/96 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:41] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 22:24:41] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:41] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 22:24:41] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-16 22:24:41] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:41] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 22:24:41] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 96/96 transitions.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-01
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:41] [INFO ] Computed 12 place invariants in 0 ms
Incomplete random walk after 10035 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1672 ) properties (out of 1) seen :100
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :104
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:41] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 22:24:41] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:41] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:24:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:41] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2022-05-16 22:24:41] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:24:41] [INFO ] Added : 22 causal constraints over 7 iterations in 86 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[104]
Incomplete Parikh walk after 82300 steps, including 115 resets, run finished after 93 ms. (steps per millisecond=884 ) properties (out of 1) seen :201 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:41] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:41] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=8000 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=7352 ) properties (out of 1) seen :198
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:42] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:24:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:42] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:24:42] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:24:42] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Incomplete Parikh walk after 78600 steps, including 102 resets, run finished after 35 ms. (steps per millisecond=2245 ) properties (out of 1) seen :201 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:42] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:42] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2022-05-16 22:24:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:42] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-01 in 804 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-04
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:42] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10090 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1441 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :200
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:42] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 22:24:42] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:42] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-16 22:24:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:42] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2022-05-16 22:24:42] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 22:24:42] [INFO ] Added : 28 causal constraints over 7 iterations in 104 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Incomplete Parikh walk after 12400 steps, including 113 resets, run finished after 22 ms. (steps per millisecond=563 ) properties (out of 1) seen :200 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:42] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:42] [INFO ] Computed 1 place invariants in 2 ms
Incomplete random walk after 1000030 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=8130 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=7042 ) properties (out of 1) seen :200
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:42] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:42] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:24:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:42] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:24:42] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2022-05-16 22:24:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 9 ms
[2022-05-16 22:24:42] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:24:42] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Incomplete Parikh walk after 1200 steps, including 144 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :200 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:43] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:43] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2022-05-16 22:24:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:43] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-04 in 710 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-05
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:43] [INFO ] Computed 12 place invariants in 0 ms
Incomplete random walk after 10024 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=911 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :130
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:43] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 22:24:43] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:43] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 22:24:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:43] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2022-05-16 22:24:43] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:24:43] [INFO ] Added : 29 causal constraints over 6 iterations in 59 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Incomplete Parikh walk after 26800 steps, including 104 resets, run finished after 37 ms. (steps per millisecond=724 ) properties (out of 1) seen :200 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:43] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:43] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=8130 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=3984 ) properties (out of 1) seen :201
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:24:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:43] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:24:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:24:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:43] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:24:43] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:24:43] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Incomplete Parikh walk after 21100 steps, including 98 resets, run finished after 9 ms. (steps per millisecond=2344 ) properties (out of 1) seen :201 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:43] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:43] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:43] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2022-05-16 22:24:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:43] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-05 in 794 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-06
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:43] [INFO ] Computed 12 place invariants in 0 ms
Incomplete random walk after 10018 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1669 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :200
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:43] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 22:24:43] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:43] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:24:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:43] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2022-05-16 22:24:43] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:24:44] [INFO ] Added : 27 causal constraints over 6 iterations in 179 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Incomplete Parikh walk after 5100 steps, including 115 resets, run finished after 9 ms. (steps per millisecond=566 ) properties (out of 1) seen :200 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:44] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 22:24:44] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:44] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000055 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=7936 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=7092 ) properties (out of 1) seen :200
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:44] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:24:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:44] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:24:44] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:24:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 8 ms
[2022-05-16 22:24:44] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:24:44] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Incomplete Parikh walk after 1200 steps, including 145 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :200 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:44] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:44] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2022-05-16 22:24:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:44] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-06 in 743 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-07
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:44] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10018 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1113 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :130
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:44] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 22:24:44] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2022-05-16 22:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:44] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:24:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:44] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2022-05-16 22:24:44] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:24:44] [INFO ] Added : 40 causal constraints over 9 iterations in 123 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Incomplete Parikh walk after 27300 steps, including 100 resets, run finished after 36 ms. (steps per millisecond=758 ) properties (out of 1) seen :200 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:44] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:44] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000039 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=7874 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=6802 ) properties (out of 1) seen :201
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:45] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:45] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:24:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:45] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:24:45] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:24:45] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Incomplete Parikh walk after 21100 steps, including 97 resets, run finished after 8 ms. (steps per millisecond=2637 ) properties (out of 1) seen :201 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:45] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:45] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2022-05-16 22:24:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:45] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-07 in 738 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-08
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:45] [INFO ] Computed 12 place invariants in 0 ms
Incomplete random walk after 10032 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1433 ) properties (out of 1) seen :41
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :130
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:45] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 22:24:45] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:45] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:24:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:45] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2022-05-16 22:24:45] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:24:45] [INFO ] Added : 41 causal constraints over 9 iterations in 171 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[130]
Incomplete Parikh walk after 47000 steps, including 100 resets, run finished after 57 ms. (steps per millisecond=824 ) properties (out of 1) seen :200 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:45] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:45] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000126 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=7937 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=6802 ) properties (out of 1) seen :201
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:46] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:46] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:46] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:24:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:46] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:24:46] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:24:46] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Incomplete Parikh walk after 21100 steps, including 97 resets, run finished after 9 ms. (steps per millisecond=2344 ) properties (out of 1) seen :201 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:46] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:46] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2022-05-16 22:24:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:46] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:46] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000055 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=7936 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=6756 ) properties (out of 1) seen :201
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:46] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:46] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:46] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:24:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:46] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:24:46] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:24:46] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Incomplete Parikh walk after 21100 steps, including 98 resets, run finished after 10 ms. (steps per millisecond=2110 ) properties (out of 1) seen :201 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:46] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:46] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:46] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2022-05-16 22:24:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:46] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-08 in 1219 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-09
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:46] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10028 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1253 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :200
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:46] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 22:24:46] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:46] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 22:24:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:46] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2022-05-16 22:24:46] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:24:46] [INFO ] Added : 44 causal constraints over 10 iterations in 219 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Incomplete Parikh walk after 12000 steps, including 115 resets, run finished after 27 ms. (steps per millisecond=444 ) properties (out of 1) seen :200 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:47] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:47] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:47] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000018 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=7874 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=6849 ) properties (out of 1) seen :200
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:47] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:47] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:24:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:24:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:47] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:24:47] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:24:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2022-05-16 22:24:47] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:24:47] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Incomplete Parikh walk after 1200 steps, including 145 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :200 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:47] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:47] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:47] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:47] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2022-05-16 22:24:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:47] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:47] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-09 in 867 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-10
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:47] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10153 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1269 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :200
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:47] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 22:24:47] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:47] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 22:24:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-16 22:24:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:47] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2022-05-16 22:24:47] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:24:47] [INFO ] Added : 34 causal constraints over 7 iterations in 70 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Incomplete Parikh walk after 28000 steps, including 101 resets, run finished after 39 ms. (steps per millisecond=717 ) properties (out of 1) seen :200 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:47] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:47] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000038 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=7576 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=7042 ) properties (out of 1) seen :200
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:48] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:48] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:24:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:48] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:24:48] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:24:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 7 ms
[2022-05-16 22:24:48] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:24:48] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Incomplete Parikh walk after 1200 steps, including 145 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :200 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:48] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:48] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2022-05-16 22:24:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:48] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-10 in 721 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-12
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:48] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10006 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :102
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :100
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:48] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 22:24:48] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:48] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 22:24:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:48] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2022-05-16 22:24:48] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:24:48] [INFO ] Added : 34 causal constraints over 8 iterations in 130 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[102]
Incomplete Parikh walk after 123500 steps, including 102 resets, run finished after 147 ms. (steps per millisecond=840 ) properties (out of 1) seen :202 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:48] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:48] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000011 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=8333 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=7142 ) properties (out of 1) seen :200
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:48] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:24:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:24:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:48] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:24:48] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:24:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 12 ms
Current structural bounds on expressions (after SMT) : [202] Max seen :[202]
FORMULA JoinFreeModules-PT-0200-UpperBounds-12 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-12 in 865 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-13
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:48] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 10026 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1253 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :130
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:49] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 22:24:49] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2022-05-16 22:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:49] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:24:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:49] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2022-05-16 22:24:49] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:24:49] [INFO ] Added : 39 causal constraints over 9 iterations in 111 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Incomplete Parikh walk after 28000 steps, including 105 resets, run finished after 35 ms. (steps per millisecond=800 ) properties (out of 1) seen :200 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:49] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:49] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000037 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=7936 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=6802 ) properties (out of 1) seen :201
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:49] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:24:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:49] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:24:49] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:24:49] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Incomplete Parikh walk after 21100 steps, including 97 resets, run finished after 12 ms. (steps per millisecond=1758 ) properties (out of 1) seen :201 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:49] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:49] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:49] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:49] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2022-05-16 22:24:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:49] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:49] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-13 in 738 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-14
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:49] [INFO ] Computed 12 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :130
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:49] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 22:24:49] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:49] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 22:24:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:49] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2022-05-16 22:24:49] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:24:49] [INFO ] Added : 33 causal constraints over 7 iterations in 101 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Incomplete Parikh walk after 28300 steps, including 108 resets, run finished after 38 ms. (steps per millisecond=744 ) properties (out of 1) seen :201 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:50] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:50] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000043 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=8130 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=6756 ) properties (out of 1) seen :201
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:50] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:24:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:50] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:24:50] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:24:50] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Incomplete Parikh walk after 21100 steps, including 98 resets, run finished after 8 ms. (steps per millisecond=2637 ) properties (out of 1) seen :201 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:50] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:50] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2022-05-16 22:24:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:50] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-14 in 721 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-15
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:50] [INFO ] Computed 12 place invariants in 9 ms
Incomplete random walk after 10042 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1004 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :200
// Phase 1: matrix 96 rows 60 cols
[2022-05-16 22:24:50] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 22:24:50] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:50] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-16 22:24:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2022-05-16 22:24:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:50] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-16 22:24:50] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:24:50] [INFO ] Added : 42 causal constraints over 10 iterations in 107 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Incomplete Parikh walk after 70800 steps, including 105 resets, run finished after 91 ms. (steps per millisecond=778 ) properties (out of 1) seen :200 could not realise parikh vector
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 5 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 88 output transitions
Drop transitions removed 88 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /60 variables (removed 55) and now considering 8/96 (removed 88) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:50] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/60 places, 8/96 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:50] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000011 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=8333 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=6666 ) properties (out of 1) seen :200
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:51] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:24:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:24:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:51] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:24:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:24:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:24:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:24:51] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:24:51] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-05-16 22:24:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2022-05-16 22:24:51] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:24:51] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Incomplete Parikh walk after 1200 steps, including 146 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :200 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:51] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:51] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:51] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:51] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2022-05-16 22:24:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:24:51] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:24:51] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-15 in 789 ms.
[2022-05-16 22:24:51] [INFO ] Flatten gal took : 38 ms
[2022-05-16 22:24:51] [INFO ] Applying decomposition
[2022-05-16 22:24:51] [INFO ] Flatten gal took : 9 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/graph5146759267500097620.txt, -o, /tmp/graph5146759267500097620.bin, -w, /tmp/graph5146759267500097620.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/graph5146759267500097620.bin, -l, -1, -v, -w, /tmp/graph5146759267500097620.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 22:24:51] [INFO ] Decomposing Gal with order
[2022-05-16 22:24:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 22:24:51] [INFO ] Flatten gal took : 7 ms
[2022-05-16 22:24:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 22:24:51] [INFO ] Time to serialize gal into /tmp/UpperBounds15399885525682480095.gal : 3 ms
[2022-05-16 22:24:51] [INFO ] Time to serialize properties into /tmp/UpperBounds15454904940424881136.prop : 0 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/UpperBounds15399885525682480095.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15454904940424881136.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/UpperBounds15399885525682480095.gal -t CGAL -reachable-file /tmp/UpperBounds15454904940424881136.prop --nowitness
Loading property file /tmp/UpperBounds15454904940424881136.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.8299e+94,8.60793,119492,14,1419,40,339629,44,0,58,399420,0
Total reachable state count : 2.829897608588263545018042837108235282913e+94

Verifying 11 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-01 :0 <= u5.p359 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-01 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-01,0,8.62715,119492,1,0,72,339629,116,13,273,399420,140
Min sum of variable value : 0
Maximum sum along a path : 200
Bounds property JoinFreeModules-PT-0200-UpperBounds-04 :0 <= u6.p368 <= 200
FORMULA JoinFreeModules-PT-0200-UpperBounds-04 200 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-04,0,8.69724,119492,1,0,81,339629,139,13,481,399420,157
Min sum of variable value : 0
Maximum sum along a path : 201
Bounds property JoinFreeModules-PT-0200-UpperBounds-05 :0 <= u9.p762 <= 201
FORMULA JoinFreeModules-PT-0200-UpperBounds-05 201 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-05,0,8.85786,119492,1,0,86,339629,166,13,693,399420,171
Min sum of variable value : 0
Maximum sum along a path : 200
Bounds property JoinFreeModules-PT-0200-UpperBounds-06 :0 <= u0.p38 <= 200
FORMULA JoinFreeModules-PT-0200-UpperBounds-06 200 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-06,0,8.85807,119492,1,0,98,339629,189,13,693,399420,194
Min sum of variable value : 0
Maximum sum along a path : 201
Bounds property JoinFreeModules-PT-0200-UpperBounds-07 :0 <= u11.p852 <= 201
FORMULA JoinFreeModules-PT-0200-UpperBounds-07 201 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-07,0,8.85824,119492,1,0,100,339629,214,13,693,399420,201
Min sum of variable value : 0
Maximum sum along a path : 201
Bounds property JoinFreeModules-PT-0200-UpperBounds-08 :0 <= u4.p352 <= 201
FORMULA JoinFreeModules-PT-0200-UpperBounds-08 201 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-08,0,8.85842,119492,1,0,109,339629,232,13,693,399420,218
Min sum of variable value : 0
Maximum sum along a path : 200
Bounds property JoinFreeModules-PT-0200-UpperBounds-09 :0 <= u2.p283 <= 200
FORMULA JoinFreeModules-PT-0200-UpperBounds-09 200 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-09,0,8.85856,119492,1,0,120,339629,248,13,693,399420,239
Min sum of variable value : 0
Maximum sum along a path : 200
Bounds property JoinFreeModules-PT-0200-UpperBounds-10 :0 <= u8.p738 <= 200
FORMULA JoinFreeModules-PT-0200-UpperBounds-10 200 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-10,0,8.85868,119492,1,0,125,339629,270,13,693,399420,248
Min sum of variable value : 0
Maximum sum along a path : 201
Bounds property JoinFreeModules-PT-0200-UpperBounds-13 :0 <= u1.p72 <= 201
FORMULA JoinFreeModules-PT-0200-UpperBounds-13 201 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-13,0,8.85882,119492,1,0,137,339629,285,13,693,399420,271
Min sum of variable value : 0
Maximum sum along a path : 201
Bounds property JoinFreeModules-PT-0200-UpperBounds-14 :0 <= u10.p827 <= 201
FORMULA JoinFreeModules-PT-0200-UpperBounds-14 201 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-14,0,8.85894,119492,1,0,140,339629,309,13,693,399420,276
Min sum of variable value : 0
Maximum sum along a path : 200
Bounds property JoinFreeModules-PT-0200-UpperBounds-15 :0 <= u3.p348 <= 200
FORMULA JoinFreeModules-PT-0200-UpperBounds-15 200 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-15,0,8.85907,119492,1,0,150,339629,326,13,693,399420,295

BK_STOP 1652739901409

--------------------
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="JoinFreeModules-PT-0200"
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 JoinFreeModules-PT-0200, 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 r143-tall-165271830200073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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