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-167813695900575.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-16, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695900575
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.8K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 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 159K 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-16-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678734180244

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-16
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:03:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:03:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:03:02] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-13 19:03:02] [INFO ] Transformed 638 places.
[2023-03-13 19:03:02] [INFO ] Transformed 578 transitions.
[2023-03-13 19:03:02] [INFO ] Found NUPN structural information;
[2023-03-13 19:03:02] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 16) seen :3
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 570 rows 630 cols
[2023-03-13 19:03:03] [INFO ] Computed 100 place invariants in 34 ms
[2023-03-13 19:03:03] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2023-03-13 19:03:03] [INFO ] [Real]Absence check using 62 positive and 38 generalized place invariants in 15 ms returned sat
[2023-03-13 19:03:03] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-13 19:03:04] [INFO ] [Nat]Absence check using 62 positive place invariants in 14 ms returned sat
[2023-03-13 19:03:04] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 12 ms returned sat
[2023-03-13 19:03:05] [INFO ] After 800ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :9
[2023-03-13 19:03:05] [INFO ] Deduced a trap composed of 36 places in 171 ms of which 7 ms to minimize.
[2023-03-13 19:03:05] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 9 ms to minimize.
[2023-03-13 19:03:05] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 0 ms to minimize.
[2023-03-13 19:03:05] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2023-03-13 19:03:05] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 1 ms to minimize.
[2023-03-13 19:03:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 763 ms
[2023-03-13 19:03:06] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2023-03-13 19:03:06] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2023-03-13 19:03:06] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2023-03-13 19:03:06] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2023-03-13 19:03:06] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2023-03-13 19:03:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 479 ms
[2023-03-13 19:03:06] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 0 ms to minimize.
[2023-03-13 19:03:06] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 0 ms to minimize.
[2023-03-13 19:03:06] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 0 ms to minimize.
[2023-03-13 19:03:07] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 1 ms to minimize.
[2023-03-13 19:03:07] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 1 ms to minimize.
[2023-03-13 19:03:07] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 1 ms to minimize.
[2023-03-13 19:03:07] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2023-03-13 19:03:07] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2023-03-13 19:03:07] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2023-03-13 19:03:08] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 1 ms to minimize.
[2023-03-13 19:03:08] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 0 ms to minimize.
[2023-03-13 19:03:08] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 1 ms to minimize.
[2023-03-13 19:03:08] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1765 ms
[2023-03-13 19:03:08] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2023-03-13 19:03:08] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 0 ms to minimize.
[2023-03-13 19:03:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 305 ms
[2023-03-13 19:03:08] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2023-03-13 19:03:08] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2023-03-13 19:03:09] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2023-03-13 19:03:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 377 ms
[2023-03-13 19:03:09] [INFO ] Deduced a trap composed of 36 places in 199 ms of which 0 ms to minimize.
[2023-03-13 19:03:09] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 1 ms to minimize.
[2023-03-13 19:03:10] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 0 ms to minimize.
[2023-03-13 19:03:10] [INFO ] Deduced a trap composed of 134 places in 185 ms of which 1 ms to minimize.
[2023-03-13 19:03:10] [INFO ] Deduced a trap composed of 155 places in 203 ms of which 1 ms to minimize.
[2023-03-13 19:03:10] [INFO ] Deduced a trap composed of 139 places in 189 ms of which 1 ms to minimize.
[2023-03-13 19:03:11] [INFO ] Deduced a trap composed of 135 places in 199 ms of which 2 ms to minimize.
[2023-03-13 19:03:11] [INFO ] Deduced a trap composed of 131 places in 229 ms of which 1 ms to minimize.
[2023-03-13 19:03:11] [INFO ] Deduced a trap composed of 155 places in 216 ms of which 0 ms to minimize.
[2023-03-13 19:03:12] [INFO ] Deduced a trap composed of 131 places in 296 ms of which 2 ms to minimize.
[2023-03-13 19:03:12] [INFO ] Deduced a trap composed of 143 places in 204 ms of which 1 ms to minimize.
[2023-03-13 19:03:12] [INFO ] Deduced a trap composed of 148 places in 198 ms of which 0 ms to minimize.
[2023-03-13 19:03:12] [INFO ] Deduced a trap composed of 145 places in 169 ms of which 2 ms to minimize.
[2023-03-13 19:03:13] [INFO ] Deduced a trap composed of 140 places in 168 ms of which 0 ms to minimize.
[2023-03-13 19:03:13] [INFO ] Deduced a trap composed of 154 places in 154 ms of which 1 ms to minimize.
[2023-03-13 19:03:13] [INFO ] Deduced a trap composed of 145 places in 170 ms of which 1 ms to minimize.
[2023-03-13 19:03:13] [INFO ] Deduced a trap composed of 137 places in 174 ms of which 0 ms to minimize.
[2023-03-13 19:03:13] [INFO ] Deduced a trap composed of 149 places in 152 ms of which 0 ms to minimize.
[2023-03-13 19:03:14] [INFO ] Deduced a trap composed of 148 places in 183 ms of which 16 ms to minimize.
[2023-03-13 19:03:14] [INFO ] Deduced a trap composed of 154 places in 164 ms of which 1 ms to minimize.
[2023-03-13 19:03:14] [INFO ] Deduced a trap composed of 146 places in 175 ms of which 0 ms to minimize.
[2023-03-13 19:03:14] [INFO ] Deduced a trap composed of 155 places in 172 ms of which 1 ms to minimize.
[2023-03-13 19:03:15] [INFO ] Deduced a trap composed of 149 places in 245 ms of which 1 ms to minimize.
[2023-03-13 19:03:15] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 13 ms to minimize.
[2023-03-13 19:03:15] [INFO ] Deduced a trap composed of 138 places in 141 ms of which 1 ms to minimize.
[2023-03-13 19:03:16] [INFO ] Deduced a trap composed of 140 places in 193 ms of which 0 ms to minimize.
[2023-03-13 19:03:16] [INFO ] Deduced a trap composed of 155 places in 184 ms of which 0 ms to minimize.
[2023-03-13 19:03:16] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 1 ms to minimize.
[2023-03-13 19:03:16] [INFO ] Deduced a trap composed of 145 places in 162 ms of which 1 ms to minimize.
[2023-03-13 19:03:17] [INFO ] Deduced a trap composed of 133 places in 142 ms of which 4 ms to minimize.
[2023-03-13 19:03:17] [INFO ] Deduced a trap composed of 150 places in 165 ms of which 0 ms to minimize.
[2023-03-13 19:03:17] [INFO ] Deduced a trap composed of 138 places in 143 ms of which 0 ms to minimize.
[2023-03-13 19:03:18] [INFO ] Deduced a trap composed of 142 places in 136 ms of which 0 ms to minimize.
[2023-03-13 19:03:18] [INFO ] Deduced a trap composed of 155 places in 146 ms of which 1 ms to minimize.
[2023-03-13 19:03:18] [INFO ] Deduced a trap composed of 156 places in 142 ms of which 0 ms to minimize.
[2023-03-13 19:03:18] [INFO ] Deduced a trap composed of 139 places in 182 ms of which 1 ms to minimize.
[2023-03-13 19:03:19] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 1 ms to minimize.
[2023-03-13 19:03:19] [INFO ] Deduced a trap composed of 153 places in 134 ms of which 0 ms to minimize.
[2023-03-13 19:03:19] [INFO ] Deduced a trap composed of 160 places in 139 ms of which 0 ms to minimize.
[2023-03-13 19:03:20] [INFO ] Deduced a trap composed of 155 places in 173 ms of which 1 ms to minimize.
[2023-03-13 19:03:20] [INFO ] Deduced a trap composed of 156 places in 165 ms of which 2 ms to minimize.
[2023-03-13 19:03:20] [INFO ] Deduced a trap composed of 166 places in 150 ms of which 0 ms to minimize.
[2023-03-13 19:03:20] [INFO ] Deduced a trap composed of 145 places in 119 ms of which 0 ms to minimize.
[2023-03-13 19:03:21] [INFO ] Deduced a trap composed of 144 places in 130 ms of which 1 ms to minimize.
[2023-03-13 19:03:21] [INFO ] Deduced a trap composed of 148 places in 118 ms of which 1 ms to minimize.
[2023-03-13 19:03:21] [INFO ] Deduced a trap composed of 154 places in 200 ms of which 0 ms to minimize.
[2023-03-13 19:03:21] [INFO ] Deduced a trap composed of 155 places in 185 ms of which 1 ms to minimize.
[2023-03-13 19:03:22] [INFO ] Deduced a trap composed of 159 places in 200 ms of which 1 ms to minimize.
[2023-03-13 19:03:22] [INFO ] Deduced a trap composed of 147 places in 183 ms of which 1 ms to minimize.
[2023-03-13 19:03:22] [INFO ] Deduced a trap composed of 134 places in 176 ms of which 1 ms to minimize.
[2023-03-13 19:03:22] [INFO ] Deduced a trap composed of 142 places in 167 ms of which 0 ms to minimize.
[2023-03-13 19:03:23] [INFO ] Deduced a trap composed of 157 places in 162 ms of which 1 ms to minimize.
[2023-03-13 19:03:23] [INFO ] Deduced a trap composed of 140 places in 152 ms of which 0 ms to minimize.
[2023-03-13 19:03:23] [INFO ] Deduced a trap composed of 144 places in 177 ms of which 1 ms to minimize.
[2023-03-13 19:03:24] [INFO ] Deduced a trap composed of 165 places in 170 ms of which 0 ms to minimize.
[2023-03-13 19:03:24] [INFO ] Deduced a trap composed of 156 places in 123 ms of which 0 ms to minimize.
[2023-03-13 19:03:24] [INFO ] Deduced a trap composed of 156 places in 158 ms of which 1 ms to minimize.
[2023-03-13 19:03:25] [INFO ] Deduced a trap composed of 146 places in 150 ms of which 0 ms to minimize.
[2023-03-13 19:03:25] [INFO ] Deduced a trap composed of 165 places in 148 ms of which 1 ms to minimize.
[2023-03-13 19:03:25] [INFO ] Deduced a trap composed of 163 places in 156 ms of which 1 ms to minimize.
[2023-03-13 19:03:26] [INFO ] Deduced a trap composed of 159 places in 182 ms of which 0 ms to minimize.
[2023-03-13 19:03:26] [INFO ] Deduced a trap composed of 166 places in 171 ms of which 0 ms to minimize.
[2023-03-13 19:03:27] [INFO ] Deduced a trap composed of 143 places in 124 ms of which 0 ms to minimize.
[2023-03-13 19:03:27] [INFO ] Deduced a trap composed of 140 places in 142 ms of which 1 ms to minimize.
[2023-03-13 19:03:27] [INFO ] Deduced a trap composed of 144 places in 117 ms of which 1 ms to minimize.
[2023-03-13 19:03:27] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 0 ms to minimize.
[2023-03-13 19:03:28] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2023-03-13 19:03:28] [INFO ] Deduced a trap composed of 15 places in 304 ms of which 1 ms to minimize.
[2023-03-13 19:03:28] [INFO ] Deduced a trap composed of 41 places in 291 ms of which 1 ms to minimize.
[2023-03-13 19:03:29] [INFO ] Deduced a trap composed of 50 places in 204 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-13 19:03:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 19:03:29] [INFO ] After 25139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 9 different solutions.
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 137 ms.
Support contains 28 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (complete) has 1291 edges and 630 vertex of which 624 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 624 transition count 479
Reduce places removed 90 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 93 rules applied. Total rules applied 184 place count 534 transition count 476
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 187 place count 531 transition count 476
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 187 place count 531 transition count 344
Deduced a syphon composed of 132 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 277 rules applied. Total rules applied 464 place count 386 transition count 344
Discarding 88 places :
Symmetric choice reduction at 3 with 88 rule applications. Total rules 552 place count 298 transition count 256
Iterating global reduction 3 with 88 rules applied. Total rules applied 640 place count 298 transition count 256
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 640 place count 298 transition count 249
Deduced a syphon composed of 7 places in 10 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 657 place count 288 transition count 249
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 821 place count 206 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 822 place count 206 transition count 166
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 823 place count 206 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 824 place count 205 transition count 165
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 825 place count 205 transition count 165
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 826 place count 204 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 827 place count 203 transition count 164
Applied a total of 827 rules in 225 ms. Remains 203 /630 variables (removed 427) and now considering 164/570 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 203/630 places, 164/570 transitions.
Incomplete random walk after 10000 steps, including 443 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 102 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Finished probabilistic random walk after 254295 steps, run visited all 4 properties in 1462 ms. (steps per millisecond=173 )
Probabilistic random walk after 254295 steps, saw 53957 distinct states, run finished after 1463 ms. (steps per millisecond=173 ) properties seen :4
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 29427 ms.
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_16
(NrP: 638 NrTr: 578 NrArc: 1694)

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

net check time: 0m 0.000sec

init dd package: 0m 3.109sec


before gc: list nodes free: 489668

after gc: idd nodes used:43996539, unused:20003461; list nodes free:85059676

RS generation: 30m36.426sec


-> last computed set: #nodes 43995919 (4.4e+07) #states 922,786,896,490,681 (14)


CANNOT_COMPUTE


BK_STOP 1678736078206

--------------------
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
found
The net has a maximal unmarked siphon:
p305
p310
p247
p243
p242
p248
p244
p246

The net has transition(s) that can never fire:
t267
t271
t458
t459
t289
t290
t292
t293

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.003sec

idd.cc:820: DD Exception: No free nodes

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-16"
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-16, 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-167813695900575"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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