About the Execution of GreatSPN+red for BusinessProcesses-PT-13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 438.691 | 66563.00 | 93224.00 | 88.30 | 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398500549.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BusinessProcesses-PT-13, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398500549
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 148K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-13-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716306322382
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:45:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 15:45:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:45:24] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-05-21 15:45:24] [INFO ] Transformed 593 places.
[2024-05-21 15:45:24] [INFO ] Transformed 536 transitions.
[2024-05-21 15:45:24] [INFO ] Found NUPN structural information;
[2024-05-21 15:45:24] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 528 rows 585 cols
[2024-05-21 15:45:24] [INFO ] Computed 95 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (69 resets) in 44 ms. (222 steps per ms)
FORMULA BusinessProcesses-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110009 steps (133 resets) in 171 ms. (639 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-21 15:45:24] [INFO ] Invariant cache hit.
[2024-05-21 15:45:24] [INFO ] [Real]Absence check using 57 positive place invariants in 30 ms returned sat
[2024-05-21 15:45:25] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 25 ms returned sat
[2024-05-21 15:45:25] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2024-05-21 15:45:25] [INFO ] Deduced a trap composed of 15 places in 421 ms of which 65 ms to minimize.
[2024-05-21 15:45:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:45:25] [INFO ] [Nat]Absence check using 57 positive place invariants in 43 ms returned sat
[2024-05-21 15:45:25] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2024-05-21 15:45:26] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-05-21 15:45:26] [INFO ] Deduced a trap composed of 15 places in 306 ms of which 16 ms to minimize.
[2024-05-21 15:45:26] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2024-05-21 15:45:26] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:45:26] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:45:26] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:45:27] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 3 ms to minimize.
[2024-05-21 15:45:27] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:45:27] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:45:27] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:45:27] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:45:27] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:45:27] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:45:27] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:45:27] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:45:28] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 2 ms to minimize.
[2024-05-21 15:45:28] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:45:28] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 2 ms to minimize.
[2024-05-21 15:45:28] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:45:28] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-05-21 15:45:28] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:45:28] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-21 15:45:28] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:45:28] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:45:29] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 3 ms to minimize.
[2024-05-21 15:45:29] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2973 ms
[2024-05-21 15:45:29] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 43 ms.
[2024-05-21 15:45:30] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 15:45:30] [INFO ] [Real]Absence check using 57 positive place invariants in 21 ms returned sat
[2024-05-21 15:45:30] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2024-05-21 15:45:31] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2024-05-21 15:45:31] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:45:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:45:31] [INFO ] [Nat]Absence check using 57 positive place invariants in 25 ms returned sat
[2024-05-21 15:45:31] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2024-05-21 15:45:31] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2024-05-21 15:45:31] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 3 ms to minimize.
[2024-05-21 15:45:32] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 3 ms to minimize.
[2024-05-21 15:45:32] [INFO ] Deduced a trap composed of 132 places in 181 ms of which 4 ms to minimize.
[2024-05-21 15:45:32] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 3 ms to minimize.
[2024-05-21 15:45:32] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 3 ms to minimize.
[2024-05-21 15:45:32] [INFO ] Deduced a trap composed of 135 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:45:32] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 4 ms to minimize.
[2024-05-21 15:45:33] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 4 ms to minimize.
[2024-05-21 15:45:33] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 3 ms to minimize.
[2024-05-21 15:45:33] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:45:33] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 4 ms to minimize.
[2024-05-21 15:45:33] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 2 ms to minimize.
[2024-05-21 15:45:34] [INFO ] Deduced a trap composed of 140 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:45:34] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 4 ms to minimize.
[2024-05-21 15:45:34] [INFO ] Deduced a trap composed of 128 places in 205 ms of which 3 ms to minimize.
[2024-05-21 15:45:34] [INFO ] Deduced a trap composed of 133 places in 162 ms of which 4 ms to minimize.
[2024-05-21 15:45:34] [INFO ] Deduced a trap composed of 35 places in 170 ms of which 3 ms to minimize.
[2024-05-21 15:45:35] [INFO ] Deduced a trap composed of 134 places in 184 ms of which 3 ms to minimize.
[2024-05-21 15:45:35] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:45:35] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:45:35] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:45:35] [INFO ] Deduced a trap composed of 141 places in 220 ms of which 4 ms to minimize.
[2024-05-21 15:45:36] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 2 ms to minimize.
[2024-05-21 15:45:36] [INFO ] Deduced a trap composed of 135 places in 295 ms of which 6 ms to minimize.
[2024-05-21 15:45:36] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 15:45:36] [INFO ] [Real]Absence check using 57 positive place invariants in 27 ms returned sat
[2024-05-21 15:45:36] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 12 ms returned sat
[2024-05-21 15:45:36] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2024-05-21 15:45:36] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 5 ms to minimize.
[2024-05-21 15:45:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:45:37] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2024-05-21 15:45:37] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2024-05-21 15:45:37] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-05-21 15:45:37] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 4 ms to minimize.
[2024-05-21 15:45:37] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 3 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 3 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 3 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 3 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 6 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 4 ms to minimize.
[2024-05-21 15:45:38] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 3 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 141 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 2 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:45:39] [INFO ] Deduced a trap composed of 16 places in 161 ms of which 3 ms to minimize.
[2024-05-21 15:45:40] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 4 ms to minimize.
[2024-05-21 15:45:40] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 3 ms to minimize.
[2024-05-21 15:45:40] [INFO ] Deduced a trap composed of 129 places in 159 ms of which 4 ms to minimize.
[2024-05-21 15:45:40] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 4 ms to minimize.
[2024-05-21 15:45:40] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:45:40] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:45:41] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:45:41] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:45:41] [INFO ] Deduced a trap composed of 129 places in 162 ms of which 3 ms to minimize.
[2024-05-21 15:45:41] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 3 ms to minimize.
[2024-05-21 15:45:41] [INFO ] Deduced a trap composed of 125 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:45:41] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:45:42] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 3 ms to minimize.
[2024-05-21 15:45:42] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 15:45:42] [INFO ] [Real]Absence check using 57 positive place invariants in 23 ms returned sat
[2024-05-21 15:45:42] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 12 ms returned sat
[2024-05-21 15:45:42] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-05-21 15:45:42] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:45:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:45:42] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2024-05-21 15:45:42] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2024-05-21 15:45:42] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2024-05-21 15:45:43] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 2 ms to minimize.
[2024-05-21 15:45:43] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:45:43] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:45:43] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:45:43] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-21 15:45:43] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-21 15:45:43] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-21 15:45:43] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 3 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-21 15:45:44] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1739 ms
[2024-05-21 15:45:44] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 25 ms.
[2024-05-21 15:45:46] [INFO ] Added : 351 causal constraints over 71 iterations in 2260 ms. Result :sat
Minimization took 364 ms.
[2024-05-21 15:45:47] [INFO ] [Real]Absence check using 57 positive place invariants in 41 ms returned sat
[2024-05-21 15:45:47] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 17 ms returned sat
[2024-05-21 15:45:47] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-21 15:45:47] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 4 ms to minimize.
[2024-05-21 15:45:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:45:48] [INFO ] [Nat]Absence check using 57 positive place invariants in 26 ms returned sat
[2024-05-21 15:45:48] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2024-05-21 15:45:48] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-21 15:45:48] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 2 ms to minimize.
[2024-05-21 15:45:48] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:45:48] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:45:48] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 4 ms to minimize.
[2024-05-21 15:45:49] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:45:49] [INFO ] Deduced a trap composed of 118 places in 169 ms of which 3 ms to minimize.
[2024-05-21 15:45:49] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 4 ms to minimize.
[2024-05-21 15:45:49] [INFO ] Deduced a trap composed of 117 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:45:49] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:45:49] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 3 ms to minimize.
[2024-05-21 15:45:50] [INFO ] Deduced a trap composed of 114 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:45:50] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:45:50] [INFO ] Deduced a trap composed of 114 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:45:50] [INFO ] Deduced a trap composed of 116 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:45:50] [INFO ] Deduced a trap composed of 110 places in 168 ms of which 3 ms to minimize.
[2024-05-21 15:45:50] [INFO ] Deduced a trap composed of 137 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:45:51] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
[2024-05-21 15:45:51] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:45:51] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2024-05-21 15:45:51] [INFO ] Deduced a trap composed of 113 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:45:51] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:45:51] [INFO ] Deduced a trap composed of 112 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:45:51] [INFO ] Deduced a trap composed of 124 places in 121 ms of which 2 ms to minimize.
[2024-05-21 15:45:52] [INFO ] Deduced a trap composed of 116 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:45:52] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 3 ms to minimize.
[2024-05-21 15:45:52] [INFO ] Deduced a trap composed of 127 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:45:52] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 3 ms to minimize.
[2024-05-21 15:45:52] [INFO ] Deduced a trap composed of 120 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:45:52] [INFO ] Deduced a trap composed of 114 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:45:53] [INFO ] Deduced a trap composed of 118 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:45:53] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 15:45:53] [INFO ] [Real]Absence check using 57 positive place invariants in 23 ms returned sat
[2024-05-21 15:45:53] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2024-05-21 15:45:53] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2024-05-21 15:45:53] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 2 ms to minimize.
[2024-05-21 15:45:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:45:53] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2024-05-21 15:45:53] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2024-05-21 15:45:53] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-21 15:45:54] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:45:54] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 3 ms to minimize.
[2024-05-21 15:45:54] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 13 ms to minimize.
[2024-05-21 15:45:54] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-21 15:45:54] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:45:54] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-21 15:45:54] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:45:54] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-05-21 15:45:54] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 2 ms to minimize.
[2024-05-21 15:45:55] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:45:55] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-21 15:45:55] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-21 15:45:55] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:45:55] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:45:55] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-05-21 15:45:55] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 3 ms to minimize.
[2024-05-21 15:45:55] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:45:55] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:45:55] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:45:55] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2024-05-21 15:45:56] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:45:56] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-21 15:45:56] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-21 15:45:56] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:45:56] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2474 ms
[2024-05-21 15:45:56] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 31 ms.
[2024-05-21 15:45:58] [INFO ] Added : 358 causal constraints over 72 iterations in 2251 ms. Result :unknown
[2024-05-21 15:45:58] [INFO ] [Real]Absence check using 57 positive place invariants in 39 ms returned sat
[2024-05-21 15:45:58] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 40 ms returned sat
[2024-05-21 15:45:58] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-21 15:45:59] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 3 ms to minimize.
[2024-05-21 15:45:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:45:59] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2024-05-21 15:45:59] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 7 ms returned sat
[2024-05-21 15:45:59] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-21 15:45:59] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 2 ms to minimize.
[2024-05-21 15:45:59] [INFO ] Deduced a trap composed of 136 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:45:59] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:46:00] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 2 ms to minimize.
[2024-05-21 15:46:00] [INFO ] Deduced a trap composed of 134 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:46:00] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:46:00] [INFO ] Deduced a trap composed of 140 places in 137 ms of which 2 ms to minimize.
[2024-05-21 15:46:00] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:46:00] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:46:00] [INFO ] Deduced a trap composed of 139 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:46:01] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 2 ms to minimize.
[2024-05-21 15:46:01] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:46:01] [INFO ] Deduced a trap composed of 135 places in 181 ms of which 3 ms to minimize.
[2024-05-21 15:46:01] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:46:01] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 3 ms to minimize.
[2024-05-21 15:46:01] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:46:02] [INFO ] Deduced a trap composed of 133 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:46:02] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:46:02] [INFO ] Deduced a trap composed of 120 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:46:02] [INFO ] Deduced a trap composed of 134 places in 126 ms of which 2 ms to minimize.
[2024-05-21 15:46:02] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 3 ms to minimize.
[2024-05-21 15:46:02] [INFO ] Deduced a trap composed of 129 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:46:03] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 3 ms to minimize.
[2024-05-21 15:46:03] [INFO ] Deduced a trap composed of 130 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:46:03] [INFO ] Deduced a trap composed of 133 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:46:03] [INFO ] Deduced a trap composed of 125 places in 136 ms of which 3 ms to minimize.
[2024-05-21 15:46:03] [INFO ] Deduced a trap composed of 127 places in 130 ms of which 3 ms to minimize.
[2024-05-21 15:46:03] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4296 ms
[2024-05-21 15:46:03] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 27 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-21 15:46:04] [INFO ] [Real]Absence check using 57 positive place invariants in 23 ms returned sat
[2024-05-21 15:46:04] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 27 ms returned sat
[2024-05-21 15:46:04] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-21 15:46:04] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 5 ms to minimize.
[2024-05-21 15:46:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:46:05] [INFO ] [Nat]Absence check using 57 positive place invariants in 30 ms returned sat
[2024-05-21 15:46:05] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 18 ms returned sat
[2024-05-21 15:46:05] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-21 15:46:05] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 2 ms to minimize.
[2024-05-21 15:46:05] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:46:05] [INFO ] Deduced a trap composed of 118 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:46:05] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:46:05] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-05-21 15:46:05] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:46:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 817 ms
[2024-05-21 15:46:06] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 29 ms.
[2024-05-21 15:46:06] [INFO ] Added : 178 causal constraints over 37 iterations in 948 ms. Result :sat
Minimization took 283 ms.
[2024-05-21 15:46:07] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2024-05-21 15:46:07] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 11 ms returned sat
[2024-05-21 15:46:07] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-21 15:46:07] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:46:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:46:07] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2024-05-21 15:46:07] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 9 ms returned sat
[2024-05-21 15:46:08] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-21 15:46:08] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 3 ms to minimize.
[2024-05-21 15:46:08] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:46:08] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 2 ms to minimize.
[2024-05-21 15:46:08] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:46:09] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 3 ms to minimize.
[2024-05-21 15:46:09] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:46:09] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:46:09] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:46:09] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-05-21 15:46:09] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:46:09] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:46:10] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-05-21 15:46:10] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 3 ms to minimize.
[2024-05-21 15:46:10] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 2 ms to minimize.
[2024-05-21 15:46:10] [INFO ] Deduced a trap composed of 126 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:46:10] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:46:10] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 4 ms to minimize.
[2024-05-21 15:46:10] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:46:11] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2024-05-21 15:46:11] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2024-05-21 15:46:11] [INFO ] Deduced a trap composed of 132 places in 110 ms of which 3 ms to minimize.
[2024-05-21 15:46:11] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:46:11] [INFO ] Deduced a trap composed of 134 places in 136 ms of which 2 ms to minimize.
[2024-05-21 15:46:11] [INFO ] Deduced a trap composed of 128 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:46:11] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 2 ms to minimize.
[2024-05-21 15:46:12] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:46:12] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
[2024-05-21 15:46:12] [INFO ] Deduced a trap composed of 123 places in 157 ms of which 2 ms to minimize.
[2024-05-21 15:46:12] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 2 ms to minimize.
[2024-05-21 15:46:12] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 3 ms to minimize.
[2024-05-21 15:46:12] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:46:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-21 15:46:12] [INFO ] [Real]Absence check using 57 positive place invariants in 16 ms returned sat
[2024-05-21 15:46:12] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2024-05-21 15:46:13] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2024-05-21 15:46:13] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:46:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:46:13] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2024-05-21 15:46:13] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 7 ms returned sat
[2024-05-21 15:46:13] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-05-21 15:46:13] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:46:13] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:46:14] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:46:14] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 2 ms to minimize.
[2024-05-21 15:46:14] [INFO ] Deduced a trap composed of 30 places in 122 ms of which 2 ms to minimize.
[2024-05-21 15:46:14] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:46:14] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:46:14] [INFO ] Deduced a trap composed of 149 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:46:15] [INFO ] Deduced a trap composed of 119 places in 132 ms of which 3 ms to minimize.
[2024-05-21 15:46:15] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:46:15] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-21 15:46:15] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:46:15] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 3 ms to minimize.
[2024-05-21 15:46:15] [INFO ] Deduced a trap composed of 119 places in 118 ms of which 3 ms to minimize.
[2024-05-21 15:46:15] [INFO ] Deduced a trap composed of 138 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 110 places in 145 ms of which 2 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 116 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 121 places in 108 ms of which 2 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 124 places in 125 ms of which 3 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-05-21 15:46:16] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3106 ms
[2024-05-21 15:46:16] [INFO ] Computed and/alt/rep : 496/823/496 causal constraints (skipped 31 transitions) in 24 ms.
[2024-05-21 15:46:17] [INFO ] Added : 219 causal constraints over 44 iterations in 1036 ms. Result :sat
Minimization took 266 ms.
[2024-05-21 15:46:18] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2024-05-21 15:46:18] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 10 ms returned sat
[2024-05-21 15:46:18] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-21 15:46:18] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 3 ms to minimize.
[2024-05-21 15:46:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:46:18] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2024-05-21 15:46:18] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 8 ms returned sat
[2024-05-21 15:46:18] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-21 15:46:19] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:46:19] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:46:19] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 3 ms to minimize.
[2024-05-21 15:46:19] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-05-21 15:46:19] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 2 ms to minimize.
[2024-05-21 15:46:20] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 3 ms to minimize.
[2024-05-21 15:46:20] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 2 ms to minimize.
[2024-05-21 15:46:20] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 2 ms to minimize.
[2024-05-21 15:46:20] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 4 ms to minimize.
[2024-05-21 15:46:20] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:46:20] [INFO ] Deduced a trap composed of 133 places in 151 ms of which 2 ms to minimize.
[2024-05-21 15:46:21] [INFO ] Deduced a trap composed of 132 places in 173 ms of which 2 ms to minimize.
[2024-05-21 15:46:21] [INFO ] Deduced a trap composed of 143 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:46:21] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:46:21] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:46:21] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 16 ms to minimize.
[2024-05-21 15:46:21] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 2 ms to minimize.
[2024-05-21 15:46:22] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 7 ms to minimize.
[2024-05-21 15:46:22] [INFO ] Deduced a trap composed of 132 places in 127 ms of which 3 ms to minimize.
[2024-05-21 15:46:22] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:46:22] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 3 ms to minimize.
[2024-05-21 15:46:22] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:46:22] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 2 ms to minimize.
[2024-05-21 15:46:23] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:46:23] [INFO ] Deduced a trap composed of 132 places in 140 ms of which 3 ms to minimize.
[2024-05-21 15:46:23] [INFO ] Deduced a trap composed of 139 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:46:23] [INFO ] Deduced a trap composed of 147 places in 141 ms of which 2 ms to minimize.
[2024-05-21 15:46:23] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 2 ms to minimize.
[2024-05-21 15:46:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA BusinessProcesses-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 1, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 327 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1189 edges and 579 vertex of which 573 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 127 transitions
Trivial Post-agglo rules discarded 127 transitions
Performed 127 trivial Post agglomeration. Transition count delta: 127
Iterating post reduction 0 with 127 rules applied. Total rules applied 129 place count 573 transition count 392
Reduce places removed 127 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 128 rules applied. Total rules applied 257 place count 446 transition count 391
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 258 place count 445 transition count 391
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 258 place count 445 transition count 305
Deduced a syphon composed of 86 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 187 rules applied. Total rules applied 445 place count 344 transition count 305
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 518 place count 271 transition count 232
Iterating global reduction 3 with 73 rules applied. Total rules applied 591 place count 271 transition count 232
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 591 place count 271 transition count 224
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 609 place count 261 transition count 224
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 785 place count 172 transition count 137
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 787 place count 171 transition count 141
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 789 place count 171 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 791 place count 169 transition count 139
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 792 place count 169 transition count 139
Applied a total of 792 rules in 150 ms. Remains 169 /585 variables (removed 416) and now considering 139/528 (removed 389) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 169/585 places, 139/528 transitions.
// Phase 1: matrix 139 rows 169 cols
[2024-05-21 15:46:24] [INFO ] Computed 71 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 1, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA BusinessProcesses-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (39972 resets) in 2897 ms. (345 steps per ms)
FORMULA BusinessProcesses-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (21599 resets) in 1746 ms. (572 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 65015 ms.
ITS solved all properties within timeout
BK_STOP 1716306388945
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-13"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-13, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398500549"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-13.tgz
mv BusinessProcesses-PT-13 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;