About the Execution of ITS-Tools for BusinessProcesses-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 371.611 | 67362.00 | 91744.00 | 205.30 | 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-162038143900443.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-16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900443
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K 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.5K 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 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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.7K 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 159K 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-16-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-16-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1620547378130
Running Version 0
[2021-05-09 08:03:01] [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 08:03:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:03:01] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2021-05-09 08:03:01] [INFO ] Transformed 638 places.
[2021-05-09 08:03:01] [INFO ] Transformed 578 transitions.
[2021-05-09 08:03:01] [INFO ] Found NUPN structural information;
[2021-05-09 08:03:01] [INFO ] Parsed PT model containing 638 places and 578 transitions in 122 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 570 rows 630 cols
[2021-05-09 08:03:01] [INFO ] Computed 100 place invariants in 46 ms
Incomplete random walk after 10000 steps, including 67 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 15) seen :3
FORMULA BusinessProcesses-PT-16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :1
FORMULA BusinessProcesses-PT-16-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
// Phase 1: matrix 570 rows 630 cols
[2021-05-09 08:03:02] [INFO ] Computed 100 place invariants in 39 ms
[2021-05-09 08:03:02] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2021-05-09 08:03:02] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 11 ms returned sat
[2021-05-09 08:03:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:02] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2021-05-09 08:03:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:03:02] [INFO ] [Nat]Absence check using 62 positive place invariants in 20 ms returned sat
[2021-05-09 08:03:02] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2021-05-09 08:03:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:02] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-09 08:03:02] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 3 ms to minimize.
[2021-05-09 08:03:03] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2021-05-09 08:03:03] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2021-05-09 08:03:03] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2021-05-09 08:03:03] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2021-05-09 08:03:03] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 0 ms to minimize.
[2021-05-09 08:03:03] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2021-05-09 08:03:03] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 11 ms to minimize.
[2021-05-09 08:03:03] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 1 ms to minimize.
[2021-05-09 08:03:04] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:03:04] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 0 ms to minimize.
[2021-05-09 08:03:04] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 1 ms to minimize.
[2021-05-09 08:03:04] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2021-05-09 08:03:04] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 0 ms to minimize.
[2021-05-09 08:03:04] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2021-05-09 08:03:04] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:03:05] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 1 ms to minimize.
[2021-05-09 08:03:05] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 1 ms to minimize.
[2021-05-09 08:03:05] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 0 ms to minimize.
[2021-05-09 08:03:07] [INFO ] Deduced a trap composed of 60 places in 1869 ms of which 1 ms to minimize.
[2021-05-09 08:03:07] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 1 ms to minimize.
[2021-05-09 08:03:07] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
[2021-05-09 08:03:07] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4679 ms
[2021-05-09 08:03:07] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 46 ms.
[2021-05-09 08:03:07] [INFO ] Added : 0 causal constraints over 0 iterations in 52 ms. Result :unknown
[2021-05-09 08:03:07] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2021-05-09 08:03:07] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2021-05-09 08:03:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:07] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2021-05-09 08:03:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:03:08] [INFO ] [Nat]Absence check using 62 positive place invariants in 28 ms returned sat
[2021-05-09 08:03:08] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 61 ms returned sat
[2021-05-09 08:03:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:08] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2021-05-09 08:03:08] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:03:08] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:03:08] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:03:09] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:03:09] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 0 ms to minimize.
[2021-05-09 08:03:09] [INFO ] Deduced a trap composed of 19 places in 582 ms of which 1 ms to minimize.
[2021-05-09 08:03:11] [INFO ] Deduced a trap composed of 36 places in 1257 ms of which 1 ms to minimize.
[2021-05-09 08:03:11] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2021-05-09 08:03:11] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 1 ms to minimize.
[2021-05-09 08:03:11] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:03:11] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 0 ms to minimize.
[2021-05-09 08:03:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3415 ms
[2021-05-09 08:03:11] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 69 ms.
[2021-05-09 08:03:13] [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: Broken pipe ... 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: Broken pipe ...
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 08:03:13] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2021-05-09 08:03:13] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2021-05-09 08:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:13] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2021-05-09 08:03:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:03:13] [INFO ] [Nat]Absence check using 62 positive place invariants in 28 ms returned sat
[2021-05-09 08:03:13] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 16 ms returned sat
[2021-05-09 08:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:13] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2021-05-09 08:03:13] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2021-05-09 08:03:14] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2021-05-09 08:03:14] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2021-05-09 08:03:14] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2021-05-09 08:03:14] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:03:14] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2021-05-09 08:03:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 678 ms
[2021-05-09 08:03:14] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 60 ms.
[2021-05-09 08:03:16] [INFO ] Added : 245 causal constraints over 49 iterations in 1651 ms. Result :sat
Minimization took 98 ms.
[2021-05-09 08:03:16] [INFO ] [Real]Absence check using 62 positive place invariants in 21 ms returned sat
[2021-05-09 08:03:16] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2021-05-09 08:03:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:16] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2021-05-09 08:03:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:03:16] [INFO ] [Nat]Absence check using 62 positive place invariants in 21 ms returned sat
[2021-05-09 08:03:16] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 11 ms returned sat
[2021-05-09 08:03:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:17] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2021-05-09 08:03:17] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:03:17] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:03:17] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:03:17] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 0 ms to minimize.
[2021-05-09 08:03:17] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:03:18] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 1 ms to minimize.
[2021-05-09 08:03:18] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 2 ms to minimize.
[2021-05-09 08:03:18] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 0 ms to minimize.
[2021-05-09 08:03:18] [INFO ] Deduced a trap composed of 56 places in 184 ms of which 1 ms to minimize.
[2021-05-09 08:03:18] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 1 ms to minimize.
[2021-05-09 08:03:19] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 0 ms to minimize.
[2021-05-09 08:03:19] [INFO ] Deduced a trap composed of 144 places in 160 ms of which 1 ms to minimize.
[2021-05-09 08:03:19] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 0 ms to minimize.
[2021-05-09 08:03:19] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:03:19] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 1 ms to minimize.
[2021-05-09 08:03:19] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 1 ms to minimize.
[2021-05-09 08:03:20] [INFO ] Deduced a trap composed of 166 places in 165 ms of which 1 ms to minimize.
[2021-05-09 08:03:20] [INFO ] Deduced a trap composed of 137 places in 167 ms of which 1 ms to minimize.
[2021-05-09 08:03:20] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 1 ms to minimize.
[2021-05-09 08:03:20] [INFO ] Deduced a trap composed of 143 places in 167 ms of which 0 ms to minimize.
[2021-05-09 08:03:20] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 1 ms to minimize.
[2021-05-09 08:03:21] [INFO ] Deduced a trap composed of 140 places in 144 ms of which 1 ms to minimize.
[2021-05-09 08:03:21] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:03:21] [INFO ] Deduced a trap composed of 145 places in 154 ms of which 1 ms to minimize.
[2021-05-09 08:03:21] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:03:21] [INFO ] Deduced a trap composed of 80 places in 164 ms of which 1 ms to minimize.
[2021-05-09 08:03: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 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 08:03:21] [INFO ] [Real]Absence check using 62 positive place invariants in 31 ms returned sat
[2021-05-09 08:03:22] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 22 ms returned sat
[2021-05-09 08:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:22] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2021-05-09 08:03:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:03:22] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2021-05-09 08:03:22] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2021-05-09 08:03:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:22] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2021-05-09 08:03:22] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2021-05-09 08:03:22] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2021-05-09 08:03:23] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2021-05-09 08:03:23] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 8 ms to minimize.
[2021-05-09 08:03:23] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:03:23] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:03:23] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 1 ms to minimize.
[2021-05-09 08:03:23] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2021-05-09 08:03:23] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2021-05-09 08:03:23] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2021-05-09 08:03:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1275 ms
[2021-05-09 08:03:24] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 62 ms.
[2021-05-09 08:03:26] [INFO ] Added : 280 causal constraints over 57 iterations in 2076 ms. Result :sat
Minimization took 96 ms.
[2021-05-09 08:03:26] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2021-05-09 08:03:26] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2021-05-09 08:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:26] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2021-05-09 08:03:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:03:26] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2021-05-09 08:03:26] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2021-05-09 08:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:27] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2021-05-09 08:03:27] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 1 ms to minimize.
[2021-05-09 08:03:27] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 1 ms to minimize.
[2021-05-09 08:03:27] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 1 ms to minimize.
[2021-05-09 08:03:27] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 1 ms to minimize.
[2021-05-09 08:03:28] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 1 ms to minimize.
[2021-05-09 08:03:28] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 0 ms to minimize.
[2021-05-09 08:03:28] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 1 ms to minimize.
[2021-05-09 08:03:28] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:03:28] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 1 ms to minimize.
[2021-05-09 08:03:29] [INFO ] Deduced a trap composed of 142 places in 176 ms of which 1 ms to minimize.
[2021-05-09 08:03:29] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:03:29] [INFO ] Deduced a trap composed of 164 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:03:29] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 1 ms to minimize.
[2021-05-09 08:03:29] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2021-05-09 08:03:29] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2733 ms
[2021-05-09 08:03:29] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 49 ms.
[2021-05-09 08:03:31] [INFO ] Deduced a trap composed of 8 places in 347 ms of which 0 ms to minimize.
[2021-05-09 08:03:31] [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.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 08:03:32] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2021-05-09 08:03:32] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2021-05-09 08:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:32] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2021-05-09 08:03:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:03:32] [INFO ] [Nat]Absence check using 62 positive place invariants in 28 ms returned sat
[2021-05-09 08:03:32] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 28 ms returned sat
[2021-05-09 08:03:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:32] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2021-05-09 08:03:33] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 0 ms to minimize.
[2021-05-09 08:03:33] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 0 ms to minimize.
[2021-05-09 08:03:33] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 1 ms to minimize.
[2021-05-09 08:03:33] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:03:33] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 1 ms to minimize.
[2021-05-09 08:03:34] [INFO ] Deduced a trap composed of 131 places in 181 ms of which 1 ms to minimize.
[2021-05-09 08:03:34] [INFO ] Deduced a trap composed of 38 places in 154 ms of which 0 ms to minimize.
[2021-05-09 08:03:34] [INFO ] Deduced a trap composed of 145 places in 180 ms of which 1 ms to minimize.
[2021-05-09 08:03:34] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 1 ms to minimize.
[2021-05-09 08:03:34] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 1 ms to minimize.
[2021-05-09 08:03:35] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 1 ms to minimize.
[2021-05-09 08:03:35] [INFO ] Deduced a trap composed of 142 places in 147 ms of which 0 ms to minimize.
[2021-05-09 08:03:35] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 1 ms to minimize.
[2021-05-09 08:03:35] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:03:35] [INFO ] Deduced a trap composed of 142 places in 170 ms of which 0 ms to minimize.
[2021-05-09 08:03:35] [INFO ] Deduced a trap composed of 36 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:03:36] [INFO ] Deduced a trap composed of 149 places in 164 ms of which 1 ms to minimize.
[2021-05-09 08:03:36] [INFO ] Deduced a trap composed of 144 places in 159 ms of which 0 ms to minimize.
[2021-05-09 08:03:36] [INFO ] Deduced a trap composed of 145 places in 139 ms of which 1 ms to minimize.
[2021-05-09 08:03:36] [INFO ] Deduced a trap composed of 148 places in 135 ms of which 1 ms to minimize.
[2021-05-09 08:03:36] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 0 ms to minimize.
[2021-05-09 08:03:36] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 1 ms to minimize.
[2021-05-09 08:03:37] [INFO ] Deduced a trap composed of 144 places in 159 ms of which 0 ms to minimize.
[2021-05-09 08:03:37] [INFO ] Deduced a trap composed of 152 places in 141 ms of which 0 ms to minimize.
[2021-05-09 08:03:37] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 0 ms to minimize.
[2021-05-09 08:03: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 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)
[2021-05-09 08:03:37] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2021-05-09 08:03:37] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 16 ms returned sat
[2021-05-09 08:03:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:37] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2021-05-09 08:03:38] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 1 ms to minimize.
[2021-05-09 08:03:38] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2021-05-09 08:03:38] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 1 ms to minimize.
[2021-05-09 08:03:38] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 1 ms to minimize.
[2021-05-09 08:03:38] [INFO ] Deduced a trap composed of 20 places in 186 ms of which 0 ms to minimize.
[2021-05-09 08:03:39] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 1 ms to minimize.
[2021-05-09 08:03:39] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 1 ms to minimize.
[2021-05-09 08:03:39] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 0 ms to minimize.
[2021-05-09 08:03:39] [INFO ] Deduced a trap composed of 36 places in 181 ms of which 0 ms to minimize.
[2021-05-09 08:03:39] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 0 ms to minimize.
[2021-05-09 08:03:40] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 1 ms to minimize.
[2021-05-09 08:03:40] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 1 ms to minimize.
[2021-05-09 08:03:40] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 1 ms to minimize.
[2021-05-09 08:03:40] [INFO ] Deduced a trap composed of 150 places in 199 ms of which 1 ms to minimize.
[2021-05-09 08:03:40] [INFO ] Deduced a trap composed of 164 places in 162 ms of which 0 ms to minimize.
[2021-05-09 08:03:41] [INFO ] Deduced a trap composed of 150 places in 149 ms of which 0 ms to minimize.
[2021-05-09 08:03:41] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3188 ms
[2021-05-09 08:03:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:03:41] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2021-05-09 08:03:41] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2021-05-09 08:03:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:41] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2021-05-09 08:03:41] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 1 ms to minimize.
[2021-05-09 08:03:41] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 0 ms to minimize.
[2021-05-09 08:03:42] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 1 ms to minimize.
[2021-05-09 08:03:42] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 1 ms to minimize.
[2021-05-09 08:03:42] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 1 ms to minimize.
[2021-05-09 08:03:42] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2021-05-09 08:03:42] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 1 ms to minimize.
[2021-05-09 08:03:43] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2021-05-09 08:03:43] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2021-05-09 08:03:43] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2021-05-09 08:03:43] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2021-05-09 08:03:43] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2021-05-09 08:03:43] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2021-05-09 08:03:43] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2021-05-09 08:03:43] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1927 ms
[2021-05-09 08:03:43] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 45 ms.
[2021-05-09 08:03:46] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 0 ms to minimize.
[2021-05-09 08:03:46] [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 08:03:46] [INFO ] [Real]Absence check using 62 positive place invariants in 19 ms returned sat
[2021-05-09 08:03:46] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2021-05-09 08:03:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:46] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-09 08:03:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:03:46] [INFO ] [Nat]Absence check using 62 positive place invariants in 22 ms returned sat
[2021-05-09 08:03:46] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2021-05-09 08:03:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:47] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2021-05-09 08:03:47] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2021-05-09 08:03:47] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2021-05-09 08:03:47] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:03:47] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2021-05-09 08:03:47] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2021-05-09 08:03:47] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2021-05-09 08:03:47] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:03:48] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 1 ms to minimize.
[2021-05-09 08:03:48] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:03:48] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:03:48] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:03:48] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:03:48] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 1 ms to minimize.
[2021-05-09 08:03:48] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 1 ms to minimize.
[2021-05-09 08:03:49] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:03:49] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:03:49] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 1 ms to minimize.
[2021-05-09 08:03:49] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:03:49] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 1 ms to minimize.
[2021-05-09 08:03:49] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:03:49] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:03:50] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:03:50] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:03:50] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:03:50] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 0 ms to minimize.
[2021-05-09 08:03:50] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 0 ms to minimize.
[2021-05-09 08:03:50] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:03:50] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:03:51] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:03:51] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 1 ms to minimize.
[2021-05-09 08:03:51] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2021-05-09 08:03:51] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 0 ms to minimize.
[2021-05-09 08:03:51] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4425 ms
[2021-05-09 08:03:51] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 36 ms.
[2021-05-09 08:03:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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 08:03:51] [INFO ] [Real]Absence check using 62 positive place invariants in 19 ms returned sat
[2021-05-09 08:03:51] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2021-05-09 08:03:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:52] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2021-05-09 08:03:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:03:52] [INFO ] [Nat]Absence check using 62 positive place invariants in 28 ms returned sat
[2021-05-09 08:03:52] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 14 ms returned sat
[2021-05-09 08:03:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:52] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2021-05-09 08:03:52] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 0 ms to minimize.
[2021-05-09 08:03:52] [INFO ] Deduced a trap composed of 127 places in 181 ms of which 1 ms to minimize.
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 0 ms to minimize.
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 0 ms to minimize.
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:03:53] [INFO ] Deduced a trap composed of 71 places in 171 ms of which 1 ms to minimize.
[2021-05-09 08:03:54] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 1 ms to minimize.
[2021-05-09 08:03:54] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 0 ms to minimize.
[2021-05-09 08:03:54] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 0 ms to minimize.
[2021-05-09 08:03:54] [INFO ] Deduced a trap composed of 132 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:03:54] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:03:55] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 1 ms to minimize.
[2021-05-09 08:03:55] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 1 ms to minimize.
[2021-05-09 08:03:55] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:03:55] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 1 ms to minimize.
[2021-05-09 08:03:55] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:03:55] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 1 ms to minimize.
[2021-05-09 08:03:56] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 1 ms to minimize.
[2021-05-09 08:03:56] [INFO ] Deduced a trap composed of 141 places in 207 ms of which 1 ms to minimize.
[2021-05-09 08:03:56] [INFO ] Deduced a trap composed of 146 places in 154 ms of which 0 ms to minimize.
[2021-05-09 08:03:56] [INFO ] Deduced a trap composed of 138 places in 181 ms of which 0 ms to minimize.
[2021-05-09 08:03:56] [INFO ] Deduced a trap composed of 137 places in 152 ms of which 1 ms to minimize.
[2021-05-09 08:03:57] [INFO ] Deduced a trap composed of 133 places in 182 ms of which 0 ms to minimize.
[2021-05-09 08:03:57] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 1 ms to minimize.
[2021-05-09 08:03:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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 08:03:57] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2021-05-09 08:03:57] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 16 ms returned sat
[2021-05-09 08:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:57] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2021-05-09 08:03:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:03:58] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2021-05-09 08:03:58] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2021-05-09 08:03:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:03:58] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2021-05-09 08:03:58] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 0 ms to minimize.
[2021-05-09 08:03:58] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 1 ms to minimize.
[2021-05-09 08:03:58] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2021-05-09 08:03:59] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2021-05-09 08:03:59] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 1 ms to minimize.
[2021-05-09 08:03:59] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:03:59] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 0 ms to minimize.
[2021-05-09 08:03:59] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2021-05-09 08:03:59] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 0 ms to minimize.
[2021-05-09 08:03:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1517 ms
[2021-05-09 08:03:59] [INFO ] Computed and/alt/rep : 535/875/535 causal constraints (skipped 34 transitions) in 41 ms.
[2021-05-09 08:04:01] [INFO ] Added : 254 causal constraints over 52 iterations in 1660 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 32400 steps, including 133 resets, run finished after 155 ms. (steps per millisecond=209 ) properties (out of 11) seen :5 could not realise parikh vector
FORMULA BusinessProcesses-PT-16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 28300 steps, including 215 resets, run finished after 115 ms. (steps per millisecond=246 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 27500 steps, including 118 resets, run finished after 101 ms. (steps per millisecond=272 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 40200 steps, including 307 resets, run finished after 135 ms. (steps per millisecond=297 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 6 out of 630 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 630/630 places, 570/570 transitions.
Graph (trivial) has 362 edges and 630 vertex of which 7 / 630 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 1283 edges and 624 vertex of which 618 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 144 place count 618 transition count 419
Reduce places removed 142 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 143 rules applied. Total rules applied 287 place count 476 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 288 place count 475 transition count 418
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 288 place count 475 transition count 329
Deduced a syphon composed of 89 places in 2 ms
Ensure Unique test removed 16 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 482 place count 370 transition count 329
Discarding 88 places :
Symmetric choice reduction at 3 with 88 rule applications. Total rules 570 place count 282 transition count 241
Iterating global reduction 3 with 88 rules applied. Total rules applied 658 place count 282 transition count 241
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 658 place count 282 transition count 231
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 681 place count 269 transition count 231
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 869 place count 174 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 871 place count 173 transition count 142
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 873 place count 173 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 875 place count 171 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 876 place count 171 transition count 140
Applied a total of 876 rules in 172 ms. Remains 171 /630 variables (removed 459) and now considering 140/570 (removed 430) transitions.
Finished structural reductions, in 1 iterations. Remains : 171/630 places, 140/570 transitions.
// Phase 1: matrix 140 rows 171 cols
[2021-05-09 08:04:02] [INFO ] Computed 74 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 41860 resets, run finished after 3028 ms. (steps per millisecond=330 ) properties (out of 6) seen :6
FORMULA BusinessProcesses-PT-16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
BK_STOP 1620547445492
--------------------
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-16"
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-16, 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-162038143900443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 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 ;