Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143900435.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900435
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 157K May 5 16:51 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 BusinessProcesses-PT-15-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620547075143

Running Version 0
[2021-05-09 07:57:56] [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]
[2021-05-09 07:57:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:57:56] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2021-05-09 07:57:56] [INFO ] Transformed 630 places.
[2021-05-09 07:57:56] [INFO ] Transformed 566 transitions.
[2021-05-09 07:57:56] [INFO ] Found NUPN structural information;
[2021-05-09 07:57:56] [INFO ] Parsed PT model containing 630 places and 566 transitions in 150 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
// Phase 1: matrix 562 rows 626 cols
[2021-05-09 07:57:57] [INFO ] Computed 102 place invariants in 54 ms
Incomplete random walk after 10000 steps, including 67 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
// Phase 1: matrix 562 rows 626 cols
[2021-05-09 07:57:57] [INFO ] Computed 102 place invariants in 20 ms
[2021-05-09 07:57:57] [INFO ] [Real]Absence check using 61 positive place invariants in 24 ms returned sat
[2021-05-09 07:57:57] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 23 ms returned sat
[2021-05-09 07:57:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:57:57] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2021-05-09 07:57:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:57:58] [INFO ] [Nat]Absence check using 61 positive place invariants in 19 ms returned sat
[2021-05-09 07:57:58] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-09 07:57:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:57:58] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2021-05-09 07:57:58] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 7 ms to minimize.
[2021-05-09 07:57:58] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 1 ms to minimize.
[2021-05-09 07:57:58] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 1 ms to minimize.
[2021-05-09 07:57:59] [INFO ] Deduced a trap composed of 146 places in 190 ms of which 1 ms to minimize.
[2021-05-09 07:57:59] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 0 ms to minimize.
[2021-05-09 07:57:59] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:57:59] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:57:59] [INFO ] Deduced a trap composed of 146 places in 136 ms of which 1 ms to minimize.
[2021-05-09 07:57:59] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:57:59] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
[2021-05-09 07:58:00] [INFO ] Deduced a trap composed of 148 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:58:00] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:58:00] [INFO ] Deduced a trap composed of 144 places in 138 ms of which 0 ms to minimize.
[2021-05-09 07:58:00] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:58:00] [INFO ] Deduced a trap composed of 143 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:58:00] [INFO ] Deduced a trap composed of 155 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:58:00] [INFO ] Deduced a trap composed of 146 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:58:00] [INFO ] Deduced a trap composed of 147 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:58:01] [INFO ] Deduced a trap composed of 141 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:58:01] [INFO ] Deduced a trap composed of 148 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:58:01] [INFO ] Deduced a trap composed of 141 places in 83 ms of which 0 ms to minimize.
[2021-05-09 07:58:01] [INFO ] Deduced a trap composed of 149 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:58:01] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:58:01] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:58:01] [INFO ] Deduced a trap composed of 137 places in 83 ms of which 0 ms to minimize.
[2021-05-09 07:58:01] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2021-05-09 07:58:02] [INFO ] Deduced a trap composed of 143 places in 84 ms of which 0 ms to minimize.
[2021-05-09 07:58:02] [INFO ] Deduced a trap composed of 145 places in 89 ms of which 3 ms to minimize.
[2021-05-09 07:58:02] [INFO ] Deduced a trap composed of 156 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:58:02] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:58:02] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:58:02] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:58:02] [INFO ] Deduced a trap composed of 149 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:58:02] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2021-05-09 07:58:02] [INFO ] Deduced a trap composed of 146 places in 119 ms of which 6 ms to minimize.
[2021-05-09 07:58: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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)
[2021-05-09 07:58:03] [INFO ] [Real]Absence check using 61 positive place invariants in 19 ms returned sat
[2021-05-09 07:58:03] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-09 07:58:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:03] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2021-05-09 07:58:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:58:03] [INFO ] [Nat]Absence check using 61 positive place invariants in 18 ms returned sat
[2021-05-09 07:58:03] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 07:58:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:03] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-09 07:58:03] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:58:03] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 0 ms to minimize.
[2021-05-09 07:58:03] [INFO ] Deduced a trap composed of 32 places in 151 ms of which 1 ms to minimize.
[2021-05-09 07:58:04] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:58:04] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 0 ms to minimize.
[2021-05-09 07:58:04] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:58:04] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 1 ms to minimize.
[2021-05-09 07:58:04] [INFO ] Deduced a trap composed of 139 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:58:04] [INFO ] Deduced a trap composed of 147 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:58:04] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2021-05-09 07:58:05] [INFO ] Deduced a trap composed of 152 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:58:05] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:58:05] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:58:05] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:58:05] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:58:05] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:58:05] [INFO ] Deduced a trap composed of 154 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:58:05] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:58:06] [INFO ] Deduced a trap composed of 139 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:58:06] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:58:06] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:58:06] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 6 ms to minimize.
[2021-05-09 07:58:06] [INFO ] Deduced a trap composed of 141 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:58:06] [INFO ] Deduced a trap composed of 143 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:58:06] [INFO ] Deduced a trap composed of 146 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:58:06] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3304 ms
[2021-05-09 07:58:06] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 39 ms.
[2021-05-09 07:58:08] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2021-05-09 07:58: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 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)
[2021-05-09 07:58:08] [INFO ] [Real]Absence check using 61 positive place invariants in 18 ms returned sat
[2021-05-09 07:58:08] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-09 07:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:08] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2021-05-09 07:58:08] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 0 ms to minimize.
[2021-05-09 07:58:09] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:58:09] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 0 ms to minimize.
[2021-05-09 07:58:09] [INFO ] Deduced a trap composed of 140 places in 120 ms of which 0 ms to minimize.
[2021-05-09 07:58:09] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2021-05-09 07:58:09] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2021-05-09 07:58:09] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 10 ms to minimize.
[2021-05-09 07:58:09] [INFO ] Deduced a trap composed of 151 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:58:09] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:58:10] [INFO ] Deduced a trap composed of 149 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:58:10] [INFO ] Deduced a trap composed of 141 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:58:10] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:58:10] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 0 ms to minimize.
[2021-05-09 07:58:10] [INFO ] Deduced a trap composed of 12 places in 15 ms of which 0 ms to minimize.
[2021-05-09 07:58:10] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1690 ms
[2021-05-09 07:58:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:58:10] [INFO ] [Nat]Absence check using 61 positive place invariants in 18 ms returned sat
[2021-05-09 07:58:10] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-09 07:58:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:10] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2021-05-09 07:58:10] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:58:11] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:58:11] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2021-05-09 07:58:11] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:58:11] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 0 ms to minimize.
[2021-05-09 07:58:11] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 14 ms to minimize.
[2021-05-09 07:58:11] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:58:11] [INFO ] Deduced a trap composed of 142 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:58:11] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:58:12] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:58:12] [INFO ] Deduced a trap composed of 146 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:58:12] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 0 ms to minimize.
[2021-05-09 07:58:12] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 1 ms to minimize.
[2021-05-09 07:58:12] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:58:12] [INFO ] Deduced a trap composed of 140 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:58:12] [INFO ] Deduced a trap composed of 147 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:58:12] [INFO ] Deduced a trap composed of 141 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:58:13] [INFO ] Deduced a trap composed of 151 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:58:13] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2021-05-09 07:58:13] [INFO ] Deduced a trap composed of 138 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:58:13] [INFO ] Deduced a trap composed of 153 places in 89 ms of which 1 ms to minimize.
[2021-05-09 07:58:13] [INFO ] Deduced a trap composed of 139 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:58:13] [INFO ] Deduced a trap composed of 145 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:58:13] [INFO ] Deduced a trap composed of 160 places in 106 ms of which 0 ms to minimize.
[2021-05-09 07:58:13] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:58:13] [INFO ] Deduced a trap composed of 146 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:58:14] [INFO ] Deduced a trap composed of 148 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:58:14] [INFO ] Deduced a trap composed of 141 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:58:14] [INFO ] Deduced a trap composed of 147 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:58:14] [INFO ] Deduced a trap composed of 139 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:58:14] [INFO ] Deduced a trap composed of 143 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:58:14] [INFO ] Deduced a trap composed of 153 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:58:14] [INFO ] Deduced a trap composed of 138 places in 86 ms of which 0 ms to minimize.
[2021-05-09 07:58:14] [INFO ] Deduced a trap composed of 142 places in 153 ms of which 1 ms to minimize.
[2021-05-09 07:58:15] [INFO ] Deduced a trap composed of 145 places in 97 ms of which 1 ms to minimize.
[2021-05-09 07:58:15] [INFO ] Deduced a trap composed of 149 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:58:15] [INFO ] Deduced a trap composed of 144 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:58:15] [INFO ] Deduced a trap composed of 153 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:58:15] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:58:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 07:58:15] [INFO ] [Real]Absence check using 61 positive place invariants in 18 ms returned sat
[2021-05-09 07:58:15] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-09 07:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:15] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2021-05-09 07:58:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:58:15] [INFO ] [Nat]Absence check using 61 positive place invariants in 21 ms returned sat
[2021-05-09 07:58:15] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-09 07:58:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:16] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2021-05-09 07:58:16] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:58:16] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:58:16] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:58:16] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:58:16] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:58:16] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:58:16] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:58:16] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 12 ms to minimize.
[2021-05-09 07:58:16] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:58:16] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2021-05-09 07:58:16] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2021-05-09 07:58:17] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:58:17] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:58:17] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:58:17] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:58:17] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:58:17] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:58:17] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:58:17] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:58:17] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:58:17] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 0 ms to minimize.
[2021-05-09 07:58:17] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:58:17] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:58:17] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2021-05-09 07:58:17] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:58:18] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:58:18] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:58:18] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 1942 ms
[2021-05-09 07:58:18] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 25 ms.
[2021-05-09 07:58:20] [INFO ] Added : 319 causal constraints over 64 iterations in 1923 ms. Result :sat
Minimization took 153 ms.
[2021-05-09 07:58:20] [INFO ] [Real]Absence check using 61 positive place invariants in 25 ms returned sat
[2021-05-09 07:58:20] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 27 ms returned sat
[2021-05-09 07:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:20] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2021-05-09 07:58:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:58:20] [INFO ] [Nat]Absence check using 61 positive place invariants in 32 ms returned sat
[2021-05-09 07:58:20] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 30 ms returned sat
[2021-05-09 07:58:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:21] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2021-05-09 07:58:21] [INFO ] Deduced a trap composed of 144 places in 158 ms of which 0 ms to minimize.
[2021-05-09 07:58:21] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2021-05-09 07:58:21] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:58:21] [INFO ] Deduced a trap composed of 139 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:58:21] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:58:21] [INFO ] Deduced a trap composed of 154 places in 91 ms of which 0 ms to minimize.
[2021-05-09 07:58:22] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:58:22] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:58:22] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2021-05-09 07:58:22] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:58:22] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2021-05-09 07:58:22] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:58:22] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 0 ms to minimize.
[2021-05-09 07:58:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1376 ms
[2021-05-09 07:58:22] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 31 ms.
[2021-05-09 07:58:24] [INFO ] Added : 291 causal constraints over 59 iterations in 2146 ms. Result :sat
Minimization took 139 ms.
[2021-05-09 07:58:24] [INFO ] [Real]Absence check using 61 positive place invariants in 25 ms returned sat
[2021-05-09 07:58:24] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 17 ms returned sat
[2021-05-09 07:58:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:25] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-09 07:58:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:58:25] [INFO ] [Nat]Absence check using 61 positive place invariants in 28 ms returned sat
[2021-05-09 07:58:25] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2021-05-09 07:58:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:25] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2021-05-09 07:58:25] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:58:25] [INFO ] Deduced a trap composed of 142 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:58:26] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2021-05-09 07:58:26] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 0 ms to minimize.
[2021-05-09 07:58:26] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 0 ms to minimize.
[2021-05-09 07:58:26] [INFO ] Deduced a trap composed of 134 places in 157 ms of which 1 ms to minimize.
[2021-05-09 07:58:26] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:58:26] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:58:26] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:58:27] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2021-05-09 07:58:27] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 1 ms to minimize.
[2021-05-09 07:58:27] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:58:27] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2021-05-09 07:58:27] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:58:27] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:58:27] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:58:27] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:58:27] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 0 ms to minimize.
[2021-05-09 07:58:27] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:58:27] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:58:27] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2021-05-09 07:58:27] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 0 ms to minimize.
[2021-05-09 07:58:27] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2435 ms
[2021-05-09 07:58:28] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 27 ms.
[2021-05-09 07:58:29] [INFO ] Added : 264 causal constraints over 54 iterations in 1409 ms. Result :sat
Minimization took 95 ms.
[2021-05-09 07:58:29] [INFO ] [Real]Absence check using 61 positive place invariants in 19 ms returned sat
[2021-05-09 07:58:29] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 26 ms returned sat
[2021-05-09 07:58:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:29] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2021-05-09 07:58:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:58:30] [INFO ] [Nat]Absence check using 61 positive place invariants in 21 ms returned sat
[2021-05-09 07:58:30] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-09 07:58:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:30] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2021-05-09 07:58:30] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
[2021-05-09 07:58:30] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 1 ms to minimize.
[2021-05-09 07:58:30] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:58:30] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:58:30] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 0 ms to minimize.
[2021-05-09 07:58:31] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:58:31] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 3 ms to minimize.
[2021-05-09 07:58:31] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2021-05-09 07:58:31] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
[2021-05-09 07:58:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 993 ms
[2021-05-09 07:58:31] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 26 ms.
[2021-05-09 07:58:33] [INFO ] Added : 332 causal constraints over 67 iterations in 2337 ms. Result :sat
Minimization took 156 ms.
[2021-05-09 07:58:33] [INFO ] [Real]Absence check using 61 positive place invariants in 23 ms returned sat
[2021-05-09 07:58:33] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2021-05-09 07:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:34] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2021-05-09 07:58:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:58:34] [INFO ] [Nat]Absence check using 61 positive place invariants in 26 ms returned sat
[2021-05-09 07:58:34] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 25 ms returned sat
[2021-05-09 07:58:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:34] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2021-05-09 07:58:34] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2021-05-09 07:58:34] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:58:34] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:58:34] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:58:34] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2021-05-09 07:58:35] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2021-05-09 07:58:35] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2021-05-09 07:58:35] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:58:35] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:58:35] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2021-05-09 07:58:35] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:58:35] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:58:35] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2021-05-09 07:58:35] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:58:35] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:58:35] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:58:35] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2021-05-09 07:58:35] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 0 ms to minimize.
[2021-05-09 07:58:36] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:58:36] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:58:36] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:58:36] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:58:36] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:58:36] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2021-05-09 07:58:36] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2021-05-09 07:58:36] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1878 ms
[2021-05-09 07:58:36] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 26 ms.
[2021-05-09 07:58:38] [INFO ] Deduced a trap composed of 143 places in 169 ms of which 0 ms to minimize.
[2021-05-09 07:58:38] [INFO ] Deduced a trap composed of 136 places in 115 ms of which 0 ms to minimize.
[2021-05-09 07:58:38] [INFO ] Deduced a trap composed of 140 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:58:39] [INFO ] Deduced a trap composed of 150 places in 139 ms of which 1 ms to minimize.
[2021-05-09 07:58: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 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.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)
[2021-05-09 07:58:39] [INFO ] [Real]Absence check using 61 positive place invariants in 23 ms returned sat
[2021-05-09 07:58:39] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2021-05-09 07:58:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:39] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2021-05-09 07:58:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:58:39] [INFO ] [Nat]Absence check using 61 positive place invariants in 24 ms returned sat
[2021-05-09 07:58:39] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 24 ms returned sat
[2021-05-09 07:58:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:39] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2021-05-09 07:58:40] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 0 ms to minimize.
[2021-05-09 07:58:40] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:58:40] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:58:40] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2021-05-09 07:58:40] [INFO ] Deduced a trap composed of 149 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:58:40] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:58:40] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:58:40] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2021-05-09 07:58:41] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 0 ms to minimize.
[2021-05-09 07:58:41] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:58:41] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2021-05-09 07:58:41] [INFO ] Deduced a trap composed of 138 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:58:41] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2021-05-09 07:58:41] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2021-05-09 07:58:41] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2021-05-09 07:58:41] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 0 ms to minimize.
[2021-05-09 07:58:41] [INFO ] Deduced a trap composed of 38 places in 25 ms of which 1 ms to minimize.
[2021-05-09 07:58:41] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
[2021-05-09 07:58:41] [INFO ] Deduced a trap composed of 39 places in 24 ms of which 0 ms to minimize.
[2021-05-09 07:58:41] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1916 ms
[2021-05-09 07:58:41] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 25 ms.
[2021-05-09 07:58:43] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 1 ms to minimize.
[2021-05-09 07:58:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2021-05-09 07:58:43] [INFO ] Added : 331 causal constraints over 67 iterations in 1979 ms. Result :sat
Minimization took 151 ms.
[2021-05-09 07:58:44] [INFO ] [Real]Absence check using 61 positive place invariants in 23 ms returned sat
[2021-05-09 07:58:44] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2021-05-09 07:58:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:44] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-09 07:58:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:58:44] [INFO ] [Nat]Absence check using 61 positive place invariants in 20 ms returned sat
[2021-05-09 07:58:44] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-09 07:58:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:44] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2021-05-09 07:58:44] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:58:44] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:58:44] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:58:44] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:58:44] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:58:45] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:58:45] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2021-05-09 07:58:45] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:58:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 547 ms
[2021-05-09 07:58:45] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 27 ms.
[2021-05-09 07:58:46] [INFO ] Added : 312 causal constraints over 63 iterations in 1696 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 32400 steps, including 240 resets, run finished after 130 ms. (steps per millisecond=249 ) properties (out of 10) seen :2 could not realise parikh vector
FORMULA BusinessProcesses-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 38100 steps, including 273 resets, run finished after 114 ms. (steps per millisecond=334 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 37200 steps, including 273 resets, run finished after 136 ms. (steps per millisecond=273 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 15600 steps, including 101 resets, run finished after 46 ms. (steps per millisecond=339 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 18000 steps, including 101 resets, run finished after 48 ms. (steps per millisecond=375 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 36900 steps, including 266 resets, run finished after 82 ms. (steps per millisecond=450 ) properties (out of 8) seen :0 could not realise parikh vector
Support contains 8 out of 626 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 626/626 places, 562/562 transitions.
Graph (trivial) has 354 edges and 626 vertex of which 7 / 626 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1267 edges and 620 vertex of which 616 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 139 place count 616 transition count 416
Reduce places removed 137 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 139 rules applied. Total rules applied 278 place count 479 transition count 414
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 280 place count 477 transition count 414
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 280 place count 477 transition count 322
Deduced a syphon composed of 92 places in 2 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 480 place count 369 transition count 322
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 558 place count 291 transition count 244
Iterating global reduction 3 with 78 rules applied. Total rules applied 636 place count 291 transition count 244
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 636 place count 291 transition count 236
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 654 place count 281 transition count 236
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 852 place count 181 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 854 place count 180 transition count 142
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 856 place count 180 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 858 place count 178 transition count 140
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 859 place count 178 transition count 140
Applied a total of 859 rules in 179 ms. Remains 178 /626 variables (removed 448) and now considering 140/562 (removed 422) transitions.
Finished structural reductions, in 1 iterations. Remains : 178/626 places, 140/562 transitions.
// Phase 1: matrix 140 rows 178 cols
[2021-05-09 07:58:47] [INFO ] Computed 79 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 27446 resets, run finished after 2713 ms. (steps per millisecond=368 ) properties (out of 8) seen :7
FORMULA BusinessProcesses-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 16876 resets, run finished after 2205 ms. (steps per millisecond=453 ) properties (out of 1) seen :0
// Phase 1: matrix 140 rows 178 cols
[2021-05-09 07:58:52] [INFO ] Computed 79 place invariants in 8 ms
[2021-05-09 07:58:52] [INFO ] [Real]Absence check using 58 positive place invariants in 23 ms returned sat
[2021-05-09 07:58:52] [INFO ] [Real]Absence check using 58 positive and 21 generalized place invariants in 7 ms returned sat
[2021-05-09 07:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:52] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-09 07:58:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:58:52] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2021-05-09 07:58:52] [INFO ] [Nat]Absence check using 58 positive and 21 generalized place invariants in 4 ms returned sat
[2021-05-09 07:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:52] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-09 07:58:52] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-09 07:58:52] [INFO ] [Nat]Added 12 Read/Feed constraints in 15 ms returned sat
[2021-05-09 07:58:52] [INFO ] Computed and/alt/rep : 88/424/88 causal constraints (skipped 50 transitions) in 8 ms.
[2021-05-09 07:58:53] [INFO ] Added : 27 causal constraints over 6 iterations in 98 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4700 steps, including 412 resets, run finished after 39 ms. (steps per millisecond=120 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 178/178 places, 140/140 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 178 transition count 135
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 169 transition count 135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 167 transition count 133
Applied a total of 18 rules in 26 ms. Remains 167 /178 variables (removed 11) and now considering 133/140 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 167/178 places, 133/140 transitions.
// Phase 1: matrix 133 rows 167 cols
[2021-05-09 07:58:53] [INFO ] Computed 75 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 29927 resets, run finished after 2734 ms. (steps per millisecond=365 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 18493 resets, run finished after 2138 ms. (steps per millisecond=467 ) properties (out of 1) seen :0
// Phase 1: matrix 133 rows 167 cols
[2021-05-09 07:58:58] [INFO ] Computed 75 place invariants in 2 ms
[2021-05-09 07:58:58] [INFO ] [Real]Absence check using 60 positive place invariants in 10 ms returned sat
[2021-05-09 07:58:58] [INFO ] [Real]Absence check using 60 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-09 07:58:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:58] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-09 07:58:58] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-09 07:58:58] [INFO ] [Real]Added 12 Read/Feed constraints in 14 ms returned sat
[2021-05-09 07:58:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:58:58] [INFO ] [Nat]Absence check using 60 positive place invariants in 8 ms returned sat
[2021-05-09 07:58:58] [INFO ] [Nat]Absence check using 60 positive and 15 generalized place invariants in 2 ms returned sat
[2021-05-09 07:58:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:58:58] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-09 07:58:58] [INFO ] [Nat]Added 12 Read/Feed constraints in 22 ms returned sat
[2021-05-09 07:58:58] [INFO ] Computed and/alt/rep : 81/414/81 causal constraints (skipped 50 transitions) in 10 ms.
[2021-05-09 07:58:58] [INFO ] Added : 27 causal constraints over 6 iterations in 88 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 7200 steps, including 409 resets, run finished after 47 ms. (steps per millisecond=153 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 167/167 places, 133/133 transitions.
Applied a total of 0 rules in 12 ms. Remains 167 /167 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 167/167 places, 133/133 transitions.
Starting structural reductions, iteration 0 : 167/167 places, 133/133 transitions.
Applied a total of 0 rules in 12 ms. Remains 167 /167 variables (removed 0) and now considering 133/133 (removed 0) transitions.
// Phase 1: matrix 133 rows 167 cols
[2021-05-09 07:58:58] [INFO ] Computed 75 place invariants in 4 ms
[2021-05-09 07:58:58] [INFO ] Implicit Places using invariants in 188 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 40, 41, 42, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 191 ms to find 24 implicit places.
[2021-05-09 07:58:58] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 133 rows 143 cols
[2021-05-09 07:58:58] [INFO ] Computed 51 place invariants in 7 ms
[2021-05-09 07:58:58] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Starting structural reductions, iteration 1 : 143/167 places, 133/133 transitions.
Applied a total of 0 rules in 7 ms. Remains 143 /143 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2021-05-09 07:58:58] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 133 rows 143 cols
[2021-05-09 07:58:58] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-09 07:58:58] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 2 iterations. Remains : 143/167 places, 133/133 transitions.
Successfully produced net in file /tmp/petri1000_6516501538971580880.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
// Phase 1: matrix 132 rows 143 cols
[2021-05-09 07:58:58] [INFO ] Computed 52 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 29846 resets, run finished after 1948 ms. (steps per millisecond=513 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 18450 resets, run finished after 1150 ms. (steps per millisecond=869 ) properties (out of 1) seen :0
// Phase 1: matrix 132 rows 143 cols
[2021-05-09 07:59:01] [INFO ] Computed 52 place invariants in 3 ms
[2021-05-09 07:59:02] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2021-05-09 07:59:02] [INFO ] [Real]Absence check using 35 positive and 17 generalized place invariants in 7 ms returned sat
[2021-05-09 07:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:02] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-09 07:59:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2021-05-09 07:59:02] [INFO ] [Nat]Absence check using 35 positive and 17 generalized place invariants in 3 ms returned sat
[2021-05-09 07:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:02] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-09 07:59:02] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-09 07:59:02] [INFO ] [Nat]Added 12 Read/Feed constraints in 12 ms returned sat
[2021-05-09 07:59:02] [INFO ] Computed and/alt/rep : 81/411/81 causal constraints (skipped 49 transitions) in 8 ms.
[2021-05-09 07:59:02] [INFO ] Added : 25 causal constraints over 5 iterations in 78 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4600 steps, including 243 resets, run finished after 9 ms. (steps per millisecond=511 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 132/132 transitions.
Graph (complete) has 559 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 142 /143 variables (removed 1) and now considering 132/132 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 142/143 places, 132/132 transitions.
// Phase 1: matrix 132 rows 142 cols
[2021-05-09 07:59:02] [INFO ] Computed 51 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 29828 resets, run finished after 1727 ms. (steps per millisecond=579 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 18460 resets, run finished after 1105 ms. (steps per millisecond=904 ) properties (out of 1) seen :0
// Phase 1: matrix 132 rows 142 cols
[2021-05-09 07:59:05] [INFO ] Computed 51 place invariants in 3 ms
[2021-05-09 07:59:05] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2021-05-09 07:59:05] [INFO ] [Real]Absence check using 36 positive and 15 generalized place invariants in 5 ms returned sat
[2021-05-09 07:59:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:05] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-09 07:59:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-09 07:59:05] [INFO ] [Nat]Absence check using 36 positive and 15 generalized place invariants in 5 ms returned sat
[2021-05-09 07:59:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:05] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-09 07:59:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-09 07:59:05] [INFO ] [Nat]Added 12 Read/Feed constraints in 15 ms returned sat
[2021-05-09 07:59:05] [INFO ] Computed and/alt/rep : 81/411/81 causal constraints (skipped 49 transitions) in 6 ms.
[2021-05-09 07:59:05] [INFO ] Added : 24 causal constraints over 5 iterations in 79 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4600 steps, including 234 resets, run finished after 9 ms. (steps per millisecond=511 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 142/142 places, 132/132 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 132/132 transitions.
Starting structural reductions, iteration 0 : 142/142 places, 132/132 transitions.
Applied a total of 0 rules in 4 ms. Remains 142 /142 variables (removed 0) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 142 cols
[2021-05-09 07:59:05] [INFO ] Computed 51 place invariants in 2 ms
[2021-05-09 07:59:05] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 132 rows 142 cols
[2021-05-09 07:59:05] [INFO ] Computed 51 place invariants in 1 ms
[2021-05-09 07:59:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-09 07:59:05] [INFO ] Implicit Places using invariants and state equation in 329 ms returned [3, 25, 27, 30, 32, 34, 36, 38, 41, 42, 49, 51, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91]
Discarding 30 places :
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 444 ms to find 30 implicit places.
[2021-05-09 07:59:05] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 128 rows 112 cols
[2021-05-09 07:59:05] [INFO ] Computed 21 place invariants in 0 ms
[2021-05-09 07:59:06] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Starting structural reductions, iteration 1 : 112/142 places, 128/132 transitions.
Graph (complete) has 356 edges and 112 vertex of which 102 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 102 transition count 114
Reduce places removed 13 places and 0 transitions.
Graph (complete) has 274 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 88 transition count 114
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 88 transition count 113
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 42 place count 76 transition count 73
Iterating global reduction 3 with 12 rules applied. Total rules applied 54 place count 76 transition count 73
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 76 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 58 place count 74 transition count 71
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 61 place count 71 transition count 68
Iterating global reduction 5 with 3 rules applied. Total rules applied 64 place count 71 transition count 68
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 13 rules applied. Total rules applied 77 place count 64 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 79 place count 63 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 63 transition count 60
Applied a total of 80 rules in 23 ms. Remains 63 /112 variables (removed 49) and now considering 60/128 (removed 68) transitions.
// Phase 1: matrix 60 rows 63 cols
[2021-05-09 07:59:06] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-09 07:59:06] [INFO ] Implicit Places using invariants in 33 ms returned [3, 4, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 ms to find 3 implicit places.
Starting structural reductions, iteration 2 : 60/142 places, 60/132 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 60 transition count 57
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 57
Applied a total of 6 rules in 6 ms. Remains 57 /60 variables (removed 3) and now considering 57/60 (removed 3) transitions.
// Phase 1: matrix 57 rows 57 cols
[2021-05-09 07:59:06] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 07:59:06] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 57 rows 57 cols
[2021-05-09 07:59:06] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-09 07:59:06] [INFO ] State equation strengthened by 32 read => feed constraints.
[2021-05-09 07:59:06] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [11, 17, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 103 ms to find 3 implicit places.
Starting structural reductions, iteration 3 : 54/142 places, 57/132 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 53 transition count 55
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 23 rules applied. Total rules applied 26 place count 39 transition count 46
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 36 transition count 43
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 36 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 36 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 35 transition count 41
Applied a total of 35 rules in 7 ms. Remains 35 /54 variables (removed 19) and now considering 41/57 (removed 16) transitions.
// Phase 1: matrix 41 rows 35 cols
[2021-05-09 07:59:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 07:59:06] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 41 rows 35 cols
[2021-05-09 07:59:06] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 07:59:06] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-09 07:59:06] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Finished structural reductions, in 4 iterations. Remains : 35/142 places, 41/132 transitions.
// Phase 1: matrix 41 rows 35 cols
[2021-05-09 07:59:06] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 52722 resets, run finished after 503 ms. (steps per millisecond=1988 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 29514 resets, run finished after 366 ms. (steps per millisecond=2732 ) properties (out of 1) seen :0
// Phase 1: matrix 41 rows 35 cols
[2021-05-09 07:59:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 07:59:07] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-09 07:59:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-09 07:59:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-09 07:59:07] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-09 07:59:07] [INFO ] [Real]Added 33 Read/Feed constraints in 2 ms returned sat
[2021-05-09 07:59:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-09 07:59:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-09 07:59:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:07] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-09 07:59:07] [INFO ] [Nat]Added 33 Read/Feed constraints in 2 ms returned sat
[2021-05-09 07:59:07] [INFO ] Computed and/alt/rep : 36/257/36 causal constraints (skipped 3 transitions) in 2 ms.
[2021-05-09 07:59:07] [INFO ] Added : 29 causal constraints over 6 iterations in 28 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 3000 steps, including 302 resets, run finished after 3 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 41/41 transitions.
Starting structural reductions, iteration 0 : 35/35 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 35 cols
[2021-05-09 07:59:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 07:59:07] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 41 rows 35 cols
[2021-05-09 07:59:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 07:59:07] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-09 07:59:07] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2021-05-09 07:59:07] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 41 rows 35 cols
[2021-05-09 07:59:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 07:59:07] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 41/41 transitions.
Starting property specific reduction for BusinessProcesses-PT-15-UpperBounds-05
// Phase 1: matrix 41 rows 35 cols
[2021-05-09 07:59:07] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 534 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
// Phase 1: matrix 41 rows 35 cols
[2021-05-09 07:59:07] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 07:59:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-09 07:59:07] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-09 07:59:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:07] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-09 07:59:07] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-09 07:59:07] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2021-05-09 07:59:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-09 07:59:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-09 07:59:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:07] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-09 07:59:07] [INFO ] [Nat]Added 33 Read/Feed constraints in 2 ms returned sat
[2021-05-09 07:59:07] [INFO ] Computed and/alt/rep : 36/257/36 causal constraints (skipped 3 transitions) in 2 ms.
[2021-05-09 07:59:07] [INFO ] Added : 29 causal constraints over 6 iterations in 25 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 3000 steps, including 285 resets, run finished after 3 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 41/41 transitions.
Applied a total of 0 rules in 4 ms. Remains 35 /35 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 41/41 transitions.
// Phase 1: matrix 41 rows 35 cols
[2021-05-09 07:59:07] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 52592 resets, run finished after 361 ms. (steps per millisecond=2770 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 29287 resets, run finished after 363 ms. (steps per millisecond=2754 ) properties (out of 1) seen :0
// Phase 1: matrix 41 rows 35 cols
[2021-05-09 07:59:08] [INFO ] Computed 4 place invariants in 12 ms
[2021-05-09 07:59:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-09 07:59:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-09 07:59:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:08] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-09 07:59:08] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-09 07:59:08] [INFO ] [Real]Added 33 Read/Feed constraints in 4 ms returned sat
[2021-05-09 07:59:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:59:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-09 07:59:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-09 07:59:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:59:08] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-09 07:59:08] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2021-05-09 07:59:08] [INFO ] Computed and/alt/rep : 36/257/36 causal constraints (skipped 3 transitions) in 3 ms.
[2021-05-09 07:59:08] [INFO ] Added : 29 causal constraints over 6 iterations in 43 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 3000 steps, including 298 resets, run finished after 3 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 41/41 transitions.
Starting structural reductions, iteration 0 : 35/35 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 35 cols
[2021-05-09 07:59:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 07:59:08] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 41 rows 35 cols
[2021-05-09 07:59:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 07:59:08] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-09 07:59:08] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2021-05-09 07:59:08] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 41 rows 35 cols
[2021-05-09 07:59:08] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 07:59:08] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 41/41 transitions.
Ending property specific reduction for BusinessProcesses-PT-15-UpperBounds-05 in 1142 ms.
[2021-05-09 07:59:08] [INFO ] Flatten gal took : 37 ms
[2021-05-09 07:59:08] [INFO ] Applying decomposition
[2021-05-09 07:59:08] [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/graph14773035083470683331.txt, -o, /tmp/graph14773035083470683331.bin, -w, /tmp/graph14773035083470683331.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/graph14773035083470683331.bin, -l, -1, -v, -w, /tmp/graph14773035083470683331.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:59:08] [INFO ] Decomposing Gal with order
[2021-05-09 07:59:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:59:08] [INFO ] Removed a total of 42 redundant transitions.
[2021-05-09 07:59:08] [INFO ] Flatten gal took : 42 ms
[2021-05-09 07:59:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 5 ms.
[2021-05-09 07:59:08] [INFO ] Time to serialize gal into /tmp/UpperBounds15559514912249921339.gal : 3 ms
[2021-05-09 07:59:08] [INFO ] Time to serialize properties into /tmp/UpperBounds14242520777605719950.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/UpperBounds15559514912249921339.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14242520777605719950.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/UpperBounds15559514912249921339.gal -t CGAL -reachable-file /tmp/UpperBounds14242520777605719950.prop --nowitness
Loading property file /tmp/UpperBounds14242520777605719950.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,789,0.023887,4276,75,33,585,223,131,799,39,624,0
Total reachable state count : 789

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property BusinessProcesses-PT-15-UpperBounds-05 :0 <= i4.u12.p494 <= 1
FORMULA BusinessProcesses-PT-15-UpperBounds-05 1 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
BusinessProcesses-PT-15-UpperBounds-05,0,0.024559,4276,1,0,585,223,199,799,50,624,153

BK_STOP 1620547149187

--------------------
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="BusinessProcesses-PT-15"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-15, 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 r026-tajo-162038143900435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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