fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r043-tajo-167813697000581
Last Updated
May 14, 2023

About the Execution of Smart+red for BusinessProcesses-PT-17

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
344.691 38619.00 54948.00 48.10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r043-tajo-167813697000581.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 smartxred
Input is BusinessProcesses-PT-17, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697000581
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K 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.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 161K 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-17-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-17-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678794529183

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-17
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 11:48:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 11:48:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 11:48:51] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-14 11:48:51] [INFO ] Transformed 650 places.
[2023-03-14 11:48:51] [INFO ] Transformed 580 transitions.
[2023-03-14 11:48:51] [INFO ] Found NUPN structural information;
[2023-03-14 11:48:51] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
// Phase 1: matrix 576 rows 646 cols
[2023-03-14 11:48:51] [INFO ] Computed 108 place invariants in 47 ms
Incomplete random walk after 10000 steps, including 66 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :8
FORMULA BusinessProcesses-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 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 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-14 11:48:51] [INFO ] Invariant cache hit.
[2023-03-14 11:48:51] [INFO ] [Real]Absence check using 62 positive place invariants in 32 ms returned sat
[2023-03-14 11:48:51] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2023-03-14 11:48:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:48:51] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2023-03-14 11:48:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:48:52] [INFO ] [Nat]Absence check using 62 positive place invariants in 34 ms returned sat
[2023-03-14 11:48:52] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2023-03-14 11:48:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:48:52] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2023-03-14 11:48:52] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 3 ms to minimize.
[2023-03-14 11:48:52] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 1 ms to minimize.
[2023-03-14 11:48:53] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 2 ms to minimize.
[2023-03-14 11:48:53] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 2 ms to minimize.
[2023-03-14 11:48:53] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2023-03-14 11:48:53] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 0 ms to minimize.
[2023-03-14 11:48:53] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 1 ms to minimize.
[2023-03-14 11:48:53] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 2 ms to minimize.
[2023-03-14 11:48:54] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 1 ms to minimize.
[2023-03-14 11:48:54] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 1 ms to minimize.
[2023-03-14 11:48:54] [INFO ] Deduced a trap composed of 124 places in 211 ms of which 1 ms to minimize.
[2023-03-14 11:48:54] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 1 ms to minimize.
[2023-03-14 11:48:55] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 1 ms to minimize.
[2023-03-14 11:48:55] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 1 ms to minimize.
[2023-03-14 11:48:55] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 1 ms to minimize.
[2023-03-14 11:48:55] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 1 ms to minimize.
[2023-03-14 11:48:56] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 1 ms to minimize.
[2023-03-14 11:48:56] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 0 ms to minimize.
[2023-03-14 11:48:56] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 1 ms to minimize.
[2023-03-14 11:48:56] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 0 ms to minimize.
[2023-03-14 11:48:56] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 0 ms to minimize.
[2023-03-14 11:48:57] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 1 ms to minimize.
[2023-03-14 11:48:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-14 11:48:57] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2023-03-14 11:48:57] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 16 ms returned sat
[2023-03-14 11:48:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:48:57] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2023-03-14 11:48:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:48:57] [INFO ] [Nat]Absence check using 62 positive place invariants in 23 ms returned sat
[2023-03-14 11:48:57] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 17 ms returned sat
[2023-03-14 11:48:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:48:57] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2023-03-14 11:48:58] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2023-03-14 11:48:58] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 1 ms to minimize.
[2023-03-14 11:48:58] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 1 ms to minimize.
[2023-03-14 11:48:58] [INFO ] Deduced a trap composed of 18 places in 158 ms of which 0 ms to minimize.
[2023-03-14 11:48:58] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 1 ms to minimize.
[2023-03-14 11:48:58] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2023-03-14 11:48:59] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 0 ms to minimize.
[2023-03-14 11:48:59] [INFO ] Deduced a trap composed of 164 places in 136 ms of which 1 ms to minimize.
[2023-03-14 11:48:59] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 0 ms to minimize.
[2023-03-14 11:48:59] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 1 ms to minimize.
[2023-03-14 11:48:59] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 1 ms to minimize.
[2023-03-14 11:48:59] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2023-03-14 11:49:00] [INFO ] Deduced a trap composed of 152 places in 160 ms of which 1 ms to minimize.
[2023-03-14 11:49:00] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 0 ms to minimize.
[2023-03-14 11:49:00] [INFO ] Deduced a trap composed of 144 places in 191 ms of which 1 ms to minimize.
[2023-03-14 11:49:00] [INFO ] Deduced a trap composed of 155 places in 194 ms of which 1 ms to minimize.
[2023-03-14 11:49:00] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2773 ms
[2023-03-14 11:49:00] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 61 ms.
[2023-03-14 11:49:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-14 11:49:02] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2023-03-14 11:49:02] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2023-03-14 11:49:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:49:03] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2023-03-14 11:49:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:49:03] [INFO ] [Nat]Absence check using 62 positive place invariants in 34 ms returned sat
[2023-03-14 11:49:03] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 13 ms returned sat
[2023-03-14 11:49:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:49:03] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2023-03-14 11:49:03] [INFO ] Deduced a trap composed of 140 places in 172 ms of which 0 ms to minimize.
[2023-03-14 11:49:03] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 1 ms to minimize.
[2023-03-14 11:49:04] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 1 ms to minimize.
[2023-03-14 11:49:04] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 0 ms to minimize.
[2023-03-14 11:49:04] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 1 ms to minimize.
[2023-03-14 11:49:04] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2023-03-14 11:49:04] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2023-03-14 11:49:04] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2023-03-14 11:49:04] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2023-03-14 11:49:04] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 0 ms to minimize.
[2023-03-14 11:49:05] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2023-03-14 11:49:05] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2023-03-14 11:49:05] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2023-03-14 11:49:05] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2023-03-14 11:49:05] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2023-03-14 11:49:05] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 0 ms to minimize.
[2023-03-14 11:49:05] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2023-03-14 11:49:05] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2023-03-14 11:49:05] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 2 ms to minimize.
[2023-03-14 11:49:05] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 0 ms to minimize.
[2023-03-14 11:49:06] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2023-03-14 11:49:06] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2023-03-14 11:49:06] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2023-03-14 11:49:06] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2023-03-14 11:49:06] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2023-03-14 11:49:06] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2023-03-14 11:49:06] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2023-03-14 11:49:06] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3097 ms
[2023-03-14 11:49:06] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 46 ms.
[2023-03-14 11:49:08] [INFO ] Deduced a trap composed of 15 places in 314 ms of which 0 ms to minimize.
[2023-03-14 11:49:08] [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.refineWithCausalOrder(DeadlockTester.java:1177)
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-14 11:49:08] [INFO ] [Real]Absence check using 62 positive place invariants in 43 ms returned sat
[2023-03-14 11:49:08] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 17 ms returned sat
[2023-03-14 11:49:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:49:08] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2023-03-14 11:49:09] [INFO ] Deduced a trap composed of 16 places in 288 ms of which 0 ms to minimize.
[2023-03-14 11:49:09] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 1 ms to minimize.
[2023-03-14 11:49:09] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 2 ms to minimize.
[2023-03-14 11:49:09] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 0 ms to minimize.
[2023-03-14 11:49:09] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 0 ms to minimize.
[2023-03-14 11:49:09] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 0 ms to minimize.
[2023-03-14 11:49:10] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 0 ms to minimize.
[2023-03-14 11:49:10] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 0 ms to minimize.
[2023-03-14 11:49:10] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 1 ms to minimize.
[2023-03-14 11:49:10] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 1 ms to minimize.
[2023-03-14 11:49:10] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 0 ms to minimize.
[2023-03-14 11:49:10] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 0 ms to minimize.
[2023-03-14 11:49:11] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 0 ms to minimize.
[2023-03-14 11:49:11] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 0 ms to minimize.
[2023-03-14 11:49:11] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 6 ms to minimize.
[2023-03-14 11:49:11] [INFO ] Deduced a trap composed of 144 places in 144 ms of which 0 ms to minimize.
[2023-03-14 11:49:11] [INFO ] Deduced a trap composed of 30 places in 139 ms of which 0 ms to minimize.
[2023-03-14 11:49:11] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2023-03-14 11:49:11] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 1 ms to minimize.
[2023-03-14 11:49:12] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 1 ms to minimize.
[2023-03-14 11:49:12] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 1 ms to minimize.
[2023-03-14 11:49:12] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 1 ms to minimize.
[2023-03-14 11:49:12] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 1 ms to minimize.
[2023-03-14 11:49:12] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 1 ms to minimize.
[2023-03-14 11:49:12] [INFO ] Deduced a trap composed of 30 places in 166 ms of which 1 ms to minimize.
[2023-03-14 11:49:13] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 0 ms to minimize.
[2023-03-14 11:49:13] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 0 ms to minimize.
[2023-03-14 11:49:13] [INFO ] Deduced a trap composed of 159 places in 134 ms of which 1 ms to minimize.
[2023-03-14 11:49:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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:2618)
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-14 11:49:13] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2023-03-14 11:49:13] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2023-03-14 11:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:49:13] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2023-03-14 11:49:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:49:13] [INFO ] [Nat]Absence check using 62 positive place invariants in 19 ms returned sat
[2023-03-14 11:49:14] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 8 ms returned sat
[2023-03-14 11:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:49:14] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2023-03-14 11:49:14] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 1 ms to minimize.
[2023-03-14 11:49:14] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 1 ms to minimize.
[2023-03-14 11:49:14] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 0 ms to minimize.
[2023-03-14 11:49:14] [INFO ] Deduced a trap composed of 135 places in 162 ms of which 1 ms to minimize.
[2023-03-14 11:49:15] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 0 ms to minimize.
[2023-03-14 11:49:15] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 0 ms to minimize.
[2023-03-14 11:49:15] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 1 ms to minimize.
[2023-03-14 11:49:15] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 0 ms to minimize.
[2023-03-14 11:49:15] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 1 ms to minimize.
[2023-03-14 11:49:15] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 1 ms to minimize.
[2023-03-14 11:49:16] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 0 ms to minimize.
[2023-03-14 11:49:16] [INFO ] Deduced a trap composed of 133 places in 139 ms of which 1 ms to minimize.
[2023-03-14 11:49:16] [INFO ] Deduced a trap composed of 123 places in 152 ms of which 0 ms to minimize.
[2023-03-14 11:49:16] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 0 ms to minimize.
[2023-03-14 11:49:16] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 1 ms to minimize.
[2023-03-14 11:49:16] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 1 ms to minimize.
[2023-03-14 11:49:17] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 0 ms to minimize.
[2023-03-14 11:49:17] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 0 ms to minimize.
[2023-03-14 11:49:17] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 0 ms to minimize.
[2023-03-14 11:49:17] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 0 ms to minimize.
[2023-03-14 11:49:17] [INFO ] Deduced a trap composed of 142 places in 123 ms of which 1 ms to minimize.
[2023-03-14 11:49:17] [INFO ] Deduced a trap composed of 145 places in 120 ms of which 0 ms to minimize.
[2023-03-14 11:49:17] [INFO ] Deduced a trap composed of 149 places in 145 ms of which 1 ms to minimize.
[2023-03-14 11:49:18] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 0 ms to minimize.
[2023-03-14 11:49:18] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 0 ms to minimize.
[2023-03-14 11:49:18] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 1 ms to minimize.
[2023-03-14 11:49:18] [INFO ] Deduced a trap composed of 124 places in 158 ms of which 0 ms to minimize.
[2023-03-14 11:49:18] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 1 ms to minimize.
[2023-03-14 11:49:18] [INFO ] Deduced a trap composed of 124 places in 121 ms of which 1 ms to minimize.
[2023-03-14 11:49:18] [INFO ] Trap strengthening (SAT) tested/added 29/29 trap constraints in 4694 ms
[2023-03-14 11:49:18] [INFO ] [Real]Absence check using 62 positive place invariants in 16 ms returned sat
[2023-03-14 11:49:18] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 8 ms returned sat
[2023-03-14 11:49:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 11:49:19] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-03-14 11:49:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 11:49:19] [INFO ] [Nat]Absence check using 62 positive place invariants in 17 ms returned sat
[2023-03-14 11:49:19] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 8 ms returned sat
[2023-03-14 11:49:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 11:49:19] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-14 11:49:19] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 0 ms to minimize.
[2023-03-14 11:49:19] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 0 ms to minimize.
[2023-03-14 11:49:19] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 0 ms to minimize.
[2023-03-14 11:49:19] [INFO ] Deduced a trap composed of 133 places in 121 ms of which 0 ms to minimize.
[2023-03-14 11:49:20] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 0 ms to minimize.
[2023-03-14 11:49:20] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 0 ms to minimize.
[2023-03-14 11:49:20] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 0 ms to minimize.
[2023-03-14 11:49:20] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2023-03-14 11:49:20] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 0 ms to minimize.
[2023-03-14 11:49:20] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 1 ms to minimize.
[2023-03-14 11:49:21] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 0 ms to minimize.
[2023-03-14 11:49:21] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 1 ms to minimize.
[2023-03-14 11:49:21] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 1 ms to minimize.
[2023-03-14 11:49:21] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 1 ms to minimize.
[2023-03-14 11:49:21] [INFO ] Deduced a trap composed of 129 places in 115 ms of which 1 ms to minimize.
[2023-03-14 11:49:21] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2023-03-14 11:49:21] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 0 ms to minimize.
[2023-03-14 11:49:21] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 0 ms to minimize.
[2023-03-14 11:49:22] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 0 ms to minimize.
[2023-03-14 11:49:22] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2023-03-14 11:49:22] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2023-03-14 11:49:22] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2023-03-14 11:49:22] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 0 ms to minimize.
[2023-03-14 11:49:22] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2023-03-14 11:49:22] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2023-03-14 11:49:22] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 0 ms to minimize.
[2023-03-14 11:49:22] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2023-03-14 11:49:22] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 0 ms to minimize.
[2023-03-14 11:49:22] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 0 ms to minimize.
[2023-03-14 11:49:23] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2023-03-14 11:49:23] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 0 ms to minimize.
[2023-03-14 11:49:23] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2023-03-14 11:49:23] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2023-03-14 11:49:23] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2023-03-14 11:49:23] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2023-03-14 11:49:23] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2023-03-14 11:49:23] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 0 ms to minimize.
[2023-03-14 11:49:23] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2023-03-14 11:49:23] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2023-03-14 11:49:24] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 0 ms to minimize.
[2023-03-14 11:49:24] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2023-03-14 11:49:24] [INFO ] Deduced a trap composed of 15 places in 253 ms of which 1 ms to minimize.
[2023-03-14 11:49:24] [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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (trivial) has 365 edges and 646 vertex of which 7 / 646 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 1304 edges and 640 vertex of which 636 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 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 142 place count 636 transition count 427
Reduce places removed 140 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 141 rules applied. Total rules applied 283 place count 496 transition count 426
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 284 place count 495 transition count 426
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 284 place count 495 transition count 328
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 499 place count 378 transition count 328
Discarding 81 places :
Symmetric choice reduction at 3 with 81 rule applications. Total rules 580 place count 297 transition count 247
Iterating global reduction 3 with 81 rules applied. Total rules applied 661 place count 297 transition count 247
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 661 place count 297 transition count 239
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 679 place count 287 transition count 239
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 882 place count 184 transition count 139
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 884 place count 183 transition count 143
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 886 place count 183 transition count 141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 888 place count 181 transition count 141
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 892 place count 181 transition count 141
Applied a total of 892 rules in 242 ms. Remains 181 /646 variables (removed 465) and now considering 141/576 (removed 435) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 181/646 places, 141/576 transitions.
// Phase 1: matrix 141 rows 181 cols
[2023-03-14 11:49:24] [INFO ] Computed 81 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 26830 resets, run finished after 2788 ms. (steps per millisecond=358 ) properties (out of 6) seen :6
FORMULA BusinessProcesses-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 36765 ms.
ITS solved all properties within timeout

BK_STOP 1678794567802

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-17"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is BusinessProcesses-PT-17, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813697000581"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;