Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813695900550.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BusinessProcesses-PT-13, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695900550
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:45 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.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:47 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 148K 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-13-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678732779071

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-13
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:39:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 18:39:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:39:40] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-13 18:39:40] [INFO ] Transformed 593 places.
[2023-03-13 18:39:40] [INFO ] Transformed 536 transitions.
[2023-03-13 18:39:40] [INFO ] Found NUPN structural information;
[2023-03-13 18:39:40] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 130 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 8 places in 8 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 71 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 15) seen :4
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 528 rows 585 cols
[2023-03-13 18:39:42] [INFO ] Computed 95 place invariants in 33 ms
[2023-03-13 18:39:42] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 18:39:42] [INFO ] [Nat]Absence check using 57 positive place invariants in 34 ms returned sat
[2023-03-13 18:39:42] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 20 ms returned sat
[2023-03-13 18:39:43] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-13 18:39:47] [INFO ] Deduced a trap composed of 8 places in 3875 ms of which 27 ms to minimize.
[2023-03-13 18:39:47] [INFO ] Deduced a trap composed of 14 places in 336 ms of which 1 ms to minimize.
[2023-03-13 18:39:48] [INFO ] Deduced a trap composed of 15 places in 264 ms of which 1 ms to minimize.
[2023-03-13 18:39:48] [INFO ] Deduced a trap composed of 134 places in 270 ms of which 1 ms to minimize.
[2023-03-13 18:39:48] [INFO ] Deduced a trap composed of 35 places in 250 ms of which 1 ms to minimize.
[2023-03-13 18:39:48] [INFO ] Deduced a trap composed of 138 places in 249 ms of which 0 ms to minimize.
[2023-03-13 18:39:49] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 0 ms to minimize.
[2023-03-13 18:39:49] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 1 ms to minimize.
[2023-03-13 18:39:49] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 1 ms to minimize.
[2023-03-13 18:39:49] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 0 ms to minimize.
[2023-03-13 18:39:50] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 0 ms to minimize.
[2023-03-13 18:39:50] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 4 ms to minimize.
[2023-03-13 18:39:50] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 0 ms to minimize.
[2023-03-13 18:39:50] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 1 ms to minimize.
[2023-03-13 18:39:50] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 1 ms to minimize.
[2023-03-13 18:39:51] [INFO ] Deduced a trap composed of 153 places in 155 ms of which 1 ms to minimize.
[2023-03-13 18:39:51] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 1 ms to minimize.
[2023-03-13 18:39:51] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 1 ms to minimize.
[2023-03-13 18:39:51] [INFO ] Deduced a trap composed of 131 places in 168 ms of which 1 ms to minimize.
[2023-03-13 18:39:51] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 1 ms to minimize.
[2023-03-13 18:39:52] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 0 ms to minimize.
[2023-03-13 18:39:52] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 2 ms to minimize.
[2023-03-13 18:39:52] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 0 ms to minimize.
[2023-03-13 18:39:52] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 0 ms to minimize.
[2023-03-13 18:39:52] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 2 ms to minimize.
[2023-03-13 18:39:52] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 0 ms to minimize.
[2023-03-13 18:39:53] [INFO ] Deduced a trap composed of 136 places in 194 ms of which 0 ms to minimize.
[2023-03-13 18:39:53] [INFO ] Deduced a trap composed of 140 places in 164 ms of which 0 ms to minimize.
[2023-03-13 18:39:53] [INFO ] Deduced a trap composed of 133 places in 143 ms of which 1 ms to minimize.
[2023-03-13 18:39:53] [INFO ] Deduced a trap composed of 157 places in 152 ms of which 0 ms to minimize.
[2023-03-13 18:39:53] [INFO ] Deduced a trap composed of 135 places in 184 ms of which 1 ms to minimize.
[2023-03-13 18:39:54] [INFO ] Deduced a trap composed of 139 places in 174 ms of which 0 ms to minimize.
[2023-03-13 18:39:54] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 0 ms to minimize.
[2023-03-13 18:39:54] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 1 ms to minimize.
[2023-03-13 18:39:54] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 0 ms to minimize.
[2023-03-13 18:39:54] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2023-03-13 18:39:54] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 0 ms to minimize.
[2023-03-13 18:39:55] [INFO ] Deduced a trap composed of 142 places in 147 ms of which 0 ms to minimize.
[2023-03-13 18:39:55] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 0 ms to minimize.
[2023-03-13 18:39:55] [INFO ] Deduced a trap composed of 155 places in 151 ms of which 2 ms to minimize.
[2023-03-13 18:39:55] [INFO ] Deduced a trap composed of 144 places in 166 ms of which 1 ms to minimize.
[2023-03-13 18:39:55] [INFO ] Deduced a trap composed of 142 places in 189 ms of which 1 ms to minimize.
[2023-03-13 18:39:56] [INFO ] Deduced a trap composed of 142 places in 152 ms of which 1 ms to minimize.
[2023-03-13 18:39:56] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 1 ms to minimize.
[2023-03-13 18:39:56] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 1 ms to minimize.
[2023-03-13 18:39:56] [INFO ] Deduced a trap composed of 139 places in 152 ms of which 1 ms to minimize.
[2023-03-13 18:39:56] [INFO ] Deduced a trap composed of 137 places in 154 ms of which 1 ms to minimize.
[2023-03-13 18:39:57] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 0 ms to minimize.
[2023-03-13 18:39:57] [INFO ] Deduced a trap composed of 137 places in 166 ms of which 1 ms to minimize.
[2023-03-13 18:39:57] [INFO ] Deduced a trap composed of 143 places in 143 ms of which 0 ms to minimize.
[2023-03-13 18:39:57] [INFO ] Deduced a trap composed of 150 places in 139 ms of which 0 ms to minimize.
[2023-03-13 18:39:57] [INFO ] Deduced a trap composed of 154 places in 162 ms of which 0 ms to minimize.
[2023-03-13 18:39:58] [INFO ] Deduced a trap composed of 146 places in 166 ms of which 0 ms to minimize.
[2023-03-13 18:39:58] [INFO ] Deduced a trap composed of 133 places in 163 ms of which 1 ms to minimize.
[2023-03-13 18:39:58] [INFO ] Deduced a trap composed of 137 places in 149 ms of which 1 ms to minimize.
[2023-03-13 18:39:58] [INFO ] Deduced a trap composed of 132 places in 163 ms of which 1 ms to minimize.
[2023-03-13 18:39:58] [INFO ] Deduced a trap composed of 135 places in 170 ms of which 4 ms to minimize.
[2023-03-13 18:39:59] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 1 ms to minimize.
[2023-03-13 18:39:59] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 0 ms to minimize.
[2023-03-13 18:39:59] [INFO ] Deduced a trap composed of 143 places in 161 ms of which 1 ms to minimize.
[2023-03-13 18:39:59] [INFO ] Deduced a trap composed of 21 places in 181 ms of which 1 ms to minimize.
[2023-03-13 18:39:59] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 0 ms to minimize.
[2023-03-13 18:40:00] [INFO ] Deduced a trap composed of 142 places in 168 ms of which 1 ms to minimize.
[2023-03-13 18:40:00] [INFO ] Deduced a trap composed of 138 places in 164 ms of which 1 ms to minimize.
[2023-03-13 18:40:00] [INFO ] Deduced a trap composed of 129 places in 168 ms of which 1 ms to minimize.
[2023-03-13 18:40:00] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 1 ms to minimize.
[2023-03-13 18:40:01] [INFO ] Deduced a trap composed of 159 places in 202 ms of which 2 ms to minimize.
[2023-03-13 18:40:01] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 1 ms to minimize.
[2023-03-13 18:40:01] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 1 ms to minimize.
[2023-03-13 18:40:01] [INFO ] Deduced a trap composed of 57 places in 195 ms of which 1 ms to minimize.
[2023-03-13 18:40:02] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 0 ms to minimize.
[2023-03-13 18:40:02] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 1 ms to minimize.
[2023-03-13 18:40:02] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 1 ms to minimize.
[2023-03-13 18:40:02] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 5 ms to minimize.
[2023-03-13 18:40:02] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 0 ms to minimize.
[2023-03-13 18:40:03] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 0 ms to minimize.
[2023-03-13 18:40:03] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 1 ms to minimize.
[2023-03-13 18:40:03] [INFO ] Deduced a trap composed of 121 places in 170 ms of which 1 ms to minimize.
[2023-03-13 18:40:03] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 0 ms to minimize.
[2023-03-13 18:40:03] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 1 ms to minimize.
[2023-03-13 18:40:04] [INFO ] Deduced a trap composed of 150 places in 175 ms of which 1 ms to minimize.
[2023-03-13 18:40:04] [INFO ] Deduced a trap composed of 153 places in 167 ms of which 1 ms to minimize.
[2023-03-13 18:40:04] [INFO ] Deduced a trap composed of 133 places in 181 ms of which 0 ms to minimize.
[2023-03-13 18:40:04] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 0 ms to minimize.
[2023-03-13 18:40:04] [INFO ] Deduced a trap composed of 136 places in 163 ms of which 0 ms to minimize.
[2023-03-13 18:40:05] [INFO ] Deduced a trap composed of 129 places in 162 ms of which 1 ms to minimize.
[2023-03-13 18:40:05] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 0 ms to minimize.
[2023-03-13 18:40:05] [INFO ] Deduced a trap composed of 149 places in 142 ms of which 1 ms to minimize.
[2023-03-13 18:40:05] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 1 ms to minimize.
[2023-03-13 18:40:05] [INFO ] Deduced a trap composed of 130 places in 151 ms of which 1 ms to minimize.
[2023-03-13 18:40:06] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 1 ms to minimize.
[2023-03-13 18:40:06] [INFO ] Deduced a trap composed of 132 places in 166 ms of which 1 ms to minimize.
[2023-03-13 18:40:06] [INFO ] Deduced a trap composed of 166 places in 146 ms of which 1 ms to minimize.
[2023-03-13 18:40:06] [INFO ] Deduced a trap composed of 140 places in 158 ms of which 1 ms to minimize.
[2023-03-13 18:40:06] [INFO ] Deduced a trap composed of 156 places in 158 ms of which 1 ms to minimize.
[2023-03-13 18:40:06] [INFO ] Deduced a trap composed of 139 places in 157 ms of which 1 ms to minimize.
[2023-03-13 18:40:07] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 1 ms to minimize.
[2023-03-13 18:40:07] [INFO ] Deduced a trap composed of 143 places in 169 ms of which 1 ms to minimize.
[2023-03-13 18:40:07] [INFO ] Deduced a trap composed of 145 places in 163 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 18:40:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 18:40:07] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 140 ms.
Support contains 60 out of 585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 585/585 places, 528/528 transitions.
Graph (trivial) has 274 edges and 585 vertex of which 7 / 585 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1189 edges and 579 vertex of which 574 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 97 place count 574 transition count 424
Reduce places removed 95 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 112 rules applied. Total rules applied 209 place count 479 transition count 407
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 226 place count 462 transition count 407
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 226 place count 462 transition count 340
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 370 place count 385 transition count 340
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 425 place count 330 transition count 285
Iterating global reduction 3 with 55 rules applied. Total rules applied 480 place count 330 transition count 285
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 480 place count 330 transition count 282
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 487 place count 326 transition count 282
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 653 place count 243 transition count 199
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 655 place count 242 transition count 203
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 657 place count 242 transition count 201
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 659 place count 240 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 660 place count 239 transition count 200
Applied a total of 660 rules in 144 ms. Remains 239 /585 variables (removed 346) and now considering 200/528 (removed 328) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 239/585 places, 200/528 transitions.
Finished random walk after 1043 steps, including 18 resets, run visited all 10 properties in 20 ms. (steps per millisecond=52 )
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 27176 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BusinessProcesses_PT_13
(NrP: 593 NrTr: 536 NrArc: 1582)

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

net check time: 0m 0.000sec

init dd package: 0m 3.397sec


before gc: list nodes free: 2037865

after gc: idd nodes used:33969265, unused:30030735; list nodes free:126086479

RS generation: 21m42.402sec


-> last computed set: #nodes 33968690 (3.4e+07) #states 96,828,606,918,841 (13)


CANNOT_COMPUTE


BK_STOP 1678734136823

--------------------
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
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p234
p230
p228
p273
p232
p233
p229
p278

The net has transition(s) that can never fire:
t265
t266
t268
t269
t258
t422
t423
t255

check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.008sec

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is BusinessProcesses-PT-13, 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 r042-tajo-167813695900550"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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