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-167813690500541.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-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690500541
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:49 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 146K 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-12-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678362655979

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-12
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 11:50:57] [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 11:50:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:50:57] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2023-03-09 11:50:57] [INFO ] Transformed 586 places.
[2023-03-09 11:50:57] [INFO ] Transformed 525 transitions.
[2023-03-09 11:50:57] [INFO ] Found NUPN structural information;
[2023-03-09 11:50:57] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
// Phase 1: matrix 521 rows 582 cols
[2023-03-09 11:50:57] [INFO ] Computed 98 place invariants in 38 ms
Incomplete random walk after 10000 steps, including 70 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :8
FORMULA BusinessProcesses-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-09 11:50:58] [INFO ] Invariant cache hit.
[2023-03-09 11:50:58] [INFO ] [Real]Absence check using 55 positive place invariants in 28 ms returned sat
[2023-03-09 11:50:58] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 14 ms returned sat
[2023-03-09 11:50:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:50:58] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2023-03-09 11:50:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:50:58] [INFO ] [Nat]Absence check using 55 positive place invariants in 18 ms returned sat
[2023-03-09 11:50:58] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 9 ms returned sat
[2023-03-09 11:50:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:50:59] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2023-03-09 11:50:59] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 4 ms to minimize.
[2023-03-09 11:50:59] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2023-03-09 11:50:59] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 1 ms to minimize.
[2023-03-09 11:50:59] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2023-03-09 11:51:00] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 2 ms to minimize.
[2023-03-09 11:51:00] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 1 ms to minimize.
[2023-03-09 11:51:00] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 0 ms to minimize.
[2023-03-09 11:51:00] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 1 ms to minimize.
[2023-03-09 11:51:00] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 1 ms to minimize.
[2023-03-09 11:51:00] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 1 ms to minimize.
[2023-03-09 11:51:01] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 1 ms to minimize.
[2023-03-09 11:51:01] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 0 ms to minimize.
[2023-03-09 11:51:01] [INFO ] Deduced a trap composed of 132 places in 156 ms of which 1 ms to minimize.
[2023-03-09 11:51:01] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2023-03-09 11:51:01] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 1 ms to minimize.
[2023-03-09 11:51:01] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 1 ms to minimize.
[2023-03-09 11:51:02] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
[2023-03-09 11:51:02] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 0 ms to minimize.
[2023-03-09 11:51:02] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 1 ms to minimize.
[2023-03-09 11:51:02] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2023-03-09 11:51:02] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 0 ms to minimize.
[2023-03-09 11:51:02] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 1 ms to minimize.
[2023-03-09 11:51:03] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 0 ms to minimize.
[2023-03-09 11:51:03] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 1 ms to minimize.
[2023-03-09 11:51:03] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 0 ms to minimize.
[2023-03-09 11:51:03] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 0 ms to minimize.
[2023-03-09 11:51:03] [INFO ] Deduced a trap composed of 139 places in 144 ms of which 1 ms to minimize.
[2023-03-09 11:51:03] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 0 ms to minimize.
[2023-03-09 11:51:03] [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: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 11:51:04] [INFO ] [Real]Absence check using 55 positive place invariants in 18 ms returned sat
[2023-03-09 11:51:04] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 10 ms returned sat
[2023-03-09 11:51:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:51:04] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2023-03-09 11:51:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:51:04] [INFO ] [Nat]Absence check using 55 positive place invariants in 42 ms returned sat
[2023-03-09 11:51:04] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 14 ms returned sat
[2023-03-09 11:51:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:51:04] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2023-03-09 11:51:04] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2023-03-09 11:51:05] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 0 ms to minimize.
[2023-03-09 11:51:05] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 0 ms to minimize.
[2023-03-09 11:51:05] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2023-03-09 11:51:05] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 0 ms to minimize.
[2023-03-09 11:51:05] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2023-03-09 11:51:05] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2023-03-09 11:51:06] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 0 ms to minimize.
[2023-03-09 11:51:06] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 1 ms to minimize.
[2023-03-09 11:51:06] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 0 ms to minimize.
[2023-03-09 11:51:06] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 0 ms to minimize.
[2023-03-09 11:51:06] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 1 ms to minimize.
[2023-03-09 11:51:06] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 0 ms to minimize.
[2023-03-09 11:51:06] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 1 ms to minimize.
[2023-03-09 11:51:07] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 1 ms to minimize.
[2023-03-09 11:51:07] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 1 ms to minimize.
[2023-03-09 11:51:07] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 1 ms to minimize.
[2023-03-09 11:51:07] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2023-03-09 11:51:07] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 1 ms to minimize.
[2023-03-09 11:51:07] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2023-03-09 11:51:07] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2023-03-09 11:51:07] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2023-03-09 11:51:07] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3289 ms
[2023-03-09 11:51:08] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 35 ms.
[2023-03-09 11:51:09] [INFO ] Added : 160 causal constraints over 32 iterations in 1322 ms. Result :unknown
[2023-03-09 11:51:09] [INFO ] [Real]Absence check using 55 positive place invariants in 33 ms returned sat
[2023-03-09 11:51:09] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 17 ms returned sat
[2023-03-09 11:51:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:51:09] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2023-03-09 11:51:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:51:09] [INFO ] [Nat]Absence check using 55 positive place invariants in 24 ms returned sat
[2023-03-09 11:51:10] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-09 11:51:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:51:10] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2023-03-09 11:51:10] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 1 ms to minimize.
[2023-03-09 11:51:10] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 1 ms to minimize.
[2023-03-09 11:51:10] [INFO ] Deduced a trap composed of 133 places in 206 ms of which 1 ms to minimize.
[2023-03-09 11:51:11] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 0 ms to minimize.
[2023-03-09 11:51:11] [INFO ] Deduced a trap composed of 110 places in 238 ms of which 1 ms to minimize.
[2023-03-09 11:51:11] [INFO ] Deduced a trap composed of 116 places in 202 ms of which 0 ms to minimize.
[2023-03-09 11:51:11] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 1 ms to minimize.
[2023-03-09 11:51:12] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 0 ms to minimize.
[2023-03-09 11:51:12] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 0 ms to minimize.
[2023-03-09 11:51:12] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 1 ms to minimize.
[2023-03-09 11:51:12] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 0 ms to minimize.
[2023-03-09 11:51:13] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 0 ms to minimize.
[2023-03-09 11:51:13] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 1 ms to minimize.
[2023-03-09 11:51:13] [INFO ] Deduced a trap composed of 21 places in 205 ms of which 0 ms to minimize.
[2023-03-09 11:51:13] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 0 ms to minimize.
[2023-03-09 11:51:13] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 2 ms to minimize.
[2023-03-09 11:51:13] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2023-03-09 11:51:14] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 1 ms to minimize.
[2023-03-09 11:51:14] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 0 ms to minimize.
[2023-03-09 11:51:14] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2023-03-09 11:51:14] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2023-03-09 11:51:14] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 1 ms to minimize.
[2023-03-09 11:51:14] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2023-03-09 11:51:15] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 0 ms to minimize.
[2023-03-09 11:51:15] [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 11:51:15] [INFO ] [Real]Absence check using 55 positive place invariants in 26 ms returned sat
[2023-03-09 11:51:15] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 15 ms returned sat
[2023-03-09 11:51:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:51:15] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2023-03-09 11:51:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:51:15] [INFO ] [Nat]Absence check using 55 positive place invariants in 24 ms returned sat
[2023-03-09 11:51:15] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-09 11:51:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:51:15] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2023-03-09 11:51:16] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2023-03-09 11:51:16] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 0 ms to minimize.
[2023-03-09 11:51:16] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 1 ms to minimize.
[2023-03-09 11:51:16] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 1 ms to minimize.
[2023-03-09 11:51:16] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 1 ms to minimize.
[2023-03-09 11:51:17] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 1 ms to minimize.
[2023-03-09 11:51:17] [INFO ] Deduced a trap composed of 126 places in 203 ms of which 1 ms to minimize.
[2023-03-09 11:51:17] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2023-03-09 11:51:17] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 1 ms to minimize.
[2023-03-09 11:51:17] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 0 ms to minimize.
[2023-03-09 11:51:18] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 1 ms to minimize.
[2023-03-09 11:51:18] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 0 ms to minimize.
[2023-03-09 11:51:18] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 0 ms to minimize.
[2023-03-09 11:51:18] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 0 ms to minimize.
[2023-03-09 11:51:18] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 1 ms to minimize.
[2023-03-09 11:51:19] [INFO ] Deduced a trap composed of 55 places in 222 ms of which 1 ms to minimize.
[2023-03-09 11:51:19] [INFO ] Deduced a trap composed of 121 places in 208 ms of which 1 ms to minimize.
[2023-03-09 11:51:19] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 1 ms to minimize.
[2023-03-09 11:51:19] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 1 ms to minimize.
[2023-03-09 11:51:20] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 1 ms to minimize.
[2023-03-09 11:51:20] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 1 ms to minimize.
[2023-03-09 11:51:20] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 1 ms to minimize.
[2023-03-09 11:51: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 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 11:51:20] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2023-03-09 11:51:20] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-09 11:51:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:51:20] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2023-03-09 11:51:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:51:21] [INFO ] [Nat]Absence check using 55 positive place invariants in 23 ms returned sat
[2023-03-09 11:51:21] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2023-03-09 11:51:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:51:21] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-03-09 11:51:21] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 0 ms to minimize.
[2023-03-09 11:51:21] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 0 ms to minimize.
[2023-03-09 11:51:21] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 1 ms to minimize.
[2023-03-09 11:51:22] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 1 ms to minimize.
[2023-03-09 11:51:22] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 1 ms to minimize.
[2023-03-09 11:51:22] [INFO ] Deduced a trap composed of 111 places in 155 ms of which 0 ms to minimize.
[2023-03-09 11:51:22] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 1 ms to minimize.
[2023-03-09 11:51:23] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 1 ms to minimize.
[2023-03-09 11:51:23] [INFO ] Deduced a trap composed of 33 places in 168 ms of which 1 ms to minimize.
[2023-03-09 11:51:23] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 1 ms to minimize.
[2023-03-09 11:51:23] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 1 ms to minimize.
[2023-03-09 11:51:23] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 1 ms to minimize.
[2023-03-09 11:51:24] [INFO ] Deduced a trap composed of 103 places in 182 ms of which 0 ms to minimize.
[2023-03-09 11:51:24] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 0 ms to minimize.
[2023-03-09 11:51:24] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 0 ms to minimize.
[2023-03-09 11:51:24] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 1 ms to minimize.
[2023-03-09 11:51:24] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 1 ms to minimize.
[2023-03-09 11:51:25] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 1 ms to minimize.
[2023-03-09 11:51:25] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 1 ms to minimize.
[2023-03-09 11:51:25] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 0 ms to minimize.
[2023-03-09 11:51:25] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 1 ms to minimize.
[2023-03-09 11:51:25] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 1 ms to minimize.
[2023-03-09 11:51:26] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 1 ms to minimize.
[2023-03-09 11:51:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 11:51:26] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2023-03-09 11:51:26] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-09 11:51:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:51:26] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2023-03-09 11:51:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:51:26] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2023-03-09 11:51:26] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2023-03-09 11:51:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:51:26] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2023-03-09 11:51:27] [INFO ] Deduced a trap composed of 118 places in 234 ms of which 0 ms to minimize.
[2023-03-09 11:51:27] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 0 ms to minimize.
[2023-03-09 11:51:27] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 0 ms to minimize.
[2023-03-09 11:51:27] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2023-03-09 11:51:27] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 1 ms to minimize.
[2023-03-09 11:51:28] [INFO ] Deduced a trap composed of 125 places in 198 ms of which 2 ms to minimize.
[2023-03-09 11:51:28] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2023-03-09 11:51:28] [INFO ] Deduced a trap composed of 129 places in 166 ms of which 0 ms to minimize.
[2023-03-09 11:51:28] [INFO ] Deduced a trap composed of 126 places in 175 ms of which 0 ms to minimize.
[2023-03-09 11:51:28] [INFO ] Deduced a trap composed of 130 places in 162 ms of which 1 ms to minimize.
[2023-03-09 11:51:29] [INFO ] Deduced a trap composed of 124 places in 152 ms of which 0 ms to minimize.
[2023-03-09 11:51:29] [INFO ] Deduced a trap composed of 127 places in 154 ms of which 1 ms to minimize.
[2023-03-09 11:51:29] [INFO ] Deduced a trap composed of 123 places in 161 ms of which 1 ms to minimize.
[2023-03-09 11:51:29] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 1 ms to minimize.
[2023-03-09 11:51:29] [INFO ] Deduced a trap composed of 128 places in 164 ms of which 1 ms to minimize.
[2023-03-09 11:51:30] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 0 ms to minimize.
[2023-03-09 11:51:30] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 1 ms to minimize.
[2023-03-09 11:51:30] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 1 ms to minimize.
[2023-03-09 11:51:30] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 0 ms to minimize.
[2023-03-09 11:51:30] [INFO ] Deduced a trap composed of 55 places in 174 ms of which 0 ms to minimize.
[2023-03-09 11:51:30] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 1 ms to minimize.
[2023-03-09 11:51:31] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 0 ms to minimize.
[2023-03-09 11:51:31] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2023-03-09 11:51:31] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 0 ms to minimize.
[2023-03-09 11:51:31] [INFO ] Deduced a trap composed of 132 places in 159 ms of which 1 ms to minimize.
[2023-03-09 11:51:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 11:51:31] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2023-03-09 11:51:31] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2023-03-09 11:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:51:32] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2023-03-09 11:51:32] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 1 ms to minimize.
[2023-03-09 11:51:32] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 1 ms to minimize.
[2023-03-09 11:51:32] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2023-03-09 11:51:32] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 1 ms to minimize.
[2023-03-09 11:51:33] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 0 ms to minimize.
[2023-03-09 11:51:33] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 0 ms to minimize.
[2023-03-09 11:51:33] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 1 ms to minimize.
[2023-03-09 11:51:33] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 1 ms to minimize.
[2023-03-09 11:51:33] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 1 ms to minimize.
[2023-03-09 11:51:34] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 1 ms to minimize.
[2023-03-09 11:51:34] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 1 ms to minimize.
[2023-03-09 11:51:34] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 1 ms to minimize.
[2023-03-09 11:51:34] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 0 ms to minimize.
[2023-03-09 11:51:34] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 0 ms to minimize.
[2023-03-09 11:51:35] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 1 ms to minimize.
[2023-03-09 11:51:35] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 0 ms to minimize.
[2023-03-09 11:51:35] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 1 ms to minimize.
[2023-03-09 11:51:35] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 1 ms to minimize.
[2023-03-09 11:51:35] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 1 ms to minimize.
[2023-03-09 11:51:36] [INFO ] Deduced a trap composed of 112 places in 180 ms of which 1 ms to minimize.
[2023-03-09 11:51:36] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 0 ms to minimize.
[2023-03-09 11:51:36] [INFO ] Deduced a trap composed of 61 places in 204 ms of which 1 ms to minimize.
[2023-03-09 11:51:36] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 0 ms to minimize.
[2023-03-09 11:51:36] [INFO ] Trap strengthening (SAT) tested/added 23/23 trap constraints in 4629 ms
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 322 edges and 582 vertex of which 7 / 582 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 1178 edges and 576 vertex of which 572 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 123 place count 572 transition count 391
Reduce places removed 121 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 126 rules applied. Total rules applied 249 place count 451 transition count 386
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 254 place count 446 transition count 386
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 254 place count 446 transition count 297
Deduced a syphon composed of 89 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 195 rules applied. Total rules applied 449 place count 340 transition count 297
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 519 place count 270 transition count 227
Iterating global reduction 3 with 70 rules applied. Total rules applied 589 place count 270 transition count 227
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 589 place count 270 transition count 221
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 602 place count 263 transition count 221
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 181 rules applied. Total rules applied 783 place count 171 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 3 with 2 rules applied. Total rules applied 785 place count 170 transition count 136
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 787 place count 170 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 789 place count 168 transition count 134
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 790 place count 168 transition count 134
Applied a total of 790 rules in 164 ms. Remains 168 /582 variables (removed 414) and now considering 134/521 (removed 387) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 168/582 places, 134/521 transitions.
// Phase 1: matrix 134 rows 168 cols
[2023-03-09 11:51:37] [INFO ] Computed 74 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 33082 resets, run finished after 2624 ms. (steps per millisecond=381 ) properties (out of 7) seen :7
FORMULA BusinessProcesses-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 42019 ms.

BK_STOP 1678362699922

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-12"
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-12, 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-167813690500541"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-12.tgz
mv BusinessProcesses-PT-12 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 ;