fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r065-tajo-171620414900341
Last Updated
July 7, 2024

About the Execution of 2023-gold for BusinessProcesses-PT-13

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
355.275 67497.00 88894.00 171.50 1 1 1 1 1 1 1 1 1 1 1 0 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/mcc2024-input.r065-tajo-171620414900341.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BusinessProcesses-PT-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414900341
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 148K May 18 16:42 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-13-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716651162541

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 15:32:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:32:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:32:44] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-25 15:32:44] [INFO ] Transformed 593 places.
[2024-05-25 15:32:44] [INFO ] Transformed 536 transitions.
[2024-05-25 15:32:44] [INFO ] Found NUPN structural information;
[2024-05-25 15:32:44] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 528 rows 585 cols
[2024-05-25 15:32:44] [INFO ] Computed 95 invariants in 65 ms
Incomplete random walk after 10000 steps, including 70 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 15) seen :4
FORMULA BusinessProcesses-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
[2024-05-25 15:32:45] [INFO ] Invariant cache hit.
[2024-05-25 15:32:45] [INFO ] [Real]Absence check using 57 positive place invariants in 126 ms returned sat
[2024-05-25 15:32:45] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 16 ms returned sat
[2024-05-25 15:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:32:45] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2024-05-25 15:32:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:32:46] [INFO ] [Nat]Absence check using 57 positive place invariants in 53 ms returned sat
[2024-05-25 15:32:46] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2024-05-25 15:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:32:46] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2024-05-25 15:32:46] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 5 ms to minimize.
[2024-05-25 15:32:47] [INFO ] Deduced a trap composed of 15 places in 329 ms of which 1 ms to minimize.
[2024-05-25 15:32:47] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 2 ms to minimize.
[2024-05-25 15:32:47] [INFO ] Deduced a trap composed of 140 places in 157 ms of which 3 ms to minimize.
[2024-05-25 15:32:49] [INFO ] Deduced a trap composed of 13 places in 1551 ms of which 27 ms to minimize.
[2024-05-25 15:32:49] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2024-05-25 15:32:49] [INFO ] Deduced a trap composed of 132 places in 258 ms of which 1 ms to minimize.
[2024-05-25 15:32:49] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 13 ms to minimize.
[2024-05-25 15:32:50] [INFO ] Deduced a trap composed of 63 places in 249 ms of which 1 ms to minimize.
[2024-05-25 15:32:50] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 0 ms to minimize.
[2024-05-25 15:32:50] [INFO ] Deduced a trap composed of 121 places in 176 ms of which 1 ms to minimize.
[2024-05-25 15:32:50] [INFO ] Deduced a trap composed of 20 places in 184 ms of which 1 ms to minimize.
[2024-05-25 15:32:51] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 1 ms to minimize.
[2024-05-25 15:32:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:32:51] [INFO ] [Real]Absence check using 57 positive place invariants in 33 ms returned sat
[2024-05-25 15:32:51] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 14 ms returned sat
[2024-05-25 15:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:32:51] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2024-05-25 15:32:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:32:51] [INFO ] [Nat]Absence check using 57 positive place invariants in 24 ms returned sat
[2024-05-25 15:32:51] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2024-05-25 15:32:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:32:51] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2024-05-25 15:32:52] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 0 ms to minimize.
[2024-05-25 15:32:52] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 1 ms to minimize.
[2024-05-25 15:32:52] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 1 ms to minimize.
[2024-05-25 15:32:52] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 1 ms to minimize.
[2024-05-25 15:32:53] [INFO ] Deduced a trap composed of 13 places in 285 ms of which 1 ms to minimize.
[2024-05-25 15:32:53] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 1 ms to minimize.
[2024-05-25 15:32:53] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 1 ms to minimize.
[2024-05-25 15:32:54] [INFO ] Deduced a trap composed of 15 places in 291 ms of which 2 ms to minimize.
[2024-05-25 15:32:54] [INFO ] Deduced a trap composed of 136 places in 193 ms of which 2 ms to minimize.
[2024-05-25 15:32:54] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 1 ms to minimize.
[2024-05-25 15:32:54] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:32:54] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:32:55] [INFO ] Deduced a trap composed of 138 places in 189 ms of which 1 ms to minimize.
[2024-05-25 15:32:55] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 1 ms to minimize.
[2024-05-25 15:32:55] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 1 ms to minimize.
[2024-05-25 15:32:55] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 1 ms to minimize.
[2024-05-25 15:32:55] [INFO ] Deduced a trap composed of 130 places in 185 ms of which 1 ms to minimize.
[2024-05-25 15:32:56] [INFO ] Deduced a trap composed of 137 places in 183 ms of which 0 ms to minimize.
[2024-05-25 15:32:56] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:32:56] [INFO ] Deduced a trap composed of 138 places in 135 ms of which 1 ms to minimize.
[2024-05-25 15:32:56] [INFO ] Deduced a trap composed of 137 places in 139 ms of which 1 ms to minimize.
[2024-05-25 15:32:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:32:56] [INFO ] [Real]Absence check using 57 positive place invariants in 24 ms returned sat
[2024-05-25 15:32:56] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 15 ms returned sat
[2024-05-25 15:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:32:57] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2024-05-25 15:32:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:32:57] [INFO ] [Nat]Absence check using 57 positive place invariants in 25 ms returned sat
[2024-05-25 15:32:57] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2024-05-25 15:32:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:32:57] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2024-05-25 15:32:57] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 5 ms to minimize.
[2024-05-25 15:32:57] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 1 ms to minimize.
[2024-05-25 15:32:58] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2024-05-25 15:32:58] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 1 ms to minimize.
[2024-05-25 15:32:58] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:32:58] [INFO ] Deduced a trap composed of 110 places in 206 ms of which 2 ms to minimize.
[2024-05-25 15:32:58] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 1 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 145 places in 247 ms of which 1 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 1 ms to minimize.
[2024-05-25 15:32:59] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 1 ms to minimize.
[2024-05-25 15:33:00] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 0 ms to minimize.
[2024-05-25 15:33:00] [INFO ] Deduced a trap composed of 20 places in 158 ms of which 0 ms to minimize.
[2024-05-25 15:33:00] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
[2024-05-25 15:33:00] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:33:00] [INFO ] Deduced a trap composed of 133 places in 157 ms of which 1 ms to minimize.
[2024-05-25 15:33:01] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 1 ms to minimize.
[2024-05-25 15:33:01] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:33:01] [INFO ] Deduced a trap composed of 134 places in 132 ms of which 0 ms to minimize.
[2024-05-25 15:33:01] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 0 ms to minimize.
[2024-05-25 15:33:01] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 0 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 1 ms to minimize.
[2024-05-25 15:33:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:33:02] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2024-05-25 15:33:02] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2024-05-25 15:33:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:33:02] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 6 ms to minimize.
[2024-05-25 15:33:02] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 0 ms to minimize.
[2024-05-25 15:33:03] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2024-05-25 15:33:03] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 1 ms to minimize.
[2024-05-25 15:33:03] [INFO ] Deduced a trap composed of 15 places in 284 ms of which 1 ms to minimize.
[2024-05-25 15:33:03] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 0 ms to minimize.
[2024-05-25 15:33:04] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 1 ms to minimize.
[2024-05-25 15:33:04] [INFO ] Deduced a trap composed of 43 places in 272 ms of which 1 ms to minimize.
[2024-05-25 15:33:04] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 1 ms to minimize.
[2024-05-25 15:33:05] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 2 ms to minimize.
[2024-05-25 15:33:05] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 1 ms to minimize.
[2024-05-25 15:33:05] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-05-25 15:33:05] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 9 ms to minimize.
[2024-05-25 15:33:05] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3066 ms
[2024-05-25 15:33:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:33:05] [INFO ] [Nat]Absence check using 57 positive place invariants in 25 ms returned sat
[2024-05-25 15:33:05] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 12 ms returned sat
[2024-05-25 15:33:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:33:05] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2024-05-25 15:33:06] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 14 ms to minimize.
[2024-05-25 15:33:06] [INFO ] Deduced a trap composed of 14 places in 281 ms of which 1 ms to minimize.
[2024-05-25 15:33:06] [INFO ] Deduced a trap composed of 16 places in 257 ms of which 1 ms to minimize.
[2024-05-25 15:33:07] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 1 ms to minimize.
[2024-05-25 15:33:07] [INFO ] Deduced a trap composed of 15 places in 238 ms of which 1 ms to minimize.
[2024-05-25 15:33:07] [INFO ] Deduced a trap composed of 133 places in 258 ms of which 3 ms to minimize.
[2024-05-25 15:33:07] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 0 ms to minimize.
[2024-05-25 15:33:07] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 1 ms to minimize.
[2024-05-25 15:33:08] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 1 ms to minimize.
[2024-05-25 15:33:08] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 1 ms to minimize.
[2024-05-25 15:33:08] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 1 ms to minimize.
[2024-05-25 15:33:08] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 1 ms to minimize.
[2024-05-25 15:33:09] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 0 ms to minimize.
[2024-05-25 15:33:09] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 0 ms to minimize.
[2024-05-25 15:33:09] [INFO ] Deduced a trap composed of 50 places in 187 ms of which 1 ms to minimize.
[2024-05-25 15:33:09] [INFO ] Deduced a trap composed of 60 places in 180 ms of which 1 ms to minimize.
[2024-05-25 15:33:10] [INFO ] Deduced a trap composed of 133 places in 219 ms of which 1 ms to minimize.
[2024-05-25 15:33:10] [INFO ] Deduced a trap composed of 137 places in 221 ms of which 0 ms to minimize.
[2024-05-25 15:33:10] [INFO ] Deduced a trap composed of 131 places in 179 ms of which 0 ms to minimize.
[2024-05-25 15:33:10] [INFO ] Deduced a trap composed of 153 places in 190 ms of which 1 ms to minimize.
[2024-05-25 15:33: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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:33:10] [INFO ] [Real]Absence check using 57 positive place invariants in 24 ms returned sat
[2024-05-25 15:33:10] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 12 ms returned sat
[2024-05-25 15:33:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:33:11] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2024-05-25 15:33:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:33:11] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2024-05-25 15:33:11] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2024-05-25 15:33:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:33:11] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-05-25 15:33:11] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2024-05-25 15:33:11] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2024-05-25 15:33:12] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 1 ms to minimize.
[2024-05-25 15:33:12] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 0 ms to minimize.
[2024-05-25 15:33:12] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-25 15:33:12] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2024-05-25 15:33:12] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:33:12] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2024-05-25 15:33:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1278 ms
[2024-05-25 15:33:12] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 47 ms.
[2024-05-25 15:33:14] [INFO ] Added : 240 causal constraints over 48 iterations in 1818 ms. Result :sat
Minimization took 135 ms.
[2024-05-25 15:33:14] [INFO ] [Real]Absence check using 57 positive place invariants in 24 ms returned sat
[2024-05-25 15:33:14] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2024-05-25 15:33:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:33:15] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2024-05-25 15:33:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:33:15] [INFO ] [Nat]Absence check using 57 positive place invariants in 24 ms returned sat
[2024-05-25 15:33:15] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2024-05-25 15:33:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:33:15] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2024-05-25 15:33:15] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 1 ms to minimize.
[2024-05-25 15:33:15] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:33:16] [INFO ] Deduced a trap composed of 137 places in 208 ms of which 0 ms to minimize.
[2024-05-25 15:33:16] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 0 ms to minimize.
[2024-05-25 15:33:16] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 1 ms to minimize.
[2024-05-25 15:33:16] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 0 ms to minimize.
[2024-05-25 15:33:16] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 0 ms to minimize.
[2024-05-25 15:33:17] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 1 ms to minimize.
[2024-05-25 15:33:17] [INFO ] Deduced a trap composed of 132 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:33:17] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2024-05-25 15:33:17] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 0 ms to minimize.
[2024-05-25 15:33:18] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 0 ms to minimize.
[2024-05-25 15:33:18] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 1 ms to minimize.
[2024-05-25 15:33:18] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 0 ms to minimize.
[2024-05-25 15:33:18] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 1 ms to minimize.
[2024-05-25 15:33:18] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 1 ms to minimize.
[2024-05-25 15:33:19] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 1 ms to minimize.
[2024-05-25 15:33:19] [INFO ] Deduced a trap composed of 140 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:33:19] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 1 ms to minimize.
[2024-05-25 15:33:19] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 0 ms to minimize.
[2024-05-25 15:33:19] [INFO ] Deduced a trap composed of 139 places in 134 ms of which 0 ms to minimize.
[2024-05-25 15:33:19] [INFO ] Deduced a trap composed of 141 places in 177 ms of which 0 ms to minimize.
[2024-05-25 15:33:20] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 1 ms to minimize.
[2024-05-25 15:33:20] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:33:20] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2024-05-25 15:33:20] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 13 ms returned sat
[2024-05-25 15:33:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:33:20] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2024-05-25 15:33:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:33:20] [INFO ] [Nat]Absence check using 57 positive place invariants in 24 ms returned sat
[2024-05-25 15:33:20] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2024-05-25 15:33:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:33:21] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-05-25 15:33:21] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 0 ms to minimize.
[2024-05-25 15:33:21] [INFO ] Deduced a trap composed of 118 places in 155 ms of which 1 ms to minimize.
[2024-05-25 15:33:21] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 0 ms to minimize.
[2024-05-25 15:33:21] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 1 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 0 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 0 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 1 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 1 ms to minimize.
[2024-05-25 15:33:22] [INFO ] Deduced a trap composed of 134 places in 175 ms of which 1 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 1 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 1 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 1 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 0 ms to minimize.
[2024-05-25 15:33:23] [INFO ] Deduced a trap composed of 118 places in 177 ms of which 1 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Deduced a trap composed of 119 places in 179 ms of which 1 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Deduced a trap composed of 117 places in 156 ms of which 1 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Deduced a trap composed of 125 places in 204 ms of which 0 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 0 ms to minimize.
[2024-05-25 15:33:24] [INFO ] Deduced a trap composed of 126 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:33:25] [INFO ] Deduced a trap composed of 126 places in 148 ms of which 0 ms to minimize.
[2024-05-25 15:33:25] [INFO ] Deduced a trap composed of 126 places in 155 ms of which 1 ms to minimize.
[2024-05-25 15:33:25] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4149 ms
[2024-05-25 15:33:25] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 55 ms.
[2024-05-25 15:33:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:33:25] [INFO ] [Real]Absence check using 57 positive place invariants in 24 ms returned sat
[2024-05-25 15:33:25] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 13 ms returned sat
[2024-05-25 15:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:33:26] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2024-05-25 15:33:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:33:26] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2024-05-25 15:33:26] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2024-05-25 15:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:33:26] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-25 15:33:26] [INFO ] Deduced a trap composed of 110 places in 210 ms of which 1 ms to minimize.
[2024-05-25 15:33:26] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 0 ms to minimize.
[2024-05-25 15:33:27] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 2 ms to minimize.
[2024-05-25 15:33:27] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2024-05-25 15:33:27] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 1 ms to minimize.
[2024-05-25 15:33:27] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 1 ms to minimize.
[2024-05-25 15:33:27] [INFO ] Deduced a trap composed of 113 places in 187 ms of which 1 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 1 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-25 15:33:28] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 0 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 0 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 0 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 0 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:33:29] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3222 ms
[2024-05-25 15:33:29] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 48 ms.
[2024-05-25 15:33:31] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 1 ms to minimize.
[2024-05-25 15:33:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:33:31] [INFO ] [Real]Absence check using 57 positive place invariants in 28 ms returned sat
[2024-05-25 15:33:31] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 16 ms returned sat
[2024-05-25 15:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:33:31] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2024-05-25 15:33:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:33:31] [INFO ] [Nat]Absence check using 57 positive place invariants in 26 ms returned sat
[2024-05-25 15:33:31] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 12 ms returned sat
[2024-05-25 15:33:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:33:32] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2024-05-25 15:33:32] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 1 ms to minimize.
[2024-05-25 15:33:32] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 0 ms to minimize.
[2024-05-25 15:33:32] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 0 ms to minimize.
[2024-05-25 15:33:32] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 1 ms to minimize.
[2024-05-25 15:33:33] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:33:33] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 0 ms to minimize.
[2024-05-25 15:33:33] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:33:33] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 0 ms to minimize.
[2024-05-25 15:33:33] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2024-05-25 15:33:33] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:33:33] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2024-05-25 15:33:34] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-25 15:33:34] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1962 ms
[2024-05-25 15:33:34] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 32 ms.
[2024-05-25 15:33:35] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-05-25 15:33:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2024-05-25 15:33:35] [INFO ] Added : 238 causal constraints over 49 iterations in 1567 ms. Result :sat
Minimization took 95 ms.
[2024-05-25 15:33:35] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned sat
[2024-05-25 15:33:35] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2024-05-25 15:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:33:36] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-25 15:33:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:33:36] [INFO ] [Nat]Absence check using 57 positive place invariants in 26 ms returned sat
[2024-05-25 15:33:36] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2024-05-25 15:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:33:36] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2024-05-25 15:33:36] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2024-05-25 15:33:36] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 1 ms to minimize.
[2024-05-25 15:33:36] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-25 15:33:37] [INFO ] Deduced a trap composed of 121 places in 134 ms of which 1 ms to minimize.
[2024-05-25 15:33:37] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 0 ms to minimize.
[2024-05-25 15:33:37] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 0 ms to minimize.
[2024-05-25 15:33:37] [INFO ] Deduced a trap composed of 119 places in 173 ms of which 1 ms to minimize.
[2024-05-25 15:33:37] [INFO ] Deduced a trap composed of 117 places in 172 ms of which 1 ms to minimize.
[2024-05-25 15:33:38] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 1 ms to minimize.
[2024-05-25 15:33:38] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 1 ms to minimize.
[2024-05-25 15:33:38] [INFO ] Deduced a trap composed of 22 places in 158 ms of which 1 ms to minimize.
[2024-05-25 15:33:38] [INFO ] Deduced a trap composed of 126 places in 173 ms of which 1 ms to minimize.
[2024-05-25 15:33:38] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 0 ms to minimize.
[2024-05-25 15:33:38] [INFO ] Deduced a trap composed of 119 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:33:39] [INFO ] Deduced a trap composed of 131 places in 186 ms of which 0 ms to minimize.
[2024-05-25 15:33:39] [INFO ] Deduced a trap composed of 126 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:33:39] [INFO ] Deduced a trap composed of 130 places in 144 ms of which 0 ms to minimize.
[2024-05-25 15:33:39] [INFO ] Deduced a trap composed of 116 places in 147 ms of which 1 ms to minimize.
[2024-05-25 15:33:39] [INFO ] Deduced a trap composed of 126 places in 141 ms of which 0 ms to minimize.
[2024-05-25 15:33:39] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 1 ms to minimize.
[2024-05-25 15:33:40] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 1 ms to minimize.
[2024-05-25 15:33:40] [INFO ] Deduced a trap composed of 116 places in 170 ms of which 0 ms to minimize.
[2024-05-25 15:33:40] [INFO ] Deduced a trap composed of 113 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:33:40] [INFO ] Deduced a trap composed of 115 places in 205 ms of which 1 ms to minimize.
[2024-05-25 15:33:40] [INFO ] Deduced a trap composed of 118 places in 165 ms of which 1 ms to minimize.
[2024-05-25 15:33:41] [INFO ] Deduced a trap composed of 138 places in 187 ms of which 0 ms to minimize.
[2024-05-25 15:33:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 15:33:41] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2024-05-25 15:33:41] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 13 ms returned sat
[2024-05-25 15:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:33:41] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2024-05-25 15:33:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:33:41] [INFO ] [Nat]Absence check using 57 positive place invariants in 22 ms returned sat
[2024-05-25 15:33:41] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2024-05-25 15:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:33:41] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2024-05-25 15:33:42] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 1 ms to minimize.
[2024-05-25 15:33:42] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 0 ms to minimize.
[2024-05-25 15:33:42] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 1 ms to minimize.
[2024-05-25 15:33:42] [INFO ] Deduced a trap composed of 40 places in 205 ms of which 1 ms to minimize.
[2024-05-25 15:33:43] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 1 ms to minimize.
[2024-05-25 15:33:43] [INFO ] Deduced a trap composed of 135 places in 193 ms of which 1 ms to minimize.
[2024-05-25 15:33:43] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 0 ms to minimize.
[2024-05-25 15:33:43] [INFO ] Deduced a trap composed of 127 places in 161 ms of which 0 ms to minimize.
[2024-05-25 15:33:43] [INFO ] Deduced a trap composed of 134 places in 192 ms of which 0 ms to minimize.
[2024-05-25 15:33:44] [INFO ] Deduced a trap composed of 124 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:33:44] [INFO ] Deduced a trap composed of 141 places in 148 ms of which 1 ms to minimize.
[2024-05-25 15:33:44] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 1 ms to minimize.
[2024-05-25 15:33:44] [INFO ] Deduced a trap composed of 128 places in 173 ms of which 0 ms to minimize.
[2024-05-25 15:33:44] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:33:44] [INFO ] Deduced a trap composed of 141 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:33:45] [INFO ] Deduced a trap composed of 135 places in 183 ms of which 1 ms to minimize.
[2024-05-25 15:33:45] [INFO ] Deduced a trap composed of 139 places in 174 ms of which 0 ms to minimize.
[2024-05-25 15:33:45] [INFO ] Deduced a trap composed of 126 places in 165 ms of which 1 ms to minimize.
[2024-05-25 15:33:45] [INFO ] Deduced a trap composed of 127 places in 166 ms of which 2 ms to minimize.
[2024-05-25 15:33:45] [INFO ] Deduced a trap composed of 122 places in 191 ms of which 1 ms to minimize.
[2024-05-25 15:33:46] [INFO ] Deduced a trap composed of 131 places in 191 ms of which 0 ms to minimize.
[2024-05-25 15:33:46] [INFO ] Deduced a trap composed of 128 places in 160 ms of which 1 ms to minimize.
[2024-05-25 15:33:46] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 3 ms to minimize.
[2024-05-25 15:33:46] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 1 ms to minimize.
[2024-05-25 15:33:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 332 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1189 edges and 579 vertex of which 573 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 132 place count 573 transition count 389
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 1 with 130 rules applied. Total rules applied 262 place count 443 transition count 389
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 87 Pre rules applied. Total rules applied 262 place count 443 transition count 302
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 191 rules applied. Total rules applied 453 place count 339 transition count 302
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 527 place count 265 transition count 228
Iterating global reduction 2 with 74 rules applied. Total rules applied 601 place count 265 transition count 228
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 601 place count 265 transition count 220
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 619 place count 255 transition count 220
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 797 place count 165 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 799 place count 164 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 801 place count 164 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 803 place count 162 transition count 134
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 804 place count 162 transition count 134
Applied a total of 804 rules in 127 ms. Remains 162 /585 variables (removed 423) and now considering 134/528 (removed 394) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 162/585 places, 134/528 transitions.
// Phase 1: matrix 134 rows 162 cols
[2024-05-25 15:33:47] [INFO ] Computed 69 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 43337 resets, run finished after 2691 ms. (steps per millisecond=371 ) properties (out of 5) seen :5
FORMULA BusinessProcesses-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 65359 ms.

BK_STOP 1716651230038

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-13"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-13, 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 r065-tajo-171620414900341"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-13.tgz
mv BusinessProcesses-PT-13 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;