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-171620415000364.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-17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620415000364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 14K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 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 161K 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-17-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716651461735

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-17
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-25 15:37:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 15:37:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:37:43] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-25 15:37:43] [INFO ] Transformed 650 places.
[2024-05-25 15:37:43] [INFO ] Transformed 580 transitions.
[2024-05-25 15:37:43] [INFO ] Found NUPN structural information;
[2024-05-25 15:37:43] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 65 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 12) seen :5
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 12 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 11 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 576 rows 646 cols
[2024-05-25 15:37:44] [INFO ] Computed 108 invariants in 37 ms
[2024-05-25 15:37:45] [INFO ] After 386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-25 15:37:45] [INFO ] [Nat]Absence check using 62 positive place invariants in 35 ms returned sat
[2024-05-25 15:37:45] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 24 ms returned sat
[2024-05-25 15:37:46] [INFO ] After 1007ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-25 15:37:47] [INFO ] Deduced a trap composed of 29 places in 409 ms of which 8 ms to minimize.
[2024-05-25 15:37:47] [INFO ] Deduced a trap composed of 20 places in 332 ms of which 1 ms to minimize.
[2024-05-25 15:37:47] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 2 ms to minimize.
[2024-05-25 15:37:48] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 13 ms to minimize.
[2024-05-25 15:37:48] [INFO ] Deduced a trap composed of 133 places in 244 ms of which 14 ms to minimize.
[2024-05-25 15:37:48] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 1 ms to minimize.
[2024-05-25 15:37:49] [INFO ] Deduced a trap composed of 134 places in 273 ms of which 1 ms to minimize.
[2024-05-25 15:37:49] [INFO ] Deduced a trap composed of 20 places in 274 ms of which 1 ms to minimize.
[2024-05-25 15:37:49] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 0 ms to minimize.
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 30 places in 293 ms of which 1 ms to minimize.
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 1 ms to minimize.
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 0 ms to minimize.
[2024-05-25 15:37:50] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 1 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 4 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 30 places in 235 ms of which 1 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 119 places in 175 ms of which 2 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 27 places in 216 ms of which 1 ms to minimize.
[2024-05-25 15:37:51] [INFO ] Deduced a trap composed of 14 places in 262 ms of which 0 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 1 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 157 places in 228 ms of which 1 ms to minimize.
[2024-05-25 15:37:52] [INFO ] Deduced a trap composed of 17 places in 256 ms of which 1 ms to minimize.
[2024-05-25 15:37:53] [INFO ] Deduced a trap composed of 140 places in 231 ms of which 2 ms to minimize.
[2024-05-25 15:37:53] [INFO ] Deduced a trap composed of 143 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:37:53] [INFO ] Deduced a trap composed of 146 places in 164 ms of which 0 ms to minimize.
[2024-05-25 15:37:53] [INFO ] Deduced a trap composed of 154 places in 171 ms of which 1 ms to minimize.
[2024-05-25 15:37:53] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 1 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 0 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 0 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 1 ms to minimize.
[2024-05-25 15:37:54] [INFO ] Deduced a trap composed of 123 places in 251 ms of which 1 ms to minimize.
[2024-05-25 15:37:55] [INFO ] Deduced a trap composed of 30 places in 261 ms of which 1 ms to minimize.
[2024-05-25 15:37:55] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 1 ms to minimize.
[2024-05-25 15:37:55] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 1 ms to minimize.
[2024-05-25 15:37:55] [INFO ] Deduced a trap composed of 155 places in 263 ms of which 13 ms to minimize.
[2024-05-25 15:37:56] [INFO ] Deduced a trap composed of 142 places in 238 ms of which 1 ms to minimize.
[2024-05-25 15:37:56] [INFO ] Deduced a trap composed of 153 places in 211 ms of which 1 ms to minimize.
[2024-05-25 15:37:56] [INFO ] Deduced a trap composed of 157 places in 256 ms of which 2 ms to minimize.
[2024-05-25 15:37:56] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 1 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 0 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 1 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 1 ms to minimize.
[2024-05-25 15:37:57] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 14 ms to minimize.
[2024-05-25 15:37:58] [INFO ] Deduced a trap composed of 38 places in 235 ms of which 2 ms to minimize.
[2024-05-25 15:37:58] [INFO ] Deduced a trap composed of 132 places in 196 ms of which 1 ms to minimize.
[2024-05-25 15:37:58] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 0 ms to minimize.
[2024-05-25 15:37:58] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 1 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 48 places in 185 ms of which 0 ms to minimize.
[2024-05-25 15:37:59] [INFO ] Deduced a trap composed of 148 places in 236 ms of which 0 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 1 ms to minimize.
[2024-05-25 15:38:00] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 1 ms to minimize.
[2024-05-25 15:38:01] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 0 ms to minimize.
[2024-05-25 15:38:01] [INFO ] Deduced a trap composed of 141 places in 230 ms of which 1 ms to minimize.
[2024-05-25 15:38:01] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 0 ms to minimize.
[2024-05-25 15:38:01] [INFO ] Deduced a trap composed of 140 places in 319 ms of which 1 ms to minimize.
[2024-05-25 15:38:02] [INFO ] Deduced a trap composed of 138 places in 319 ms of which 1 ms to minimize.
[2024-05-25 15:38:02] [INFO ] Deduced a trap composed of 139 places in 229 ms of which 1 ms to minimize.
[2024-05-25 15:38:02] [INFO ] Deduced a trap composed of 150 places in 226 ms of which 0 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 1 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 136 places in 302 ms of which 0 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 146 places in 268 ms of which 1 ms to minimize.
[2024-05-25 15:38:03] [INFO ] Deduced a trap composed of 152 places in 196 ms of which 2 ms to minimize.
[2024-05-25 15:38:04] [INFO ] Deduced a trap composed of 140 places in 218 ms of which 1 ms to minimize.
[2024-05-25 15:38:04] [INFO ] Deduced a trap composed of 148 places in 245 ms of which 0 ms to minimize.
[2024-05-25 15:38:04] [INFO ] Deduced a trap composed of 138 places in 243 ms of which 1 ms to minimize.
[2024-05-25 15:38:05] [INFO ] Deduced a trap composed of 148 places in 232 ms of which 1 ms to minimize.
[2024-05-25 15:38:05] [INFO ] Deduced a trap composed of 150 places in 235 ms of which 1 ms to minimize.
[2024-05-25 15:38:05] [INFO ] Deduced a trap composed of 136 places in 201 ms of which 1 ms to minimize.
[2024-05-25 15:38:05] [INFO ] Deduced a trap composed of 146 places in 237 ms of which 0 ms to minimize.
[2024-05-25 15:38:06] [INFO ] Deduced a trap composed of 149 places in 228 ms of which 0 ms to minimize.
[2024-05-25 15:38:06] [INFO ] Deduced a trap composed of 136 places in 225 ms of which 1 ms to minimize.
[2024-05-25 15:38:06] [INFO ] Deduced a trap composed of 149 places in 220 ms of which 1 ms to minimize.
[2024-05-25 15:38:06] [INFO ] Deduced a trap composed of 150 places in 211 ms of which 0 ms to minimize.
[2024-05-25 15:38:07] [INFO ] Deduced a trap composed of 135 places in 208 ms of which 1 ms to minimize.
[2024-05-25 15:38:07] [INFO ] Deduced a trap composed of 146 places in 199 ms of which 1 ms to minimize.
[2024-05-25 15:38:07] [INFO ] Deduced a trap composed of 143 places in 228 ms of which 1 ms to minimize.
[2024-05-25 15:38:07] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 1 ms to minimize.
[2024-05-25 15:38:08] [INFO ] Deduced a trap composed of 141 places in 209 ms of which 0 ms to minimize.
[2024-05-25 15:38:08] [INFO ] Deduced a trap composed of 142 places in 232 ms of which 1 ms to minimize.
[2024-05-25 15:38:08] [INFO ] Deduced a trap composed of 151 places in 216 ms of which 0 ms to minimize.
[2024-05-25 15:38:08] [INFO ] Deduced a trap composed of 151 places in 206 ms of which 0 ms to minimize.
[2024-05-25 15:38:09] [INFO ] Deduced a trap composed of 152 places in 225 ms of which 1 ms to minimize.
[2024-05-25 15:38:09] [INFO ] Deduced a trap composed of 133 places in 193 ms of which 1 ms to minimize.
[2024-05-25 15:38:09] [INFO ] Deduced a trap composed of 139 places in 197 ms of which 1 ms to minimize.
[2024-05-25 15:38:09] [INFO ] Deduced a trap composed of 144 places in 196 ms of which 1 ms to minimize.
[2024-05-25 15:38:10] [INFO ] Deduced a trap composed of 134 places in 222 ms of which 1 ms to minimize.
[2024-05-25 15:38:10] [INFO ] Deduced a trap composed of 147 places in 223 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: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:38:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-25 15:38:10] [INFO ] After 25143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 47 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 576/576 transitions.
Graph (trivial) has 321 edges and 646 vertex of which 7 / 646 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1304 edges and 640 vertex of which 636 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 116 place count 636 transition count 453
Reduce places removed 114 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 126 rules applied. Total rules applied 242 place count 522 transition count 441
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 254 place count 510 transition count 441
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 254 place count 510 transition count 351
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 448 place count 406 transition count 351
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 514 place count 340 transition count 285
Iterating global reduction 3 with 66 rules applied. Total rules applied 580 place count 340 transition count 285
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 580 place count 340 transition count 280
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 590 place count 335 transition count 280
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 177 rules applied. Total rules applied 767 place count 245 transition count 193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 769 place count 244 transition count 197
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 771 place count 244 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 773 place count 242 transition count 195
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 778 place count 242 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 779 place count 241 transition count 194
Applied a total of 779 rules in 165 ms. Remains 241 /646 variables (removed 405) and now considering 194/576 (removed 382) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 241/646 places, 194/576 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :3
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 194 rows 241 cols
[2024-05-25 15:38:10] [INFO ] Computed 88 invariants in 11 ms
[2024-05-25 15:38:10] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 15:38:10] [INFO ] [Nat]Absence check using 59 positive place invariants in 16 ms returned sat
[2024-05-25 15:38:10] [INFO ] [Nat]Absence check using 59 positive and 29 generalized place invariants in 11 ms returned sat
[2024-05-25 15:38:11] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 15:38:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 15:38:11] [INFO ] After 27ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 15:38:11] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2024-05-25 15:38:11] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-05-25 15:38:11] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-25 15:38:11] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-25 15:38:11] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-25 15:38:11] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-05-25 15:38:11] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:38:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 666 ms
[2024-05-25 15:38:11] [INFO ] After 724ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-05-25 15:38:11] [INFO ] After 906ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 28229 ms.
starting LoLA
BK_INPUT BusinessProcesses-PT-17
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
ReachabilityCardinality

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-2024-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716651494616

--------------------
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 ReachabilityCardinality -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/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/ReachabilityCardinality.xml
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: 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: 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: 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: Rule S: 4 transitions removed,4 places removed
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 # 53 (type EXCL) for 3 BusinessProcesses-PT-17-ReachabilityCardinality-2024-01
lola: time limit : 224 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 49 (type FNDP) for 3 BusinessProcesses-PT-17-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type EQUN) for 3 BusinessProcesses-PT-17-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 52 (type SRCH) for 3 BusinessProcesses-PT-17-ReachabilityCardinality-2024-01
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: FINISHED task # 52 (type SRCH) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-01
lola: result : true
lola: markings : 47
lola: fired transitions : 46
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 49 (type FNDP) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-01 (obsolete)
lola: CANCELED task # 50 (type EQUN) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-01 (obsolete)
lola: CANCELED task # 53 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-01 (obsolete)
lola: LAUNCH task # 59 (type EXCL) for 33 BusinessProcesses-PT-17-ReachabilityCardinality-2024-11
lola: time limit : 239 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 55 (type FNDP) for 33 BusinessProcesses-PT-17-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 56 (type EQUN) for 33 BusinessProcesses-PT-17-ReachabilityCardinality-2024-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 58 (type SRCH) for 33 BusinessProcesses-PT-17-ReachabilityCardinality-2024-11
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: FINISHED task # 55 (type FNDP) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-11
lola: result : true
lola: fired transitions : 3
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 56 (type EQUN) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-11 (obsolete)
lola: CANCELED task # 58 (type SRCH) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-11 (obsolete)
lola: CANCELED task # 59 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-11 (obsolete)
lola: LAUNCH task # 65 (type EXCL) for 21 BusinessProcesses-PT-17-ReachabilityCardinality-2024-07
lola: time limit : 327 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 61 (type FNDP) for 21 BusinessProcesses-PT-17-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 62 (type EQUN) for 21 BusinessProcesses-PT-17-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 64 (type SRCH) for 21 BusinessProcesses-PT-17-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 49 (type FNDP) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-01
lola: result : true
lola: fired transitions : 50
lola: tried executions : 9
lola: time used : 0.000000
lola: memory pages used : 0
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: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: 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: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
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: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
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-56.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-62.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-50.sara.
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: 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: 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: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: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: 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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 65 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-07
lola: result : false
lola: markings : 11449
lola: fired transitions : 14561
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 61 (type FNDP) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 62 (type EQUN) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 64 (type SRCH) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-07 (obsolete)
lola: LAUNCH task # 146 (type EXCL) for 0 BusinessProcesses-PT-17-ReachabilityCardinality-2024-00
lola: time limit : 276 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 89 (type FNDP) for 9 BusinessProcesses-PT-17-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 90 (type EQUN) for 9 BusinessProcesses-PT-17-ReachabilityCardinality-2024-03
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 # 92 (type SRCH) for 9 BusinessProcesses-PT-17-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 61 (type FNDP) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-07
lola: result : unknown
lola: fired transitions : 10251
lola: tried executions : 739
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 62 (type EQUN) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-07
lola: result : unknown
lola: FINISHED task # 146 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-00
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 86 (type EXCL) for 15 BusinessProcesses-PT-17-ReachabilityCardinality-2024-05
lola: time limit : 299 sec
lola: memory limit: 32 pages
lola: FINISHED task # 50 (type EQUN) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-01
lola: result : true
lola: FINISHED task # 86 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-05
lola: result : true
lola: markings : 143
lola: fired transitions : 145
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 117 (type EXCL) for 36 BusinessProcesses-PT-17-ReachabilityCardinality-2024-12
lola: time limit : 327 sec
lola: memory limit: 32 pages
sara: try reading problem file /home/mcc/execution/ReachabilityCardinality-90.sara.
lola: FINISHED task # 117 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-12
lola: result : true
lola: markings : 345
lola: fired transitions : 379
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 137 (type EXCL) for 45 BusinessProcesses-PT-17-ReachabilityCardinality-2024-15
lola: time limit : 359 sec
lola: memory limit: 32 pages
lola: FINISHED task # 137 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-15
lola: result : true
lola: markings : 18
lola: fired transitions : 17
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 126 (type EXCL) for 39 BusinessProcesses-PT-17-ReachabilityCardinality-2024-13
lola: time limit : 399 sec
lola: memory limit: 32 pages
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 126 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-13
lola: result : true
lola: markings : 86
lola: fired transitions : 86
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 132 (type EXCL) for 6 BusinessProcesses-PT-17-ReachabilityCardinality-2024-02
lola: time limit : 449 sec
lola: memory limit: 32 pages
lola: FINISHED task # 132 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-02
lola: result : true
lola: markings : 5
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 143 (type EXCL) for 18 BusinessProcesses-PT-17-ReachabilityCardinality-2024-06
lola: time limit : 514 sec
lola: memory limit: 32 pages
lola: FINISHED task # 143 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-06
lola: result : false
lola: markings : 7647
lola: fired transitions : 8932
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 105 (type EXCL) for 42 BusinessProcesses-PT-17-ReachabilityCardinality-2024-14
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 105 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-14
lola: result : false
lola: markings : 7527
lola: fired transitions : 9288
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 122 (type EXCL) for 27 BusinessProcesses-PT-17-ReachabilityCardinality-2024-09
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: FINISHED task # 122 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-09
lola: result : false
lola: markings : 22469
lola: fired transitions : 28880
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 139 (type EXCL) for 24 BusinessProcesses-PT-17-ReachabilityCardinality-2024-08
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: FINISHED task # 139 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-08
lola: result : false
lola: markings : 27934
lola: fired transitions : 37550
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 83 (type EXCL) for 30 BusinessProcesses-PT-17-ReachabilityCardinality-2024-10
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 83 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-10
lola: result : true
lola: markings : 12119
lola: fired transitions : 16079
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 151 (type EXCL) for 12 BusinessProcesses-PT-17-ReachabilityCardinality-2024-04
lola: time limit : 1798 sec
lola: memory limit: 32 pages
lola: FINISHED task # 151 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-04
lola: result : false
lola: markings : 29237
lola: fired transitions : 38167
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 93 (type EXCL) for 9 BusinessProcesses-PT-17-ReachabilityCardinality-2024-03
lola: time limit : 3597 sec
lola: memory limit: 32 pages
lola: FINISHED task # 93 (type EXCL) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-03
lola: result : false
lola: markings : 61553
lola: fired transitions : 73698
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 89 (type FNDP) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 90 (type EQUN) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 92 (type SRCH) for BusinessProcesses-PT-17-ReachabilityCardinality-2024-03 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-17-ReachabilityCardinality-2024-00: AG false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-2024-01: AG false tandem / insertion
BusinessProcesses-PT-17-ReachabilityCardinality-2024-02: AG false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-2024-03: AG true tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-2024-04: EF false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-2024-05: AG false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-2024-06: AG true tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-2024-07: EF false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-2024-08: EF false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-2024-09: EF false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-2024-10: EF true tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-2024-11: EF true findpath
BusinessProcesses-PT-17-ReachabilityCardinality-2024-12: AG false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-2024-13: AG false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-2024-14: EF false tandem / relaxed
BusinessProcesses-PT-17-ReachabilityCardinality-2024-15: AG false tandem / relaxed


Time elapsed: 3 secs. Pages in use: 4

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-17"
export BK_EXAMINATION="ReachabilityCardinality"
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-17, examination is ReachabilityCardinality"
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-171620415000364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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