About the Execution of ITS-Tools for BusinessProcesses-PT-11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 699.403 | 58445.00 | 80811.00 | 104.00 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
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-162038143800403.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-11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800403
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.7K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K 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.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:14 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 141K 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-11-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-11-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1620545103423
Running Version 0
[2021-05-09 07:25:04] [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:25:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:25:04] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2021-05-09 07:25:05] [INFO ] Transformed 567 places.
[2021-05-09 07:25:05] [INFO ] Transformed 508 transitions.
[2021-05-09 07:25:05] [INFO ] Found NUPN structural information;
[2021-05-09 07:25:05] [INFO ] Parsed PT model containing 567 places and 508 transitions in 99 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 7 transitions.
// Phase 1: matrix 501 rows 560 cols
[2021-05-09 07:25:05] [INFO ] Computed 95 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 75 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :9
FORMULA BusinessProcesses-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
// Phase 1: matrix 501 rows 560 cols
[2021-05-09 07:25:05] [INFO ] Computed 95 place invariants in 16 ms
[2021-05-09 07:25:05] [INFO ] [Real]Absence check using 53 positive place invariants in 27 ms returned sat
[2021-05-09 07:25:05] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 10 ms returned sat
[2021-05-09 07:25:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:05] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-09 07:25:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:25:05] [INFO ] [Nat]Absence check using 53 positive place invariants in 18 ms returned sat
[2021-05-09 07:25:05] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 9 ms returned sat
[2021-05-09 07:25:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:06] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2021-05-09 07:25:06] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 6 ms to minimize.
[2021-05-09 07:25:06] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 2 ms to minimize.
[2021-05-09 07:25:06] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 2 ms to minimize.
[2021-05-09 07:25:06] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:25:06] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
[2021-05-09 07:25:07] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 0 ms to minimize.
[2021-05-09 07:25:07] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2021-05-09 07:25:07] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:25:07] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 1 ms to minimize.
[2021-05-09 07:25:07] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:25:07] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 1 ms to minimize.
[2021-05-09 07:25:07] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2021-05-09 07:25:08] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:25:08] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:25:08] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 0 ms to minimize.
[2021-05-09 07:25:08] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:25:08] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 0 ms to minimize.
[2021-05-09 07:25:08] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 0 ms to minimize.
[2021-05-09 07:25:09] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:25:09] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 0 ms to minimize.
[2021-05-09 07:25:09] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 1 ms to minimize.
[2021-05-09 07:25:09] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:25:09] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2021-05-09 07:25:09] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 1 ms to minimize.
[2021-05-09 07:25:10] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 4 ms to minimize.
[2021-05-09 07:25:10] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 0 ms to minimize.
[2021-05-09 07:25:10] [INFO ] Deduced a trap composed of 127 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:25:10] [INFO ] Deduced a trap composed of 120 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:25:10] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 0 ms to minimize.
[2021-05-09 07:25:10] [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:25:10] [INFO ] [Real]Absence check using 53 positive place invariants in 26 ms returned sat
[2021-05-09 07:25:10] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 12 ms returned sat
[2021-05-09 07:25:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:11] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2021-05-09 07:25:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:25:11] [INFO ] [Nat]Absence check using 53 positive place invariants in 27 ms returned sat
[2021-05-09 07:25:11] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 12 ms returned sat
[2021-05-09 07:25:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:11] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2021-05-09 07:25:11] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 1 ms to minimize.
[2021-05-09 07:25:11] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 1 ms to minimize.
[2021-05-09 07:25:11] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 1 ms to minimize.
[2021-05-09 07:25:12] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 1 ms to minimize.
[2021-05-09 07:25:12] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:25:12] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 7 ms to minimize.
[2021-05-09 07:25:12] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:25:12] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2021-05-09 07:25:12] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 1 ms to minimize.
[2021-05-09 07:25:13] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 1 ms to minimize.
[2021-05-09 07:25:13] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 2 ms to minimize.
[2021-05-09 07:25:13] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 1 ms to minimize.
[2021-05-09 07:25:13] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 0 ms to minimize.
[2021-05-09 07:25:13] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 1 ms to minimize.
[2021-05-09 07:25:14] [INFO ] Deduced a trap composed of 113 places in 168 ms of which 1 ms to minimize.
[2021-05-09 07:25:14] [INFO ] Deduced a trap composed of 99 places in 166 ms of which 0 ms to minimize.
[2021-05-09 07:25:14] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:25:14] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 1 ms to minimize.
[2021-05-09 07:25:14] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 1 ms to minimize.
[2021-05-09 07:25:14] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 1 ms to minimize.
[2021-05-09 07:25:15] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 0 ms to minimize.
[2021-05-09 07:25:15] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 0 ms to minimize.
[2021-05-09 07:25:15] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 0 ms to minimize.
[2021-05-09 07:25:15] [INFO ] Deduced a trap composed of 132 places in 143 ms of which 0 ms to minimize.
[2021-05-09 07:25:15] [INFO ] Deduced a trap composed of 149 places in 143 ms of which 1 ms to minimize.
[2021-05-09 07:25:15] [INFO ] Deduced a trap composed of 132 places in 120 ms of which 1 ms to minimize.
[2021-05-09 07:25:16] [INFO ] Deduced a trap composed of 147 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:25:16] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 13 ms to minimize.
[2021-05-09 07:25:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 07:25:16] [INFO ] [Real]Absence check using 53 positive place invariants in 21 ms returned sat
[2021-05-09 07:25:16] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 13 ms returned sat
[2021-05-09 07:25:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:16] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-09 07:25:16] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2021-05-09 07:25:16] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 0 ms to minimize.
[2021-05-09 07:25:17] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2021-05-09 07:25:17] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 1 ms to minimize.
[2021-05-09 07:25:17] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 1 ms to minimize.
[2021-05-09 07:25:17] [INFO ] Deduced a trap composed of 124 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:25:17] [INFO ] Deduced a trap composed of 122 places in 141 ms of which 1 ms to minimize.
[2021-05-09 07:25:17] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 1 ms to minimize.
[2021-05-09 07:25:17] [INFO ] Deduced a trap composed of 104 places in 167 ms of which 2 ms to minimize.
[2021-05-09 07:25:18] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 0 ms to minimize.
[2021-05-09 07:25:18] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 2 ms to minimize.
[2021-05-09 07:25:18] [INFO ] Deduced a trap composed of 117 places in 175 ms of which 8 ms to minimize.
[2021-05-09 07:25:18] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 1 ms to minimize.
[2021-05-09 07:25:18] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2021-05-09 07:25:18] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 0 ms to minimize.
[2021-05-09 07:25:19] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 1 ms to minimize.
[2021-05-09 07:25:19] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:25:19] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:25:19] [INFO ] Deduced a trap composed of 107 places in 166 ms of which 1 ms to minimize.
[2021-05-09 07:25:19] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 1 ms to minimize.
[2021-05-09 07:25:19] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2021-05-09 07:25:20] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 0 ms to minimize.
[2021-05-09 07:25:20] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:25:20] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 0 ms to minimize.
[2021-05-09 07:25:20] [INFO ] Deduced a trap composed of 123 places in 107 ms of which 1 ms to minimize.
[2021-05-09 07:25:20] [INFO ] Deduced a trap composed of 106 places in 171 ms of which 0 ms to minimize.
[2021-05-09 07:25:20] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:25:20] [INFO ] Deduced a trap composed of 108 places in 163 ms of which 1 ms to minimize.
[2021-05-09 07:25:21] [INFO ] Deduced a trap composed of 108 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:25:21] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 1 ms to minimize.
[2021-05-09 07:25:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:2242)
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:25:21] [INFO ] [Real]Absence check using 53 positive place invariants in 21 ms returned sat
[2021-05-09 07:25:21] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 12 ms returned sat
[2021-05-09 07:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:21] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2021-05-09 07:25:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:25:21] [INFO ] [Nat]Absence check using 53 positive place invariants in 23 ms returned sat
[2021-05-09 07:25:21] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 19 ms returned sat
[2021-05-09 07:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:22] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2021-05-09 07:25:22] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 1 ms to minimize.
[2021-05-09 07:25:22] [INFO ] Deduced a trap composed of 101 places in 263 ms of which 1 ms to minimize.
[2021-05-09 07:25:22] [INFO ] Deduced a trap composed of 103 places in 255 ms of which 1 ms to minimize.
[2021-05-09 07:25:23] [INFO ] Deduced a trap composed of 15 places in 230 ms of which 1 ms to minimize.
[2021-05-09 07:25:23] [INFO ] Deduced a trap composed of 36 places in 179 ms of which 1 ms to minimize.
[2021-05-09 07:25:23] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 0 ms to minimize.
[2021-05-09 07:25:23] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:25:23] [INFO ] Deduced a trap composed of 121 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:25:23] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:25:23] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 0 ms to minimize.
[2021-05-09 07:25:24] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:25:24] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:25:24] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:25:24] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 0 ms to minimize.
[2021-05-09 07:25:24] [INFO ] Deduced a trap composed of 39 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:25:24] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:25:24] [INFO ] Deduced a trap composed of 142 places in 151 ms of which 1 ms to minimize.
[2021-05-09 07:25:25] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:25:25] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2021-05-09 07:25:25] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:25:25] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 1 ms to minimize.
[2021-05-09 07:25:25] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 0 ms to minimize.
[2021-05-09 07:25:25] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 1 ms to minimize.
[2021-05-09 07:25:25] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:25:26] [INFO ] Deduced a trap composed of 113 places in 106 ms of which 1 ms to minimize.
[2021-05-09 07:25:26] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:25:26] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 0 ms to minimize.
[2021-05-09 07:25:26] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 1 ms to minimize.
[2021-05-09 07:25:26] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 1 ms to minimize.
[2021-05-09 07:25:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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:25:26] [INFO ] [Real]Absence check using 53 positive place invariants in 22 ms returned sat
[2021-05-09 07:25:26] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 12 ms returned sat
[2021-05-09 07:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:27] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2021-05-09 07:25:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:25:27] [INFO ] [Nat]Absence check using 53 positive place invariants in 22 ms returned sat
[2021-05-09 07:25:27] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-09 07:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:27] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2021-05-09 07:25:27] [INFO ] Deduced a trap composed of 27 places in 187 ms of which 1 ms to minimize.
[2021-05-09 07:25:27] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 1 ms to minimize.
[2021-05-09 07:25:28] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2021-05-09 07:25:28] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 1 ms to minimize.
[2021-05-09 07:25:28] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 1 ms to minimize.
[2021-05-09 07:25:28] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 0 ms to minimize.
[2021-05-09 07:25:28] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 0 ms to minimize.
[2021-05-09 07:25:28] [INFO ] Deduced a trap composed of 125 places in 159 ms of which 0 ms to minimize.
[2021-05-09 07:25:28] [INFO ] Deduced a trap composed of 125 places in 157 ms of which 1 ms to minimize.
[2021-05-09 07:25:29] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 1 ms to minimize.
[2021-05-09 07:25:29] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2021-05-09 07:25:29] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 0 ms to minimize.
[2021-05-09 07:25:29] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 1 ms to minimize.
[2021-05-09 07:25:29] [INFO ] Deduced a trap composed of 117 places in 135 ms of which 1 ms to minimize.
[2021-05-09 07:25:29] [INFO ] Deduced a trap composed of 136 places in 132 ms of which 0 ms to minimize.
[2021-05-09 07:25:30] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:25:30] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2021-05-09 07:25:30] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2021-05-09 07:25:30] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2021-05-09 07:25:30] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:25:30] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2798 ms
[2021-05-09 07:25:30] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 31 ms.
[2021-05-09 07:25:32] [INFO ] Added : 210 causal constraints over 42 iterations in 1905 ms. Result :unknown
[2021-05-09 07:25:32] [INFO ] [Real]Absence check using 53 positive place invariants in 21 ms returned sat
[2021-05-09 07:25:32] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-09 07:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:32] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2021-05-09 07:25:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:25:32] [INFO ] [Nat]Absence check using 53 positive place invariants in 24 ms returned sat
[2021-05-09 07:25:32] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 19 ms returned sat
[2021-05-09 07:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:32] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2021-05-09 07:25:33] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2021-05-09 07:25:33] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 1 ms to minimize.
[2021-05-09 07:25:33] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2021-05-09 07:25:33] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 0 ms to minimize.
[2021-05-09 07:25:33] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2021-05-09 07:25:34] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 1 ms to minimize.
[2021-05-09 07:25:34] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:25:34] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 1 ms to minimize.
[2021-05-09 07:25:34] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 1 ms to minimize.
[2021-05-09 07:25:34] [INFO ] Deduced a trap composed of 111 places in 102 ms of which 1 ms to minimize.
[2021-05-09 07:25:34] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 0 ms to minimize.
[2021-05-09 07:25:34] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:25:34] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:25:35] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 0 ms to minimize.
[2021-05-09 07:25:35] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 1 ms to minimize.
[2021-05-09 07:25:35] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 13 ms to minimize.
[2021-05-09 07:25:35] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:25:35] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 0 ms to minimize.
[2021-05-09 07:25:35] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:25:35] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:25:36] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 0 ms to minimize.
[2021-05-09 07:25:36] [INFO ] Deduced a trap composed of 123 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:25:36] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:25:36] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:25:36] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3336 ms
[2021-05-09 07:25:36] [INFO ] Computed and/alt/rep : 471/791/471 causal constraints (skipped 29 transitions) in 51 ms.
[2021-05-09 07:25:37] [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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 07:25:37] [INFO ] [Real]Absence check using 53 positive place invariants in 20 ms returned sat
[2021-05-09 07:25:37] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-09 07:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:37] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2021-05-09 07:25:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:25:38] [INFO ] [Nat]Absence check using 53 positive place invariants in 33 ms returned sat
[2021-05-09 07:25:38] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 20 ms returned sat
[2021-05-09 07:25:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:38] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2021-05-09 07:25:38] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2021-05-09 07:25:38] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2021-05-09 07:25:38] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 0 ms to minimize.
[2021-05-09 07:25:39] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 1 ms to minimize.
[2021-05-09 07:25:39] [INFO ] Deduced a trap composed of 118 places in 126 ms of which 0 ms to minimize.
[2021-05-09 07:25:39] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 0 ms to minimize.
[2021-05-09 07:25:39] [INFO ] Deduced a trap composed of 116 places in 147 ms of which 0 ms to minimize.
[2021-05-09 07:25:39] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:25:39] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 0 ms to minimize.
[2021-05-09 07:25:39] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:25:40] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2021-05-09 07:25:40] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 0 ms to minimize.
[2021-05-09 07:25:40] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 0 ms to minimize.
[2021-05-09 07:25:40] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:25:40] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:25:40] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2021-05-09 07:25:40] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 1 ms to minimize.
[2021-05-09 07:25:41] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 0 ms to minimize.
[2021-05-09 07:25:41] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 1 ms to minimize.
[2021-05-09 07:25:41] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 0 ms to minimize.
[2021-05-09 07:25:41] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:25:41] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 0 ms to minimize.
[2021-05-09 07:25:41] [INFO ] Deduced a trap composed of 138 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:25:41] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:25:42] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 0 ms to minimize.
[2021-05-09 07:25:42] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 1 ms to minimize.
[2021-05-09 07:25:42] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 0 ms to minimize.
[2021-05-09 07:25:42] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 1 ms to minimize.
[2021-05-09 07:25:42] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 1 ms to minimize.
[2021-05-09 07:25:42] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 1 ms to minimize.
[2021-05-09 07:25:42] [INFO ] Deduced a trap composed of 124 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:25:42] [INFO ] Deduced a trap composed of 144 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:25:43] [INFO ] Deduced a trap composed of 122 places in 144 ms of which 1 ms to minimize.
[2021-05-09 07:25:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 33200 steps, including 272 resets, run finished after 76 ms. (steps per millisecond=436 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 7 out of 560 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 560/560 places, 501/501 transitions.
Graph (trivial) has 307 edges and 560 vertex of which 7 / 560 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1132 edges and 554 vertex of which 549 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 119 place count 549 transition count 375
Reduce places removed 117 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 432 transition count 373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 240 place count 430 transition count 373
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 240 place count 430 transition count 286
Deduced a syphon composed of 87 places in 3 ms
Ensure Unique test removed 18 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 432 place count 325 transition count 286
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 496 place count 261 transition count 222
Iterating global reduction 3 with 64 rules applied. Total rules applied 560 place count 261 transition count 222
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 560 place count 261 transition count 218
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 568 place count 257 transition count 218
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 181 rules applied. Total rules applied 749 place count 165 transition count 129
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 751 place count 164 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 753 place count 164 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 755 place count 162 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 756 place count 162 transition count 131
Applied a total of 756 rules in 189 ms. Remains 162 /560 variables (removed 398) and now considering 131/501 (removed 370) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/560 places, 131/501 transitions.
// Phase 1: matrix 131 rows 162 cols
[2021-05-09 07:25:43] [INFO ] Computed 70 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 54797 resets, run finished after 2802 ms. (steps per millisecond=356 ) properties (out of 7) seen :6
FORMULA BusinessProcesses-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 27637 resets, run finished after 1647 ms. (steps per millisecond=607 ) properties (out of 1) seen :0
// Phase 1: matrix 131 rows 162 cols
[2021-05-09 07:25:47] [INFO ] Computed 70 place invariants in 5 ms
[2021-05-09 07:25:47] [INFO ] [Real]Absence check using 50 positive place invariants in 20 ms returned sat
[2021-05-09 07:25:47] [INFO ] [Real]Absence check using 50 positive and 20 generalized place invariants in 6 ms returned sat
[2021-05-09 07:25:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:48] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-09 07:25:48] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-09 07:25:48] [INFO ] [Real]Added 14 Read/Feed constraints in 11 ms returned sat
[2021-05-09 07:25:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:25:48] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2021-05-09 07:25:48] [INFO ] [Nat]Absence check using 50 positive and 20 generalized place invariants in 6 ms returned sat
[2021-05-09 07:25:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:48] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2021-05-09 07:25:48] [INFO ] [Nat]Added 14 Read/Feed constraints in 22 ms returned sat
[2021-05-09 07:25:48] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 0 ms to minimize.
[2021-05-09 07:25:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2021-05-09 07:25:48] [INFO ] Computed and/alt/rep : 84/403/84 causal constraints (skipped 45 transitions) in 15 ms.
[2021-05-09 07:25:48] [INFO ] Added : 22 causal constraints over 5 iterations in 112 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4900 steps, including 113 resets, run finished after 32 ms. (steps per millisecond=153 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 162/162 places, 131/131 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 160 transition count 129
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 160 transition count 127
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 158 transition count 127
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 155 transition count 124
Applied a total of 14 rules in 37 ms. Remains 155 /162 variables (removed 7) and now considering 124/131 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 155/162 places, 124/131 transitions.
// Phase 1: matrix 124 rows 155 cols
[2021-05-09 07:25:48] [INFO ] Computed 70 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 57165 resets, run finished after 2799 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 30414 resets, run finished after 1941 ms. (steps per millisecond=515 ) properties (out of 1) seen :0
// Phase 1: matrix 124 rows 155 cols
[2021-05-09 07:25:53] [INFO ] Computed 70 place invariants in 5 ms
[2021-05-09 07:25:53] [INFO ] [Real]Absence check using 48 positive place invariants in 5 ms returned sat
[2021-05-09 07:25:53] [INFO ] [Real]Absence check using 48 positive and 22 generalized place invariants in 3 ms returned sat
[2021-05-09 07:25:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:53] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-09 07:25:53] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-09 07:25:53] [INFO ] [Real]Added 14 Read/Feed constraints in 12 ms returned sat
[2021-05-09 07:25:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:25:53] [INFO ] [Nat]Absence check using 48 positive place invariants in 7 ms returned sat
[2021-05-09 07:25:53] [INFO ] [Nat]Absence check using 48 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 07:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:53] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2021-05-09 07:25:53] [INFO ] [Nat]Added 14 Read/Feed constraints in 14 ms returned sat
[2021-05-09 07:25:53] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2021-05-09 07:25:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2021-05-09 07:25:53] [INFO ] Computed and/alt/rep : 77/396/77 causal constraints (skipped 45 transitions) in 12 ms.
[2021-05-09 07:25:53] [INFO ] Added : 21 causal constraints over 5 iterations in 98 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4800 steps, including 122 resets, run finished after 27 ms. (steps per millisecond=177 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 124/124 transitions.
Applied a total of 0 rules in 8 ms. Remains 155 /155 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 155/155 places, 124/124 transitions.
Starting structural reductions, iteration 0 : 155/155 places, 124/124 transitions.
Applied a total of 0 rules in 12 ms. Remains 155 /155 variables (removed 0) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 155 cols
[2021-05-09 07:25:53] [INFO ] Computed 70 place invariants in 2 ms
[2021-05-09 07:25:53] [INFO ] Implicit Places using invariants in 198 ms returned [1, 4, 5, 28, 29, 30, 31, 38, 39, 40, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 200 ms to find 21 implicit places.
[2021-05-09 07:25:53] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 124 rows 134 cols
[2021-05-09 07:25:53] [INFO ] Computed 49 place invariants in 1 ms
[2021-05-09 07:25:54] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Starting structural reductions, iteration 1 : 134/155 places, 124/124 transitions.
Applied a total of 0 rules in 6 ms. Remains 134 /134 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2021-05-09 07:25:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 124 rows 134 cols
[2021-05-09 07:25:54] [INFO ] Computed 49 place invariants in 1 ms
[2021-05-09 07:25:54] [INFO ] Dead Transitions using invariants and state equation in 165 ms returned []
Finished structural reductions, in 2 iterations. Remains : 134/155 places, 124/124 transitions.
Successfully produced net in file /tmp/petri1000_16029761170515708201.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
// Phase 1: matrix 123 rows 134 cols
[2021-05-09 07:25:54] [INFO ] Computed 50 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 57395 resets, run finished after 1359 ms. (steps per millisecond=735 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 30665 resets, run finished after 879 ms. (steps per millisecond=1137 ) properties (out of 1) seen :0
// Phase 1: matrix 123 rows 134 cols
[2021-05-09 07:25:56] [INFO ] Computed 50 place invariants in 4 ms
[2021-05-09 07:25:56] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2021-05-09 07:25:56] [INFO ] [Real]Absence check using 32 positive and 18 generalized place invariants in 3 ms returned sat
[2021-05-09 07:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:56] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-09 07:25:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:25:56] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2021-05-09 07:25:56] [INFO ] [Nat]Absence check using 32 positive and 18 generalized place invariants in 3 ms returned sat
[2021-05-09 07:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:56] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2021-05-09 07:25:56] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-09 07:25:56] [INFO ] [Nat]Added 14 Read/Feed constraints in 8 ms returned sat
[2021-05-09 07:25:56] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2021-05-09 07:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2021-05-09 07:25:56] [INFO ] Computed and/alt/rep : 77/392/77 causal constraints (skipped 44 transitions) in 11 ms.
[2021-05-09 07:25:56] [INFO ] Added : 21 causal constraints over 5 iterations in 63 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4800 steps, including 114 resets, run finished after 9 ms. (steps per millisecond=533 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 134/134 places, 123/123 transitions.
Graph (complete) has 531 edges and 134 vertex of which 133 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 5 ms. Remains 133 /134 variables (removed 1) and now considering 123/123 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/134 places, 123/123 transitions.
// Phase 1: matrix 123 rows 133 cols
[2021-05-09 07:25:56] [INFO ] Computed 49 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 57023 resets, run finished after 1404 ms. (steps per millisecond=712 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 30480 resets, run finished after 1057 ms. (steps per millisecond=946 ) properties (out of 1) seen :0
// Phase 1: matrix 123 rows 133 cols
[2021-05-09 07:25:59] [INFO ] Computed 49 place invariants in 5 ms
[2021-05-09 07:25:59] [INFO ] [Real]Absence check using 29 positive place invariants in 3 ms returned sat
[2021-05-09 07:25:59] [INFO ] [Real]Absence check using 29 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-09 07:25:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:59] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-09 07:25:59] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-09 07:25:59] [INFO ] [Real]Added 14 Read/Feed constraints in 5 ms returned sat
[2021-05-09 07:25:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:25:59] [INFO ] [Nat]Absence check using 29 positive place invariants in 7 ms returned sat
[2021-05-09 07:25:59] [INFO ] [Nat]Absence check using 29 positive and 20 generalized place invariants in 5 ms returned sat
[2021-05-09 07:25:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:25:59] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-09 07:25:59] [INFO ] [Nat]Added 14 Read/Feed constraints in 13 ms returned sat
[2021-05-09 07:25:59] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2021-05-09 07:25:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2021-05-09 07:25:59] [INFO ] Computed and/alt/rep : 77/392/77 causal constraints (skipped 44 transitions) in 12 ms.
[2021-05-09 07:25:59] [INFO ] Added : 21 causal constraints over 5 iterations in 103 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4800 steps, including 116 resets, run finished after 12 ms. (steps per millisecond=400 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 133/133 places, 123/123 transitions.
Applied a total of 0 rules in 8 ms. Remains 133 /133 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 123/123 transitions.
Starting structural reductions, iteration 0 : 133/133 places, 123/123 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 133 cols
[2021-05-09 07:25:59] [INFO ] Computed 49 place invariants in 2 ms
[2021-05-09 07:25:59] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 123 rows 133 cols
[2021-05-09 07:25:59] [INFO ] Computed 49 place invariants in 1 ms
[2021-05-09 07:25:59] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-09 07:26:00] [INFO ] Implicit Places using invariants and state equation in 287 ms returned [3, 25, 27, 29, 39, 40, 46, 48, 50, 52, 54, 57, 58, 60, 62, 64, 66, 68, 70, 72, 74, 75, 77, 79, 81, 83, 85]
Discarding 27 places :
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 377 ms to find 27 implicit places.
[2021-05-09 07:26:00] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 119 rows 106 cols
[2021-05-09 07:26:00] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-09 07:26:00] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Starting structural reductions, iteration 1 : 106/133 places, 119/123 transitions.
Graph (complete) has 343 edges and 106 vertex of which 96 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 96 transition count 106
Reduce places removed 12 places and 0 transitions.
Graph (complete) has 262 edges and 84 vertex of which 82 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 82 transition count 106
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 82 transition count 104
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 38 place count 73 transition count 68
Iterating global reduction 3 with 9 rules applied. Total rules applied 47 place count 73 transition count 68
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 63 place count 64 transition count 61
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 3 with 2 rules applied. Total rules applied 65 place count 63 transition count 60
Applied a total of 65 rules in 18 ms. Remains 63 /106 variables (removed 43) and now considering 60/119 (removed 59) transitions.
// Phase 1: matrix 60 rows 63 cols
[2021-05-09 07:26:00] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-09 07:26:00] [INFO ] Implicit Places using invariants in 60 ms returned [3, 4, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions, iteration 2 : 60/133 places, 60/123 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 5 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:26:00] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-09 07:26:00] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 57 rows 57 cols
[2021-05-09 07:26:00] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-09 07:26:00] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-09 07:26:00] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [7, 15, 17]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 173 ms to find 3 implicit places.
Starting structural reductions, iteration 3 : 54/133 places, 57/123 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 53 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 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 0 with 23 rules applied. Total rules applied 25 place count 39 transition count 46
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 28 place count 36 transition count 43
Iterating global reduction 0 with 3 rules applied. Total rules applied 31 place count 36 transition count 43
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 0 with 2 rules applied. Total rules applied 33 place count 35 transition count 42
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 35 place count 35 transition count 40
Applied a total of 35 rules in 12 ms. Remains 35 /54 variables (removed 19) and now considering 40/57 (removed 17) transitions.
// Phase 1: matrix 40 rows 35 cols
[2021-05-09 07:26:00] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 07:26:00] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 40 rows 35 cols
[2021-05-09 07:26:00] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 07:26:00] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-09 07:26:00] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Finished structural reductions, in 4 iterations. Remains : 35/133 places, 40/123 transitions.
// Phase 1: matrix 40 rows 35 cols
[2021-05-09 07:26:00] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 97177 resets, run finished after 463 ms. (steps per millisecond=2159 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 43454 resets, run finished after 261 ms. (steps per millisecond=3831 ) properties (out of 1) seen :0
// Phase 1: matrix 40 rows 35 cols
[2021-05-09 07:26:01] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 07:26:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-09 07:26:01] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 07:26:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-09 07:26:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:26:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 07:26:01] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 07:26:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:26:01] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-09 07:26:01] [INFO ] State equation strengthened by 33 read => feed constraints.
[2021-05-09 07:26:01] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2021-05-09 07:26:01] [INFO ] Computed and/alt/rep : 36/230/36 causal constraints (skipped 2 transitions) in 4 ms.
[2021-05-09 07:26:01] [INFO ] Added : 28 causal constraints over 6 iterations in 45 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 2900 steps, including 286 resets, run finished after 6 ms. (steps per millisecond=483 ) properties (out of 1) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
BK_STOP 1620545161868
--------------------
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-11"
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-11, 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-162038143800403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 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 '
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 ;