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-167813697100606.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697100606
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678795583419

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=ReachabilityCardinality
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:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 12:06:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 12:06:25] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-14 12:06:25] [INFO ] Transformed 782 places.
[2023-03-14 12:06:25] [INFO ] Transformed 697 transitions.
[2023-03-14 12:06:25] [INFO ] Found NUPN structural information;
[2023-03-14 12:06:25] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 15 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 50 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 9) seen :3
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 638 rows 719 cols
[2023-03-14 12:06:26] [INFO ] Computed 121 place invariants in 33 ms
[2023-03-14 12:06:26] [INFO ] [Real]Absence check using 78 positive place invariants in 23 ms returned sat
[2023-03-14 12:06:26] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 11 ms returned sat
[2023-03-14 12:06:26] [INFO ] After 405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 12:06:26] [INFO ] [Nat]Absence check using 78 positive place invariants in 22 ms returned sat
[2023-03-14 12:06:26] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 10 ms returned sat
[2023-03-14 12:06:27] [INFO ] After 605ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-14 12:06:27] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 5 ms to minimize.
[2023-03-14 12:06:27] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 2 ms to minimize.
[2023-03-14 12:06:28] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 2 ms to minimize.
[2023-03-14 12:06:28] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 1 ms to minimize.
[2023-03-14 12:06:28] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 15 ms to minimize.
[2023-03-14 12:06:29] [INFO ] Deduced a trap composed of 132 places in 178 ms of which 1 ms to minimize.
[2023-03-14 12:06:29] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 1 ms to minimize.
[2023-03-14 12:06:29] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 1 ms to minimize.
[2023-03-14 12:06:29] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 0 ms to minimize.
[2023-03-14 12:06:30] [INFO ] Deduced a trap composed of 28 places in 257 ms of which 1 ms to minimize.
[2023-03-14 12:06:30] [INFO ] Deduced a trap composed of 29 places in 261 ms of which 1 ms to minimize.
[2023-03-14 12:06:30] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 0 ms to minimize.
[2023-03-14 12:06:30] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2023-03-14 12:06:30] [INFO ] Deduced a trap composed of 134 places in 243 ms of which 1 ms to minimize.
[2023-03-14 12:06:31] [INFO ] Deduced a trap composed of 127 places in 244 ms of which 1 ms to minimize.
[2023-03-14 12:06:31] [INFO ] Deduced a trap composed of 130 places in 218 ms of which 1 ms to minimize.
[2023-03-14 12:06:31] [INFO ] Deduced a trap composed of 129 places in 176 ms of which 2 ms to minimize.
[2023-03-14 12:06:31] [INFO ] Deduced a trap composed of 127 places in 147 ms of which 0 ms to minimize.
[2023-03-14 12:06:32] [INFO ] Deduced a trap composed of 129 places in 178 ms of which 0 ms to minimize.
[2023-03-14 12:06:32] [INFO ] Deduced a trap composed of 124 places in 174 ms of which 1 ms to minimize.
[2023-03-14 12:06:32] [INFO ] Deduced a trap composed of 124 places in 184 ms of which 0 ms to minimize.
[2023-03-14 12:06:32] [INFO ] Deduced a trap composed of 130 places in 214 ms of which 1 ms to minimize.
[2023-03-14 12:06:33] [INFO ] Deduced a trap composed of 131 places in 223 ms of which 0 ms to minimize.
[2023-03-14 12:06:33] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 1 ms to minimize.
[2023-03-14 12:06:33] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 1 ms to minimize.
[2023-03-14 12:06:33] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 1 ms to minimize.
[2023-03-14 12:06:33] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2023-03-14 12:06:34] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 1 ms to minimize.
[2023-03-14 12:06:34] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 1 ms to minimize.
[2023-03-14 12:06:34] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 0 ms to minimize.
[2023-03-14 12:06:34] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 0 ms to minimize.
[2023-03-14 12:06:34] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 0 ms to minimize.
[2023-03-14 12:06:34] [INFO ] Deduced a trap composed of 28 places in 117 ms of which 0 ms to minimize.
[2023-03-14 12:06:35] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 4 ms to minimize.
[2023-03-14 12:06:35] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 7698 ms
[2023-03-14 12:06:35] [INFO ] Deduced a trap composed of 159 places in 185 ms of which 1 ms to minimize.
[2023-03-14 12:06:35] [INFO ] Deduced a trap composed of 167 places in 169 ms of which 1 ms to minimize.
[2023-03-14 12:06:35] [INFO ] Deduced a trap composed of 154 places in 150 ms of which 0 ms to minimize.
[2023-03-14 12:06:36] [INFO ] Deduced a trap composed of 168 places in 177 ms of which 1 ms to minimize.
[2023-03-14 12:06:36] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 1 ms to minimize.
[2023-03-14 12:06:36] [INFO ] Deduced a trap composed of 157 places in 183 ms of which 2 ms to minimize.
[2023-03-14 12:06:36] [INFO ] Deduced a trap composed of 157 places in 188 ms of which 0 ms to minimize.
[2023-03-14 12:06:36] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2023-03-14 12:06:37] [INFO ] Deduced a trap composed of 185 places in 149 ms of which 1 ms to minimize.
[2023-03-14 12:06:37] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 1 ms to minimize.
[2023-03-14 12:06:37] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 0 ms to minimize.
[2023-03-14 12:06:37] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 0 ms to minimize.
[2023-03-14 12:06:37] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 0 ms to minimize.
[2023-03-14 12:06:37] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2023-03-14 12:06:37] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 0 ms to minimize.
[2023-03-14 12:06:37] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2023-03-14 12:06:37] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2645 ms
[2023-03-14 12:06:38] [INFO ] Deduced a trap composed of 146 places in 239 ms of which 1 ms to minimize.
[2023-03-14 12:06:38] [INFO ] Deduced a trap composed of 51 places in 224 ms of which 0 ms to minimize.
[2023-03-14 12:06:38] [INFO ] Deduced a trap composed of 154 places in 232 ms of which 1 ms to minimize.
[2023-03-14 12:06:39] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 1 ms to minimize.
[2023-03-14 12:06:39] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 0 ms to minimize.
[2023-03-14 12:06:39] [INFO ] Deduced a trap composed of 144 places in 243 ms of which 1 ms to minimize.
[2023-03-14 12:06:40] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 0 ms to minimize.
[2023-03-14 12:06:40] [INFO ] Deduced a trap composed of 57 places in 225 ms of which 1 ms to minimize.
[2023-03-14 12:06:40] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 1 ms to minimize.
[2023-03-14 12:06:41] [INFO ] Deduced a trap composed of 163 places in 233 ms of which 0 ms to minimize.
[2023-03-14 12:06:41] [INFO ] Deduced a trap composed of 38 places in 227 ms of which 0 ms to minimize.
[2023-03-14 12:06:41] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2023-03-14 12:06:42] [INFO ] Deduced a trap composed of 169 places in 233 ms of which 1 ms to minimize.
[2023-03-14 12:06:42] [INFO ] Deduced a trap composed of 158 places in 234 ms of which 2 ms to minimize.
[2023-03-14 12:06:42] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 0 ms to minimize.
[2023-03-14 12:06:43] [INFO ] Deduced a trap composed of 165 places in 240 ms of which 0 ms to minimize.
[2023-03-14 12:06:43] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 1 ms to minimize.
[2023-03-14 12:06:43] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 1 ms to minimize.
[2023-03-14 12:06:44] [INFO ] Deduced a trap composed of 56 places in 232 ms of which 3 ms to minimize.
[2023-03-14 12:06:44] [INFO ] Deduced a trap composed of 161 places in 217 ms of which 3 ms to minimize.
[2023-03-14 12:06:44] [INFO ] Deduced a trap composed of 167 places in 217 ms of which 0 ms to minimize.
[2023-03-14 12:06:45] [INFO ] Deduced a trap composed of 59 places in 225 ms of which 0 ms to minimize.
[2023-03-14 12:06:45] [INFO ] Deduced a trap composed of 61 places in 215 ms of which 1 ms to minimize.
[2023-03-14 12:06:45] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 1 ms to minimize.
[2023-03-14 12:06:45] [INFO ] Deduced a trap composed of 81 places in 180 ms of which 1 ms to minimize.
[2023-03-14 12:06:46] [INFO ] Deduced a trap composed of 156 places in 212 ms of which 0 ms to minimize.
[2023-03-14 12:06:46] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 1 ms to minimize.
[2023-03-14 12:06:46] [INFO ] Deduced a trap composed of 150 places in 221 ms of which 0 ms to minimize.
[2023-03-14 12:06:46] [INFO ] Deduced a trap composed of 84 places in 178 ms of which 1 ms to minimize.
[2023-03-14 12:06:47] [INFO ] Deduced a trap composed of 55 places in 230 ms of which 1 ms to minimize.
[2023-03-14 12:06:47] [INFO ] Deduced a trap composed of 52 places in 244 ms of which 0 ms to minimize.
[2023-03-14 12:06:47] [INFO ] Deduced a trap composed of 80 places in 212 ms of which 1 ms to minimize.
[2023-03-14 12:06:48] [INFO ] Deduced a trap composed of 155 places in 215 ms of which 0 ms to minimize.
[2023-03-14 12:06:48] [INFO ] Deduced a trap composed of 86 places in 204 ms of which 1 ms to minimize.
[2023-03-14 12:06:48] [INFO ] Deduced a trap composed of 78 places in 197 ms of which 1 ms to minimize.
[2023-03-14 12:06:48] [INFO ] Deduced a trap composed of 56 places in 210 ms of which 1 ms to minimize.
[2023-03-14 12:06:49] [INFO ] Deduced a trap composed of 52 places in 209 ms of which 1 ms to minimize.
[2023-03-14 12:06:49] [INFO ] Deduced a trap composed of 149 places in 179 ms of which 1 ms to minimize.
[2023-03-14 12:06:49] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 1 ms to minimize.
[2023-03-14 12:06:49] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 1 ms to minimize.
[2023-03-14 12:06:50] [INFO ] Deduced a trap composed of 78 places in 224 ms of which 1 ms to minimize.
[2023-03-14 12:06:50] [INFO ] Deduced a trap composed of 54 places in 218 ms of which 1 ms to minimize.
[2023-03-14 12:06:50] [INFO ] Deduced a trap composed of 151 places in 207 ms of which 1 ms to minimize.
[2023-03-14 12:06:51] [INFO ] Deduced a trap composed of 150 places in 202 ms of which 1 ms to minimize.
[2023-03-14 12:06:51] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 0 ms to minimize.
[2023-03-14 12:06:51] [INFO ] Deduced a trap composed of 153 places in 175 ms of which 1 ms to minimize.
[2023-03-14 12:06:51] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 13505 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
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:06:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-14 12:06:51] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 160 ms.
Support contains 59 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (trivial) has 350 edges and 719 vertex of which 7 / 719 are part of one of the 1 SCC in 13 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1410 edges and 713 vertex of which 692 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Discarding 21 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 126 place count 692 transition count 498
Reduce places removed 124 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 144 rules applied. Total rules applied 270 place count 568 transition count 478
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 290 place count 548 transition count 478
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 290 place count 548 transition count 385
Deduced a syphon composed of 93 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 493 place count 438 transition count 385
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 561 place count 370 transition count 317
Iterating global reduction 3 with 68 rules applied. Total rules applied 629 place count 370 transition count 317
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 629 place count 370 transition count 313
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 638 place count 365 transition count 313
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 820 place count 274 transition count 222
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 823 place count 274 transition count 219
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 826 place count 271 transition count 219
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 830 place count 271 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 831 place count 270 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 832 place count 269 transition count 218
Applied a total of 832 rules in 180 ms. Remains 269 /719 variables (removed 450) and now considering 218/638 (removed 420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 269/719 places, 218/638 transitions.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 6) seen :4
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 218 rows 269 cols
[2023-03-14 12:06:52] [INFO ] Computed 89 place invariants in 6 ms
[2023-03-14 12:06:52] [INFO ] [Real]Absence check using 65 positive place invariants in 17 ms returned sat
[2023-03-14 12:06:52] [INFO ] [Real]Absence check using 65 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-14 12:06:52] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 12:06:52] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-14 12:06:52] [INFO ] [Nat]Absence check using 65 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-14 12:06:52] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 12:06:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 12:06:52] [INFO ] After 24ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 12:06:52] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 1 ms to minimize.
[2023-03-14 12:06:52] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 4 ms to minimize.
[2023-03-14 12:06:52] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 1 ms to minimize.
[2023-03-14 12:06:53] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2023-03-14 12:06:53] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 0 ms to minimize.
[2023-03-14 12:06:53] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2023-03-14 12:06:53] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 1 ms to minimize.
[2023-03-14 12:06:53] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 0 ms to minimize.
[2023-03-14 12:06:53] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2023-03-14 12:06:53] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2023-03-14 12:06:53] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 0 ms to minimize.
[2023-03-14 12:06:53] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 0 ms to minimize.
[2023-03-14 12:06:53] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2023-03-14 12:06:53] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2023-03-14 12:06:54] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 0 ms to minimize.
[2023-03-14 12:06:54] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2023-03-14 12:06:54] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2023-03-14 12:06:54] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 0 ms to minimize.
[2023-03-14 12:06:54] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2023-03-14 12:06:54] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 0 ms to minimize.
[2023-03-14 12:06:54] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 0 ms to minimize.
[2023-03-14 12:06:54] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2023-03-14 12:06:54] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2023-03-14 12:06:54] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 0 ms to minimize.
[2023-03-14 12:06:55] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 1 ms to minimize.
[2023-03-14 12:06:55] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 0 ms to minimize.
[2023-03-14 12:06:55] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2023-03-14 12:06:55] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2023-03-14 12:06:55] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2611 ms
[2023-03-14 12:06:55] [INFO ] After 2683ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-14 12:06:55] [INFO ] After 2955ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 14 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 218/218 transitions.
Graph (complete) has 816 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 268 transition count 204
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 255 transition count 204
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 255 transition count 193
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 54 place count 239 transition count 193
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 61 place count 232 transition count 186
Iterating global reduction 2 with 7 rules applied. Total rules applied 68 place count 232 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 68 place count 232 transition count 185
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 231 transition count 185
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 128 place count 201 transition count 157
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 200 transition count 160
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 200 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 199 transition count 159
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 199 transition count 159
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 197 transition count 157
Applied a total of 135 rules in 81 ms. Remains 197 /269 variables (removed 72) and now considering 157/218 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 197/269 places, 157/218 transitions.
Incomplete random walk after 10000 steps, including 337 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 532779 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 532779 steps, saw 203371 distinct states, run finished after 3003 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 12:06:58] [INFO ] Flow matrix only has 156 transitions (discarded 1 similar events)
// Phase 1: matrix 156 rows 197 cols
[2023-03-14 12:06:58] [INFO ] Computed 82 place invariants in 8 ms
[2023-03-14 12:06:58] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-14 12:06:58] [INFO ] [Real]Absence check using 65 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-14 12:06:58] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 12:06:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 9 ms returned sat
[2023-03-14 12:06:58] [INFO ] [Nat]Absence check using 65 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-14 12:06:58] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 12:06:58] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-14 12:06:58] [INFO ] After 25ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 12:06:58] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2023-03-14 12:06:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-14 12:06:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-14 12:06:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-14 12:06:59] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-14 12:06:59] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 14 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 157/157 transitions.
Applied a total of 0 rules in 7 ms. Remains 197 /197 variables (removed 0) and now considering 157/157 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 197/197 places, 157/157 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 157/157 transitions.
Applied a total of 0 rules in 6 ms. Remains 197 /197 variables (removed 0) and now considering 157/157 (removed 0) transitions.
[2023-03-14 12:06:59] [INFO ] Flow matrix only has 156 transitions (discarded 1 similar events)
[2023-03-14 12:06:59] [INFO ] Invariant cache hit.
[2023-03-14 12:06:59] [INFO ] Implicit Places using invariants in 142 ms returned [9, 11, 13, 15, 17, 19, 21, 23, 25, 32, 37, 38, 40, 41, 42, 43, 44, 45, 46, 50, 51, 52, 53, 54, 55, 56, 60, 61, 62, 169]
Discarding 30 places :
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Implicit Place search using SMT only with invariants took 146 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 167/197 places, 154/157 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 161 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 161 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 160 transition count 135
Applied a total of 14 rules in 11 ms. Remains 160 /167 variables (removed 7) and now considering 135/154 (removed 19) transitions.
[2023-03-14 12:06:59] [INFO ] Flow matrix only has 134 transitions (discarded 1 similar events)
// Phase 1: matrix 134 rows 160 cols
[2023-03-14 12:06:59] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-14 12:06:59] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-14 12:06:59] [INFO ] Flow matrix only has 134 transitions (discarded 1 similar events)
[2023-03-14 12:06:59] [INFO ] Invariant cache hit.
[2023-03-14 12:06:59] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-14 12:06:59] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [14, 93, 95, 97, 99, 102, 103, 105]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 271 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 152/197 places, 135/157 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 152 transition count 132
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 149 transition count 132
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 10 place count 147 transition count 130
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 147 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 145 transition count 128
Applied a total of 14 rules in 13 ms. Remains 145 /152 variables (removed 7) and now considering 128/135 (removed 7) transitions.
[2023-03-14 12:06:59] [INFO ] Flow matrix only has 127 transitions (discarded 1 similar events)
// Phase 1: matrix 127 rows 145 cols
[2023-03-14 12:06:59] [INFO ] Computed 47 place invariants in 2 ms
[2023-03-14 12:06:59] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-14 12:06:59] [INFO ] Flow matrix only has 127 transitions (discarded 1 similar events)
[2023-03-14 12:06:59] [INFO ] Invariant cache hit.
[2023-03-14 12:06:59] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-14 12:06:59] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 145/197 places, 128/157 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 687 ms. Remains : 145/197 places, 128/157 transitions.
Incomplete random walk after 10000 steps, including 335 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 2730 steps, including 19 resets, run visited all 1 properties in 5 ms. (steps per millisecond=546 )
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 34952 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 20
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 782 places, 697 transitions, 2011 arcs.
Final Score: 51460.652
Took : 26 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BusinessProcesses-PT-20-ReachabilityCardinality-00 (reachable & potential(( ( 1 ) <= (tk(P33)) )))
PROPERTY: BusinessProcesses-PT-20-ReachabilityCardinality-01 (reachable &!potential( ( ( ( (tk(P398)) <= ( 1 ) ) | (! ( (tk(P28)) <= (tk(P670)) )) ) | ( ( 1 ) <= (tk(P493)) ) )))
PROPERTY: BusinessProcesses-PT-20-ReachabilityCardinality-02 (reachable &!potential( ( (! ( (! ( (tk(P578)) <= (tk(P710)) )) & ( ( ( 1 ) <= (tk(P218)) ) & ( (! ( ( ( ( 1 ) <= (tk(P547)) ) & ( (tk(P598)) <= (tk(P317)) ) ) & ( (tk(P480)) <= (tk(P194)) ) )) | ( ( ( ( 1 ) <= (tk(P713)) ) & ( (tk(P594)) <= ( 0 ) ) ) | ( ( ( 1 ) <= (tk(P286)) ) & ( (! ( ( 1 ) <= (tk(P619)) )) | ( ( (tk(P333)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P547)) ) ) ) ) ) ) ) )) | ( (tk(P316)) <= ( 0 ) ) )))
PROPERTY: BusinessProcesses-PT-20-ReachabilityCardinality-03 (reachable & potential(( (! ( (tk(P120)) <= (tk(P778)) )) & ( ( 1 ) <= (tk(P605)) ) )))
PROPERTY: BusinessProcesses-PT-20-ReachabilityCardinality-04 (reachable &!potential( (! ( ( ( ( (tk(P265)) <= (tk(P7)) ) | (! ( ( ( (! ( (tk(P197)) <= ( 1 ) )) | (! ( (tk(P112)) <= (tk(P497)) )) ) | ( ( ( (tk(P646)) <= (tk(P564)) ) | ( (tk(P113)) <= ( 0 ) ) ) | (! ( (tk(P658)) <= ( 1 ) )) ) ) & ( ( (! ( (tk(P672)) <= (tk(P703)) )) | (! ( (tk(P781)) <= (tk(P181)) )) ) & (! ( (tk(P50)) <= (tk(P462)) )) ) )) ) & ( ( 1 ) <= (tk(P191)) ) ) | ( (! ( ( ( ( ( ( ( 1 ) <= (tk(P592)) ) | ( ( 1 ) <= (tk(P580)) ) ) & ( ( (tk(P274)) <= ( 0 ) ) | ( (tk(P755)) <= (tk(P514)) ) ) ) | (! ( (tk(P323)) <= (tk(P44)) )) ) | ( ( 1 ) <= (tk(P518)) ) ) | (! ( ( 1 ) <= (tk(P457)) )) )) & ( (tk(P591)) <= ( 1 ) ) ) ))))
PROPERTY: BusinessProcesses-PT-20-ReachabilityCardinality-05 (reachable &!potential( ( ( ( (tk(P429)) <= (tk(P234)) ) & (! ( ( ( (! ( ( ( (tk(P388)) <= ( 1 ) ) | ( (tk(P428)) <= (tk(P584)) ) ) | ( ( (tk(P89)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P450)) ) ) )) | ( ( ( ( 1 ) <= (tk(P555)) ) | ( ( 1 ) <= (tk(P8)) ) ) & ( (tk(P58)) <= (tk(P59)) ) ) ) | ( (tk(P515)) <= (tk(P269)) ) ) | ( ( 1 ) <= (tk(P684)) ) )) ) | ( ( (! ( ( ( ( (tk(P415)) <= (tk(P375)) ) | ( ( ( 1 ) <= (tk(P194)) ) & ( ( (tk(P408)) <= (tk(P362)) ) & ( ( 1 ) <= (tk(P752)) ) ) ) ) | ( (! ( ( 1 ) <= (tk(P776)) )) & ( ( 1 ) <= (tk(P346)) ) ) ) & ( ( ( ( 1 ) <= (tk(P673)) ) | ( ( 1 ) <= (tk(P186)) ) ) & ( ( (! ( (tk(P447)) <= ( 1 ) )) | (! ( (tk(P339)) <= ( 0 ) )) ) & ( ( 1 ) <= (tk(P626)) ) ) ) )) | (! ( ( ( (tk(P168)) <= (tk(P409)) ) | ( ( ( (tk(P612)) <= (tk(P316)) ) | ( (tk(P207)) <= (tk(P307)) ) ) | ( ( (tk(P23)) <= (tk(P170)) ) | ( (tk(P64)) <= ( 0 ) ) ) ) ) & ( ( 1 ) <= (tk(P525)) ) )) ) & ( (! ( (! ( ( 1 ) <= (tk(P35)) )) & ( (! ( ( ( 1 ) <= (tk(P603)) ) | ( (tk(P162)) <= ( 0 ) ) )) | (! ( ( 1 ) <= (tk(P47)) )) ) )) | ( (tk(P595)) <= (tk(P671)) ) ) ) )))
PROPERTY: BusinessProcesses-PT-20-ReachabilityCardinality-06 (reachable &!potential( ( (tk(P21)) <= ( 1 ) )))
PROPERTY: BusinessProcesses-PT-20-ReachabilityCardinality-07 (reachable & potential(( ( ( (tk(P251)) <= (tk(P454)) ) & ( ( 1 ) <= (tk(P638)) ) ) & (! ( (tk(P444)) <= ( 1 ) )) )))
PROPERTY: BusinessProcesses-PT-20-ReachabilityCardinality-08 (reachable &!potential( ( ( (tk(P350)) <= ( 1 ) ) | ( ( ( (! ( (! ( ( ( ( 1 ) <= (tk(P307)) ) & ( ( 1 ) <= (tk(P747)) ) ) & ( ( (tk(P99)) <= ( 1 ) ) | ( (tk(P102)) <= ( 0 ) ) ) )) | ( ( ( ( (tk(P748)) <= (tk(P334)) ) | ( ( 1 ) <= (tk(P31)) ) ) & (! ( ( 1 ) <= (tk(P695)) )) ) & ( (tk(P416)) <= (tk(P3)) ) ) )) | ( ( (! ( (tk(P756)) <= (tk(P424)) )) & (! ( ( ( (tk(P193)) <= (tk(P605)) ) & ( (tk(P722)) <= ( 1 ) ) ) | (! ( ( 1 ) <= (tk(P120)) )) )) ) & ( ( ( ( ( (tk(P23)) <= ( 0 ) ) & ( (tk(P183)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P484)) ) | ( (tk(P703)) <= (tk(P709)) ) ) ) | (! ( ( (tk(P186)) <= (tk(P65)) ) & ( (tk(P757)) <= (tk(P592)) ) )) ) & (! ( ( 1 ) <= (tk(P522)) )) ) ) ) | ( ( (tk(P315)) <= (tk(P189)) ) & ( ( (tk(P700)) <= ( 1 ) ) | ( ( ( (! ( (tk(P607)) <= ( 1 ) )) | (! ( (tk(P167)) <= ( 1 ) )) ) & ( ( ( ( 1 ) <= (tk(P189)) ) & ( (tk(P37)) <= (tk(P148)) ) ) & ( ( (tk(P148)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P491)) ) ) ) ) & ( ( ( ( ( 1 ) <= (tk(P623)) ) | ( (tk(P369)) <= (tk(P426)) ) ) | ( ( 1 ) <= (tk(P46)) ) ) & ( (! ( ( 1 ) <= (tk(P244)) )) & (! ( (tk(P416)) <= (tk(P268)) )) ) ) ) ) ) ) & ( (! ( ( (! ( ( ( 1 ) <= (tk(P681)) ) | ( ( (tk(P301)) <= (tk(P118)) ) & ( (tk(P709)) <= ( 0 ) ) ) )) & (! ( (tk(P559)) <= ( 0 ) )) ) | (! ( (! ( ( 1 ) <= (tk(P252)) )) | ( (! ( (tk(P223)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P115)) ) | ( ( 1 ) <= (tk(P510)) ) ) ) )) )) | ( ( 1 ) <= (tk(P568)) ) ) ) )))
PROPERTY: BusinessProcesses-PT-20-ReachabilityCardinality-09 (reachable & potential(( ( ( 1 ) <= (tk(P236)) ) & ( (tk(P692)) <= ( 0 ) ) )))
PROPERTY: BusinessProcesses-PT-20-ReachabilityCardinality-10 (reachable &!potential( ( (! ( ( ( (! ( ( ( ( 1 ) <= (tk(P22)) ) | ( ( ( 1 ) <= (tk(P316)) ) | ( (tk(P201)) <= (tk(P431)) ) ) ) | ( (tk(P633)) <= (tk(P350)) ) )) & (! ( ( ( 1 ) <= (tk(P774)) ) | ( ( ( 1 ) <= (tk(P176)) ) | ( (tk(P292)) <= ( 0 ) ) ) )) ) & (! ( ( ( ( ( (tk(P388)) <= ( 1 ) ) | ( (tk(P116)) <= ( 0 ) ) ) | ( ( (tk(P736)) <= ( 0 ) ) | ( (tk(P631)) <= (tk(P512)) ) ) ) | ( ( ( 1 ) <= (tk(P498)) ) & ( ( (tk(P85)) <= ( 1 ) ) | ( (tk(P32)) <= (tk(P780)) ) ) ) ) & (! ( (tk(P130)) <= ( 1 ) )) )) ) & ( ( ( 1 ) <= (tk(P127)) ) | ( ( ( ( (! ( ( 1 ) <= (tk(P74)) )) & ( ( ( 1 ) <= (tk(P431)) ) | ( (tk(P343)) <= (tk(P526)) ) ) ) & (! ( ( ( 1 ) <= (tk(P676)) ) & ( ( 1 ) <= (tk(P62)) ) )) ) | ( (tk(P382)) <= ( 0 ) ) ) & (! ( ( ( ( 1 ) <= (tk(P440)) ) | ( (tk(P626)) <= (tk(P364)) ) ) | ( ( ( 1 ) <= (tk(P720)) ) | ( ( 1 ) <= (tk(P286)) ) ) )) ) ) )) | ( ( ( (! ( ( (! ( (tk(P62)) <= ( 1 ) )) & ( ( ( (tk(P243)) <= (tk(P189)) ) & ( (tk(P188)) <= ( 1 ) ) ) | (! ( (tk(P384)) <= (tk(P665)) )) ) ) & ( ( (tk(P215)) <= ( 1 ) ) & (! ( (tk(P606)) <= (tk(P74)) )) ) )) & (! ( (tk(P704)) <= (tk(P593)) )) ) | ( ( ( (tk(P73)) <= (tk(P414)) ) | (! ( ( (tk(P57)) <= (tk(P81)) ) & ( (! ( (tk(P17)) <= (tk(P80)) )) & (! ( ( 1 ) <= (tk(P362)) )) ) )) ) & (! ( ( ( (tk(P605)) <= ( 0 ) ) | ( ( ( ( 1 ) <= (tk(P573)) ) & ( ( 1 ) <= (tk(P206)) ) ) & (! ( (tk(P777)) <= (tk(P527)) )) ) ) | ( ( ( ( 1 ) <= (tk(P330)) ) | ( ( (tk(P94)) <= ( 0 ) ) & ( (tk(P136)) <= ( 1 ) ) ) ) & (! ( (tk(P142)) <= (tk(P544)) )) ) )) ) ) | (! ( (! ( (tk(P86)) <= (tk(P33)) )) & ( ( (! ( (tk(P619)) <= ( 0 ) )) | ( ( ( ( (tk(P185)) <= ( 0 ) ) | ( (tk(P289)) <= (tk(P51)) ) ) & ( ( (tk(P280)) <= (tk(P343)) ) | ( (tk(P485)) <= ( 0 ) ) ) ) | ( ( ( ( 1 ) <= (tk(P588)) ) & ( (tk(P660)) <= (tk(P128)) ) ) & ( ( (tk(P516)) <= (tk(P455)) ) | ( (tk(P571)) <= (tk(P123)) ) ) ) ) ) | (! ( (tk(P326)) <= (tk(P158)) )) ) )) ) )))
PROPERTY: BusinessProcesses-PT-20-ReachabilityCardinality-11 (reachable & potential(( ( 1 ) <= (tk(P312)) )))
PROPERTY: BusinessProcesses-PT-20-ReachabilityCardinality-12 (reachable & potential(( ( ( (tk(P586)) <= ( 0 ) ) | ( (! ( ( (tk(P465)) <= ( 1 ) ) & ( ( ( (! ( ( 1 ) <= (tk(P227)) )) | ( ( ( 1 ) <= (tk(P682)) ) & ( (tk(P54)) <= (tk(P653)) ) ) ) & (! ( ( ( 1 ) <= (tk(P465)) ) & ( (tk(P550)) <= ( 0 ) ) )) ) & ( (! ( ( ( 1 ) <= (tk(P179)) ) & ( (tk(P60)) <= (tk(P458)) ) )) | ( (tk(P451)) <= ( 0 ) ) ) ) )) & ( ( 1 ) <= (tk(P69)) ) ) ) & ( ( 1 ) <= (tk(P129)) ) )))
PROPERTY: BusinessProcesses-PT-20-ReachabilityCardinality-13 (reachable &!potential( (! ( ( (! ( ( ( (tk(P585)) <= ( 1 ) ) & ( (tk(P164)) <= ( 0 ) ) ) & ( (tk(P617)) <= (tk(P415)) ) )) & (! ( (tk(P675)) <= ( 1 ) )) ) | ( ( 1 ) <= (tk(P390)) ) ))))
PROPERTY: BusinessProcesses-PT-20-ReachabilityCardinality-14 (reachable & potential(( (! ( ( ( ( 1 ) <= (tk(P215)) ) & ( ( (! ( ( ( (tk(P268)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P302)) ) ) & ( ( ( 1 ) <= (tk(P684)) ) | ( (tk(P740)) <= (tk(P30)) ) ) )) | (! ( (tk(P46)) <= (tk(P178)) )) ) | ( ( (! ( (tk(P666)) <= ( 1 ) )) & ( ( ( ( 1 ) <= (tk(P285)) ) & ( (tk(P443)) <= ( 0 ) ) ) | ( ( ( 1 ) <= (tk(P11)) ) & ( (tk(P675)) <= ( 1 ) ) ) ) ) & ( ( (! ( ( 1 ) <= (tk(P221)) )) | ( (tk(P18)) <= (tk(P95)) ) ) | ( ( 1 ) <= (tk(P48)) ) ) ) ) ) | ( ( (tk(P643)) <= (tk(P134)) ) & ( ( ( ( ( (tk(P196)) <= ( 1 ) ) | (! ( ( 1 ) <= (tk(P355)) )) ) | ( ( ( ( 1 ) <= (tk(P84)) ) | ( ( 1 ) <= (tk(P566)) ) ) & (! ( (tk(P344)) <= (tk(P610)) )) ) ) | ( ( 1 ) <= (tk(P597)) ) ) | ( ( (! ( ( (tk(P304)) <= (tk(P627)) ) | ( (tk(P204)) <= (tk(P511)) ) )) | ( ( ( (tk(P580)) <= (tk(P616)) ) & ( (tk(P189)) <= ( 1 ) ) ) & ( ( (tk(P436)) <= (tk(P693)) ) & ( (tk(P277)) <= ( 1 ) ) ) ) ) | ( (tk(P354)) <= (tk(P677)) ) ) ) ) )) | ( ( 1 ) <= (tk(P775)) ) )))
PROPERTY: BusinessProcesses-PT-20-ReachabilityCardinality-15 (reachable & potential(( ( (! ( (tk(P616)) <= (tk(P468)) )) & (! ( ( ( (tk(P243)) <= (tk(P284)) ) | ( (! ( (tk(P480)) <= ( 0 ) )) & ( ( (! ( (tk(P600)) <= ( 1 ) )) & ( ( ( 1 ) <= (tk(P373)) ) | ( (tk(P382)) <= ( 0 ) ) ) ) & ( ( ( (tk(P412)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P397)) ) ) & ( (tk(P542)) <= ( 1 ) ) ) ) ) ) | (! ( (tk(P399)) <= (tk(P459)) )) )) ) & ( (! ( (! ( ( (! ( ( (tk(P690)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P2)) ) )) & ( ( 1 ) <= (tk(P530)) ) ) & ( (tk(P48)) <= ( 0 ) ) )) & ( (! ( (tk(P134)) <= ( 1 ) )) & ( (tk(P714)) <= ( 1 ) ) ) )) & (! ( ( ( ( ( (! ( (tk(P434)) <= (tk(P400)) )) | ( (tk(P409)) <= (tk(P341)) ) ) | ( (! ( (tk(P312)) <= ( 0 ) )) & ( (tk(P498)) <= (tk(P299)) ) ) ) | (! ( ( 1 ) <= (tk(P461)) )) ) & ( ( ( (tk(P205)) <= ( 1 ) ) | (! ( ( (tk(P154)) <= (tk(P54)) ) | ( (tk(P280)) <= ( 1 ) ) )) ) & (! ( ( ( ( 1 ) <= (tk(P524)) ) | ( (tk(P171)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P530)) ) & ( ( 1 ) <= (tk(P392)) ) ) )) ) ) & ( (! ( (! ( (tk(P622)) <= (tk(P165)) )) | (! ( (tk(P387)) <= ( 1 ) )) )) & ( ( 1 ) <= (tk(P411)) ) ) )) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 11959600 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16110260 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="ReachabilityCardinality"
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 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 r043-tajo-167813697100606"
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 [ "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 ;