Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 189K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678503734650

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:02:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:02:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:02:16] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-11 03:02:16] [INFO ] Transformed 772 places.
[2023-03-11 03:02:16] [INFO ] Transformed 685 transitions.
[2023-03-11 03:02:16] [INFO ] Found NUPN structural information;
[2023-03-11 03:02:16] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 20 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 55 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 15) seen :3
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 670 rows 757 cols
[2023-03-11 03:02:17] [INFO ] Computed 125 place invariants in 24 ms
[2023-03-11 03:02:18] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-11 03:02:18] [INFO ] [Nat]Absence check using 78 positive place invariants in 24 ms returned sat
[2023-03-11 03:02:18] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2023-03-11 03:02:19] [INFO ] After 1132ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2023-03-11 03:02:20] [INFO ] Deduced a trap composed of 17 places in 287 ms of which 30 ms to minimize.
[2023-03-11 03:02:20] [INFO ] Deduced a trap composed of 23 places in 239 ms of which 1 ms to minimize.
[2023-03-11 03:02:20] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 2 ms to minimize.
[2023-03-11 03:02:20] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 1 ms to minimize.
[2023-03-11 03:02:21] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 1 ms to minimize.
[2023-03-11 03:02:21] [INFO ] Deduced a trap composed of 154 places in 240 ms of which 1 ms to minimize.
[2023-03-11 03:02:21] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 1 ms to minimize.
[2023-03-11 03:02:21] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 2 ms to minimize.
[2023-03-11 03:02:22] [INFO ] Deduced a trap composed of 142 places in 187 ms of which 1 ms to minimize.
[2023-03-11 03:02:22] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2023-03-11 03:02:22] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 0 ms to minimize.
[2023-03-11 03:02:22] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 0 ms to minimize.
[2023-03-11 03:02:23] [INFO ] Deduced a trap composed of 36 places in 198 ms of which 1 ms to minimize.
[2023-03-11 03:02:23] [INFO ] Deduced a trap composed of 150 places in 189 ms of which 1 ms to minimize.
[2023-03-11 03:02:23] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 0 ms to minimize.
[2023-03-11 03:02:23] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2023-03-11 03:02:23] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3978 ms
[2023-03-11 03:02:24] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 0 ms to minimize.
[2023-03-11 03:02:24] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 1 ms to minimize.
[2023-03-11 03:02:24] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 1 ms to minimize.
[2023-03-11 03:02:24] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 0 ms to minimize.
[2023-03-11 03:02:25] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 0 ms to minimize.
[2023-03-11 03:02:25] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 0 ms to minimize.
[2023-03-11 03:02:25] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2023-03-11 03:02:25] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2023-03-11 03:02:25] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 0 ms to minimize.
[2023-03-11 03:02:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1257 ms
[2023-03-11 03:02:26] [INFO ] Deduced a trap composed of 169 places in 232 ms of which 0 ms to minimize.
[2023-03-11 03:02:26] [INFO ] Deduced a trap composed of 174 places in 150 ms of which 0 ms to minimize.
[2023-03-11 03:02:26] [INFO ] Deduced a trap composed of 174 places in 142 ms of which 1 ms to minimize.
[2023-03-11 03:02:26] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 1 ms to minimize.
[2023-03-11 03:02:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 850 ms
[2023-03-11 03:02:26] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2023-03-11 03:02:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-11 03:02:27] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 1 ms to minimize.
[2023-03-11 03:02:27] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 2 ms to minimize.
[2023-03-11 03:02:27] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 1 ms to minimize.
[2023-03-11 03:02:28] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 6 ms to minimize.
[2023-03-11 03:02:28] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 1 ms to minimize.
[2023-03-11 03:02:28] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 1 ms to minimize.
[2023-03-11 03:02:28] [INFO ] Deduced a trap composed of 172 places in 142 ms of which 1 ms to minimize.
[2023-03-11 03:02:28] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 0 ms to minimize.
[2023-03-11 03:02:29] [INFO ] Deduced a trap composed of 169 places in 133 ms of which 1 ms to minimize.
[2023-03-11 03:02:29] [INFO ] Deduced a trap composed of 166 places in 138 ms of which 2 ms to minimize.
[2023-03-11 03:02:29] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 0 ms to minimize.
[2023-03-11 03:02:29] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 0 ms to minimize.
[2023-03-11 03:02:29] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 1 ms to minimize.
[2023-03-11 03:02:30] [INFO ] Deduced a trap composed of 164 places in 154 ms of which 0 ms to minimize.
[2023-03-11 03:02:30] [INFO ] Deduced a trap composed of 159 places in 204 ms of which 1 ms to minimize.
[2023-03-11 03:02:30] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 1 ms to minimize.
[2023-03-11 03:02:30] [INFO ] Deduced a trap composed of 178 places in 191 ms of which 0 ms to minimize.
[2023-03-11 03:02:30] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 1 ms to minimize.
[2023-03-11 03:02:31] [INFO ] Deduced a trap composed of 169 places in 188 ms of which 1 ms to minimize.
[2023-03-11 03:02:31] [INFO ] Deduced a trap composed of 186 places in 193 ms of which 1 ms to minimize.
[2023-03-11 03:02:31] [INFO ] Deduced a trap composed of 169 places in 192 ms of which 2 ms to minimize.
[2023-03-11 03:02:31] [INFO ] Deduced a trap composed of 173 places in 184 ms of which 0 ms to minimize.
[2023-03-11 03:02:32] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 2 ms to minimize.
[2023-03-11 03:02:32] [INFO ] Deduced a trap composed of 161 places in 162 ms of which 1 ms to minimize.
[2023-03-11 03:02:32] [INFO ] Deduced a trap composed of 159 places in 162 ms of which 0 ms to minimize.
[2023-03-11 03:02:32] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 1 ms to minimize.
[2023-03-11 03:02:32] [INFO ] Deduced a trap composed of 159 places in 161 ms of which 1 ms to minimize.
[2023-03-11 03:02:33] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 1 ms to minimize.
[2023-03-11 03:02:33] [INFO ] Deduced a trap composed of 172 places in 183 ms of which 1 ms to minimize.
[2023-03-11 03:02:33] [INFO ] Deduced a trap composed of 167 places in 159 ms of which 1 ms to minimize.
[2023-03-11 03:02:33] [INFO ] Deduced a trap composed of 174 places in 170 ms of which 1 ms to minimize.
[2023-03-11 03:02:33] [INFO ] Deduced a trap composed of 167 places in 189 ms of which 1 ms to minimize.
[2023-03-11 03:02:34] [INFO ] Deduced a trap composed of 163 places in 164 ms of which 1 ms to minimize.
[2023-03-11 03:02:34] [INFO ] Deduced a trap composed of 167 places in 165 ms of which 0 ms to minimize.
[2023-03-11 03:02:34] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 1 ms to minimize.
[2023-03-11 03:02:34] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 2 ms to minimize.
[2023-03-11 03:02:35] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 0 ms to minimize.
[2023-03-11 03:02:35] [INFO ] Deduced a trap composed of 164 places in 187 ms of which 1 ms to minimize.
[2023-03-11 03:02:35] [INFO ] Deduced a trap composed of 163 places in 156 ms of which 0 ms to minimize.
[2023-03-11 03:02:35] [INFO ] Deduced a trap composed of 179 places in 231 ms of which 0 ms to minimize.
[2023-03-11 03:02:35] [INFO ] Deduced a trap composed of 167 places in 140 ms of which 1 ms to minimize.
[2023-03-11 03:02:36] [INFO ] Deduced a trap composed of 169 places in 190 ms of which 1 ms to minimize.
[2023-03-11 03:02:36] [INFO ] Deduced a trap composed of 168 places in 180 ms of which 1 ms to minimize.
[2023-03-11 03:02:36] [INFO ] Deduced a trap composed of 167 places in 173 ms of which 1 ms to minimize.
[2023-03-11 03:02:36] [INFO ] Deduced a trap composed of 159 places in 171 ms of which 0 ms to minimize.
[2023-03-11 03:02:36] [INFO ] Deduced a trap composed of 158 places in 186 ms of which 1 ms to minimize.
[2023-03-11 03:02:37] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 1 ms to minimize.
[2023-03-11 03:02:37] [INFO ] Deduced a trap composed of 158 places in 164 ms of which 0 ms to minimize.
[2023-03-11 03:02:37] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 1 ms to minimize.
[2023-03-11 03:02:38] [INFO ] Deduced a trap composed of 154 places in 162 ms of which 1 ms to minimize.
[2023-03-11 03:02:38] [INFO ] Deduced a trap composed of 159 places in 198 ms of which 1 ms to minimize.
[2023-03-11 03:02:38] [INFO ] Deduced a trap composed of 157 places in 171 ms of which 1 ms to minimize.
[2023-03-11 03:02:38] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 1 ms to minimize.
[2023-03-11 03:02:38] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 1 ms to minimize.
[2023-03-11 03:02:39] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 1 ms to minimize.
[2023-03-11 03:02:39] [INFO ] Deduced a trap composed of 16 places in 203 ms of which 1 ms to minimize.
[2023-03-11 03:02:39] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 1 ms to minimize.
[2023-03-11 03:02:39] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 0 ms to minimize.
[2023-03-11 03:02:39] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 0 ms to minimize.
[2023-03-11 03:02:39] [INFO ] Deduced a trap composed of 163 places in 173 ms of which 1 ms to minimize.
[2023-03-11 03:02:40] [INFO ] Deduced a trap composed of 174 places in 159 ms of which 0 ms to minimize.
[2023-03-11 03:02:40] [INFO ] Deduced a trap composed of 158 places in 161 ms of which 1 ms to minimize.
[2023-03-11 03:02:40] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 1 ms to minimize.
[2023-03-11 03:02:40] [INFO ] Deduced a trap composed of 166 places in 123 ms of which 0 ms to minimize.
[2023-03-11 03:02:40] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 0 ms to minimize.
[2023-03-11 03:02:41] [INFO ] Deduced a trap composed of 167 places in 167 ms of which 1 ms to minimize.
[2023-03-11 03:02:41] [INFO ] Deduced a trap composed of 162 places in 156 ms of which 1 ms to minimize.
[2023-03-11 03:02:41] [INFO ] Deduced a trap composed of 157 places in 203 ms of which 1 ms to minimize.
[2023-03-11 03:02:41] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 1 ms to minimize.
[2023-03-11 03:02:42] [INFO ] Deduced a trap composed of 165 places in 206 ms of which 0 ms to minimize.
[2023-03-11 03:02:42] [INFO ] Deduced a trap composed of 167 places in 140 ms of which 0 ms to minimize.
[2023-03-11 03:02:42] [INFO ] Deduced a trap composed of 159 places in 135 ms of which 1 ms to minimize.
[2023-03-11 03:02:42] [INFO ] Deduced a trap composed of 157 places in 207 ms of which 1 ms to minimize.
[2023-03-11 03:02:42] [INFO ] Deduced a trap composed of 162 places in 154 ms of which 0 ms to minimize.
[2023-03-11 03:02:43] [INFO ] Deduced a trap composed of 156 places in 183 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 03:02:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:02:43] [INFO ] After 25091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 10 different solutions.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 189 ms.
Support contains 103 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (complete) has 1520 edges and 757 vertex of which 748 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 748 transition count 586
Reduce places removed 83 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 92 rules applied. Total rules applied 176 place count 665 transition count 577
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 185 place count 656 transition count 577
Performed 127 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 127 Pre rules applied. Total rules applied 185 place count 656 transition count 450
Deduced a syphon composed of 127 places in 4 ms
Ensure Unique test removed 11 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 265 rules applied. Total rules applied 450 place count 518 transition count 450
Discarding 82 places :
Symmetric choice reduction at 3 with 82 rule applications. Total rules 532 place count 436 transition count 368
Iterating global reduction 3 with 82 rules applied. Total rules applied 614 place count 436 transition count 368
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 614 place count 436 transition count 365
Deduced a syphon composed of 3 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 621 place count 432 transition count 365
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 811 place count 336 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 812 place count 336 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 814 place count 335 transition count 273
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 815 place count 335 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 816 place count 334 transition count 272
Applied a total of 816 rules in 195 ms. Remains 334 /757 variables (removed 423) and now considering 272/670 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 334/757 places, 272/670 transitions.
Incomplete random walk after 10000 steps, including 228 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 726153 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{2=1, 4=1, 5=1, 6=1}
Probabilistic random walk after 726153 steps, saw 118858 distinct states, run finished after 3002 ms. (steps per millisecond=241 ) properties seen :4
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 272 rows 334 cols
[2023-03-11 03:02:47] [INFO ] Computed 103 place invariants in 7 ms
[2023-03-11 03:02:47] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:02:47] [INFO ] [Nat]Absence check using 70 positive place invariants in 9 ms returned sat
[2023-03-11 03:02:47] [INFO ] [Nat]Absence check using 70 positive and 33 generalized place invariants in 7 ms returned sat
[2023-03-11 03:02:47] [INFO ] After 406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:02:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 03:02:48] [INFO ] After 365ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:02:48] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2023-03-11 03:02:48] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2023-03-11 03:02:48] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2023-03-11 03:02:48] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2023-03-11 03:02:48] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2023-03-11 03:02:48] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2023-03-11 03:02:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 641 ms
[2023-03-11 03:02:49] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-11 03:02:49] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-03-11 03:02:49] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2023-03-11 03:02:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 238 ms
[2023-03-11 03:02:49] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2023-03-11 03:02:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-11 03:02:49] [INFO ] After 1718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 449 ms.
[2023-03-11 03:02:49] [INFO ] After 2654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 35 ms.
Support contains 86 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 272/272 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 334 transition count 265
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 325 transition count 265
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 324 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 324 transition count 264
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 34 place count 316 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 315 transition count 255
Applied a total of 35 rules in 65 ms. Remains 315 /334 variables (removed 19) and now considering 255/272 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 315/334 places, 255/272 transitions.
Incomplete random walk after 10000 steps, including 264 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 659306 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 659306 steps, saw 111942 distinct states, run finished after 3004 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 255 rows 315 cols
[2023-03-11 03:02:53] [INFO ] Computed 101 place invariants in 12 ms
[2023-03-11 03:02:53] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:02:53] [INFO ] [Nat]Absence check using 70 positive place invariants in 9 ms returned sat
[2023-03-11 03:02:53] [INFO ] [Nat]Absence check using 70 positive and 31 generalized place invariants in 7 ms returned sat
[2023-03-11 03:02:53] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:02:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 03:02:54] [INFO ] After 211ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:02:54] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 1 ms to minimize.
[2023-03-11 03:02:54] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2023-03-11 03:02:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2023-03-11 03:02:54] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2023-03-11 03:02:54] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2023-03-11 03:02:54] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2023-03-11 03:02:54] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2023-03-11 03:02:54] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2023-03-11 03:02:54] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2023-03-11 03:02:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 350 ms
[2023-03-11 03:02:55] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2023-03-11 03:02:55] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-03-11 03:02:55] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2023-03-11 03:02:55] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2023-03-11 03:02:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 222 ms
[2023-03-11 03:02:55] [INFO ] After 1291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 303 ms.
[2023-03-11 03:02:55] [INFO ] After 1939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 29 ms.
Support contains 63 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 255/255 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 315 transition count 254
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 314 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 313 transition count 253
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 4 place count 313 transition count 249
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 12 place count 309 transition count 249
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 14 place count 307 transition count 247
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 307 transition count 247
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 50 place count 290 transition count 230
Applied a total of 50 rules in 55 ms. Remains 290 /315 variables (removed 25) and now considering 230/255 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 290/315 places, 230/255 transitions.
Incomplete random walk after 10000 steps, including 408 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 86 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1061037 steps, run timeout after 3001 ms. (steps per millisecond=353 ) properties seen :{1=1}
Probabilistic random walk after 1061037 steps, saw 180974 distinct states, run finished after 3001 ms. (steps per millisecond=353 ) properties seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 230 rows 290 cols
[2023-03-11 03:02:58] [INFO ] Computed 101 place invariants in 9 ms
[2023-03-11 03:02:58] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:02:58] [INFO ] [Nat]Absence check using 70 positive place invariants in 8 ms returned sat
[2023-03-11 03:02:58] [INFO ] [Nat]Absence check using 70 positive and 31 generalized place invariants in 8 ms returned sat
[2023-03-11 03:02:59] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:02:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 03:02:59] [INFO ] After 114ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:02:59] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2023-03-11 03:02:59] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2023-03-11 03:02:59] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2023-03-11 03:02:59] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2023-03-11 03:02:59] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2023-03-11 03:02:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 336 ms
[2023-03-11 03:02:59] [INFO ] After 559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-11 03:02:59] [INFO ] After 948ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 45 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 230/230 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 290 transition count 227
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 287 transition count 227
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 6 place count 287 transition count 220
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 23 place count 277 transition count 220
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 275 transition count 218
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 275 transition count 218
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 50 place count 263 transition count 207
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 263 transition count 207
Applied a total of 51 rules in 41 ms. Remains 263 /290 variables (removed 27) and now considering 207/230 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 263/290 places, 207/230 transitions.
Incomplete random walk after 10000 steps, including 416 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1226505 steps, run timeout after 3001 ms. (steps per millisecond=408 ) properties seen :{}
Probabilistic random walk after 1226505 steps, saw 210537 distinct states, run finished after 3001 ms. (steps per millisecond=408 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 207 rows 263 cols
[2023-03-11 03:03:02] [INFO ] Computed 97 place invariants in 10 ms
[2023-03-11 03:03:02] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:03:03] [INFO ] [Nat]Absence check using 71 positive place invariants in 13 ms returned sat
[2023-03-11 03:03:03] [INFO ] [Nat]Absence check using 71 positive and 26 generalized place invariants in 5 ms returned sat
[2023-03-11 03:03:03] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:03:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 03:03:03] [INFO ] After 109ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:03:03] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2023-03-11 03:03:03] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2023-03-11 03:03:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2023-03-11 03:03:03] [INFO ] After 419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-11 03:03:03] [INFO ] After 758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 45 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 207/207 transitions.
Applied a total of 0 rules in 16 ms. Remains 263 /263 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 263/263 places, 207/207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 207/207 transitions.
Applied a total of 0 rules in 14 ms. Remains 263 /263 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2023-03-11 03:03:03] [INFO ] Invariant cache hit.
[2023-03-11 03:03:03] [INFO ] Implicit Places using invariants in 182 ms returned [14, 23, 24, 84, 203, 207, 217]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 185 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 256/263 places, 207/207 transitions.
Applied a total of 0 rules in 8 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 208 ms. Remains : 256/263 places, 207/207 transitions.
Incomplete random walk after 10000 steps, including 430 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1142873 steps, run timeout after 3001 ms. (steps per millisecond=380 ) properties seen :{}
Probabilistic random walk after 1142873 steps, saw 200381 distinct states, run finished after 3003 ms. (steps per millisecond=380 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 207 rows 256 cols
[2023-03-11 03:03:07] [INFO ] Computed 90 place invariants in 8 ms
[2023-03-11 03:03:07] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:03:07] [INFO ] [Nat]Absence check using 69 positive place invariants in 15 ms returned sat
[2023-03-11 03:03:07] [INFO ] [Nat]Absence check using 69 positive and 21 generalized place invariants in 10 ms returned sat
[2023-03-11 03:03:07] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:03:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 03:03:07] [INFO ] After 97ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:03:07] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2023-03-11 03:03:07] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2023-03-11 03:03:07] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2023-03-11 03:03:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 150 ms
[2023-03-11 03:03:07] [INFO ] After 355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-11 03:03:07] [INFO ] After 684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 45 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 207/207 transitions.
Applied a total of 0 rules in 14 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 256/256 places, 207/207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 207/207 transitions.
Applied a total of 0 rules in 12 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2023-03-11 03:03:07] [INFO ] Invariant cache hit.
[2023-03-11 03:03:08] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-11 03:03:08] [INFO ] Invariant cache hit.
[2023-03-11 03:03:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-11 03:03:08] [INFO ] Implicit Places using invariants and state equation in 440 ms returned [93, 165, 168, 170, 172, 173, 175, 177, 179, 181, 184]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 619 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 245/256 places, 207/207 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 245 transition count 203
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 241 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 240 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 240 transition count 202
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 237 transition count 199
Applied a total of 16 rules in 29 ms. Remains 237 /245 variables (removed 8) and now considering 199/207 (removed 8) transitions.
// Phase 1: matrix 199 rows 237 cols
[2023-03-11 03:03:08] [INFO ] Computed 79 place invariants in 2 ms
[2023-03-11 03:03:08] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-11 03:03:08] [INFO ] Invariant cache hit.
[2023-03-11 03:03:08] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-11 03:03:08] [INFO ] Implicit Places using invariants and state equation in 311 ms returned [84, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 468 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 235/256 places, 199/207 transitions.
Applied a total of 0 rules in 7 ms. Remains 235 /235 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1136 ms. Remains : 235/256 places, 199/207 transitions.
Incomplete random walk after 10000 steps, including 430 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1309349 steps, run timeout after 3001 ms. (steps per millisecond=436 ) properties seen :{}
Probabilistic random walk after 1309349 steps, saw 230436 distinct states, run finished after 3001 ms. (steps per millisecond=436 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 199 rows 235 cols
[2023-03-11 03:03:12] [INFO ] Computed 77 place invariants in 8 ms
[2023-03-11 03:03:12] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:03:12] [INFO ] [Nat]Absence check using 57 positive place invariants in 11 ms returned sat
[2023-03-11 03:03:12] [INFO ] [Nat]Absence check using 57 positive and 20 generalized place invariants in 5 ms returned sat
[2023-03-11 03:03:12] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:03:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-11 03:03:12] [INFO ] After 70ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:03:12] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2023-03-11 03:03:12] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2023-03-11 03:03:12] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2023-03-11 03:03:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 145 ms
[2023-03-11 03:03:12] [INFO ] After 293ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-11 03:03:12] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 45 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 199/199 transitions.
Applied a total of 0 rules in 13 ms. Remains 235 /235 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 235/235 places, 199/199 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 199/199 transitions.
Applied a total of 0 rules in 11 ms. Remains 235 /235 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-11 03:03:12] [INFO ] Invariant cache hit.
[2023-03-11 03:03:12] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-11 03:03:12] [INFO ] Invariant cache hit.
[2023-03-11 03:03:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-11 03:03:13] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-11 03:03:13] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-11 03:03:13] [INFO ] Invariant cache hit.
[2023-03-11 03:03:13] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 615 ms. Remains : 235/235 places, 199/199 transitions.
Graph (complete) has 758 edges and 235 vertex of which 232 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 231 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 231 transition count 198
Applied a total of 3 rules in 13 ms. Remains 231 /235 variables (removed 4) and now considering 198/199 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 198 rows 231 cols
[2023-03-11 03:03:13] [INFO ] Computed 74 place invariants in 3 ms
[2023-03-11 03:03:13] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:03:13] [INFO ] [Nat]Absence check using 56 positive place invariants in 10 ms returned sat
[2023-03-11 03:03:13] [INFO ] [Nat]Absence check using 56 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-11 03:03:13] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:03:13] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2023-03-11 03:03:13] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2023-03-11 03:03:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2023-03-11 03:03:13] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-11 03:03:13] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:03:13] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-11 03:03:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 235 places, 199 transitions and 937 arcs took 2 ms.
[2023-03-11 03:03:13] [INFO ] Flatten gal took : 44 ms
Total runtime 57769 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-19
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
ReachabilityFireability

FORMULA BusinessProcesses-PT-19-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678503794234

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 8 (type EXCL) for 0 BusinessProcesses-PT-19-ReachabilityFireability-05
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 BusinessProcesses-PT-19-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 BusinessProcesses-PT-19-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 7 (type SRCH) for 0 BusinessProcesses-PT-19-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type SRCH) for BusinessProcesses-PT-19-ReachabilityFireability-05
lola: result : true
lola: markings : 110
lola: fired transitions : 109
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 4 (type FNDP) for BusinessProcesses-PT-19-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 5 (type EQUN) for BusinessProcesses-PT-19-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 8 (type EXCL) for BusinessProcesses-PT-19-ReachabilityFireability-05 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-19-ReachabilityFireability-05: AG false tandem / insertion


Time elapsed: 0 secs. Pages in use: 2

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-19"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-19.tgz
mv BusinessProcesses-PT-19 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;