About the Execution of ITS-Tools for BusinessProcesses-PT-17
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 515.195 | 72129.00 | 102885.00 | 314.50 | 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-162038143900451.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-17, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143900451
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K 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.2K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 4.1K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 161K 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-17-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1620548207296
Running Version 0
[2021-05-09 08:16:49] [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:16:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:16:49] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2021-05-09 08:16:49] [INFO ] Transformed 650 places.
[2021-05-09 08:16:49] [INFO ] Transformed 580 transitions.
[2021-05-09 08:16:49] [INFO ] Found NUPN structural information;
[2021-05-09 08:16:49] [INFO ] Parsed PT model containing 650 places and 580 transitions in 160 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
// Phase 1: matrix 576 rows 646 cols
[2021-05-09 08:16:49] [INFO ] Computed 108 place invariants in 74 ms
Incomplete random walk after 10000 steps, including 67 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :1
FORMULA BusinessProcesses-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
// Phase 1: matrix 576 rows 646 cols
[2021-05-09 08:16:49] [INFO ] Computed 108 place invariants in 32 ms
[2021-05-09 08:16:50] [INFO ] [Real]Absence check using 62 positive place invariants in 34 ms returned sat
[2021-05-09 08:16:50] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 19 ms returned sat
[2021-05-09 08:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:16:50] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2021-05-09 08:16:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:16:50] [INFO ] [Nat]Absence check using 62 positive place invariants in 33 ms returned sat
[2021-05-09 08:16:51] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 91 ms returned sat
[2021-05-09 08:16:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:16:51] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2021-05-09 08:16:51] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 6 ms to minimize.
[2021-05-09 08:16:51] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 2 ms to minimize.
[2021-05-09 08:16:52] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2021-05-09 08:16:52] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2021-05-09 08:16:52] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 1 ms to minimize.
[2021-05-09 08:16:52] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2021-05-09 08:16:52] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 1 ms to minimize.
[2021-05-09 08:16:52] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 14 ms to minimize.
[2021-05-09 08:16:53] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:16:53] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 12 ms to minimize.
[2021-05-09 08:16:53] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 1 ms to minimize.
[2021-05-09 08:16:53] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 0 ms to minimize.
[2021-05-09 08:16:53] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:16:53] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 0 ms to minimize.
[2021-05-09 08:16:53] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:16:54] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:16:54] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:16:54] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:16:54] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 1 ms to minimize.
[2021-05-09 08:16:54] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:16:54] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 0 ms to minimize.
[2021-05-09 08:16:54] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 9 ms to minimize.
[2021-05-09 08:16:55] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 0 ms to minimize.
[2021-05-09 08:16:55] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 0 ms to minimize.
[2021-05-09 08:16:55] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:16:55] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:16:55] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 1 ms to minimize.
[2021-05-09 08:16:55] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 0 ms to minimize.
[2021-05-09 08:16:55] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
[2021-05-09 08:16:55] [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 08:16:55] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2021-05-09 08:16:55] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 14 ms returned sat
[2021-05-09 08:16:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:16:56] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2021-05-09 08:16:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:16:56] [INFO ] [Nat]Absence check using 62 positive place invariants in 21 ms returned sat
[2021-05-09 08:16:56] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 10 ms returned sat
[2021-05-09 08:16:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:16:56] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2021-05-09 08:16:56] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 0 ms to minimize.
[2021-05-09 08:16:56] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:16:56] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 1 ms to minimize.
[2021-05-09 08:16:57] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 0 ms to minimize.
[2021-05-09 08:16:57] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:16:57] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 3 ms to minimize.
[2021-05-09 08:16:57] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 1 ms to minimize.
[2021-05-09 08:16:57] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
[2021-05-09 08:16:57] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:16:58] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 0 ms to minimize.
[2021-05-09 08:16:58] [INFO ] Deduced a trap composed of 139 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:16:58] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:16:58] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:16:58] [INFO ] Deduced a trap composed of 145 places in 243 ms of which 13 ms to minimize.
[2021-05-09 08:16:59] [INFO ] Deduced a trap composed of 19 places in 294 ms of which 1 ms to minimize.
[2021-05-09 08:16:59] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 1 ms to minimize.
[2021-05-09 08:16:59] [INFO ] Deduced a trap composed of 129 places in 185 ms of which 1 ms to minimize.
[2021-05-09 08:16:59] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 1 ms to minimize.
[2021-05-09 08:16:59] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 0 ms to minimize.
[2021-05-09 08:17:00] [INFO ] Deduced a trap composed of 132 places in 135 ms of which 0 ms to minimize.
[2021-05-09 08:17:00] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 0 ms to minimize.
[2021-05-09 08:17:00] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2021-05-09 08:17:00] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 0 ms to minimize.
[2021-05-09 08:17:00] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2021-05-09 08:17:00] [INFO ] Deduced a trap composed of 22 places in 199 ms of which 1 ms to minimize.
[2021-05-09 08:17:00] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 0 ms to minimize.
[2021-05-09 08:17:01] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 8 ms to minimize.
[2021-05-09 08:17:01] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 0 ms to minimize.
[2021-05-09 08:17:01] [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 08:17:01] [INFO ] [Real]Absence check using 62 positive place invariants in 18 ms returned sat
[2021-05-09 08:17:01] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 9 ms returned sat
[2021-05-09 08:17:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:01] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2021-05-09 08:17:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:01] [INFO ] [Nat]Absence check using 62 positive place invariants in 19 ms returned sat
[2021-05-09 08:17:01] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 8 ms returned sat
[2021-05-09 08:17:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:01] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2021-05-09 08:17:01] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2021-05-09 08:17:02] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 0 ms to minimize.
[2021-05-09 08:17:02] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2021-05-09 08:17:02] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 0 ms to minimize.
[2021-05-09 08:17:02] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2021-05-09 08:17:02] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:17:02] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2021-05-09 08:17:02] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2021-05-09 08:17:02] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 0 ms to minimize.
[2021-05-09 08:17:02] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
[2021-05-09 08:17:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 919 ms
[2021-05-09 08:17:02] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 28 ms.
[2021-05-09 08:17:04] [INFO ] Added : 334 causal constraints over 67 iterations in 2192 ms. Result :sat
Minimization took 109 ms.
[2021-05-09 08:17:05] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2021-05-09 08:17:05] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:05] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2021-05-09 08:17:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:05] [INFO ] [Nat]Absence check using 62 positive place invariants in 31 ms returned sat
[2021-05-09 08:17:05] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 24 ms returned sat
[2021-05-09 08:17:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:05] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2021-05-09 08:17:06] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 2 ms to minimize.
[2021-05-09 08:17:06] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 2 ms to minimize.
[2021-05-09 08:17:06] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 1 ms to minimize.
[2021-05-09 08:17:06] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 0 ms to minimize.
[2021-05-09 08:17:06] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:17:06] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:17:07] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 0 ms to minimize.
[2021-05-09 08:17:07] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:17:07] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 1 ms to minimize.
[2021-05-09 08:17:07] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 0 ms to minimize.
[2021-05-09 08:17:07] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 1 ms to minimize.
[2021-05-09 08:17:07] [INFO ] Deduced a trap composed of 137 places in 142 ms of which 0 ms to minimize.
[2021-05-09 08:17:08] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:17:08] [INFO ] Deduced a trap composed of 149 places in 151 ms of which 10 ms to minimize.
[2021-05-09 08:17:08] [INFO ] Deduced a trap composed of 173 places in 135 ms of which 0 ms to minimize.
[2021-05-09 08:17:08] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 0 ms to minimize.
[2021-05-09 08:17:08] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:17:08] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 0 ms to minimize.
[2021-05-09 08:17:09] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:17:09] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 0 ms to minimize.
[2021-05-09 08:17:09] [INFO ] Deduced a trap composed of 151 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:17:09] [INFO ] Deduced a trap composed of 156 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:17:09] [INFO ] Deduced a trap composed of 143 places in 180 ms of which 1 ms to minimize.
[2021-05-09 08:17:09] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 0 ms to minimize.
[2021-05-09 08:17:09] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 1 ms to minimize.
[2021-05-09 08:17:10] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 1 ms to minimize.
[2021-05-09 08:17:10] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:17:10] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 0 ms to minimize.
[2021-05-09 08:17:10] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 1 ms to minimize.
[2021-05-09 08:17: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 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:17:10] [INFO ] [Real]Absence check using 62 positive place invariants in 20 ms returned sat
[2021-05-09 08:17:10] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 10 ms returned sat
[2021-05-09 08:17:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:10] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2021-05-09 08:17:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:11] [INFO ] [Nat]Absence check using 62 positive place invariants in 20 ms returned sat
[2021-05-09 08:17:11] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 9 ms returned sat
[2021-05-09 08:17:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:11] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2021-05-09 08:17:11] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 1 ms to minimize.
[2021-05-09 08:17:11] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2021-05-09 08:17:11] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 1 ms to minimize.
[2021-05-09 08:17:11] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:17:12] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 0 ms to minimize.
[2021-05-09 08:17:12] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:17:12] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:17:12] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:17:12] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2021-05-09 08:17:12] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2021-05-09 08:17:12] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 0 ms to minimize.
[2021-05-09 08:17:12] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2021-05-09 08:17:12] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2021-05-09 08:17:13] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 0 ms to minimize.
[2021-05-09 08:17:13] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1796 ms
[2021-05-09 08:17:13] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 52 ms.
[2021-05-09 08:17:15] [INFO ] Added : 322 causal constraints over 65 iterations in 2546 ms. Result :sat
Minimization took 121 ms.
[2021-05-09 08:17:15] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2021-05-09 08:17:15] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:17:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:16] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2021-05-09 08:17:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:16] [INFO ] [Nat]Absence check using 62 positive place invariants in 28 ms returned sat
[2021-05-09 08:17:16] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:17:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:16] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2021-05-09 08:17:16] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 1 ms to minimize.
[2021-05-09 08:17:16] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2021-05-09 08:17:17] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:17:17] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 1 ms to minimize.
[2021-05-09 08:17:17] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:17:17] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 0 ms to minimize.
[2021-05-09 08:17:17] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2021-05-09 08:17:17] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:17:18] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:17:18] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2021-05-09 08:17:18] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 0 ms to minimize.
[2021-05-09 08:17:18] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:17:18] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 0 ms to minimize.
[2021-05-09 08:17:18] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 1 ms to minimize.
[2021-05-09 08:17:19] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 0 ms to minimize.
[2021-05-09 08:17:19] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:17:19] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2021-05-09 08:17:19] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 1 ms to minimize.
[2021-05-09 08:17:19] [INFO ] Deduced a trap composed of 136 places in 120 ms of which 0 ms to minimize.
[2021-05-09 08:17:19] [INFO ] Deduced a trap composed of 154 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:17:19] [INFO ] Deduced a trap composed of 132 places in 135 ms of which 1 ms to minimize.
[2021-05-09 08:17:20] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 1 ms to minimize.
[2021-05-09 08:17:20] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 0 ms to minimize.
[2021-05-09 08:17:20] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 1 ms to minimize.
[2021-05-09 08:17:20] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 1 ms to minimize.
[2021-05-09 08:17:20] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 0 ms to minimize.
[2021-05-09 08:17:20] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 0 ms to minimize.
[2021-05-09 08:17:21] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 0 ms to minimize.
[2021-05-09 08:17:21] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 0 ms to minimize.
[2021-05-09 08:17: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 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.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:17:21] [INFO ] [Real]Absence check using 62 positive place invariants in 19 ms returned sat
[2021-05-09 08:17:21] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 10 ms returned sat
[2021-05-09 08:17:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:21] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-09 08:17:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:21] [INFO ] [Nat]Absence check using 62 positive place invariants in 21 ms returned sat
[2021-05-09 08:17:21] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 9 ms returned sat
[2021-05-09 08:17:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:21] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2021-05-09 08:17:21] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:17:22] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 0 ms to minimize.
[2021-05-09 08:17:22] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 0 ms to minimize.
[2021-05-09 08:17:22] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 0 ms to minimize.
[2021-05-09 08:17:22] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 0 ms to minimize.
[2021-05-09 08:17:22] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2021-05-09 08:17:22] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 0 ms to minimize.
[2021-05-09 08:17:22] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2021-05-09 08:17:22] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2021-05-09 08:17:23] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 0 ms to minimize.
[2021-05-09 08:17:23] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 0 ms to minimize.
[2021-05-09 08:17:23] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:17:23] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2021-05-09 08:17:23] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:17:23] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2021-05-09 08:17:23] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2021-05-09 08:17:23] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 0 ms to minimize.
[2021-05-09 08:17:24] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 0 ms to minimize.
[2021-05-09 08:17:24] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 0 ms to minimize.
[2021-05-09 08:17:24] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2021-05-09 08:17:24] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 0 ms to minimize.
[2021-05-09 08:17:24] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 0 ms to minimize.
[2021-05-09 08:17:24] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2021-05-09 08:17:24] [INFO ] Deduced a trap composed of 32 places in 21 ms of which 1 ms to minimize.
[2021-05-09 08:17:24] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2677 ms
[2021-05-09 08:17:24] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 29 ms.
[2021-05-09 08:17:26] [INFO ] Added : 341 causal constraints over 69 iterations in 1876 ms. Result :sat
Minimization took 116 ms.
[2021-05-09 08:17:26] [INFO ] [Real]Absence check using 62 positive place invariants in 20 ms returned sat
[2021-05-09 08:17:26] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2021-05-09 08:17:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:26] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2021-05-09 08:17:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:27] [INFO ] [Nat]Absence check using 62 positive place invariants in 20 ms returned sat
[2021-05-09 08:17:27] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 10 ms returned sat
[2021-05-09 08:17:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:27] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2021-05-09 08:17:27] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 1 ms to minimize.
[2021-05-09 08:17:27] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 1 ms to minimize.
[2021-05-09 08:17:27] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 0 ms to minimize.
[2021-05-09 08:17:27] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:17:28] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2021-05-09 08:17:28] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2021-05-09 08:17:28] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 0 ms to minimize.
[2021-05-09 08:17:28] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 0 ms to minimize.
[2021-05-09 08:17:28] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 1 ms to minimize.
[2021-05-09 08:17:29] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2021-05-09 08:17:29] [INFO ] Deduced a trap composed of 121 places in 140 ms of which 1 ms to minimize.
[2021-05-09 08:17:29] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 1 ms to minimize.
[2021-05-09 08:17:29] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 0 ms to minimize.
[2021-05-09 08:17:29] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 1 ms to minimize.
[2021-05-09 08:17:29] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2021-05-09 08:17:30] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 1 ms to minimize.
[2021-05-09 08:17:30] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:17:30] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 0 ms to minimize.
[2021-05-09 08:17:30] [INFO ] Deduced a trap composed of 132 places in 150 ms of which 1 ms to minimize.
[2021-05-09 08:17:30] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
[2021-05-09 08:17:30] [INFO ] Deduced a trap composed of 153 places in 132 ms of which 0 ms to minimize.
[2021-05-09 08:17:30] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 0 ms to minimize.
[2021-05-09 08:17:31] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 1 ms to minimize.
[2021-05-09 08:17:31] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 0 ms to minimize.
[2021-05-09 08:17:31] [INFO ] Deduced a trap composed of 151 places in 141 ms of which 1 ms to minimize.
[2021-05-09 08:17:31] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 1 ms to minimize.
[2021-05-09 08:17:31] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:17:32] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 1 ms to minimize.
[2021-05-09 08:17:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.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:17:32] [INFO ] [Real]Absence check using 62 positive place invariants in 17 ms returned sat
[2021-05-09 08:17:32] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 9 ms returned sat
[2021-05-09 08:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:32] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2021-05-09 08:17:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:32] [INFO ] [Nat]Absence check using 62 positive place invariants in 27 ms returned sat
[2021-05-09 08:17:32] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2021-05-09 08:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:32] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2021-05-09 08:17:32] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:17:33] [INFO ] Deduced a trap composed of 130 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:17:33] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2021-05-09 08:17:33] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:17:33] [INFO ] Deduced a trap composed of 130 places in 134 ms of which 0 ms to minimize.
[2021-05-09 08:17:33] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 0 ms to minimize.
[2021-05-09 08:17:33] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 0 ms to minimize.
[2021-05-09 08:17:34] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 1 ms to minimize.
[2021-05-09 08:17:34] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 1 ms to minimize.
[2021-05-09 08:17:34] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:17:34] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 0 ms to minimize.
[2021-05-09 08:17:34] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 0 ms to minimize.
[2021-05-09 08:17:34] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 1 ms to minimize.
[2021-05-09 08:17:34] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 0 ms to minimize.
[2021-05-09 08:17:35] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 0 ms to minimize.
[2021-05-09 08:17:35] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:17:35] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:17:35] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2021-05-09 08:17:35] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 0 ms to minimize.
[2021-05-09 08:17:35] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 1 ms to minimize.
[2021-05-09 08:17:35] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 0 ms to minimize.
[2021-05-09 08:17:36] [INFO ] Deduced a trap composed of 147 places in 110 ms of which 1 ms to minimize.
[2021-05-09 08:17:36] [INFO ] Deduced a trap composed of 119 places in 141 ms of which 0 ms to minimize.
[2021-05-09 08:17:36] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2021-05-09 08:17:36] [INFO ] Deduced a trap composed of 151 places in 111 ms of which 1 ms to minimize.
[2021-05-09 08:17:36] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2021-05-09 08:17:36] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 0 ms to minimize.
[2021-05-09 08:17:36] [INFO ] Deduced a trap composed of 144 places in 101 ms of which 0 ms to minimize.
[2021-05-09 08:17:37] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2021-05-09 08:17:37] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 1 ms to minimize.
[2021-05-09 08:17:37] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2021-05-09 08:17:37] [INFO ] Deduced a trap composed of 15 places in 298 ms of which 0 ms to minimize.
[2021-05-09 08:17: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 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 39300 steps, including 292 resets, run finished after 85 ms. (steps per millisecond=462 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 32300 steps, including 238 resets, run finished after 76 ms. (steps per millisecond=425 ) properties (out of 9) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 40500 steps, including 300 resets, run finished after 80 ms. (steps per millisecond=506 ) properties (out of 8) seen :0 could not realise parikh vector
Support contains 8 out of 646 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 646/646 places, 576/576 transitions.
Graph (trivial) has 362 edges and 646 vertex of which 7 / 646 are part of one of the 1 SCC in 30 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1304 edges and 640 vertex of which 636 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 141 place count 636 transition count 428
Reduce places removed 139 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 142 rules applied. Total rules applied 283 place count 497 transition count 425
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 286 place count 494 transition count 425
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 286 place count 494 transition count 329
Deduced a syphon composed of 96 places in 7 ms
Ensure Unique test removed 19 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 497 place count 379 transition count 329
Discarding 81 places :
Symmetric choice reduction at 3 with 81 rule applications. Total rules 578 place count 298 transition count 248
Iterating global reduction 3 with 81 rules applied. Total rules applied 659 place count 298 transition count 248
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 659 place count 298 transition count 241
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 675 place count 289 transition count 241
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 880 place count 185 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 882 place count 184 transition count 144
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 884 place count 184 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 886 place count 182 transition count 142
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 887 place count 182 transition count 142
Applied a total of 887 rules in 251 ms. Remains 182 /646 variables (removed 464) and now considering 142/576 (removed 434) transitions.
Finished structural reductions, in 1 iterations. Remains : 182/646 places, 142/576 transitions.
// Phase 1: matrix 142 rows 182 cols
[2021-05-09 08:17:38] [INFO ] Computed 81 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 26809 resets, run finished after 2903 ms. (steps per millisecond=344 ) properties (out of 8) seen :7
FORMULA BusinessProcesses-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 14164 resets, run finished after 1622 ms. (steps per millisecond=616 ) properties (out of 1) seen :0
// Phase 1: matrix 142 rows 182 cols
[2021-05-09 08:17:42] [INFO ] Computed 81 place invariants in 2 ms
[2021-05-09 08:17:43] [INFO ] [Real]Absence check using 59 positive place invariants in 397 ms returned sat
[2021-05-09 08:17:43] [INFO ] [Real]Absence check using 59 positive and 22 generalized place invariants in 84 ms returned sat
[2021-05-09 08:17:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:43] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-09 08:17:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:43] [INFO ] [Nat]Absence check using 59 positive place invariants in 10 ms returned sat
[2021-05-09 08:17:43] [INFO ] [Nat]Absence check using 59 positive and 22 generalized place invariants in 17 ms returned sat
[2021-05-09 08:17:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:43] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-09 08:17:43] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-09 08:17:43] [INFO ] [Nat]Added 14 Read/Feed constraints in 29 ms returned sat
[2021-05-09 08:17:43] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 0 ms to minimize.
[2021-05-09 08:17:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2021-05-09 08:17:43] [INFO ] Computed and/alt/rep : 89/413/89 causal constraints (skipped 51 transitions) in 15 ms.
[2021-05-09 08:17:43] [INFO ] Added : 29 causal constraints over 6 iterations in 113 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 7500 steps, including 854 resets, run finished after 30 ms. (steps per millisecond=250 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 182/182 places, 142/142 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 182 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 181 transition count 141
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 181 transition count 137
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 11 place count 176 transition count 137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 15 place count 174 transition count 135
Applied a total of 15 rules in 16 ms. Remains 174 /182 variables (removed 8) and now considering 135/142 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/182 places, 135/142 transitions.
// Phase 1: matrix 135 rows 174 cols
[2021-05-09 08:17:43] [INFO ] Computed 80 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 28496 resets, run finished after 2674 ms. (steps per millisecond=373 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 15436 resets, run finished after 1678 ms. (steps per millisecond=595 ) properties (out of 1) seen :0
// Phase 1: matrix 135 rows 174 cols
[2021-05-09 08:17:48] [INFO ] Computed 80 place invariants in 3 ms
[2021-05-09 08:17:48] [INFO ] [Real]Absence check using 61 positive place invariants in 20 ms returned sat
[2021-05-09 08:17:48] [INFO ] [Real]Absence check using 61 positive and 19 generalized place invariants in 3 ms returned sat
[2021-05-09 08:17:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:48] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-09 08:17:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:48] [INFO ] [Nat]Absence check using 61 positive place invariants in 7 ms returned sat
[2021-05-09 08:17:48] [INFO ] [Nat]Absence check using 61 positive and 19 generalized place invariants in 2 ms returned sat
[2021-05-09 08:17:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:48] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2021-05-09 08:17:48] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-09 08:17:48] [INFO ] [Nat]Added 14 Read/Feed constraints in 29 ms returned sat
[2021-05-09 08:17:48] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2021-05-09 08:17:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2021-05-09 08:17:48] [INFO ] Computed and/alt/rep : 82/404/82 causal constraints (skipped 51 transitions) in 17 ms.
[2021-05-09 08:17:48] [INFO ] Added : 25 causal constraints over 5 iterations in 116 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4900 steps, including 570 resets, run finished after 30 ms. (steps per millisecond=163 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 174/174 places, 135/135 transitions.
Applied a total of 0 rules in 9 ms. Remains 174 /174 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/174 places, 135/135 transitions.
Starting structural reductions, iteration 0 : 174/174 places, 135/135 transitions.
Applied a total of 0 rules in 9 ms. Remains 174 /174 variables (removed 0) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 174 cols
[2021-05-09 08:17:48] [INFO ] Computed 80 place invariants in 1 ms
[2021-05-09 08:17:49] [INFO ] Implicit Places using invariants in 436 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 438 ms to find 25 implicit places.
[2021-05-09 08:17:49] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 135 rows 149 cols
[2021-05-09 08:17:49] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-09 08:17:49] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Starting structural reductions, iteration 1 : 149/174 places, 135/135 transitions.
Applied a total of 0 rules in 9 ms. Remains 149 /149 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2021-05-09 08:17:49] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 135 rows 149 cols
[2021-05-09 08:17:49] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-09 08:17:49] [INFO ] Dead Transitions using invariants and state equation in 226 ms returned []
Finished structural reductions, in 2 iterations. Remains : 149/174 places, 135/135 transitions.
Successfully produced net in file /tmp/petri1000_5665488612470167561.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
// Phase 1: matrix 134 rows 149 cols
[2021-05-09 08:17:49] [INFO ] Computed 56 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 28410 resets, run finished after 1525 ms. (steps per millisecond=655 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 15521 resets, run finished after 1025 ms. (steps per millisecond=975 ) properties (out of 1) seen :0
// Phase 1: matrix 134 rows 149 cols
[2021-05-09 08:17:52] [INFO ] Computed 56 place invariants in 3 ms
[2021-05-09 08:17:52] [INFO ] [Real]Absence check using 38 positive place invariants in 7 ms returned sat
[2021-05-09 08:17:52] [INFO ] [Real]Absence check using 38 positive and 18 generalized place invariants in 4 ms returned sat
[2021-05-09 08:17:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:52] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-09 08:17:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:52] [INFO ] [Nat]Absence check using 38 positive place invariants in 7 ms returned sat
[2021-05-09 08:17:52] [INFO ] [Nat]Absence check using 38 positive and 18 generalized place invariants in 4 ms returned sat
[2021-05-09 08:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:52] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2021-05-09 08:17:52] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-09 08:17:52] [INFO ] [Nat]Added 14 Read/Feed constraints in 21 ms returned sat
[2021-05-09 08:17:52] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2021-05-09 08:17:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2021-05-09 08:17:52] [INFO ] Computed and/alt/rep : 82/400/82 causal constraints (skipped 50 transitions) in 11 ms.
[2021-05-09 08:17:52] [INFO ] Added : 25 causal constraints over 5 iterations in 79 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4800 steps, including 686 resets, run finished after 15 ms. (steps per millisecond=320 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 149 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 149/149 places, 134/134 transitions.
Graph (complete) has 579 edges and 149 vertex of which 148 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 148 /149 variables (removed 1) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 148/149 places, 134/134 transitions.
// Phase 1: matrix 134 rows 148 cols
[2021-05-09 08:17:52] [INFO ] Computed 55 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 28554 resets, run finished after 1544 ms. (steps per millisecond=647 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 15600 resets, run finished after 998 ms. (steps per millisecond=1002 ) properties (out of 1) seen :0
// Phase 1: matrix 134 rows 148 cols
[2021-05-09 08:17:55] [INFO ] Computed 55 place invariants in 3 ms
[2021-05-09 08:17:55] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2021-05-09 08:17:55] [INFO ] [Real]Absence check using 35 positive and 20 generalized place invariants in 6 ms returned sat
[2021-05-09 08:17:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:55] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-09 08:17:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2021-05-09 08:17:55] [INFO ] [Nat]Absence check using 35 positive and 20 generalized place invariants in 6 ms returned sat
[2021-05-09 08:17:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:55] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2021-05-09 08:17:55] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-09 08:17:55] [INFO ] [Nat]Added 14 Read/Feed constraints in 17 ms returned sat
[2021-05-09 08:17:55] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 6 ms to minimize.
[2021-05-09 08:17:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2021-05-09 08:17:55] [INFO ] Computed and/alt/rep : 82/400/82 causal constraints (skipped 50 transitions) in 9 ms.
[2021-05-09 08:17:55] [INFO ] Added : 23 causal constraints over 5 iterations in 72 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4800 steps, including 714 resets, run finished after 15 ms. (steps per millisecond=320 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 148/148 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 148 /148 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 148/148 places, 134/134 transitions.
Starting structural reductions, iteration 0 : 148/148 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 148 /148 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 148 cols
[2021-05-09 08:17:55] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-09 08:17:55] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 134 rows 148 cols
[2021-05-09 08:17:55] [INFO ] Computed 55 place invariants in 1 ms
[2021-05-09 08:17:55] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-09 08:17:56] [INFO ] Implicit Places using invariants and state equation in 343 ms returned [3, 25, 27, 29, 32, 34, 36, 38, 40, 48, 50, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96]
Discarding 32 places :
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Implicit Place search using SMT with State Equation took 486 ms to find 32 implicit places.
[2021-05-09 08:17:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 130 rows 116 cols
[2021-05-09 08:17:56] [INFO ] Computed 23 place invariants in 1 ms
[2021-05-09 08:17:56] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 116/148 places, 130/134 transitions.
Graph (complete) has 361 edges and 116 vertex of which 106 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 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 106 transition count 116
Reduce places removed 13 places and 0 transitions.
Graph (complete) has 279 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 92 transition count 116
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 92 transition count 115
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 42 place count 80 transition count 75
Iterating global reduction 3 with 12 rules applied. Total rules applied 54 place count 80 transition count 75
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 80 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 58 place count 78 transition count 73
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 61 place count 75 transition count 70
Iterating global reduction 5 with 3 rules applied. Total rules applied 64 place count 75 transition count 70
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 80 place count 66 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 82 place count 65 transition count 62
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 83 place count 65 transition count 61
Applied a total of 83 rules in 14 ms. Remains 65 /116 variables (removed 51) and now considering 61/130 (removed 69) transitions.
// Phase 1: matrix 61 rows 65 cols
[2021-05-09 08:17:56] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-09 08:17:56] [INFO ] Implicit Places using invariants in 67 ms returned [3, 4, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 73 ms to find 3 implicit places.
Starting structural reductions, iteration 2 : 62/148 places, 61/134 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 62 transition count 58
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 58
Applied a total of 6 rules in 5 ms. Remains 59 /62 variables (removed 3) and now considering 58/61 (removed 3) transitions.
// Phase 1: matrix 58 rows 59 cols
[2021-05-09 08:17:56] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-09 08:17:56] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 58 rows 59 cols
[2021-05-09 08:17:56] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-09 08:17:56] [INFO ] State equation strengthened by 34 read => feed constraints.
[2021-05-09 08:17:56] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [13, 18, 20]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 120 ms to find 3 implicit places.
Starting structural reductions, iteration 3 : 56/148 places, 58/134 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 55 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 55 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 55 transition count 56
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 23 rules applied. Total rules applied 26 place count 41 transition count 47
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 38 transition count 44
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 38 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 38 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 2 with 2 rules applied. Total rules applied 35 place count 37 transition count 42
Applied a total of 35 rules in 5 ms. Remains 37 /56 variables (removed 19) and now considering 42/58 (removed 16) transitions.
// Phase 1: matrix 42 rows 37 cols
[2021-05-09 08:17:56] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 08:17:56] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 42 rows 37 cols
[2021-05-09 08:17:56] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-09 08:17:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 08:17:56] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Finished structural reductions, in 4 iterations. Remains : 37/148 places, 42/134 transitions.
// Phase 1: matrix 42 rows 37 cols
[2021-05-09 08:17:56] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 50351 resets, run finished after 493 ms. (steps per millisecond=2028 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 24689 resets, run finished after 267 ms. (steps per millisecond=3745 ) properties (out of 1) seen :0
// Phase 1: matrix 42 rows 37 cols
[2021-05-09 08:17:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 08:17:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-09 08:17:57] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 08:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:57] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-09 08:17:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-09 08:17:57] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 08:17:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:57] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-09 08:17:57] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 08:17:57] [INFO ] [Nat]Added 35 Read/Feed constraints in 4 ms returned sat
[2021-05-09 08:17:57] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2021-05-09 08:17:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-09 08:17:57] [INFO ] Computed and/alt/rep : 38/241/38 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-09 08:17:57] [INFO ] Added : 31 causal constraints over 7 iterations in 49 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 3000 steps, including 327 resets, run finished after 5 ms. (steps per millisecond=600 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 42/42 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 37 cols
[2021-05-09 08:17:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 08:17:57] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 42 rows 37 cols
[2021-05-09 08:17:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 08:17:57] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 08:17:57] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2021-05-09 08:17:57] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 42 rows 37 cols
[2021-05-09 08:17:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 08:17:57] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 42/42 transitions.
Starting property specific reduction for BusinessProcesses-PT-17-UpperBounds-07
// Phase 1: matrix 42 rows 37 cols
[2021-05-09 08:17:57] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 503 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 242 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
// Phase 1: matrix 42 rows 37 cols
[2021-05-09 08:17:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 08:17:57] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-09 08:17:57] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-09 08:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:57] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 08:17:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-09 08:17:57] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 08:17:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:57] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-09 08:17:57] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 08:17:57] [INFO ] [Nat]Added 35 Read/Feed constraints in 2 ms returned sat
[2021-05-09 08:17:57] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2021-05-09 08:17:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2021-05-09 08:17:57] [INFO ] Computed and/alt/rep : 38/241/38 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-09 08:17:57] [INFO ] Added : 31 causal constraints over 7 iterations in 29 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 3000 steps, including 322 resets, run finished after 3 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 42/42 transitions.
// Phase 1: matrix 42 rows 37 cols
[2021-05-09 08:17:57] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 50355 resets, run finished after 399 ms. (steps per millisecond=2506 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 24479 resets, run finished after 250 ms. (steps per millisecond=4000 ) properties (out of 1) seen :0
// Phase 1: matrix 42 rows 37 cols
[2021-05-09 08:17:58] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-09 08:17:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-09 08:17:58] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 08:17:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:58] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-09 08:17:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:17:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-09 08:17:58] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2021-05-09 08:17:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:17:58] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-09 08:17:58] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 08:17:58] [INFO ] [Nat]Added 35 Read/Feed constraints in 3 ms returned sat
[2021-05-09 08:17:58] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2021-05-09 08:17:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2021-05-09 08:17:58] [INFO ] Computed and/alt/rep : 38/241/38 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-09 08:17:58] [INFO ] Added : 31 causal constraints over 7 iterations in 50 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 3000 steps, including 310 resets, run finished after 3 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 42/42 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 37 cols
[2021-05-09 08:17:58] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 08:17:58] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 42 rows 37 cols
[2021-05-09 08:17:58] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 08:17:58] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 08:17:58] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2021-05-09 08:17:58] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 42 rows 37 cols
[2021-05-09 08:17:58] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 08:17:58] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 42/42 transitions.
Ending property specific reduction for BusinessProcesses-PT-17-UpperBounds-07 in 1198 ms.
[2021-05-09 08:17:58] [INFO ] Flatten gal took : 35 ms
[2021-05-09 08:17:58] [INFO ] Applying decomposition
[2021-05-09 08:17:58] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9971954310428839085.txt, -o, /tmp/graph9971954310428839085.bin, -w, /tmp/graph9971954310428839085.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9971954310428839085.bin, -l, -1, -v, -w, /tmp/graph9971954310428839085.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:17:59] [INFO ] Decomposing Gal with order
[2021-05-09 08:17:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:17:59] [INFO ] Removed a total of 33 redundant transitions.
[2021-05-09 08:17:59] [INFO ] Flatten gal took : 69 ms
[2021-05-09 08:17:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 3 ms.
[2021-05-09 08:17:59] [INFO ] Time to serialize gal into /tmp/UpperBounds490301674711120851.gal : 2 ms
[2021-05-09 08:17:59] [INFO ] Time to serialize properties into /tmp/UpperBounds14096173232495990629.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds490301674711120851.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14096173232495990629.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds490301674711120851.gal -t CGAL -reachable-file /tmp/UpperBounds14096173232495990629.prop --nowitness
Loading property file /tmp/UpperBounds14096173232495990629.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1201,0.017642,4352,54,32,633,251,112,680,60,487,0
Total reachable state count : 1201
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property BusinessProcesses-PT-17-UpperBounds-07 :0 <= u5.p324 <= 1
FORMULA BusinessProcesses-PT-17-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-17-UpperBounds-07,0,0.018106,4352,1,0,633,251,183,680,85,487,144
BK_STOP 1620548279425
--------------------
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-17"
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-17, 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-162038143900451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-17.tgz
mv BusinessProcesses-PT-17 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 ;