Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 157K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678363564537

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 12:06:06] [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]
[2023-03-09 12:06:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:06:06] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-09 12:06:06] [INFO ] Transformed 630 places.
[2023-03-09 12:06:06] [INFO ] Transformed 566 transitions.
[2023-03-09 12:06:06] [INFO ] Found NUPN structural information;
[2023-03-09 12:06:06] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 4 transitions.
// Phase 1: matrix 562 rows 626 cols
[2023-03-09 12:06:06] [INFO ] Computed 102 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 69 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :5
FORMULA BusinessProcesses-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 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 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 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :2
FORMULA BusinessProcesses-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
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
[2023-03-09 12:06:06] [INFO ] Invariant cache hit.
[2023-03-09 12:06:06] [INFO ] [Real]Absence check using 61 positive place invariants in 21 ms returned sat
[2023-03-09 12:06:06] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 21 ms returned sat
[2023-03-09 12:06:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:06] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2023-03-09 12:06:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:06:07] [INFO ] [Nat]Absence check using 61 positive place invariants in 19 ms returned sat
[2023-03-09 12:06:07] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 12 ms returned sat
[2023-03-09 12:06:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:07] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-09 12:06:07] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 4 ms to minimize.
[2023-03-09 12:06:07] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2023-03-09 12:06:07] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2023-03-09 12:06:07] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2023-03-09 12:06:07] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2023-03-09 12:06:07] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2023-03-09 12:06:07] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2023-03-09 12:06:07] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2023-03-09 12:06:08] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 0 ms to minimize.
[2023-03-09 12:06:08] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 1 ms to minimize.
[2023-03-09 12:06:08] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 0 ms to minimize.
[2023-03-09 12:06:08] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2023-03-09 12:06:08] [INFO ] Deduced a trap composed of 151 places in 124 ms of which 1 ms to minimize.
[2023-03-09 12:06:08] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 1 ms to minimize.
[2023-03-09 12:06:08] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 1 ms to minimize.
[2023-03-09 12:06:09] [INFO ] Deduced a trap composed of 162 places in 143 ms of which 1 ms to minimize.
[2023-03-09 12:06:09] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 1 ms to minimize.
[2023-03-09 12:06:09] [INFO ] Deduced a trap composed of 136 places in 104 ms of which 0 ms to minimize.
[2023-03-09 12:06:09] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 1 ms to minimize.
[2023-03-09 12:06:09] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 0 ms to minimize.
[2023-03-09 12:06:09] [INFO ] Deduced a trap composed of 136 places in 136 ms of which 0 ms to minimize.
[2023-03-09 12:06:10] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 0 ms to minimize.
[2023-03-09 12:06:10] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 0 ms to minimize.
[2023-03-09 12:06:10] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2023-03-09 12:06:10] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 0 ms to minimize.
[2023-03-09 12:06:10] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 0 ms to minimize.
[2023-03-09 12:06:10] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
[2023-03-09 12:06:10] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2023-03-09 12:06:10] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2023-03-09 12:06:10] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2023-03-09 12:06:11] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2023-03-09 12:06:11] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2023-03-09 12:06:11] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 0 ms to minimize.
[2023-03-09 12:06:11] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 4060 ms
[2023-03-09 12:06:11] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 61 ms.
[2023-03-09 12:06:11] [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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 12:06:12] [INFO ] [Real]Absence check using 61 positive place invariants in 24 ms returned sat
[2023-03-09 12:06:12] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 17 ms returned sat
[2023-03-09 12:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:12] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2023-03-09 12:06:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:06:12] [INFO ] [Nat]Absence check using 61 positive place invariants in 26 ms returned sat
[2023-03-09 12:06:12] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2023-03-09 12:06:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:12] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2023-03-09 12:06:12] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 1 ms to minimize.
[2023-03-09 12:06:13] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 0 ms to minimize.
[2023-03-09 12:06:13] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 0 ms to minimize.
[2023-03-09 12:06:13] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 0 ms to minimize.
[2023-03-09 12:06:13] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2023-03-09 12:06:13] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 0 ms to minimize.
[2023-03-09 12:06:13] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2023-03-09 12:06:13] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 0 ms to minimize.
[2023-03-09 12:06:13] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 0 ms to minimize.
[2023-03-09 12:06:14] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2023-03-09 12:06:14] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2023-03-09 12:06:14] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2023-03-09 12:06:14] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 0 ms to minimize.
[2023-03-09 12:06:14] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2023-03-09 12:06:14] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 0 ms to minimize.
[2023-03-09 12:06:14] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2023-03-09 12:06:14] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 0 ms to minimize.
[2023-03-09 12:06:14] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2023-03-09 12:06:14] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2169 ms
[2023-03-09 12:06:15] [INFO ] Computed and/alt/rep : 527/861/527 causal constraints (skipped 34 transitions) in 45 ms.
[2023-03-09 12:06:16] [INFO ] Added : 315 causal constraints over 63 iterations in 1977 ms. Result :sat
Minimization took 109 ms.
[2023-03-09 12:06:17] [INFO ] [Real]Absence check using 61 positive place invariants in 18 ms returned sat
[2023-03-09 12:06:17] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 12 ms returned sat
[2023-03-09 12:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:17] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2023-03-09 12:06:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:06:17] [INFO ] [Nat]Absence check using 61 positive place invariants in 22 ms returned sat
[2023-03-09 12:06:17] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 12 ms returned sat
[2023-03-09 12:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:17] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-09 12:06:17] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 1 ms to minimize.
[2023-03-09 12:06:18] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 0 ms to minimize.
[2023-03-09 12:06:18] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 0 ms to minimize.
[2023-03-09 12:06:18] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 1 ms to minimize.
[2023-03-09 12:06:18] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 1 ms to minimize.
[2023-03-09 12:06:18] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 5 ms to minimize.
[2023-03-09 12:06:19] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 0 ms to minimize.
[2023-03-09 12:06:19] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 1 ms to minimize.
[2023-03-09 12:06:19] [INFO ] Deduced a trap composed of 43 places in 188 ms of which 1 ms to minimize.
[2023-03-09 12:06:19] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 1 ms to minimize.
[2023-03-09 12:06:19] [INFO ] Deduced a trap composed of 173 places in 173 ms of which 0 ms to minimize.
[2023-03-09 12:06:20] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 1 ms to minimize.
[2023-03-09 12:06:20] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 1 ms to minimize.
[2023-03-09 12:06:20] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 1 ms to minimize.
[2023-03-09 12:06:20] [INFO ] Deduced a trap composed of 33 places in 193 ms of which 1 ms to minimize.
[2023-03-09 12:06:20] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 1 ms to minimize.
[2023-03-09 12:06:21] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 0 ms to minimize.
[2023-03-09 12:06:21] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 0 ms to minimize.
[2023-03-09 12:06:21] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 0 ms to minimize.
[2023-03-09 12:06:21] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 0 ms to minimize.
[2023-03-09 12:06:21] [INFO ] Deduced a trap composed of 143 places in 179 ms of which 0 ms to minimize.
[2023-03-09 12:06:22] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 0 ms to minimize.
[2023-03-09 12:06:22] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 1 ms to minimize.
[2023-03-09 12:06:22] [INFO ] Deduced a trap composed of 147 places in 148 ms of which 1 ms to minimize.
[2023-03-09 12:06:22] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 0 ms to minimize.
[2023-03-09 12:06:22] [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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 12:06:22] [INFO ] [Real]Absence check using 61 positive place invariants in 23 ms returned sat
[2023-03-09 12:06:22] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2023-03-09 12:06:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:22] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2023-03-09 12:06:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:06:23] [INFO ] [Nat]Absence check using 61 positive place invariants in 25 ms returned sat
[2023-03-09 12:06:23] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2023-03-09 12:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:23] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2023-03-09 12:06:23] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 1 ms to minimize.
[2023-03-09 12:06:23] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 0 ms to minimize.
[2023-03-09 12:06:23] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 0 ms to minimize.
[2023-03-09 12:06:24] [INFO ] Deduced a trap composed of 141 places in 144 ms of which 1 ms to minimize.
[2023-03-09 12:06:24] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 2 ms to minimize.
[2023-03-09 12:06:24] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 1 ms to minimize.
[2023-03-09 12:06:24] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2023-03-09 12:06:24] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 0 ms to minimize.
[2023-03-09 12:06:24] [INFO ] Deduced a trap composed of 154 places in 142 ms of which 0 ms to minimize.
[2023-03-09 12:06:25] [INFO ] Deduced a trap composed of 71 places in 158 ms of which 0 ms to minimize.
[2023-03-09 12:06:25] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 1 ms to minimize.
[2023-03-09 12:06:25] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 1 ms to minimize.
[2023-03-09 12:06:25] [INFO ] Deduced a trap composed of 146 places in 175 ms of which 1 ms to minimize.
[2023-03-09 12:06:25] [INFO ] Deduced a trap composed of 143 places in 140 ms of which 1 ms to minimize.
[2023-03-09 12:06:25] [INFO ] Deduced a trap composed of 143 places in 141 ms of which 0 ms to minimize.
[2023-03-09 12:06:26] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 1 ms to minimize.
[2023-03-09 12:06:26] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 1 ms to minimize.
[2023-03-09 12:06:26] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 1 ms to minimize.
[2023-03-09 12:06:26] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 1 ms to minimize.
[2023-03-09 12:06:26] [INFO ] Deduced a trap composed of 141 places in 117 ms of which 0 ms to minimize.
[2023-03-09 12:06:26] [INFO ] Deduced a trap composed of 152 places in 116 ms of which 1 ms to minimize.
[2023-03-09 12:06:26] [INFO ] Deduced a trap composed of 140 places in 161 ms of which 0 ms to minimize.
[2023-03-09 12:06:27] [INFO ] Deduced a trap composed of 153 places in 178 ms of which 1 ms to minimize.
[2023-03-09 12:06:27] [INFO ] Deduced a trap composed of 130 places in 125 ms of which 1 ms to minimize.
[2023-03-09 12:06:27] [INFO ] Deduced a trap composed of 130 places in 162 ms of which 1 ms to minimize.
[2023-03-09 12:06:27] [INFO ] Deduced a trap composed of 131 places in 172 ms of which 1 ms to minimize.
[2023-03-09 12:06:27] [INFO ] Deduced a trap composed of 145 places in 157 ms of which 1 ms to minimize.
[2023-03-09 12:06:28] [INFO ] Deduced a trap composed of 153 places in 171 ms of which 0 ms to minimize.
[2023-03-09 12:06:28] [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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 12:06:28] [INFO ] [Real]Absence check using 61 positive place invariants in 23 ms returned sat
[2023-03-09 12:06:28] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2023-03-09 12:06:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:28] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2023-03-09 12:06:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:06:28] [INFO ] [Nat]Absence check using 61 positive place invariants in 25 ms returned sat
[2023-03-09 12:06:28] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2023-03-09 12:06:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:28] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2023-03-09 12:06:29] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2023-03-09 12:06:29] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 0 ms to minimize.
[2023-03-09 12:06:29] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2023-03-09 12:06:29] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 1 ms to minimize.
[2023-03-09 12:06:29] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2023-03-09 12:06:29] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 0 ms to minimize.
[2023-03-09 12:06:30] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 1 ms to minimize.
[2023-03-09 12:06:30] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2023-03-09 12:06:30] [INFO ] Deduced a trap composed of 123 places in 164 ms of which 0 ms to minimize.
[2023-03-09 12:06:30] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 0 ms to minimize.
[2023-03-09 12:06:30] [INFO ] Deduced a trap composed of 127 places in 121 ms of which 0 ms to minimize.
[2023-03-09 12:06:30] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2023-03-09 12:06:31] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 1 ms to minimize.
[2023-03-09 12:06:31] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 1 ms to minimize.
[2023-03-09 12:06:31] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 0 ms to minimize.
[2023-03-09 12:06:31] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 0 ms to minimize.
[2023-03-09 12:06:31] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 1 ms to minimize.
[2023-03-09 12:06:31] [INFO ] Deduced a trap composed of 130 places in 133 ms of which 0 ms to minimize.
[2023-03-09 12:06:32] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 1 ms to minimize.
[2023-03-09 12:06:32] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 0 ms to minimize.
[2023-03-09 12:06:32] [INFO ] Deduced a trap composed of 137 places in 109 ms of which 1 ms to minimize.
[2023-03-09 12:06:32] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 1 ms to minimize.
[2023-03-09 12:06:32] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 1 ms to minimize.
[2023-03-09 12:06:32] [INFO ] Deduced a trap composed of 126 places in 169 ms of which 1 ms to minimize.
[2023-03-09 12:06:33] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 1 ms to minimize.
[2023-03-09 12:06:33] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 1 ms to minimize.
[2023-03-09 12:06:33] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 0 ms to minimize.
[2023-03-09 12:06:33] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 1 ms to minimize.
[2023-03-09 12:06:33] [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 4
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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 12:06:33] [INFO ] [Real]Absence check using 61 positive place invariants in 22 ms returned sat
[2023-03-09 12:06:33] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2023-03-09 12:06:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:33] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2023-03-09 12:06:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:06:34] [INFO ] [Nat]Absence check using 61 positive place invariants in 24 ms returned sat
[2023-03-09 12:06:34] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2023-03-09 12:06:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:34] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2023-03-09 12:06:34] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2023-03-09 12:06:34] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 0 ms to minimize.
[2023-03-09 12:06:34] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2023-03-09 12:06:34] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2023-03-09 12:06:35] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 0 ms to minimize.
[2023-03-09 12:06:35] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 1 ms to minimize.
[2023-03-09 12:06:35] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 1 ms to minimize.
[2023-03-09 12:06:35] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 1 ms to minimize.
[2023-03-09 12:06:35] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2023-03-09 12:06:35] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 0 ms to minimize.
[2023-03-09 12:06:35] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2023-03-09 12:06:35] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 0 ms to minimize.
[2023-03-09 12:06:35] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 0 ms to minimize.
[2023-03-09 12:06:36] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2023-03-09 12:06:36] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2023-03-09 12:06:36] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2023-03-09 12:06:36] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 0 ms to minimize.
[2023-03-09 12:06:36] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 0 ms to minimize.
[2023-03-09 12:06:36] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 0 ms to minimize.
[2023-03-09 12:06:36] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 0 ms to minimize.
[2023-03-09 12:06:37] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 0 ms to minimize.
[2023-03-09 12:06:37] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 0 ms to minimize.
[2023-03-09 12:06:37] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2023-03-09 12:06:37] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2023-03-09 12:06:37] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2023-03-09 12:06:37] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 0 ms to minimize.
[2023-03-09 12:06:37] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 1 ms to minimize.
[2023-03-09 12:06:37] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2023-03-09 12:06:38] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 0 ms to minimize.
[2023-03-09 12:06:38] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 1 ms to minimize.
[2023-03-09 12:06:38] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2023-03-09 12:06:38] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2023-03-09 12:06:38] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 0 ms to minimize.
[2023-03-09 12:06:38] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2023-03-09 12:06:38] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2023-03-09 12:06:38] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 0 ms to minimize.
[2023-03-09 12:06:38] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 0 ms to minimize.
[2023-03-09 12:06:38] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 0 ms to minimize.
[2023-03-09 12:06:39] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 0 ms to minimize.
[2023-03-09 12:06:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 12:06:39] [INFO ] [Real]Absence check using 61 positive place invariants in 25 ms returned sat
[2023-03-09 12:06:39] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2023-03-09 12:06:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:39] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2023-03-09 12:06:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:06:39] [INFO ] [Nat]Absence check using 61 positive place invariants in 26 ms returned sat
[2023-03-09 12:06:39] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2023-03-09 12:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:39] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2023-03-09 12:06:40] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 1 ms to minimize.
[2023-03-09 12:06:40] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 0 ms to minimize.
[2023-03-09 12:06:40] [INFO ] Deduced a trap composed of 147 places in 185 ms of which 3 ms to minimize.
[2023-03-09 12:06:40] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2023-03-09 12:06:40] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 1 ms to minimize.
[2023-03-09 12:06:41] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 1 ms to minimize.
[2023-03-09 12:06:41] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 1 ms to minimize.
[2023-03-09 12:06:41] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 0 ms to minimize.
[2023-03-09 12:06:41] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 1 ms to minimize.
[2023-03-09 12:06:41] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 1 ms to minimize.
[2023-03-09 12:06:41] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 0 ms to minimize.
[2023-03-09 12:06:41] [INFO ] Deduced a trap composed of 156 places in 109 ms of which 1 ms to minimize.
[2023-03-09 12:06:42] [INFO ] Deduced a trap composed of 145 places in 122 ms of which 1 ms to minimize.
[2023-03-09 12:06:42] [INFO ] Deduced a trap composed of 151 places in 128 ms of which 0 ms to minimize.
[2023-03-09 12:06:42] [INFO ] Deduced a trap composed of 141 places in 128 ms of which 1 ms to minimize.
[2023-03-09 12:06:42] [INFO ] Deduced a trap composed of 158 places in 111 ms of which 1 ms to minimize.
[2023-03-09 12:06:42] [INFO ] Deduced a trap composed of 144 places in 152 ms of which 1 ms to minimize.
[2023-03-09 12:06:42] [INFO ] Deduced a trap composed of 136 places in 161 ms of which 1 ms to minimize.
[2023-03-09 12:06:43] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 0 ms to minimize.
[2023-03-09 12:06:43] [INFO ] Deduced a trap composed of 127 places in 151 ms of which 1 ms to minimize.
[2023-03-09 12:06:43] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 0 ms to minimize.
[2023-03-09 12:06:43] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 0 ms to minimize.
[2023-03-09 12:06:43] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 0 ms to minimize.
[2023-03-09 12:06:43] [INFO ] Deduced a trap composed of 142 places in 157 ms of which 1 ms to minimize.
[2023-03-09 12:06:44] [INFO ] Deduced a trap composed of 134 places in 140 ms of which 1 ms to minimize.
[2023-03-09 12:06:44] [INFO ] Deduced a trap composed of 140 places in 152 ms of which 1 ms to minimize.
[2023-03-09 12:06:44] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2023-03-09 12:06:44] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2023-03-09 12:06:44] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 4589 ms
[2023-03-09 12:06:44] [INFO ] [Real]Absence check using 61 positive place invariants in 24 ms returned sat
[2023-03-09 12:06:44] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2023-03-09 12:06:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:44] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2023-03-09 12:06:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:06:45] [INFO ] [Nat]Absence check using 61 positive place invariants in 42 ms returned sat
[2023-03-09 12:06:45] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 25 ms returned sat
[2023-03-09 12:06:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:45] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2023-03-09 12:06:45] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 0 ms to minimize.
[2023-03-09 12:06:45] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 1 ms to minimize.
[2023-03-09 12:06:45] [INFO ] Deduced a trap composed of 147 places in 170 ms of which 1 ms to minimize.
[2023-03-09 12:06:46] [INFO ] Deduced a trap composed of 150 places in 171 ms of which 1 ms to minimize.
[2023-03-09 12:06:46] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 0 ms to minimize.
[2023-03-09 12:06:46] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 1 ms to minimize.
[2023-03-09 12:06:46] [INFO ] Deduced a trap composed of 153 places in 194 ms of which 1 ms to minimize.
[2023-03-09 12:06:46] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 1 ms to minimize.
[2023-03-09 12:06:47] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 1 ms to minimize.
[2023-03-09 12:06:47] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 1 ms to minimize.
[2023-03-09 12:06:47] [INFO ] Deduced a trap composed of 76 places in 192 ms of which 1 ms to minimize.
[2023-03-09 12:06:47] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 0 ms to minimize.
[2023-03-09 12:06:47] [INFO ] Deduced a trap composed of 146 places in 182 ms of which 1 ms to minimize.
[2023-03-09 12:06:48] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 1 ms to minimize.
[2023-03-09 12:06:48] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 1 ms to minimize.
[2023-03-09 12:06:48] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 1 ms to minimize.
[2023-03-09 12:06:48] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 1 ms to minimize.
[2023-03-09 12:06:48] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 1 ms to minimize.
[2023-03-09 12:06:48] [INFO ] Deduced a trap composed of 147 places in 142 ms of which 0 ms to minimize.
[2023-03-09 12:06:49] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 1 ms to minimize.
[2023-03-09 12:06:49] [INFO ] Deduced a trap composed of 155 places in 162 ms of which 1 ms to minimize.
[2023-03-09 12:06:49] [INFO ] Deduced a trap composed of 150 places in 134 ms of which 1 ms to minimize.
[2023-03-09 12:06:49] [INFO ] Deduced a trap composed of 138 places in 143 ms of which 1 ms to minimize.
[2023-03-09 12:06:49] [INFO ] Deduced a trap composed of 147 places in 158 ms of which 0 ms to minimize.
[2023-03-09 12:06:49] [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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-09 12:06:50] [INFO ] [Real]Absence check using 61 positive place invariants in 22 ms returned sat
[2023-03-09 12:06:50] [INFO ] [Real]Absence check using 61 positive and 41 generalized place invariants in 14 ms returned sat
[2023-03-09 12:06:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:50] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2023-03-09 12:06:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:06:50] [INFO ] [Nat]Absence check using 61 positive place invariants in 24 ms returned sat
[2023-03-09 12:06:50] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2023-03-09 12:06:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:06:50] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2023-03-09 12:06:50] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 1 ms to minimize.
[2023-03-09 12:06:51] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2023-03-09 12:06:51] [INFO ] Deduced a trap composed of 20 places in 163 ms of which 0 ms to minimize.
[2023-03-09 12:06:51] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2023-03-09 12:06:51] [INFO ] Deduced a trap composed of 152 places in 172 ms of which 1 ms to minimize.
[2023-03-09 12:06:51] [INFO ] Deduced a trap composed of 148 places in 153 ms of which 0 ms to minimize.
[2023-03-09 12:06:52] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 1 ms to minimize.
[2023-03-09 12:06:52] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 1 ms to minimize.
[2023-03-09 12:06:52] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 2 ms to minimize.
[2023-03-09 12:06:52] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 0 ms to minimize.
[2023-03-09 12:06:52] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2023-03-09 12:06:53] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 1 ms to minimize.
[2023-03-09 12:06:53] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 0 ms to minimize.
[2023-03-09 12:06:53] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 0 ms to minimize.
[2023-03-09 12:06:53] [INFO ] Deduced a trap composed of 141 places in 207 ms of which 1 ms to minimize.
[2023-03-09 12:06:53] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 0 ms to minimize.
[2023-03-09 12:06:54] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 0 ms to minimize.
[2023-03-09 12:06:54] [INFO ] Deduced a trap composed of 129 places in 154 ms of which 1 ms to minimize.
[2023-03-09 12:06:54] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 0 ms to minimize.
[2023-03-09 12:06:54] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 1 ms to minimize.
[2023-03-09 12:06:54] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 1 ms to minimize.
[2023-03-09 12:06:54] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 1 ms to minimize.
[2023-03-09 12:06:55] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 1 ms to minimize.
[2023-03-09 12:06:55] [INFO ] Deduced a trap composed of 151 places in 150 ms of which 1 ms to minimize.
[2023-03-09 12:06: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 562/562 transitions.
Graph (trivial) has 354 edges and 626 vertex of which 7 / 626 are part of one of the 1 SCC in 8 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1267 edges and 620 vertex of which 616 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 139 place count 616 transition count 416
Reduce places removed 137 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 138 rules applied. Total rules applied 277 place count 479 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 478 transition count 415
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 278 place count 478 transition count 321
Deduced a syphon composed of 94 places in 2 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 484 place count 366 transition count 321
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 563 place count 287 transition count 242
Iterating global reduction 3 with 79 rules applied. Total rules applied 642 place count 287 transition count 242
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 642 place count 287 transition count 234
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 660 place count 277 transition count 234
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 850 place count 181 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 852 place count 180 transition count 144
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 854 place count 180 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 856 place count 178 transition count 142
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 861 place count 178 transition count 142
Applied a total of 861 rules in 182 ms. Remains 178 /626 variables (removed 448) and now considering 142/562 (removed 420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 178/626 places, 142/562 transitions.
// Phase 1: matrix 142 rows 178 cols
[2023-03-09 12:06:55] [INFO ] Computed 77 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 27336 resets, run finished after 2574 ms. (steps per millisecond=388 ) properties (out of 7) seen :7
FORMULA BusinessProcesses-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 52308 ms.

BK_STOP 1678363619250

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-15"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-15, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690500565"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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