About the Execution of GreatSPN+red for BusinessProcesses-PT-12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 447.920 | 67295.00 | 86768.00 | 74.70 | 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/mcc2024-input.r047-tajo-171620398400541.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-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398400541
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 16:38 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 146K 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-12-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-12-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716305941684
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-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:39:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 15:39:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:39:03] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-05-21 15:39:03] [INFO ] Transformed 586 places.
[2024-05-21 15:39:03] [INFO ] Transformed 525 transitions.
[2024-05-21 15:39:03] [INFO ] Found NUPN structural information;
[2024-05-21 15:39:03] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 314 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
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, 0] Max Struct:[1, 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 521 rows 582 cols
[2024-05-21 15:39:04] [INFO ] Computed 98 invariants in 37 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, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (73 resets) in 59 ms. (166 steps per ms)
FORMULA BusinessProcesses-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (119 resets) in 138 ms. (647 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-21 15:39:04] [INFO ] Invariant cache hit.
[2024-05-21 15:39:04] [INFO ] [Real]Absence check using 55 positive place invariants in 30 ms returned sat
[2024-05-21 15:39:04] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 17 ms returned sat
[2024-05-21 15:39:04] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2024-05-21 15:39:05] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 53 ms to minimize.
[2024-05-21 15:39:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:05] [INFO ] [Nat]Absence check using 55 positive place invariants in 26 ms returned sat
[2024-05-21 15:39:05] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2024-05-21 15:39:05] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-05-21 15:39:05] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 4 ms to minimize.
[2024-05-21 15:39:05] [INFO ] Deduced a trap composed of 111 places in 171 ms of which 4 ms to minimize.
[2024-05-21 15:39:06] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:39:06] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 4 ms to minimize.
[2024-05-21 15:39:06] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 4 ms to minimize.
[2024-05-21 15:39:06] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 4 ms to minimize.
[2024-05-21 15:39:06] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 4 ms to minimize.
[2024-05-21 15:39:07] [INFO ] Deduced a trap composed of 116 places in 182 ms of which 4 ms to minimize.
[2024-05-21 15:39:07] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 4 ms to minimize.
[2024-05-21 15:39:07] [INFO ] Deduced a trap composed of 119 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:39:07] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 3 ms to minimize.
[2024-05-21 15:39:07] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 4 ms to minimize.
[2024-05-21 15:39:07] [INFO ] Deduced a trap composed of 122 places in 135 ms of which 3 ms to minimize.
[2024-05-21 15:39:08] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
[2024-05-21 15:39:08] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:39:08] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 3 ms to minimize.
[2024-05-21 15:39:08] [INFO ] Deduced a trap composed of 131 places in 163 ms of which 2 ms to minimize.
[2024-05-21 15:39:08] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 4 ms to minimize.
[2024-05-21 15:39:09] [INFO ] Deduced a trap composed of 129 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:39:09] [INFO ] Deduced a trap composed of 130 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:39:09] [INFO ] Deduced a trap composed of 126 places in 160 ms of which 4 ms to minimize.
[2024-05-21 15:39:09] [INFO ] Deduced a trap composed of 130 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:39:09] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3967 ms
[2024-05-21 15:39:09] [INFO ] Computed and/alt/rep : 489/815/489 causal constraints (skipped 31 transitions) in 38 ms.
[2024-05-21 15:39:10] [INFO ] Added : 125 causal constraints over 25 iterations in 678 ms. Result :unknown
[2024-05-21 15:39:10] [INFO ] [Real]Absence check using 55 positive place invariants in 18 ms returned sat
[2024-05-21 15:39:10] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2024-05-21 15:39:10] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2024-05-21 15:39:10] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 4 ms to minimize.
[2024-05-21 15:39:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:11] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2024-05-21 15:39:11] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2024-05-21 15:39:11] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2024-05-21 15:39:11] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 4 ms to minimize.
[2024-05-21 15:39:11] [INFO ] Deduced a trap composed of 132 places in 205 ms of which 4 ms to minimize.
[2024-05-21 15:39:12] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 4 ms to minimize.
[2024-05-21 15:39:12] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 3 ms to minimize.
[2024-05-21 15:39:12] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 3 ms to minimize.
[2024-05-21 15:39:12] [INFO ] Deduced a trap composed of 15 places in 238 ms of which 4 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 4 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 4 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 135 places in 162 ms of which 3 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 4 ms to minimize.
[2024-05-21 15:39:13] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 4 ms to minimize.
[2024-05-21 15:39:14] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 4 ms to minimize.
[2024-05-21 15:39:14] [INFO ] Deduced a trap composed of 133 places in 181 ms of which 4 ms to minimize.
[2024-05-21 15:39:14] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 4 ms to minimize.
[2024-05-21 15:39:14] [INFO ] Deduced a trap composed of 30 places in 194 ms of which 4 ms to minimize.
[2024-05-21 15:39:14] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 4 ms to minimize.
[2024-05-21 15:39:15] [INFO ] Deduced a trap composed of 57 places in 183 ms of which 3 ms to minimize.
[2024-05-21 15:39:15] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 3 ms to minimize.
[2024-05-21 15:39:15] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 4 ms to minimize.
[2024-05-21 15:39:15] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 3 ms to minimize.
[2024-05-21 15:39:15] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 4 ms to minimize.
[2024-05-21 15:39:16] [INFO ] Deduced a trap composed of 116 places in 179 ms of which 3 ms to minimize.
[2024-05-21 15:39:16] [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:39:16] [INFO ] [Real]Absence check using 55 positive place invariants in 31 ms returned sat
[2024-05-21 15:39:16] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2024-05-21 15:39:16] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2024-05-21 15:39:16] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
[2024-05-21 15:39:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:16] [INFO ] [Nat]Absence check using 55 positive place invariants in 24 ms returned sat
[2024-05-21 15:39:16] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2024-05-21 15:39:17] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 3 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 3 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 3 ms to minimize.
[2024-05-21 15:39:17] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 4 ms to minimize.
[2024-05-21 15:39:18] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 3 ms to minimize.
[2024-05-21 15:39:18] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:39:18] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:39:18] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 5 ms to minimize.
[2024-05-21 15:39:18] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 2 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 3 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 3 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 4 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 115 places in 162 ms of which 4 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 125 places in 163 ms of which 3 ms to minimize.
[2024-05-21 15:39:19] [INFO ] Deduced a trap composed of 127 places in 150 ms of which 3 ms to minimize.
[2024-05-21 15:39:20] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 4 ms to minimize.
[2024-05-21 15:39:20] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 3 ms to minimize.
[2024-05-21 15:39:20] [INFO ] Deduced a trap composed of 140 places in 177 ms of which 3 ms to minimize.
[2024-05-21 15:39:20] [INFO ] Deduced a trap composed of 148 places in 176 ms of which 4 ms to minimize.
[2024-05-21 15:39:20] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 4 ms to minimize.
[2024-05-21 15:39:21] [INFO ] Deduced a trap composed of 133 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:39:21] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:39:21] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:39:21] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 3 ms to minimize.
[2024-05-21 15:39:21] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 2 ms to minimize.
[2024-05-21 15:39:21] [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:39:21] [INFO ] [Real]Absence check using 55 positive place invariants in 18 ms returned sat
[2024-05-21 15:39:21] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 10 ms returned sat
[2024-05-21 15:39:22] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-21 15:39:22] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 4 ms to minimize.
[2024-05-21 15:39:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:22] [INFO ] [Nat]Absence check using 55 positive place invariants in 19 ms returned sat
[2024-05-21 15:39:22] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 18 ms returned sat
[2024-05-21 15:39:22] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-21 15:39:22] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 4 ms to minimize.
[2024-05-21 15:39:23] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 4 ms to minimize.
[2024-05-21 15:39:23] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 4 ms to minimize.
[2024-05-21 15:39:23] [INFO ] Deduced a trap composed of 23 places in 207 ms of which 6 ms to minimize.
[2024-05-21 15:39:23] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 4 ms to minimize.
[2024-05-21 15:39:23] [INFO ] Deduced a trap composed of 26 places in 179 ms of which 3 ms to minimize.
[2024-05-21 15:39:24] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 3 ms to minimize.
[2024-05-21 15:39:24] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 3 ms to minimize.
[2024-05-21 15:39:24] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 3 ms to minimize.
[2024-05-21 15:39:24] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 3 ms to minimize.
[2024-05-21 15:39:24] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 3 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 135 places in 174 ms of which 4 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 3 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 3 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 4 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 3 ms to minimize.
[2024-05-21 15:39:25] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 141 places in 152 ms of which 3 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:39:26] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 4 ms to minimize.
[2024-05-21 15:39:27] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 3 ms to minimize.
[2024-05-21 15:39:27] [INFO ] Deduced a trap composed of 30 places in 148 ms of which 3 ms to minimize.
[2024-05-21 15:39:27] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 3 ms to minimize.
[2024-05-21 15:39:27] [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: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:39:27] [INFO ] [Real]Absence check using 55 positive place invariants in 18 ms returned sat
[2024-05-21 15:39:27] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 11 ms returned sat
[2024-05-21 15:39:27] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-21 15:39:27] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 3 ms to minimize.
[2024-05-21 15:39:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:28] [INFO ] [Nat]Absence check using 55 positive place invariants in 23 ms returned sat
[2024-05-21 15:39:28] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2024-05-21 15:39:28] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2024-05-21 15:39:28] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 4 ms to minimize.
[2024-05-21 15:39:28] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 3 ms to minimize.
[2024-05-21 15:39:28] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 4 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 3 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 4 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 3 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 119 places in 200 ms of which 3 ms to minimize.
[2024-05-21 15:39:29] [INFO ] Deduced a trap composed of 137 places in 178 ms of which 3 ms to minimize.
[2024-05-21 15:39:30] [INFO ] Deduced a trap composed of 122 places in 186 ms of which 4 ms to minimize.
[2024-05-21 15:39:30] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 3 ms to minimize.
[2024-05-21 15:39:30] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 4 ms to minimize.
[2024-05-21 15:39:30] [INFO ] Deduced a trap composed of 134 places in 178 ms of which 4 ms to minimize.
[2024-05-21 15:39:31] [INFO ] Deduced a trap composed of 128 places in 186 ms of which 3 ms to minimize.
[2024-05-21 15:39:31] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 4 ms to minimize.
[2024-05-21 15:39:31] [INFO ] Deduced a trap composed of 144 places in 175 ms of which 4 ms to minimize.
[2024-05-21 15:39:31] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 4 ms to minimize.
[2024-05-21 15:39:31] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 4 ms to minimize.
[2024-05-21 15:39:32] [INFO ] Deduced a trap composed of 30 places in 178 ms of which 4 ms to minimize.
[2024-05-21 15:39:32] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 3 ms to minimize.
[2024-05-21 15:39:32] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 4 ms to minimize.
[2024-05-21 15:39:32] [INFO ] Deduced a trap composed of 133 places in 184 ms of which 4 ms to minimize.
[2024-05-21 15:39:32] [INFO ] Deduced a trap composed of 132 places in 142 ms of which 2 ms to minimize.
[2024-05-21 15:39:33] [INFO ] Deduced a trap composed of 126 places in 129 ms of which 3 ms to minimize.
[2024-05-21 15:39:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:39:33] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned sat
[2024-05-21 15:39:33] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2024-05-21 15:39:33] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2024-05-21 15:39:33] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 4 ms to minimize.
[2024-05-21 15:39:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:33] [INFO ] [Nat]Absence check using 55 positive place invariants in 25 ms returned sat
[2024-05-21 15:39:33] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2024-05-21 15:39:34] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-05-21 15:39:34] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 4 ms to minimize.
[2024-05-21 15:39:34] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 4 ms to minimize.
[2024-05-21 15:39:34] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 4 ms to minimize.
[2024-05-21 15:39:34] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 4 ms to minimize.
[2024-05-21 15:39:35] [INFO ] Deduced a trap composed of 29 places in 205 ms of which 4 ms to minimize.
[2024-05-21 15:39:35] [INFO ] Deduced a trap composed of 126 places in 206 ms of which 4 ms to minimize.
[2024-05-21 15:39:35] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 4 ms to minimize.
[2024-05-21 15:39:35] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 3 ms to minimize.
[2024-05-21 15:39:35] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 3 ms to minimize.
[2024-05-21 15:39:36] [INFO ] Deduced a trap composed of 122 places in 186 ms of which 4 ms to minimize.
[2024-05-21 15:39:36] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 4 ms to minimize.
[2024-05-21 15:39:36] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 5 ms to minimize.
[2024-05-21 15:39:36] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 4 ms to minimize.
[2024-05-21 15:39:37] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 4 ms to minimize.
[2024-05-21 15:39:37] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 4 ms to minimize.
[2024-05-21 15:39:37] [INFO ] Deduced a trap composed of 116 places in 183 ms of which 4 ms to minimize.
[2024-05-21 15:39:37] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 3 ms to minimize.
[2024-05-21 15:39:37] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 4 ms to minimize.
[2024-05-21 15:39:37] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:39:38] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 3 ms to minimize.
[2024-05-21 15:39:38] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 3 ms to minimize.
[2024-05-21 15:39:38] [INFO ] Deduced a trap composed of 115 places in 161 ms of which 3 ms to minimize.
[2024-05-21 15:39:38] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 3 ms to minimize.
[2024-05-21 15:39:38] [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: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:39:38] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned sat
[2024-05-21 15:39:38] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2024-05-21 15:39:39] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2024-05-21 15:39:39] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 3 ms to minimize.
[2024-05-21 15:39:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:39] [INFO ] [Nat]Absence check using 55 positive place invariants in 25 ms returned sat
[2024-05-21 15:39:39] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2024-05-21 15:39:39] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2024-05-21 15:39:39] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 4 ms to minimize.
[2024-05-21 15:39:40] [INFO ] Deduced a trap composed of 132 places in 205 ms of which 3 ms to minimize.
[2024-05-21 15:39:40] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 3 ms to minimize.
[2024-05-21 15:39:40] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 4 ms to minimize.
[2024-05-21 15:39:40] [INFO ] Deduced a trap composed of 134 places in 207 ms of which 5 ms to minimize.
[2024-05-21 15:39:40] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 3 ms to minimize.
[2024-05-21 15:39:41] [INFO ] Deduced a trap composed of 128 places in 175 ms of which 4 ms to minimize.
[2024-05-21 15:39:41] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 4 ms to minimize.
[2024-05-21 15:39:41] [INFO ] Deduced a trap composed of 136 places in 211 ms of which 4 ms to minimize.
[2024-05-21 15:39:41] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 4 ms to minimize.
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 3 ms to minimize.
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 4 ms to minimize.
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 3 ms to minimize.
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 4 ms to minimize.
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 4 ms to minimize.
[2024-05-21 15:39:42] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 3 ms to minimize.
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 117 places in 184 ms of which 3 ms to minimize.
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 3 ms to minimize.
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 3 ms to minimize.
[2024-05-21 15:39:43] [INFO ] Deduced a trap composed of 72 places in 183 ms of which 3 ms to minimize.
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 3 ms to minimize.
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 4 ms to minimize.
[2024-05-21 15:39:44] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 4 ms to minimize.
[2024-05-21 15:39:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:39:44] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned sat
[2024-05-21 15:39:44] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 14 ms returned sat
[2024-05-21 15:39:44] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 125 places in 210 ms of which 4 ms to minimize.
[2024-05-21 15:39:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:45] [INFO ] [Nat]Absence check using 55 positive place invariants in 24 ms returned sat
[2024-05-21 15:39:45] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2024-05-21 15:39:45] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 125 places in 195 ms of which 4 ms to minimize.
[2024-05-21 15:39:45] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 4 ms to minimize.
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 4 ms to minimize.
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 4 ms to minimize.
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 4 ms to minimize.
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 4 ms to minimize.
[2024-05-21 15:39:46] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 4 ms to minimize.
[2024-05-21 15:39:47] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 4 ms to minimize.
[2024-05-21 15:39:47] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
[2024-05-21 15:39:47] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 4 ms to minimize.
[2024-05-21 15:39:47] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 4 ms to minimize.
[2024-05-21 15:39:47] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 5 ms to minimize.
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 3 ms to minimize.
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 3 ms to minimize.
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 3 ms to minimize.
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 137 places in 196 ms of which 3 ms to minimize.
[2024-05-21 15:39:48] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 3 ms to minimize.
[2024-05-21 15:39:49] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 3 ms to minimize.
[2024-05-21 15:39:49] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 3 ms to minimize.
[2024-05-21 15:39:49] [INFO ] Deduced a trap composed of 123 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:39:49] [INFO ] Deduced a trap composed of 133 places in 151 ms of which 3 ms to minimize.
[2024-05-21 15:39:49] [INFO ] Deduced a trap composed of 137 places in 159 ms of which 3 ms to minimize.
[2024-05-21 15:39:50] [INFO ] Deduced a trap composed of 126 places in 147 ms of which 3 ms to minimize.
[2024-05-21 15:39:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:39:50] [INFO ] [Real]Absence check using 55 positive place invariants in 19 ms returned sat
[2024-05-21 15:39:50] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned sat
[2024-05-21 15:39:50] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-21 15:39:50] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 7 ms to minimize.
[2024-05-21 15:39:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:39:50] [INFO ] [Nat]Absence check using 55 positive place invariants in 24 ms returned sat
[2024-05-21 15:39:50] [INFO ] [Nat]Absence check using 55 positive and 43 generalized place invariants in 13 ms returned sat
[2024-05-21 15:39:51] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-05-21 15:39:51] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 4 ms to minimize.
[2024-05-21 15:39:51] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 4 ms to minimize.
[2024-05-21 15:39:51] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 5 ms to minimize.
[2024-05-21 15:39:51] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 3 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 4 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 4 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 3 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 3 ms to minimize.
[2024-05-21 15:39:52] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 4 ms to minimize.
[2024-05-21 15:39:53] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 4 ms to minimize.
[2024-05-21 15:39:53] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 4 ms to minimize.
[2024-05-21 15:39:53] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 3 ms to minimize.
[2024-05-21 15:39:53] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 3 ms to minimize.
[2024-05-21 15:39:54] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 4 ms to minimize.
[2024-05-21 15:39:54] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 3 ms to minimize.
[2024-05-21 15:39:54] [INFO ] Deduced a trap composed of 113 places in 171 ms of which 4 ms to minimize.
[2024-05-21 15:39:54] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 4 ms to minimize.
[2024-05-21 15:39:54] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 3 ms to minimize.
[2024-05-21 15:39:54] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 3 ms to minimize.
[2024-05-21 15:39:55] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 3 ms to minimize.
[2024-05-21 15:39:55] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 3 ms to minimize.
[2024-05-21 15:39:55] [INFO ] Deduced a trap composed of 111 places in 184 ms of which 4 ms to minimize.
[2024-05-21 15:39:55] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 4 ms to minimize.
[2024-05-21 15:39:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 319 edges and 582 vertex of which 7 / 582 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1178 edges and 576 vertex of which 572 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 123 place count 572 transition count 391
Reduce places removed 121 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 124 rules applied. Total rules applied 247 place count 451 transition count 388
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 250 place count 448 transition count 388
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 250 place count 448 transition count 300
Deduced a syphon composed of 88 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 193 rules applied. Total rules applied 443 place count 343 transition count 300
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 511 place count 275 transition count 232
Iterating global reduction 3 with 68 rules applied. Total rules applied 579 place count 275 transition count 232
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 579 place count 275 transition count 226
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 592 place count 268 transition count 226
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 185 rules applied. Total rules applied 777 place count 174 transition count 135
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 779 place count 173 transition count 139
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 781 place count 173 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 783 place count 171 transition count 137
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 784 place count 171 transition count 137
Applied a total of 784 rules in 164 ms. Remains 171 /582 variables (removed 411) and now considering 137/521 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 171/582 places, 137/521 transitions.
// Phase 1: matrix 137 rows 171 cols
[2024-05-21 15:39:56] [INFO ] Computed 74 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA BusinessProcesses-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (32910 resets) in 2966 ms. (337 steps per ms)
FORMULA BusinessProcesses-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (17042 resets) in 2043 ms. (489 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 15:40:01] [INFO ] Invariant cache hit.
[2024-05-21 15:40:01] [INFO ] [Real]Absence check using 51 positive place invariants in 12 ms returned sat
[2024-05-21 15:40:01] [INFO ] [Real]Absence check using 51 positive and 23 generalized place invariants in 7 ms returned sat
[2024-05-21 15:40:01] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-21 15:40:01] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-21 15:40:01] [INFO ] [Real]Added 13 Read/Feed constraints in 9 ms returned sat
[2024-05-21 15:40:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:40:01] [INFO ] [Nat]Absence check using 51 positive place invariants in 9 ms returned sat
[2024-05-21 15:40:01] [INFO ] [Nat]Absence check using 51 positive and 23 generalized place invariants in 6 ms returned sat
[2024-05-21 15:40:01] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-21 15:40:01] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2024-05-21 15:40:01] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 15:40:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-21 15:40:01] [INFO ] Computed and/alt/rep : 88/420/88 causal constraints (skipped 47 transitions) in 15 ms.
[2024-05-21 15:40:01] [INFO ] Added : 24 causal constraints over 5 iterations in 112 ms. Result :sat
Minimization took 130 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 171 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p445) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 136/136 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 171 transition count 134
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 169 transition count 134
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 169 transition count 131
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 11 place count 165 transition count 131
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 161 transition count 127
Applied a total of 19 rules in 27 ms. Remains 161 /171 variables (removed 10) and now considering 127/136 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 161/171 places, 127/136 transitions.
// Phase 1: matrix 127 rows 161 cols
[2024-05-21 15:40:01] [INFO ] Computed 73 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (35998 resets) in 2860 ms. (349 steps per ms)
BEST_FIRST walk for 1000001 steps (19512 resets) in 1730 ms. (577 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 15:40:06] [INFO ] Invariant cache hit.
[2024-05-21 15:40:06] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2024-05-21 15:40:06] [INFO ] [Real]Absence check using 52 positive and 21 generalized place invariants in 7 ms returned sat
[2024-05-21 15:40:06] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-21 15:40:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-21 15:40:06] [INFO ] [Real]Added 13 Read/Feed constraints in 4 ms returned sat
[2024-05-21 15:40:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 15:40:06] [INFO ] [Nat]Absence check using 52 positive place invariants in 11 ms returned sat
[2024-05-21 15:40:06] [INFO ] [Nat]Absence check using 52 positive and 21 generalized place invariants in 7 ms returned sat
[2024-05-21 15:40:06] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-21 15:40:06] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2024-05-21 15:40:06] [INFO ] Computed and/alt/rep : 78/403/78 causal constraints (skipped 47 transitions) in 14 ms.
[2024-05-21 15:40:06] [INFO ] Added : 22 causal constraints over 5 iterations in 92 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 127/127 transitions.
Applied a total of 0 rules in 9 ms. Remains 161 /161 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 161/161 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 127/127 transitions.
Applied a total of 0 rules in 9 ms. Remains 161 /161 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-21 15:40:07] [INFO ] Invariant cache hit.
[2024-05-21 15:40:07] [INFO ] Implicit Places using invariants in 175 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
[2024-05-21 15:40:07] [INFO ] Actually due to overlaps returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 43, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 179 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 141/161 places, 127/127 transitions.
Applied a total of 0 rules in 9 ms. Remains 141 /141 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 201 ms. Remains : 141/161 places, 127/127 transitions.
// Phase 1: matrix 127 rows 141 cols
[2024-05-21 15:40:07] [INFO ] Computed 53 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA BusinessProcesses-PT-12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (36007 resets) in 1674 ms. (597 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 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 65385 ms.
ITS solved all properties within timeout
BK_STOP 1716306008979
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-12"
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-12, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398400541"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-12.tgz
mv BusinessProcesses-PT-12 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;