Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414900355.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r065-tajo-171620414900355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 157K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716651387089

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=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-25 15:36:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 15:36:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:36:29] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-25 15:36:29] [INFO ] Transformed 630 places.
[2024-05-25 15:36:29] [INFO ] Transformed 566 transitions.
[2024-05-25 15:36:29] [INFO ] Found NUPN structural information;
[2024-05-25 15:36:29] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 188 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 14 ms
Reduce places removed 4 places and 4 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 548 ms. (steps per millisecond=18 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 562 rows 626 cols
[2024-05-25 15:36:30] [INFO ] Computed 102 invariants in 36 ms
[2024-05-25 15:36:31] [INFO ] After 436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-25 15:36:31] [INFO ] [Nat]Absence check using 61 positive place invariants in 31 ms returned sat
[2024-05-25 15:36:31] [INFO ] [Nat]Absence check using 61 positive and 41 generalized place invariants in 16 ms returned sat
[2024-05-25 15:36:32] [INFO ] After 1049ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2024-05-25 15:36:32] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 7 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 1 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 5 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 0 ms to minimize.
[2024-05-25 15:36:33] [INFO ] Deduced a trap composed of 132 places in 149 ms of which 0 ms to minimize.
[2024-05-25 15:36:34] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 2 ms to minimize.
[2024-05-25 15:36:34] [INFO ] Deduced a trap composed of 144 places in 164 ms of which 1 ms to minimize.
[2024-05-25 15:36:34] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 1 ms to minimize.
[2024-05-25 15:36:34] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 1 ms to minimize.
[2024-05-25 15:36:34] [INFO ] Deduced a trap composed of 126 places in 178 ms of which 0 ms to minimize.
[2024-05-25 15:36:35] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 1 ms to minimize.
[2024-05-25 15:36:35] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 1 ms to minimize.
[2024-05-25 15:36:35] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 1 ms to minimize.
[2024-05-25 15:36:35] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 1 ms to minimize.
[2024-05-25 15:36:36] [INFO ] Deduced a trap composed of 163 places in 189 ms of which 1 ms to minimize.
[2024-05-25 15:36:36] [INFO ] Deduced a trap composed of 118 places in 191 ms of which 1 ms to minimize.
[2024-05-25 15:36:36] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 1 ms to minimize.
[2024-05-25 15:36:36] [INFO ] Deduced a trap composed of 134 places in 163 ms of which 0 ms to minimize.
[2024-05-25 15:36:37] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 1 ms to minimize.
[2024-05-25 15:36:37] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:36:37] [INFO ] Deduced a trap composed of 177 places in 172 ms of which 1 ms to minimize.
[2024-05-25 15:36:37] [INFO ] Deduced a trap composed of 171 places in 186 ms of which 1 ms to minimize.
[2024-05-25 15:36:38] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 1 ms to minimize.
[2024-05-25 15:36:38] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 0 ms to minimize.
[2024-05-25 15:36:38] [INFO ] Deduced a trap composed of 167 places in 147 ms of which 0 ms to minimize.
[2024-05-25 15:36:38] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 0 ms to minimize.
[2024-05-25 15:36:38] [INFO ] Deduced a trap composed of 151 places in 149 ms of which 0 ms to minimize.
[2024-05-25 15:36:39] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 1 ms to minimize.
[2024-05-25 15:36:39] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 1 ms to minimize.
[2024-05-25 15:36:39] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 1 ms to minimize.
[2024-05-25 15:36:39] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 0 ms to minimize.
[2024-05-25 15:36:39] [INFO ] Deduced a trap composed of 121 places in 175 ms of which 1 ms to minimize.
[2024-05-25 15:36:40] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 2 ms to minimize.
[2024-05-25 15:36:40] [INFO ] Deduced a trap composed of 33 places in 144 ms of which 1 ms to minimize.
[2024-05-25 15:36:40] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:36:40] [INFO ] Deduced a trap composed of 124 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:36:40] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 0 ms to minimize.
[2024-05-25 15:36:41] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:36:41] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 2 ms to minimize.
[2024-05-25 15:36:41] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 0 ms to minimize.
[2024-05-25 15:36:41] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 1 ms to minimize.
[2024-05-25 15:36:42] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 3 ms to minimize.
[2024-05-25 15:36:42] [INFO ] Deduced a trap composed of 122 places in 193 ms of which 1 ms to minimize.
[2024-05-25 15:36:42] [INFO ] Deduced a trap composed of 63 places in 184 ms of which 1 ms to minimize.
[2024-05-25 15:36:42] [INFO ] Deduced a trap composed of 150 places in 185 ms of which 1 ms to minimize.
[2024-05-25 15:36:43] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 0 ms to minimize.
[2024-05-25 15:36:43] [INFO ] Deduced a trap composed of 166 places in 183 ms of which 1 ms to minimize.
[2024-05-25 15:36:43] [INFO ] Deduced a trap composed of 146 places in 200 ms of which 1 ms to minimize.
[2024-05-25 15:36:43] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:36:44] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 2 ms to minimize.
[2024-05-25 15:36:44] [INFO ] Deduced a trap composed of 148 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:36:44] [INFO ] Deduced a trap composed of 149 places in 163 ms of which 1 ms to minimize.
[2024-05-25 15:36:44] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 0 ms to minimize.
[2024-05-25 15:36:45] [INFO ] Deduced a trap composed of 144 places in 183 ms of which 0 ms to minimize.
[2024-05-25 15:36:45] [INFO ] Deduced a trap composed of 145 places in 157 ms of which 2 ms to minimize.
[2024-05-25 15:36:45] [INFO ] Deduced a trap composed of 150 places in 180 ms of which 1 ms to minimize.
[2024-05-25 15:36:45] [INFO ] Deduced a trap composed of 120 places in 171 ms of which 2 ms to minimize.
[2024-05-25 15:36:45] [INFO ] Deduced a trap composed of 149 places in 151 ms of which 0 ms to minimize.
[2024-05-25 15:36:46] [INFO ] Deduced a trap composed of 125 places in 151 ms of which 1 ms to minimize.
[2024-05-25 15:36:46] [INFO ] Deduced a trap composed of 142 places in 136 ms of which 0 ms to minimize.
[2024-05-25 15:36:46] [INFO ] Deduced a trap composed of 138 places in 130 ms of which 1 ms to minimize.
[2024-05-25 15:36:46] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 1 ms to minimize.
[2024-05-25 15:36:46] [INFO ] Deduced a trap composed of 144 places in 133 ms of which 0 ms to minimize.
[2024-05-25 15:36:47] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 1 ms to minimize.
[2024-05-25 15:36:47] [INFO ] Deduced a trap composed of 153 places in 151 ms of which 0 ms to minimize.
[2024-05-25 15:36:47] [INFO ] Deduced a trap composed of 157 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:36:47] [INFO ] Deduced a trap composed of 155 places in 170 ms of which 4 ms to minimize.
[2024-05-25 15:36:47] [INFO ] Deduced a trap composed of 158 places in 161 ms of which 1 ms to minimize.
[2024-05-25 15:36:48] [INFO ] Deduced a trap composed of 149 places in 168 ms of which 0 ms to minimize.
[2024-05-25 15:36:48] [INFO ] Deduced a trap composed of 152 places in 169 ms of which 1 ms to minimize.
[2024-05-25 15:36:48] [INFO ] Deduced a trap composed of 142 places in 185 ms of which 0 ms to minimize.
[2024-05-25 15:36:49] [INFO ] Deduced a trap composed of 144 places in 181 ms of which 0 ms to minimize.
[2024-05-25 15:36:49] [INFO ] Deduced a trap composed of 139 places in 184 ms of which 1 ms to minimize.
[2024-05-25 15:36:49] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 0 ms to minimize.
[2024-05-25 15:36:49] [INFO ] Deduced a trap composed of 150 places in 164 ms of which 1 ms to minimize.
[2024-05-25 15:36:49] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 1 ms to minimize.
[2024-05-25 15:36:50] [INFO ] Deduced a trap composed of 153 places in 186 ms of which 0 ms to minimize.
[2024-05-25 15:36:50] [INFO ] Deduced a trap composed of 153 places in 168 ms of which 1 ms to minimize.
[2024-05-25 15:36:50] [INFO ] Deduced a trap composed of 151 places in 157 ms of which 1 ms to minimize.
[2024-05-25 15:36:50] [INFO ] Deduced a trap composed of 147 places in 152 ms of which 1 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 147 places in 182 ms of which 1 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 150 places in 165 ms of which 1 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Deduced a trap composed of 152 places in 181 ms of which 1 ms to minimize.
[2024-05-25 15:36:51] [INFO ] Trap strengthening (SAT) tested/added 85/84 trap constraints in 19249 ms
[2024-05-25 15:36:52] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 0 ms to minimize.
[2024-05-25 15:36:52] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 1 ms to minimize.
[2024-05-25 15:36:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2024-05-25 15:36:52] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 0 ms to minimize.
[2024-05-25 15:36:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2024-05-25 15:36:53] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 0 ms to minimize.
[2024-05-25 15:36:53] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 1 ms to minimize.
[2024-05-25 15:36:53] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:36:53] [INFO ] Deduced a trap composed of 135 places in 159 ms of which 1 ms to minimize.
[2024-05-25 15:36:54] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 1 ms to minimize.
[2024-05-25 15:36:54] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 1 ms to minimize.
[2024-05-25 15:36:54] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:36:54] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 1 ms to minimize.
[2024-05-25 15:36:54] [INFO ] Deduced a trap composed of 161 places in 168 ms of which 1 ms to minimize.
[2024-05-25 15:36:55] [INFO ] Deduced a trap composed of 140 places in 159 ms of which 1 ms to minimize.
[2024-05-25 15:36:55] [INFO ] Deduced a trap composed of 144 places in 190 ms of which 1 ms to minimize.
[2024-05-25 15:36:55] [INFO ] Deduced a trap composed of 144 places in 136 ms of which 1 ms to minimize.
[2024-05-25 15:36:55] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2964 ms
[2024-05-25 15:36:56] [INFO ] Deduced a trap composed of 146 places in 205 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-25 15:36:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:36:56] [INFO ] After 25179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 194 ms.
Support contains 131 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 622 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 622 transition count 520
Reduce places removed 41 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 59 rules applied. Total rules applied 101 place count 581 transition count 502
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 119 place count 563 transition count 502
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 119 place count 563 transition count 396
Deduced a syphon composed of 106 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 223 rules applied. Total rules applied 342 place count 446 transition count 396
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 397 place count 391 transition count 341
Iterating global reduction 3 with 55 rules applied. Total rules applied 452 place count 391 transition count 341
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 574 place count 330 transition count 280
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 575 place count 330 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 576 place count 329 transition count 279
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 581 place count 329 transition count 279
Applied a total of 581 rules in 159 ms. Remains 329 /626 variables (removed 297) and now considering 279/562 (removed 283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 329/626 places, 279/562 transitions.
Incomplete random walk after 10000 steps, including 170 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 525785 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{1=1, 2=1, 4=1, 6=1}
Probabilistic random walk after 525785 steps, saw 90395 distinct states, run finished after 3002 ms. (steps per millisecond=175 ) properties seen :4
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 279 rows 329 cols
[2024-05-25 15:37:00] [INFO ] Computed 88 invariants in 13 ms
[2024-05-25 15:37:00] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:37:00] [INFO ] [Nat]Absence check using 58 positive place invariants in 14 ms returned sat
[2024-05-25 15:37:00] [INFO ] [Nat]Absence check using 58 positive and 30 generalized place invariants in 10 ms returned sat
[2024-05-25 15:37:01] [INFO ] After 598ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 15:37:01] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 1 ms to minimize.
[2024-05-25 15:37:01] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2024-05-25 15:37:01] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2024-05-25 15:37:01] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-05-25 15:37:01] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 0 ms to minimize.
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 1 ms to minimize.
[2024-05-25 15:37:02] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 0 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 0 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 1 ms to minimize.
[2024-05-25 15:37:03] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 1 ms to minimize.
[2024-05-25 15:37:04] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 1 ms to minimize.
[2024-05-25 15:37:04] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2764 ms
[2024-05-25 15:37:04] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:37:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-05-25 15:37:04] [INFO ] After 3908ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 442 ms.
[2024-05-25 15:37:04] [INFO ] After 4478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 49 ms.
Support contains 124 out of 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 279/279 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 329 transition count 277
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 327 transition count 277
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 327 transition count 276
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 326 transition count 276
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 320 transition count 270
Applied a total of 18 rules in 48 ms. Remains 320 /329 variables (removed 9) and now considering 270/279 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 320/329 places, 270/279 transitions.
Incomplete random walk after 10000 steps, including 176 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 570678 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 570678 steps, saw 94724 distinct states, run finished after 3006 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 270 rows 320 cols
[2024-05-25 15:37:08] [INFO ] Computed 88 invariants in 11 ms
[2024-05-25 15:37:08] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:37:08] [INFO ] [Nat]Absence check using 59 positive place invariants in 10 ms returned sat
[2024-05-25 15:37:08] [INFO ] [Nat]Absence check using 59 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-25 15:37:09] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 15:37:09] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 1 ms to minimize.
[2024-05-25 15:37:09] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 0 ms to minimize.
[2024-05-25 15:37:09] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-25 15:37:09] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2024-05-25 15:37:09] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:37:09] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 0 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 0 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 0 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-25 15:37:10] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1712 ms
[2024-05-25 15:37:11] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 0 ms to minimize.
[2024-05-25 15:37:11] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 0 ms to minimize.
[2024-05-25 15:37:11] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:37:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 337 ms
[2024-05-25 15:37:11] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-05-25 15:37:11] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:37:11] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:37:11] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-05-25 15:37:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 211 ms
[2024-05-25 15:37:11] [INFO ] After 3018ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 420 ms.
[2024-05-25 15:37:12] [INFO ] After 3538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 49 ms.
Support contains 124 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 270/270 transitions.
Applied a total of 0 rules in 15 ms. Remains 320 /320 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 320/320 places, 270/270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 270/270 transitions.
Applied a total of 0 rules in 13 ms. Remains 320 /320 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-25 15:37:12] [INFO ] Invariant cache hit.
[2024-05-25 15:37:12] [INFO ] Implicit Places using invariants in 132 ms returned [12, 58, 63, 65, 67, 104, 106, 253, 276, 287]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 134 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 310/320 places, 270/270 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 308 transition count 268
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 308 transition count 268
Applied a total of 4 rules in 14 ms. Remains 308 /310 variables (removed 2) and now considering 268/270 (removed 2) transitions.
// Phase 1: matrix 268 rows 308 cols
[2024-05-25 15:37:12] [INFO ] Computed 78 invariants in 4 ms
[2024-05-25 15:37:12] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-25 15:37:12] [INFO ] Invariant cache hit.
[2024-05-25 15:37:12] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 308/320 places, 268/270 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 678 ms. Remains : 308/320 places, 268/270 transitions.
Incomplete random walk after 10000 steps, including 174 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 610534 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 610534 steps, saw 102335 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 15:37:16] [INFO ] Invariant cache hit.
[2024-05-25 15:37:16] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:37:16] [INFO ] [Nat]Absence check using 57 positive place invariants in 15 ms returned sat
[2024-05-25 15:37:16] [INFO ] [Nat]Absence check using 57 positive and 21 generalized place invariants in 17 ms returned sat
[2024-05-25 15:37:16] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 15:37:17] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2024-05-25 15:37:17] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2024-05-25 15:37:17] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2024-05-25 15:37:17] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 1 ms to minimize.
[2024-05-25 15:37:17] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 0 ms to minimize.
[2024-05-25 15:37:17] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2024-05-25 15:37:18] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2024-05-25 15:37:18] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2024-05-25 15:37:18] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 0 ms to minimize.
[2024-05-25 15:37:18] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-25 15:37:18] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 0 ms to minimize.
[2024-05-25 15:37:18] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2024-05-25 15:37:18] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 1 ms to minimize.
[2024-05-25 15:37:18] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1750 ms
[2024-05-25 15:37:18] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 1 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-05-25 15:37:19] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 0 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 0 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1576 ms
[2024-05-25 15:37:20] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-25 15:37:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-05-25 15:37:20] [INFO ] After 4278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 429 ms.
[2024-05-25 15:37:21] [INFO ] After 4857ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 29 ms.
Support contains 124 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 268/268 transitions.
Applied a total of 0 rules in 16 ms. Remains 308 /308 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 308/308 places, 268/268 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 268/268 transitions.
Applied a total of 0 rules in 15 ms. Remains 308 /308 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-05-25 15:37:21] [INFO ] Invariant cache hit.
[2024-05-25 15:37:21] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-25 15:37:21] [INFO ] Invariant cache hit.
[2024-05-25 15:37:21] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-05-25 15:37:21] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-25 15:37:21] [INFO ] Invariant cache hit.
[2024-05-25 15:37:21] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 632 ms. Remains : 308/308 places, 268/268 transitions.
Applied a total of 0 rules in 10 ms. Remains 308 /308 variables (removed 0) and now considering 268/268 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-25 15:37:21] [INFO ] Invariant cache hit.
[2024-05-25 15:37:22] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 15:37:22] [INFO ] [Nat]Absence check using 57 positive place invariants in 9 ms returned sat
[2024-05-25 15:37:22] [INFO ] [Nat]Absence check using 57 positive and 21 generalized place invariants in 4 ms returned sat
[2024-05-25 15:37:22] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2024-05-25 15:37:22] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 0 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 0 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-05-25 15:37:23] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 0 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1389 ms
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 0 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2024-05-25 15:37:24] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 1 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1334 ms
[2024-05-25 15:37:25] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-25 15:37:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2024-05-25 15:37:25] [INFO ] After 3516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 365 ms.
[2024-05-25 15:37:26] [INFO ] After 3972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-25 15:37:26] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-05-25 15:37:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 308 places, 268 transitions and 1017 arcs took 1 ms.
[2024-05-25 15:37:26] [INFO ] Flatten gal took : 97 ms
Total runtime 57617 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-15
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
ReachabilityFireability

FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716651447138

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 21 (type EXCL) for 3 BusinessProcesses-PT-15-ReachabilityFireability-2024-06
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 16 (type FNDP) for 3 BusinessProcesses-PT-15-ReachabilityFireability-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 3 BusinessProcesses-PT-15-ReachabilityFireability-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 20 (type SRCH) for 3 BusinessProcesses-PT-15-ReachabilityFireability-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 20 (type SRCH) for BusinessProcesses-PT-15-ReachabilityFireability-2024-06
lola: result : true
lola: markings : 82
lola: fired transitions : 81
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 16 (type FNDP) for BusinessProcesses-PT-15-ReachabilityFireability-2024-06 (obsolete)
lola: CANCELED task # 17 (type EQUN) for BusinessProcesses-PT-15-ReachabilityFireability-2024-06 (obsolete)
lola: CANCELED task # 21 (type EXCL) for BusinessProcesses-PT-15-ReachabilityFireability-2024-06 (obsolete)
lola: LAUNCH task # 28 (type EXCL) for 6 BusinessProcesses-PT-15-ReachabilityFireability-2024-09
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 30 (type FNDP) for 9 BusinessProcesses-PT-15-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 31 (type EQUN) for 9 BusinessProcesses-PT-15-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type SRCH) for 9 BusinessProcesses-PT-15-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 21 (type EXCL) for BusinessProcesses-PT-15-ReachabilityFireability-2024-06
lola: result : true
lola: markings : 1410
lola: fired transitions : 1775
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 16 (type FNDP) for BusinessProcesses-PT-15-ReachabilityFireability-2024-06
lola: result : true
lola: fired transitions : 80
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 34 (type SRCH) for BusinessProcesses-PT-15-ReachabilityFireability-2024-15
lola: result : true
lola: markings : 67
lola: fired transitions : 67
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 30 (type FNDP) for BusinessProcesses-PT-15-ReachabilityFireability-2024-15 (obsolete)
lola: CANCELED task # 31 (type EQUN) for BusinessProcesses-PT-15-ReachabilityFireability-2024-15 (obsolete)
lola: LAUNCH task # 12 (type FNDP) for 0 BusinessProcesses-PT-15-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 0 BusinessProcesses-PT-15-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type SRCH) for 0 BusinessProcesses-PT-15-ReachabilityFireability-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 28 (type EXCL) for BusinessProcesses-PT-15-ReachabilityFireability-2024-09
lola: result : true
lola: markings : 348
lola: fired transitions : 356
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 24 (type EXCL) for 0 BusinessProcesses-PT-15-ReachabilityFireability-2024-00
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 30 (type FNDP) for BusinessProcesses-PT-15-ReachabilityFireability-2024-15
lola: result : unknown
lola: fired transitions : 14
lola: tried executions : 2
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 23 (type SRCH) for BusinessProcesses-PT-15-ReachabilityFireability-2024-00
lola: result : true
lola: markings : 82
lola: fired transitions : 81
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 12 (type FNDP) for BusinessProcesses-PT-15-ReachabilityFireability-2024-00 (obsolete)
lola: CANCELED task # 14 (type EQUN) for BusinessProcesses-PT-15-ReachabilityFireability-2024-00 (obsolete)
lola: CANCELED task # 24 (type EXCL) for BusinessProcesses-PT-15-ReachabilityFireability-2024-00 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-15-ReachabilityFireability-2024-00: EF true tandem / insertion
BusinessProcesses-PT-15-ReachabilityFireability-2024-06: AG false tandem / insertion
BusinessProcesses-PT-15-ReachabilityFireability-2024-09: EF true tandem / relaxed
BusinessProcesses-PT-15-ReachabilityFireability-2024-15: EF true tandem / insertion


Time elapsed: 1 secs. Pages in use: 2

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-15"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
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 r065-tajo-171620414900355"
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 ;