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.r042-tajo-167813695900567.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 marciexred
Input is BusinessProcesses-PT-15, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695900567
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 25 16:47 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 157K 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-15-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678733701901

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:55:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 18:55:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:55:03] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-13 18:55:03] [INFO ] Transformed 630 places.
[2023-03-13 18:55:03] [INFO ] Transformed 566 transitions.
[2023-03-13 18:55:03] [INFO ] Found NUPN structural information;
[2023-03-13 18:55:03] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 69 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 15) seen :6
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 562 rows 626 cols
[2023-03-13 18:55:05] [INFO ] Computed 102 place invariants in 27 ms
[2023-03-13 18:55:05] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 18:55:05] [INFO ] [Nat]Absence check using 61 positive place invariants in 23 ms returned sat
[2023-03-13 18:55:05] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 15 ms returned sat
[2023-03-13 18:55:07] [INFO ] After 1295ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-13 18:55:07] [INFO ] Deduced a trap composed of 14 places in 261 ms of which 7 ms to minimize.
[2023-03-13 18:55:07] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 1 ms to minimize.
[2023-03-13 18:55:08] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 2 ms to minimize.
[2023-03-13 18:55:08] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 3 ms to minimize.
[2023-03-13 18:55:08] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 1 ms to minimize.
[2023-03-13 18:55:08] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2023-03-13 18:55:08] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 1 ms to minimize.
[2023-03-13 18:55:09] [INFO ] Deduced a trap composed of 20 places in 312 ms of which 3 ms to minimize.
[2023-03-13 18:55:09] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 1 ms to minimize.
[2023-03-13 18:55:09] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 1 ms to minimize.
[2023-03-13 18:55:09] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 1 ms to minimize.
[2023-03-13 18:55:10] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 1 ms to minimize.
[2023-03-13 18:55:10] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 0 ms to minimize.
[2023-03-13 18:55:10] [INFO ] Deduced a trap composed of 18 places in 229 ms of which 1 ms to minimize.
[2023-03-13 18:55:10] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 1 ms to minimize.
[2023-03-13 18:55:11] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2023-03-13 18:55:11] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 1 ms to minimize.
[2023-03-13 18:55:11] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 1 ms to minimize.
[2023-03-13 18:55:11] [INFO ] Deduced a trap composed of 113 places in 196 ms of which 1 ms to minimize.
[2023-03-13 18:55:11] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 0 ms to minimize.
[2023-03-13 18:55:12] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 1 ms to minimize.
[2023-03-13 18:55:12] [INFO ] Deduced a trap composed of 133 places in 203 ms of which 2 ms to minimize.
[2023-03-13 18:55:12] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 0 ms to minimize.
[2023-03-13 18:55:12] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2023-03-13 18:55:13] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 1 ms to minimize.
[2023-03-13 18:55:13] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 0 ms to minimize.
[2023-03-13 18:55:13] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 1 ms to minimize.
[2023-03-13 18:55:13] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 0 ms to minimize.
[2023-03-13 18:55:13] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2023-03-13 18:55:13] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2023-03-13 18:55:13] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 1 ms to minimize.
[2023-03-13 18:55:14] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 1 ms to minimize.
[2023-03-13 18:55:14] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2023-03-13 18:55:14] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2023-03-13 18:55:14] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 0 ms to minimize.
[2023-03-13 18:55:14] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2023-03-13 18:55:14] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 0 ms to minimize.
[2023-03-13 18:55:14] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 0 ms to minimize.
[2023-03-13 18:55:15] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 7714 ms
[2023-03-13 18:55:15] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2023-03-13 18:55:15] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 2 ms to minimize.
[2023-03-13 18:55:15] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 0 ms to minimize.
[2023-03-13 18:55:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 530 ms
[2023-03-13 18:55:16] [INFO ] Deduced a trap composed of 126 places in 262 ms of which 0 ms to minimize.
[2023-03-13 18:55:16] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 1 ms to minimize.
[2023-03-13 18:55:16] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 1 ms to minimize.
[2023-03-13 18:55:16] [INFO ] Deduced a trap composed of 126 places in 272 ms of which 1 ms to minimize.
[2023-03-13 18:55:17] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 1 ms to minimize.
[2023-03-13 18:55:17] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 1 ms to minimize.
[2023-03-13 18:55:17] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 0 ms to minimize.
[2023-03-13 18:55:17] [INFO ] Deduced a trap composed of 153 places in 253 ms of which 1 ms to minimize.
[2023-03-13 18:55:18] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2023-03-13 18:55:18] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2321 ms
[2023-03-13 18:55:18] [INFO ] Deduced a trap composed of 129 places in 161 ms of which 14 ms to minimize.
[2023-03-13 18:55:18] [INFO ] Deduced a trap composed of 131 places in 167 ms of which 1 ms to minimize.
[2023-03-13 18:55:18] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 1 ms to minimize.
[2023-03-13 18:55:18] [INFO ] Deduced a trap composed of 129 places in 145 ms of which 1 ms to minimize.
[2023-03-13 18:55:19] [INFO ] Deduced a trap composed of 129 places in 175 ms of which 1 ms to minimize.
[2023-03-13 18:55:19] [INFO ] Deduced a trap composed of 143 places in 168 ms of which 2 ms to minimize.
[2023-03-13 18:55:19] [INFO ] Deduced a trap composed of 149 places in 182 ms of which 5 ms to minimize.
[2023-03-13 18:55:19] [INFO ] Deduced a trap composed of 170 places in 170 ms of which 1 ms to minimize.
[2023-03-13 18:55:19] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 1 ms to minimize.
[2023-03-13 18:55:20] [INFO ] Deduced a trap composed of 142 places in 142 ms of which 1 ms to minimize.
[2023-03-13 18:55:20] [INFO ] Deduced a trap composed of 143 places in 172 ms of which 1 ms to minimize.
[2023-03-13 18:55:20] [INFO ] Deduced a trap composed of 152 places in 157 ms of which 0 ms to minimize.
[2023-03-13 18:55:20] [INFO ] Deduced a trap composed of 149 places in 177 ms of which 0 ms to minimize.
[2023-03-13 18:55:20] [INFO ] Deduced a trap composed of 148 places in 142 ms of which 1 ms to minimize.
[2023-03-13 18:55:21] [INFO ] Deduced a trap composed of 154 places in 158 ms of which 1 ms to minimize.
[2023-03-13 18:55:21] [INFO ] Deduced a trap composed of 143 places in 194 ms of which 3 ms to minimize.
[2023-03-13 18:55:21] [INFO ] Deduced a trap composed of 150 places in 171 ms of which 0 ms to minimize.
[2023-03-13 18:55:21] [INFO ] Deduced a trap composed of 149 places in 152 ms of which 2 ms to minimize.
[2023-03-13 18:55:21] [INFO ] Deduced a trap composed of 142 places in 161 ms of which 4 ms to minimize.
[2023-03-13 18:55:22] [INFO ] Deduced a trap composed of 143 places in 169 ms of which 2 ms to minimize.
[2023-03-13 18:55:22] [INFO ] Deduced a trap composed of 151 places in 219 ms of which 1 ms to minimize.
[2023-03-13 18:55:22] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 0 ms to minimize.
[2023-03-13 18:55:22] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 0 ms to minimize.
[2023-03-13 18:55:23] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 0 ms to minimize.
[2023-03-13 18:55:23] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 1 ms to minimize.
[2023-03-13 18:55:23] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 1 ms to minimize.
[2023-03-13 18:55:23] [INFO ] Deduced a trap composed of 142 places in 284 ms of which 1 ms to minimize.
[2023-03-13 18:55:24] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 1 ms to minimize.
[2023-03-13 18:55:24] [INFO ] Deduced a trap composed of 132 places in 152 ms of which 1 ms to minimize.
[2023-03-13 18:55:24] [INFO ] Deduced a trap composed of 129 places in 226 ms of which 1 ms to minimize.
[2023-03-13 18:55:24] [INFO ] Deduced a trap composed of 141 places in 157 ms of which 1 ms to minimize.
[2023-03-13 18:55:25] [INFO ] Deduced a trap composed of 140 places in 208 ms of which 1 ms to minimize.
[2023-03-13 18:55:25] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 0 ms to minimize.
[2023-03-13 18:55:25] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 0 ms to minimize.
[2023-03-13 18:55:25] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 1 ms to minimize.
[2023-03-13 18:55:25] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 0 ms to minimize.
[2023-03-13 18:55:26] [INFO ] Deduced a trap composed of 142 places in 193 ms of which 1 ms to minimize.
[2023-03-13 18:55:26] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 0 ms to minimize.
[2023-03-13 18:55:26] [INFO ] Deduced a trap composed of 140 places in 177 ms of which 1 ms to minimize.
[2023-03-13 18:55:26] [INFO ] Deduced a trap composed of 136 places in 178 ms of which 1 ms to minimize.
[2023-03-13 18:55:26] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 1 ms to minimize.
[2023-03-13 18:55:27] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 0 ms to minimize.
[2023-03-13 18:55:27] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 0 ms to minimize.
[2023-03-13 18:55:27] [INFO ] Deduced a trap composed of 144 places in 211 ms of which 1 ms to minimize.
[2023-03-13 18:55:27] [INFO ] Deduced a trap composed of 141 places in 238 ms of which 1 ms to minimize.
[2023-03-13 18:55:28] [INFO ] Deduced a trap composed of 51 places in 232 ms of which 0 ms to minimize.
[2023-03-13 18:55:28] [INFO ] Deduced a trap composed of 142 places in 200 ms of which 1 ms to minimize.
[2023-03-13 18:55:28] [INFO ] Deduced a trap composed of 142 places in 285 ms of which 1 ms to minimize.
[2023-03-13 18:55:28] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 1 ms to minimize.
[2023-03-13 18:55:29] [INFO ] Deduced a trap composed of 139 places in 184 ms of which 1 ms to minimize.
[2023-03-13 18:55:29] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 1 ms to minimize.
[2023-03-13 18:55:29] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 1 ms to minimize.
[2023-03-13 18:55:29] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 1 ms to minimize.
[2023-03-13 18:55:30] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 1 ms to minimize.
[2023-03-13 18:55:30] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 1 ms to minimize.
[2023-03-13 18:55:30] [INFO ] Deduced a trap composed of 145 places in 202 ms of which 1 ms to minimize.
[2023-03-13 18:55:30] [INFO ] Deduced a trap composed of 142 places in 200 ms of which 1 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-13 18:55:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 18:55:30] [INFO ] After 25166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 174 ms.
Support contains 175 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 562/562 transitions.
Graph (complete) has 1275 edges and 626 vertex of which 623 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.13 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 623 transition count 518
Reduce places removed 44 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 63 rules applied. Total rules applied 108 place count 579 transition count 499
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 127 place count 560 transition count 499
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 127 place count 560 transition count 419
Deduced a syphon composed of 80 places in 15 ms
Ensure Unique test removed 9 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 169 rules applied. Total rules applied 296 place count 471 transition count 419
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 344 place count 423 transition count 371
Iterating global reduction 3 with 48 rules applied. Total rules applied 392 place count 423 transition count 371
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 392 place count 423 transition count 369
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 396 place count 421 transition count 369
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 492 place count 373 transition count 321
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 493 place count 373 transition count 320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 494 place count 372 transition count 320
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 498 place count 372 transition count 320
Applied a total of 498 rules in 248 ms. Remains 372 /626 variables (removed 254) and now considering 320/562 (removed 242) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 372/626 places, 320/562 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 531 ms. (steps per millisecond=18 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 7 properties.
// Phase 1: matrix 320 rows 372 cols
[2023-03-13 18:55:32] [INFO ] Computed 90 place invariants in 6 ms
[2023-03-13 18:55:32] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 18:55:32] [INFO ] [Nat]Absence check using 58 positive place invariants in 18 ms returned sat
[2023-03-13 18:55:32] [INFO ] [Nat]Absence check using 58 positive and 32 generalized place invariants in 12 ms returned sat
[2023-03-13 18:55:33] [INFO ] After 586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 18:55:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 18:55:33] [INFO ] After 492ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 18:55:34] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 1 ms to minimize.
[2023-03-13 18:55:34] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-13 18:55:34] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2023-03-13 18:55:34] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 1 ms to minimize.
[2023-03-13 18:55:34] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 11 ms to minimize.
[2023-03-13 18:55:34] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2023-03-13 18:55:34] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2023-03-13 18:55:34] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2023-03-13 18:55:35] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2023-03-13 18:55:35] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2023-03-13 18:55:35] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2023-03-13 18:55:35] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1331 ms
[2023-03-13 18:55:35] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2023-03-13 18:55:35] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2023-03-13 18:55:35] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2023-03-13 18:55:35] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 0 ms to minimize.
[2023-03-13 18:55:36] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2023-03-13 18:55:36] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2023-03-13 18:55:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 795 ms
[2023-03-13 18:55:36] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2023-03-13 18:55:36] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2023-03-13 18:55:36] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 0 ms to minimize.
[2023-03-13 18:55:36] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 0 ms to minimize.
[2023-03-13 18:55:36] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2023-03-13 18:55:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 584 ms
[2023-03-13 18:55:37] [INFO ] Deduced a trap composed of 69 places in 143 ms of which 1 ms to minimize.
[2023-03-13 18:55:37] [INFO ] Deduced a trap composed of 66 places in 159 ms of which 1 ms to minimize.
[2023-03-13 18:55:37] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 0 ms to minimize.
[2023-03-13 18:55:37] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 0 ms to minimize.
[2023-03-13 18:55:37] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 1 ms to minimize.
[2023-03-13 18:55:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 818 ms
[2023-03-13 18:55:37] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2023-03-13 18:55:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-13 18:55:38] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2023-03-13 18:55:38] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2023-03-13 18:55:38] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2023-03-13 18:55:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 259 ms
[2023-03-13 18:55:38] [INFO ] After 4833ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 359 ms.
[2023-03-13 18:55:38] [INFO ] After 6006ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 80 ms.
Support contains 79 out of 372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 372/372 places, 320/320 transitions.
Graph (complete) has 970 edges and 372 vertex of which 371 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 371 transition count 307
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 359 transition count 304
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 31 place count 356 transition count 304
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 31 place count 356 transition count 275
Deduced a syphon composed of 29 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 94 place count 322 transition count 275
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 112 place count 304 transition count 257
Iterating global reduction 3 with 18 rules applied. Total rules applied 130 place count 304 transition count 257
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 200 place count 269 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 201 place count 269 transition count 221
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 202 place count 269 transition count 221
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 203 place count 268 transition count 220
Applied a total of 203 rules in 69 ms. Remains 268 /372 variables (removed 104) and now considering 220/320 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 268/372 places, 220/320 transitions.
Incomplete random walk after 10000 steps, including 234 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 6) seen :1
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 220 rows 268 cols
[2023-03-13 18:55:39] [INFO ] Computed 85 place invariants in 8 ms
[2023-03-13 18:55:39] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 18:55:39] [INFO ] [Nat]Absence check using 59 positive place invariants in 12 ms returned sat
[2023-03-13 18:55:39] [INFO ] [Nat]Absence check using 59 positive and 26 generalized place invariants in 7 ms returned sat
[2023-03-13 18:55:39] [INFO ] After 464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 18:55:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 18:55:40] [INFO ] After 341ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 18:55:40] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 0 ms to minimize.
[2023-03-13 18:55:40] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2023-03-13 18:55:40] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 0 ms to minimize.
[2023-03-13 18:55:41] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 13 ms to minimize.
[2023-03-13 18:55:41] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 0 ms to minimize.
[2023-03-13 18:55:41] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2023-03-13 18:55:41] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-13 18:55:41] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 1 ms to minimize.
[2023-03-13 18:55:41] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 1 ms to minimize.
[2023-03-13 18:55:41] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2023-03-13 18:55:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1690 ms
[2023-03-13 18:55:42] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2023-03-13 18:55:42] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2023-03-13 18:55:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2023-03-13 18:55:42] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-13 18:55:42] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2023-03-13 18:55:42] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2023-03-13 18:55:42] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2023-03-13 18:55:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 514 ms
[2023-03-13 18:55:43] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 1 ms to minimize.
[2023-03-13 18:55:43] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 0 ms to minimize.
[2023-03-13 18:55:43] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2023-03-13 18:55:43] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 0 ms to minimize.
[2023-03-13 18:55:43] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 1 ms to minimize.
[2023-03-13 18:55:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 659 ms
[2023-03-13 18:55:43] [INFO ] After 3914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 333 ms.
[2023-03-13 18:55:44] [INFO ] After 4842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 34 ms.
Support contains 76 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 220/220 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 268 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 267 transition count 219
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 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 9 place count 263 transition count 216
Applied a total of 9 rules in 43 ms. Remains 263 /268 variables (removed 5) and now considering 216/220 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 263/268 places, 216/220 transitions.
Incomplete random walk after 10000 steps, including 240 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1092856 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :{0=1, 1=1, 2=1}
Probabilistic random walk after 1092856 steps, saw 158222 distinct states, run finished after 3002 ms. (steps per millisecond=364 ) properties seen :3
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 216 rows 263 cols
[2023-03-13 18:55:47] [INFO ] Computed 84 place invariants in 10 ms
[2023-03-13 18:55:47] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:55:47] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-13 18:55:47] [INFO ] [Nat]Absence check using 58 positive and 26 generalized place invariants in 9 ms returned sat
[2023-03-13 18:55:47] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:55:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 18:55:47] [INFO ] After 76ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:55:48] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2023-03-13 18:55:48] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-03-13 18:55:48] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 0 ms to minimize.
[2023-03-13 18:55:48] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 0 ms to minimize.
[2023-03-13 18:55:48] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 0 ms to minimize.
[2023-03-13 18:55:48] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 0 ms to minimize.
[2023-03-13 18:55:48] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 0 ms to minimize.
[2023-03-13 18:55:49] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-13 18:55:49] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 0 ms to minimize.
[2023-03-13 18:55:49] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 1 ms to minimize.
[2023-03-13 18:55:49] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 0 ms to minimize.
[2023-03-13 18:55:49] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2023-03-13 18:55:49] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1651 ms
[2023-03-13 18:55:49] [INFO ] After 1790ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-03-13 18:55:49] [INFO ] After 2203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 35 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 216/216 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 263 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 260 transition count 213
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 6 place count 260 transition count 197
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 35 rules applied. Total rules applied 41 place count 241 transition count 197
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 238 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 238 transition count 194
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 93 place count 214 transition count 172
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 214 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 213 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 212 transition count 170
Applied a total of 96 rules in 64 ms. Remains 212 /263 variables (removed 51) and now considering 170/216 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 212/263 places, 170/216 transitions.
Incomplete random walk after 10000 steps, including 357 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1148961 steps, run timeout after 3001 ms. (steps per millisecond=382 ) properties seen :{}
Probabilistic random walk after 1148961 steps, saw 199972 distinct states, run finished after 3002 ms. (steps per millisecond=382 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 170 rows 212 cols
[2023-03-13 18:55:52] [INFO ] Computed 79 place invariants in 10 ms
[2023-03-13 18:55:53] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:55:53] [INFO ] [Nat]Absence check using 60 positive place invariants in 14 ms returned sat
[2023-03-13 18:55:53] [INFO ] [Nat]Absence check using 60 positive and 19 generalized place invariants in 6 ms returned sat
[2023-03-13 18:55:53] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:55:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 18:55:53] [INFO ] After 70ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:55:53] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 1 ms to minimize.
[2023-03-13 18:55:53] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2023-03-13 18:55:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2023-03-13 18:55:53] [INFO ] After 428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-13 18:55:53] [INFO ] After 835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 35 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 170/170 transitions.
Applied a total of 0 rules in 20 ms. Remains 212 /212 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 212/212 places, 170/170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 170/170 transitions.
Applied a total of 0 rules in 6 ms. Remains 212 /212 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2023-03-13 18:55:53] [INFO ] Invariant cache hit.
[2023-03-13 18:55:54] [INFO ] Implicit Places using invariants in 211 ms returned [23, 28, 30, 32, 34, 39, 41, 44, 58, 60, 63, 64, 72]
Discarding 13 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT only with invariants took 215 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 199/212 places, 169/170 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 194 transition count 155
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 194 transition count 155
Applied a total of 10 rules in 10 ms. Remains 194 /199 variables (removed 5) and now considering 155/169 (removed 14) transitions.
// Phase 1: matrix 155 rows 194 cols
[2023-03-13 18:55:54] [INFO ] Computed 67 place invariants in 1 ms
[2023-03-13 18:55:54] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-13 18:55:54] [INFO ] Invariant cache hit.
[2023-03-13 18:55:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 18:55:54] [INFO ] Implicit Places using invariants and state equation in 266 ms returned [10, 48, 50, 123, 129, 132]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 380 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 188/212 places, 155/170 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 188 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 187 transition count 154
Applied a total of 2 rules in 6 ms. Remains 187 /188 variables (removed 1) and now considering 154/155 (removed 1) transitions.
// Phase 1: matrix 154 rows 187 cols
[2023-03-13 18:55:54] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-13 18:55:54] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-13 18:55:54] [INFO ] Invariant cache hit.
[2023-03-13 18:55:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 18:55:56] [INFO ] Implicit Places using invariants and state equation in 1359 ms returned []
Implicit Place search using SMT with State Equation took 1534 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 187/212 places, 154/170 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2152 ms. Remains : 187/212 places, 154/170 transitions.
Incomplete random walk after 10000 steps, including 374 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1606674 steps, run timeout after 3001 ms. (steps per millisecond=535 ) properties seen :{}
Probabilistic random walk after 1606674 steps, saw 267522 distinct states, run finished after 3001 ms. (steps per millisecond=535 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 18:55:59] [INFO ] Invariant cache hit.
[2023-03-13 18:55:59] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:55:59] [INFO ] [Nat]Absence check using 47 positive place invariants in 10 ms returned sat
[2023-03-13 18:55:59] [INFO ] [Nat]Absence check using 47 positive and 14 generalized place invariants in 3 ms returned sat
[2023-03-13 18:55:59] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:55:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 18:55:59] [INFO ] After 47ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:55:59] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2023-03-13 18:55:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-13 18:55:59] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-13 18:55:59] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 35 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 154/154 transitions.
Applied a total of 0 rules in 11 ms. Remains 187 /187 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 187/187 places, 154/154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 154/154 transitions.
Applied a total of 0 rules in 21 ms. Remains 187 /187 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2023-03-13 18:55:59] [INFO ] Invariant cache hit.
[2023-03-13 18:55:59] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-13 18:55:59] [INFO ] Invariant cache hit.
[2023-03-13 18:55:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 18:56:00] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2023-03-13 18:56:00] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-13 18:56:00] [INFO ] Invariant cache hit.
[2023-03-13 18:56:00] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 582 ms. Remains : 187/187 places, 154/154 transitions.
Graph (complete) has 581 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 186 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 185 transition count 153
Applied a total of 3 rules in 15 ms. Remains 185 /187 variables (removed 2) and now considering 153/154 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 153 rows 185 cols
[2023-03-13 18:56:00] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-13 18:56:00] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:56:00] [INFO ] [Nat]Absence check using 46 positive place invariants in 9 ms returned sat
[2023-03-13 18:56:00] [INFO ] [Nat]Absence check using 46 positive and 14 generalized place invariants in 4 ms returned sat
[2023-03-13 18:56:00] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:56:00] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2023-03-13 18:56:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-13 18:56:00] [INFO ] After 239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-13 18:56:00] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:56:00] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2023-03-13 18:56:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 187 places, 154 transitions and 695 arcs took 3 ms.
[2023-03-13 18:56:00] [INFO ] Flatten gal took : 51 ms
Total runtime 57141 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BusinessProcesses_PT_15
(NrP: 187 NrTr: 154 NrArc: 695)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.005sec

net check time: 0m 0.000sec

init dd package: 0m 3.522sec


RS generation: 0m 1.803sec


-> reachability set: #nodes 38305 (3.8e+04) #states 2,543,463 (6)



starting MCC model checker
--------------------------

checking: AG [[[[0<=p116 & p116<=0] | [[p43<=0 & 0<=p43] | [p107<=0 & 0<=p107]]] | [[[[[[[[p56<=1 & 1<=p56] | [[p15<=0 & 0<=p15] | [p74<=0 & 0<=p74]]] | [[[p174<=0 & 0<=p174] | [p102<=0 & 0<=p102]] | [[[[p28<=0 & 0<=p28] & [p21<=1 & 1<=p21]] & [[p74<=1 & 1<=p74] & [p139<=1 & 1<=p139]]] | [[p50<=1 & 1<=p50] & [[p124<=1 & 1<=p124] & [p161<=1 & 1<=p161]]]]]] & [[[p29<=0 & 0<=p29] | [p91<=0 & 0<=p91]] | [[p163<=0 & 0<=p163] | [[p119<=1 & 1<=p119] & [[p56<=1 & 1<=p56] & [p47<=1 & 1<=p47]]]]]] & [[p83<=1 & 1<=p83] & [p163<=1 & 1<=p163]]] & [[p176<=1 & 1<=p176] & [[p93<=1 & 1<=p93] & [p11<=1 & 1<=p11]]]] | [[[p147<=0 & 0<=p147] & [p3<=1 & 1<=p3]] & [[p48<=1 & 1<=p48] & [p150<=1 & 1<=p150]]]] | [[p183<=0 & 0<=p183] | [[p23<=1 & 1<=p23] & [[p88<=1 & 1<=p88] | [[p1<=0 & 0<=p1] | [[p140<=1 & 1<=p140] & [[p122<=0 & 0<=p122] & [[p18<=0 & 0<=p18] | [p144<=0 & 0<=p144]]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[p88<=1 & 1<=p88] | [[[p140<=1 & 1<=p140] & [[p122<=0 & 0<=p122] & [[p18<=0 & 0<=p18] | [p144<=0 & 0<=p144]]]] | [p1<=0 & 0<=p1]]] & [p23<=1 & 1<=p23]] | [p183<=0 & 0<=p183]] | [[[[p147<=0 & 0<=p147] & [p3<=1 & 1<=p3]] & [[p150<=1 & 1<=p150] & [p48<=1 & 1<=p48]]] | [[[p176<=1 & 1<=p176] & [[p11<=1 & 1<=p11] & [p93<=1 & 1<=p93]]] & [[[p83<=1 & 1<=p83] & [p163<=1 & 1<=p163]] & [[[[[[p56<=1 & 1<=p56] & [p47<=1 & 1<=p47]] & [p119<=1 & 1<=p119]] | [p163<=0 & 0<=p163]] | [[p91<=0 & 0<=p91] | [p29<=0 & 0<=p29]]] & [[[[[[p161<=1 & 1<=p161] & [p124<=1 & 1<=p124]] & [p50<=1 & 1<=p50]] | [[[p139<=1 & 1<=p139] & [p74<=1 & 1<=p74]] & [[p21<=1 & 1<=p21] & [p28<=0 & 0<=p28]]]] | [[p102<=0 & 0<=p102] | [p174<=0 & 0<=p174]]] | [[[p74<=0 & 0<=p74] | [p15<=0 & 0<=p15]] | [p56<=1 & 1<=p56]]]]]]]] | [[[p107<=0 & 0<=p107] | [p43<=0 & 0<=p43]] | [0<=p116 & p116<=0]]]]]]

abstracting: (p116<=0)
states: 1,816,253 (6)
abstracting: (0<=p116)
states: 2,543,463 (6)
abstracting: (0<=p43)
states: 2,543,463 (6)
abstracting: (p43<=0)
states: 2,531,367 (6)
abstracting: (0<=p107)
states: 2,543,463 (6)
abstracting: (p107<=0)
states: 1,287,907 (6)
abstracting: (1<=p56)
states: 8,304 (3)
abstracting: (p56<=1)
states: 2,543,463 (6)
abstracting: (0<=p15)
states: 2,543,463 (6)
abstracting: (p15<=0)
states: 2,538,087 (6)
abstracting: (0<=p74)
states: 2,543,463 (6)
abstracting: (p74<=0)
states: 1,591,231 (6)
abstracting: (0<=p174)
states: 2,543,463 (6)
abstracting: (p174<=0)
states: 2,527,335 (6)
abstracting: (0<=p102)
states: 2,543,463 (6)
abstracting: (p102<=0)
states: 2,452,207 (6)
abstracting: (0<=p28)
states: 2,543,463 (6)
abstracting: (p28<=0)
states: 2,391,591 (6)
abstracting: (1<=p21)
states: 32,256 (4)
abstracting: (p21<=1)
states: 2,543,463 (6)
abstracting: (1<=p74)
states: 952,232 (5)
abstracting: (p74<=1)
states: 2,543,463 (6)
abstracting: (1<=p139)
states: 5,376 (3)
abstracting: (p139<=1)
states: 2,543,463 (6)
abstracting: (1<=p50)
states: 3,124 (3)
abstracting: (p50<=1)
states: 2,543,463 (6)
abstracting: (1<=p124)
states: 1,207,910 (6)
abstracting: (p124<=1)
states: 2,543,463 (6)
abstracting: (1<=p161)
states: 3,124 (3)
abstracting: (p161<=1)
states: 2,543,463 (6)
abstracting: (0<=p29)
states: 2,543,463 (6)
abstracting: (p29<=0)
states: 1,088,196 (6)
abstracting: (0<=p91)
states: 2,543,463 (6)
abstracting: (p91<=0)
states: 2,528,679 (6)
abstracting: (0<=p163)
states: 2,543,463 (6)
abstracting: (p163<=0)
states: 2,156,668 (6)
abstracting: (1<=p119)
states: 727,210 (5)
abstracting: (p119<=1)
states: 2,543,463 (6)
abstracting: (1<=p47)
states: 239,340 (5)
abstracting: (p47<=1)
states: 2,543,463 (6)
abstracting: (1<=p56)
states: 8,304 (3)
abstracting: (p56<=1)
states: 2,543,463 (6)
abstracting: (1<=p163)
states: 386,795 (5)
abstracting: (p163<=1)
states: 2,543,463 (6)
abstracting: (1<=p83)
states: 398,496 (5)
abstracting: (p83<=1)
states: 2,543,463 (6)
abstracting: (1<=p93)
states: 1,194,480 (6)
abstracting: (p93<=1)
states: 2,543,463 (6)
abstracting: (1<=p11)
states: 1,760,727 (6)
abstracting: (p11<=1)
states: 2,543,463 (6)
abstracting: (1<=p176)
states: 8,064 (3)
abstracting: (p176<=1)
states: 2,543,463 (6)
abstracting: (1<=p48)
states: 715,537 (5)
abstracting: (p48<=1)
states: 2,543,463 (6)
abstracting: (1<=p150)
states: 2,688 (3)
abstracting: (p150<=1)
states: 2,543,463 (6)
abstracting: (1<=p3)
states: 8,700 (3)
abstracting: (p3<=1)
states: 2,543,463 (6)
abstracting: (0<=p147)
states: 2,543,463 (6)
abstracting: (p147<=0)
states: 2,540,775 (6)
abstracting: (0<=p183)
states: 2,543,463 (6)
abstracting: (p183<=0)
states: 2,531,367 (6)
abstracting: (1<=p23)
states: 745,920 (5)
abstracting: (p23<=1)
states: 2,543,463 (6)
abstracting: (0<=p1)
states: 2,543,463 (6)
abstracting: (p1<=0)
states: 2,534,763 (6)
abstracting: (0<=p144)
states: 2,543,463 (6)
abstracting: (p144<=0)
states: 2,532,711 (6)
abstracting: (0<=p18)
states: 2,543,463 (6)
abstracting: (p18<=0)
states: 2,532,711 (6)
abstracting: (0<=p122)
states: 2,543,463 (6)
abstracting: (p122<=0)
states: 1,475,340 (6)
abstracting: (1<=p140)
states: 5,376 (3)
abstracting: (p140<=1)
states: 2,543,463 (6)
abstracting: (1<=p88)
states: 220,760 (5)
abstracting: (p88<=1)
states: 2,543,463 (6)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-15-ReachabilityFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.421sec

totally nodes used: 608185 (6.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1475105 7648037 9123142
used/not used/entry size/cache size: 7566888 59541976 16 1024MB
basic ops cache: hits/miss/sum: 166020 1301339 1467359
used/not used/entry size/cache size: 1820923 14956293 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 24191 147605 171796
used/not used/entry size/cache size: 146732 8241876 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66554390
1 506943
2 41974
3 5006
4 501
5 42
6 4
7 2
8 0
9 0
>= 10 2

Total processing time: 0m 9.650sec


BK_STOP 1678733770878

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.002sec


iterations count:15053 (97), effective:475 (3)

initing FirstDep: 0m 0.000sec


iterations count:3396 (22), effective:119 (0)

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-15"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BusinessProcesses-PT-15, 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 r042-tajo-167813695900567"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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