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.r043-tajo-167813697100607.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 smartxred
Input is BusinessProcesses-PT-20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697100607
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.9K 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:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K 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 192K 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-20-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678795608729

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 12:06:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 12:06:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 12:06:50] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-14 12:06:50] [INFO ] Transformed 782 places.
[2023-03-14 12:06:50] [INFO ] Transformed 697 transitions.
[2023-03-14 12:06:50] [INFO ] Found NUPN structural information;
[2023-03-14 12:06:50] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 17 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 51 resets, run finished after 501 ms. (steps per millisecond=19 ) properties (out of 15) seen :5
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 9 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 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :3
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 638 rows 719 cols
[2023-03-14 12:06:51] [INFO ] Computed 121 place invariants in 36 ms
[2023-03-14 12:06:52] [INFO ] [Real]Absence check using 78 positive place invariants in 25 ms returned sat
[2023-03-14 12:06:52] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 42 ms returned sat
[2023-03-14 12:06:52] [INFO ] After 793ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-14 12:06:52] [INFO ] [Nat]Absence check using 78 positive place invariants in 35 ms returned sat
[2023-03-14 12:06:52] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 37 ms returned sat
[2023-03-14 12:06:53] [INFO ] After 833ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-14 12:06:54] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 7 ms to minimize.
[2023-03-14 12:06:54] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 2 ms to minimize.
[2023-03-14 12:06:54] [INFO ] Deduced a trap composed of 74 places in 176 ms of which 2 ms to minimize.
[2023-03-14 12:06:54] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 1 ms to minimize.
[2023-03-14 12:06:54] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2023-03-14 12:06:55] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 1 ms to minimize.
[2023-03-14 12:06:55] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 1 ms to minimize.
[2023-03-14 12:06:55] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 0 ms to minimize.
[2023-03-14 12:06:55] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 0 ms to minimize.
[2023-03-14 12:06:56] [INFO ] Deduced a trap composed of 32 places in 1185 ms of which 1 ms to minimize.
[2023-03-14 12:06:56] [INFO ] Deduced a trap composed of 68 places in 134 ms of which 1 ms to minimize.
[2023-03-14 12:06:57] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 0 ms to minimize.
[2023-03-14 12:06:57] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 1 ms to minimize.
[2023-03-14 12:06:57] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 0 ms to minimize.
[2023-03-14 12:06:57] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 1 ms to minimize.
[2023-03-14 12:06:57] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 1 ms to minimize.
[2023-03-14 12:06:57] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 1 ms to minimize.
[2023-03-14 12:06:58] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 1 ms to minimize.
[2023-03-14 12:06:58] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 1 ms to minimize.
[2023-03-14 12:06:58] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 0 ms to minimize.
[2023-03-14 12:06:58] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 0 ms to minimize.
[2023-03-14 12:06:58] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 1 ms to minimize.
[2023-03-14 12:06:58] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2023-03-14 12:06:58] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4859 ms
[2023-03-14 12:06:59] [INFO ] Deduced a trap composed of 128 places in 243 ms of which 0 ms to minimize.
[2023-03-14 12:06:59] [INFO ] Deduced a trap composed of 142 places in 308 ms of which 1 ms to minimize.
[2023-03-14 12:06:59] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 1 ms to minimize.
[2023-03-14 12:06:59] [INFO ] Deduced a trap composed of 157 places in 278 ms of which 2 ms to minimize.
[2023-03-14 12:07:00] [INFO ] Deduced a trap composed of 155 places in 276 ms of which 1 ms to minimize.
[2023-03-14 12:07:00] [INFO ] Deduced a trap composed of 155 places in 206 ms of which 0 ms to minimize.
[2023-03-14 12:07:00] [INFO ] Deduced a trap composed of 28 places in 258 ms of which 0 ms to minimize.
[2023-03-14 12:07:01] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 1 ms to minimize.
[2023-03-14 12:07:01] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 1 ms to minimize.
[2023-03-14 12:07:01] [INFO ] Deduced a trap composed of 56 places in 154 ms of which 1 ms to minimize.
[2023-03-14 12:07:01] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2831 ms
[2023-03-14 12:07:01] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2023-03-14 12:07:01] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 4 ms to minimize.
[2023-03-14 12:07:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 334 ms
[2023-03-14 12:07:02] [INFO ] Deduced a trap composed of 159 places in 200 ms of which 1 ms to minimize.
[2023-03-14 12:07:02] [INFO ] Deduced a trap composed of 153 places in 185 ms of which 0 ms to minimize.
[2023-03-14 12:07:02] [INFO ] Deduced a trap composed of 155 places in 194 ms of which 0 ms to minimize.
[2023-03-14 12:07:02] [INFO ] Deduced a trap composed of 151 places in 176 ms of which 2 ms to minimize.
[2023-03-14 12:07:03] [INFO ] Deduced a trap composed of 161 places in 172 ms of which 2 ms to minimize.
[2023-03-14 12:07:03] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2023-03-14 12:07:03] [INFO ] Deduced a trap composed of 161 places in 187 ms of which 1 ms to minimize.
[2023-03-14 12:07:03] [INFO ] Deduced a trap composed of 154 places in 204 ms of which 1 ms to minimize.
[2023-03-14 12:07:04] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 0 ms to minimize.
[2023-03-14 12:07:04] [INFO ] Deduced a trap composed of 147 places in 176 ms of which 0 ms to minimize.
[2023-03-14 12:07:04] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 0 ms to minimize.
[2023-03-14 12:07:04] [INFO ] Deduced a trap composed of 149 places in 192 ms of which 0 ms to minimize.
[2023-03-14 12:07:05] [INFO ] Deduced a trap composed of 150 places in 320 ms of which 1 ms to minimize.
[2023-03-14 12:07:05] [INFO ] Deduced a trap composed of 154 places in 169 ms of which 1 ms to minimize.
[2023-03-14 12:07:05] [INFO ] Deduced a trap composed of 149 places in 156 ms of which 1 ms to minimize.
[2023-03-14 12:07:05] [INFO ] Deduced a trap composed of 169 places in 217 ms of which 2 ms to minimize.
[2023-03-14 12:07:06] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 1 ms to minimize.
[2023-03-14 12:07:06] [INFO ] Deduced a trap composed of 157 places in 210 ms of which 1 ms to minimize.
[2023-03-14 12:07:06] [INFO ] Deduced a trap composed of 155 places in 227 ms of which 1 ms to minimize.
[2023-03-14 12:07:06] [INFO ] Deduced a trap composed of 153 places in 165 ms of which 1 ms to minimize.
[2023-03-14 12:07:07] [INFO ] Deduced a trap composed of 147 places in 189 ms of which 1 ms to minimize.
[2023-03-14 12:07:07] [INFO ] Deduced a trap composed of 145 places in 178 ms of which 1 ms to minimize.
[2023-03-14 12:07:07] [INFO ] Deduced a trap composed of 160 places in 241 ms of which 1 ms to minimize.
[2023-03-14 12:07:07] [INFO ] Deduced a trap composed of 151 places in 231 ms of which 14 ms to minimize.
[2023-03-14 12:07:08] [INFO ] Deduced a trap composed of 154 places in 211 ms of which 1 ms to minimize.
[2023-03-14 12:07:08] [INFO ] Deduced a trap composed of 161 places in 203 ms of which 0 ms to minimize.
[2023-03-14 12:07:08] [INFO ] Deduced a trap composed of 154 places in 213 ms of which 1 ms to minimize.
[2023-03-14 12:07:08] [INFO ] Deduced a trap composed of 146 places in 218 ms of which 1 ms to minimize.
[2023-03-14 12:07:09] [INFO ] Deduced a trap composed of 148 places in 202 ms of which 1 ms to minimize.
[2023-03-14 12:07:09] [INFO ] Deduced a trap composed of 146 places in 190 ms of which 0 ms to minimize.
[2023-03-14 12:07:09] [INFO ] Deduced a trap composed of 152 places in 210 ms of which 1 ms to minimize.
[2023-03-14 12:07:09] [INFO ] Deduced a trap composed of 150 places in 202 ms of which 1 ms to minimize.
[2023-03-14 12:07:09] [INFO ] Deduced a trap composed of 153 places in 195 ms of which 2 ms to minimize.
[2023-03-14 12:07:10] [INFO ] Deduced a trap composed of 147 places in 227 ms of which 8 ms to minimize.
[2023-03-14 12:07:10] [INFO ] Deduced a trap composed of 147 places in 203 ms of which 2 ms to minimize.
[2023-03-14 12:07:10] [INFO ] Deduced a trap composed of 165 places in 199 ms of which 0 ms to minimize.
[2023-03-14 12:07:10] [INFO ] Deduced a trap composed of 153 places in 220 ms of which 1 ms to minimize.
[2023-03-14 12:07:11] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 1 ms to minimize.
[2023-03-14 12:07:11] [INFO ] Deduced a trap composed of 175 places in 224 ms of which 0 ms to minimize.
[2023-03-14 12:07:11] [INFO ] Deduced a trap composed of 148 places in 208 ms of which 1 ms to minimize.
[2023-03-14 12:07:11] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 1 ms to minimize.
[2023-03-14 12:07:12] [INFO ] Deduced a trap composed of 152 places in 212 ms of which 1 ms to minimize.
[2023-03-14 12:07:12] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 1 ms to minimize.
[2023-03-14 12:07:12] [INFO ] Deduced a trap composed of 160 places in 235 ms of which 26 ms to minimize.
[2023-03-14 12:07:12] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2023-03-14 12:07:13] [INFO ] Deduced a trap composed of 18 places in 197 ms of which 1 ms to minimize.
[2023-03-14 12:07:13] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 1 ms to minimize.
[2023-03-14 12:07:13] [INFO ] Deduced a trap composed of 153 places in 194 ms of which 1 ms to minimize.
[2023-03-14 12:07:13] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 1 ms to minimize.
[2023-03-14 12:07:14] [INFO ] Deduced a trap composed of 161 places in 231 ms of which 1 ms to minimize.
[2023-03-14 12:07:14] [INFO ] Deduced a trap composed of 155 places in 220 ms of which 0 ms to minimize.
[2023-03-14 12:07:14] [INFO ] Deduced a trap composed of 159 places in 247 ms of which 1 ms to minimize.
[2023-03-14 12:07:15] [INFO ] Deduced a trap composed of 168 places in 330 ms of which 1 ms to minimize.
[2023-03-14 12:07:15] [INFO ] Deduced a trap composed of 156 places in 244 ms of which 0 ms to minimize.
[2023-03-14 12:07:15] [INFO ] Deduced a trap composed of 156 places in 270 ms of which 1 ms to minimize.
[2023-03-14 12:07:16] [INFO ] Deduced a trap composed of 145 places in 269 ms of which 1 ms to minimize.
[2023-03-14 12:07:16] [INFO ] Deduced a trap composed of 160 places in 237 ms of which 1 ms to minimize.
[2023-03-14 12:07:16] [INFO ] Deduced a trap composed of 155 places in 198 ms of which 0 ms to minimize.
[2023-03-14 12:07:17] [INFO ] Deduced a trap composed of 128 places in 255 ms of which 0 ms to minimize.
[2023-03-14 12:07:17] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 1 ms to minimize.
[2023-03-14 12:07:17] [INFO ] Deduced a trap composed of 28 places in 155 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-14 12:07:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 12:07:17] [INFO ] After 25130ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:6
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 134 ms.
Support contains 49 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (complete) has 1418 edges and 719 vertex of which 695 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 695 transition count 530
Reduce places removed 98 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 107 rules applied. Total rules applied 206 place count 597 transition count 521
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 215 place count 588 transition count 521
Performed 139 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 139 Pre rules applied. Total rules applied 215 place count 588 transition count 382
Deduced a syphon composed of 139 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 3 with 295 rules applied. Total rules applied 510 place count 432 transition count 382
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 593 place count 349 transition count 299
Iterating global reduction 3 with 83 rules applied. Total rules applied 676 place count 349 transition count 299
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 676 place count 349 transition count 294
Deduced a syphon composed of 5 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 687 place count 343 transition count 294
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 869 place count 252 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 870 place count 252 transition count 202
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 874 place count 250 transition count 209
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 878 place count 250 transition count 209
Applied a total of 878 rules in 168 ms. Remains 250 /719 variables (removed 469) and now considering 209/638 (removed 429) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 250/719 places, 209/638 transitions.
Incomplete random walk after 10000 steps, including 304 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 486012 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 486012 steps, saw 84882 distinct states, run finished after 3007 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-14 12:07:21] [INFO ] Flow matrix only has 208 transitions (discarded 1 similar events)
// Phase 1: matrix 208 rows 250 cols
[2023-03-14 12:07:21] [INFO ] Computed 89 place invariants in 8 ms
[2023-03-14 12:07:21] [INFO ] [Real]Absence check using 65 positive place invariants in 8 ms returned sat
[2023-03-14 12:07:21] [INFO ] [Real]Absence check using 65 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-14 12:07:21] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 12:07:21] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-14 12:07:21] [INFO ] [Nat]Absence check using 65 positive and 24 generalized place invariants in 5 ms returned sat
[2023-03-14 12:07:22] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 12:07:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-14 12:07:22] [INFO ] After 170ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-14 12:07:22] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2023-03-14 12:07:22] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 0 ms to minimize.
[2023-03-14 12:07:22] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2023-03-14 12:07:22] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 0 ms to minimize.
[2023-03-14 12:07:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 392 ms
[2023-03-14 12:07:22] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2023-03-14 12:07:22] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2023-03-14 12:07:23] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 1 ms to minimize.
[2023-03-14 12:07:23] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 2 ms to minimize.
[2023-03-14 12:07:23] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 0 ms to minimize.
[2023-03-14 12:07:23] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 0 ms to minimize.
[2023-03-14 12:07:23] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 0 ms to minimize.
[2023-03-14 12:07:23] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 0 ms to minimize.
[2023-03-14 12:07:23] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2023-03-14 12:07:23] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1016 ms
[2023-03-14 12:07:24] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2023-03-14 12:07:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-14 12:07:24] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 0 ms to minimize.
[2023-03-14 12:07:24] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 1 ms to minimize.
[2023-03-14 12:07:24] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 26 ms to minimize.
[2023-03-14 12:07:24] [INFO ] Deduced a trap composed of 57 places in 133 ms of which 0 ms to minimize.
[2023-03-14 12:07:24] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 1 ms to minimize.
[2023-03-14 12:07:24] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 1 ms to minimize.
[2023-03-14 12:07:25] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 1 ms to minimize.
[2023-03-14 12:07:25] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 1 ms to minimize.
[2023-03-14 12:07:25] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 0 ms to minimize.
[2023-03-14 12:07:25] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 0 ms to minimize.
[2023-03-14 12:07:25] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2023-03-14 12:07:26] [INFO ] Deduced a trap composed of 54 places in 558 ms of which 0 ms to minimize.
[2023-03-14 12:07:26] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 2 ms to minimize.
[2023-03-14 12:07:26] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 0 ms to minimize.
[2023-03-14 12:07:26] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 1 ms to minimize.
[2023-03-14 12:07:26] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 0 ms to minimize.
[2023-03-14 12:07:26] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 1 ms to minimize.
[2023-03-14 12:07:26] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2818 ms
[2023-03-14 12:07:26] [INFO ] After 4744ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-14 12:07:27] [INFO ] After 5275ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 89 ms.
Support contains 39 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 209/209 transitions.
Graph (complete) has 827 edges and 250 vertex of which 249 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 249 transition count 206
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 246 transition count 206
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 26 place count 235 transition count 197
Applied a total of 26 rules in 37 ms. Remains 235 /250 variables (removed 15) and now considering 197/209 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 235/250 places, 197/209 transitions.
Incomplete random walk after 10000 steps, including 355 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 306263 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 306263 steps, saw 58513 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-14 12:07:30] [INFO ] Flow matrix only has 196 transitions (discarded 1 similar events)
// Phase 1: matrix 196 rows 235 cols
[2023-03-14 12:07:30] [INFO ] Computed 86 place invariants in 21 ms
[2023-03-14 12:07:31] [INFO ] [Real]Absence check using 63 positive place invariants in 9 ms returned sat
[2023-03-14 12:07:31] [INFO ] [Real]Absence check using 63 positive and 23 generalized place invariants in 45 ms returned sat
[2023-03-14 12:07:31] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 12:07:31] [INFO ] [Nat]Absence check using 63 positive place invariants in 7 ms returned sat
[2023-03-14 12:07:31] [INFO ] [Nat]Absence check using 63 positive and 23 generalized place invariants in 17 ms returned sat
[2023-03-14 12:07:31] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 12:07:31] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-14 12:07:31] [INFO ] After 84ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 12:07:31] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2023-03-14 12:07:31] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 0 ms to minimize.
[2023-03-14 12:07:31] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2023-03-14 12:07:31] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2023-03-14 12:07:31] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2023-03-14 12:07:31] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2023-03-14 12:07:32] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2023-03-14 12:07:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 540 ms
[2023-03-14 12:07:32] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
[2023-03-14 12:07:32] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 1 ms to minimize.
[2023-03-14 12:07:32] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 0 ms to minimize.
[2023-03-14 12:07:32] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 0 ms to minimize.
[2023-03-14 12:07:32] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 0 ms to minimize.
[2023-03-14 12:07:32] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 1 ms to minimize.
[2023-03-14 12:07:32] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 5 ms to minimize.
[2023-03-14 12:07:32] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 0 ms to minimize.
[2023-03-14 12:07:32] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 0 ms to minimize.
[2023-03-14 12:07:33] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 1 ms to minimize.
[2023-03-14 12:07:33] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 0 ms to minimize.
[2023-03-14 12:07:33] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 1 ms to minimize.
[2023-03-14 12:07:33] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 1 ms to minimize.
[2023-03-14 12:07:33] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 0 ms to minimize.
[2023-03-14 12:07:33] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2023-03-14 12:07:33] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 1 ms to minimize.
[2023-03-14 12:07:33] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 0 ms to minimize.
[2023-03-14 12:07:33] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 0 ms to minimize.
[2023-03-14 12:07:33] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1893 ms
[2023-03-14 12:07:38] [INFO ] Deduced a trap composed of 51 places in 4274 ms of which 26 ms to minimize.
[2023-03-14 12:07:38] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 0 ms to minimize.
[2023-03-14 12:07:38] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
[2023-03-14 12:07:38] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 0 ms to minimize.
[2023-03-14 12:07:38] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 1 ms to minimize.
[2023-03-14 12:07:38] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 0 ms to minimize.
[2023-03-14 12:07:39] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 1 ms to minimize.
[2023-03-14 12:07:39] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2023-03-14 12:07:39] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 0 ms to minimize.
[2023-03-14 12:07:39] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 1 ms to minimize.
[2023-03-14 12:07:39] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 0 ms to minimize.
[2023-03-14 12:07:39] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2023-03-14 12:07:39] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2023-03-14 12:07:39] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5616 ms
[2023-03-14 12:07:39] [INFO ] After 8256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-14 12:07:39] [INFO ] After 8716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 83 ms.
Support contains 39 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 197/197 transitions.
Applied a total of 0 rules in 14 ms. Remains 235 /235 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 235/235 places, 197/197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 197/197 transitions.
Applied a total of 0 rules in 12 ms. Remains 235 /235 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2023-03-14 12:07:39] [INFO ] Flow matrix only has 196 transitions (discarded 1 similar events)
[2023-03-14 12:07:39] [INFO ] Invariant cache hit.
[2023-03-14 12:07:40] [INFO ] Implicit Places using invariants in 239 ms returned [17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 57, 185, 207]
Discarding 13 places :
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Implicit Place search using SMT only with invariants took 242 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 222/235 places, 194/197 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 218 transition count 178
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 218 transition count 178
Applied a total of 8 rules in 16 ms. Remains 218 /222 variables (removed 4) and now considering 178/194 (removed 16) transitions.
[2023-03-14 12:07:40] [INFO ] Flow matrix only has 177 transitions (discarded 1 similar events)
// Phase 1: matrix 177 rows 218 cols
[2023-03-14 12:07:40] [INFO ] Computed 76 place invariants in 2 ms
[2023-03-14 12:07:40] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-14 12:07:40] [INFO ] Flow matrix only has 177 transitions (discarded 1 similar events)
[2023-03-14 12:07:40] [INFO ] Invariant cache hit.
[2023-03-14 12:07:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-14 12:07:40] [INFO ] Implicit Places using invariants and state equation in 248 ms returned [48, 49, 50, 51, 52, 54, 55, 58, 62, 136, 138, 140, 142, 147, 151]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 493 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 203/235 places, 178/197 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 203 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 202 transition count 177
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 200 transition count 175
Applied a total of 6 rules in 27 ms. Remains 200 /203 variables (removed 3) and now considering 175/178 (removed 3) transitions.
[2023-03-14 12:07:40] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
// Phase 1: matrix 174 rows 200 cols
[2023-03-14 12:07:40] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-14 12:07:40] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-14 12:07:40] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
[2023-03-14 12:07:40] [INFO ] Invariant cache hit.
[2023-03-14 12:07:41] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-14 12:07:41] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 200/235 places, 175/197 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1422 ms. Remains : 200/235 places, 175/197 transitions.
Incomplete random walk after 10000 steps, including 348 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 354870 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 354870 steps, saw 70173 distinct states, run finished after 3014 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-14 12:07:44] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
[2023-03-14 12:07:44] [INFO ] Invariant cache hit.
[2023-03-14 12:07:44] [INFO ] [Real]Absence check using 51 positive place invariants in 11 ms returned sat
[2023-03-14 12:07:44] [INFO ] [Real]Absence check using 51 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-14 12:07:44] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 12:07:44] [INFO ] [Nat]Absence check using 51 positive place invariants in 17 ms returned sat
[2023-03-14 12:07:44] [INFO ] [Nat]Absence check using 51 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-14 12:07:44] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 12:07:44] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-14 12:07:45] [INFO ] After 56ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 12:07:45] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2023-03-14 12:07:45] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2023-03-14 12:07:45] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2023-03-14 12:07:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 260 ms
[2023-03-14 12:07:45] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 1 ms to minimize.
[2023-03-14 12:07:45] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 0 ms to minimize.
[2023-03-14 12:07:45] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 16 ms to minimize.
[2023-03-14 12:07:49] [INFO ] Deduced a trap composed of 49 places in 3495 ms of which 26 ms to minimize.
[2023-03-14 12:07:49] [INFO ] Deduced a trap composed of 52 places in 124 ms of which 0 ms to minimize.
[2023-03-14 12:07:49] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 0 ms to minimize.
[2023-03-14 12:07:49] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 0 ms to minimize.
[2023-03-14 12:07:49] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2023-03-14 12:07:49] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2023-03-14 12:07:49] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 1 ms to minimize.
[2023-03-14 12:07:49] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 0 ms to minimize.
[2023-03-14 12:07:49] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4598 ms
[2023-03-14 12:07:49] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2023-03-14 12:07:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-14 12:07:50] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 0 ms to minimize.
[2023-03-14 12:07:50] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 1 ms to minimize.
[2023-03-14 12:07:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2023-03-14 12:07:50] [INFO ] After 5277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-14 12:07:50] [INFO ] After 5628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 157 ms.
Support contains 39 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 175/175 transitions.
Applied a total of 0 rules in 19 ms. Remains 200 /200 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 200/200 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 175/175 transitions.
Applied a total of 0 rules in 7 ms. Remains 200 /200 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2023-03-14 12:07:50] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
[2023-03-14 12:07:50] [INFO ] Invariant cache hit.
[2023-03-14 12:07:50] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-14 12:07:50] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
[2023-03-14 12:07:50] [INFO ] Invariant cache hit.
[2023-03-14 12:07:51] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-14 12:07:51] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2023-03-14 12:07:51] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-14 12:07:51] [INFO ] Flow matrix only has 174 transitions (discarded 1 similar events)
[2023-03-14 12:07:51] [INFO ] Invariant cache hit.
[2023-03-14 12:07:51] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 728 ms. Remains : 200/200 places, 175/175 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 200 transition count 174
Applied a total of 1 rules in 7 ms. Remains 200 /200 variables (removed 0) and now considering 174/175 (removed 1) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 174 rows 200 cols
[2023-03-14 12:07:51] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-14 12:07:51] [INFO ] [Real]Absence check using 51 positive place invariants in 16 ms returned sat
[2023-03-14 12:07:51] [INFO ] [Real]Absence check using 51 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-14 12:07:51] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 12:07:51] [INFO ] [Nat]Absence check using 51 positive place invariants in 9 ms returned sat
[2023-03-14 12:07:51] [INFO ] [Nat]Absence check using 51 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-14 12:07:51] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 12:07:51] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2023-03-14 12:07:51] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 0 ms to minimize.
[2023-03-14 12:07:52] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2023-03-14 12:07:52] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2023-03-14 12:07:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 395 ms
[2023-03-14 12:07:52] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2023-03-14 12:07:52] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2023-03-14 12:07:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 308 ms
[2023-03-14 12:07:52] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 1 ms to minimize.
[2023-03-14 12:07:52] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 1 ms to minimize.
[2023-03-14 12:07:52] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 1 ms to minimize.
[2023-03-14 12:07:53] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 0 ms to minimize.
[2023-03-14 12:07:53] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 0 ms to minimize.
[2023-03-14 12:07:53] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 0 ms to minimize.
[2023-03-14 12:07:53] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 0 ms to minimize.
[2023-03-14 12:07:53] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 1 ms to minimize.
[2023-03-14 12:07:53] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 1 ms to minimize.
[2023-03-14 12:07:53] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 0 ms to minimize.
[2023-03-14 12:07:53] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2023-03-14 12:07:54] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 0 ms to minimize.
[2023-03-14 12:07:54] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2023-03-14 12:07:54] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1552 ms
[2023-03-14 12:07:54] [INFO ] After 2572ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-14 12:07:54] [INFO ] After 2778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-14 12:07:54] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 18 ms.
[2023-03-14 12:07:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 200 places, 175 transitions and 764 arcs took 7 ms.
[2023-03-14 12:07:54] [INFO ] Flatten gal took : 113 ms
Total runtime 64275 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 20
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 200 places, 175 transitions, 764 arcs.
Final Score: 3538.264
Took : 10 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678795686444

--------------------
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
ERROR in file model.sm near line 1146:
syntax error

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-20"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is BusinessProcesses-PT-20, 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 r043-tajo-167813697100607"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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