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

--------------------
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 1678735731946

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-20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:28:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 19:28:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:28:56] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2023-03-13 19:28:56] [INFO ] Transformed 782 places.
[2023-03-13 19:28:56] [INFO ] Transformed 697 transitions.
[2023-03-13 19:28:56] [INFO ] Found NUPN structural information;
[2023-03-13 19:28:56] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 42 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 51 resets, run finished after 303 ms. (steps per millisecond=33 ) 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 10001 steps, including 9 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 638 rows 719 cols
[2023-03-13 19:28:57] [INFO ] Computed 121 place invariants in 72 ms
[2023-03-13 19:28:58] [INFO ] [Real]Absence check using 78 positive place invariants in 106 ms returned sat
[2023-03-13 19:28:58] [INFO ] [Real]Absence check using 78 positive and 43 generalized place invariants in 26 ms returned sat
[2023-03-13 19:28:58] [INFO ] After 1286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 19:28:59] [INFO ] [Nat]Absence check using 78 positive place invariants in 187 ms returned sat
[2023-03-13 19:28:59] [INFO ] [Nat]Absence check using 78 positive and 43 generalized place invariants in 27 ms returned sat
[2023-03-13 19:29:00] [INFO ] After 936ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 19:29:00] [INFO ] Deduced a trap composed of 11 places in 469 ms of which 12 ms to minimize.
[2023-03-13 19:29:01] [INFO ] Deduced a trap composed of 8 places in 382 ms of which 2 ms to minimize.
[2023-03-13 19:29:01] [INFO ] Deduced a trap composed of 21 places in 433 ms of which 2 ms to minimize.
[2023-03-13 19:29:05] [INFO ] Deduced a trap composed of 20 places in 3684 ms of which 27 ms to minimize.
[2023-03-13 19:29:05] [INFO ] Deduced a trap composed of 21 places in 384 ms of which 1 ms to minimize.
[2023-03-13 19:29:06] [INFO ] Deduced a trap composed of 131 places in 206 ms of which 14 ms to minimize.
[2023-03-13 19:29:06] [INFO ] Deduced a trap composed of 23 places in 375 ms of which 0 ms to minimize.
[2023-03-13 19:29:06] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 1 ms to minimize.
[2023-03-13 19:29:07] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2023-03-13 19:29:07] [INFO ] Deduced a trap composed of 38 places in 305 ms of which 0 ms to minimize.
[2023-03-13 19:29:07] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 0 ms to minimize.
[2023-03-13 19:29:07] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2023-03-13 19:29:07] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 0 ms to minimize.
[2023-03-13 19:29:07] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 1 ms to minimize.
[2023-03-13 19:29:08] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7575 ms
[2023-03-13 19:29:08] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 0 ms to minimize.
[2023-03-13 19:29:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-13 19:29:08] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 1 ms to minimize.
[2023-03-13 19:29:09] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 1 ms to minimize.
[2023-03-13 19:29:09] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 1 ms to minimize.
[2023-03-13 19:29:09] [INFO ] Deduced a trap composed of 22 places in 255 ms of which 1 ms to minimize.
[2023-03-13 19:29:09] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 1 ms to minimize.
[2023-03-13 19:29:10] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 1 ms to minimize.
[2023-03-13 19:29:10] [INFO ] Deduced a trap composed of 15 places in 238 ms of which 2 ms to minimize.
[2023-03-13 19:29:10] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 0 ms to minimize.
[2023-03-13 19:29:11] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 1 ms to minimize.
[2023-03-13 19:29:11] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 0 ms to minimize.
[2023-03-13 19:29:11] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 1 ms to minimize.
[2023-03-13 19:29:12] [INFO ] Deduced a trap composed of 22 places in 282 ms of which 0 ms to minimize.
[2023-03-13 19:29:12] [INFO ] Deduced a trap composed of 126 places in 245 ms of which 1 ms to minimize.
[2023-03-13 19:29:12] [INFO ] Deduced a trap composed of 126 places in 247 ms of which 1 ms to minimize.
[2023-03-13 19:29:12] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 1 ms to minimize.
[2023-03-13 19:29:13] [INFO ] Deduced a trap composed of 141 places in 246 ms of which 1 ms to minimize.
[2023-03-13 19:29:13] [INFO ] Deduced a trap composed of 141 places in 228 ms of which 1 ms to minimize.
[2023-03-13 19:29:13] [INFO ] Deduced a trap composed of 141 places in 259 ms of which 1 ms to minimize.
[2023-03-13 19:29:14] [INFO ] Deduced a trap composed of 37 places in 238 ms of which 1 ms to minimize.
[2023-03-13 19:29:14] [INFO ] Deduced a trap composed of 52 places in 213 ms of which 1 ms to minimize.
[2023-03-13 19:29:14] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2023-03-13 19:29:14] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 6366 ms
[2023-03-13 19:29:15] [INFO ] Deduced a trap composed of 151 places in 221 ms of which 1 ms to minimize.
[2023-03-13 19:29:15] [INFO ] Deduced a trap composed of 148 places in 215 ms of which 0 ms to minimize.
[2023-03-13 19:29:15] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2023-03-13 19:29:15] [INFO ] Deduced a trap composed of 154 places in 213 ms of which 3 ms to minimize.
[2023-03-13 19:29:16] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-13 19:29:16] [INFO ] Deduced a trap composed of 156 places in 206 ms of which 1 ms to minimize.
[2023-03-13 19:29:16] [INFO ] Deduced a trap composed of 151 places in 202 ms of which 0 ms to minimize.
[2023-03-13 19:29:16] [INFO ] Deduced a trap composed of 156 places in 207 ms of which 2 ms to minimize.
[2023-03-13 19:29:17] [INFO ] Deduced a trap composed of 144 places in 228 ms of which 1 ms to minimize.
[2023-03-13 19:29:17] [INFO ] Deduced a trap composed of 148 places in 207 ms of which 1 ms to minimize.
[2023-03-13 19:29:17] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-13 19:29:17] [INFO ] Deduced a trap composed of 169 places in 201 ms of which 0 ms to minimize.
[2023-03-13 19:29:18] [INFO ] Deduced a trap composed of 168 places in 230 ms of which 7 ms to minimize.
[2023-03-13 19:29:18] [INFO ] Deduced a trap composed of 151 places in 173 ms of which 1 ms to minimize.
[2023-03-13 19:29:18] [INFO ] Deduced a trap composed of 141 places in 200 ms of which 1 ms to minimize.
[2023-03-13 19:29:18] [INFO ] Deduced a trap composed of 154 places in 190 ms of which 1 ms to minimize.
[2023-03-13 19:29:18] [INFO ] Deduced a trap composed of 145 places in 211 ms of which 1 ms to minimize.
[2023-03-13 19:29:19] [INFO ] Deduced a trap composed of 163 places in 184 ms of which 1 ms to minimize.
[2023-03-13 19:29:19] [INFO ] Deduced a trap composed of 148 places in 189 ms of which 1 ms to minimize.
[2023-03-13 19:29:19] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2023-03-13 19:29:19] [INFO ] Deduced a trap composed of 157 places in 209 ms of which 3 ms to minimize.
[2023-03-13 19:29:20] [INFO ] Deduced a trap composed of 159 places in 251 ms of which 1 ms to minimize.
[2023-03-13 19:29:20] [INFO ] Deduced a trap composed of 154 places in 216 ms of which 1 ms to minimize.
[2023-03-13 19:29:20] [INFO ] Deduced a trap composed of 152 places in 203 ms of which 0 ms to minimize.
[2023-03-13 19:29:20] [INFO ] Deduced a trap composed of 153 places in 191 ms of which 1 ms to minimize.
[2023-03-13 19:29:21] [INFO ] Deduced a trap composed of 152 places in 340 ms of which 1 ms to minimize.
[2023-03-13 19:29:21] [INFO ] Deduced a trap composed of 156 places in 345 ms of which 1 ms to minimize.
[2023-03-13 19:29:21] [INFO ] Deduced a trap composed of 161 places in 222 ms of which 1 ms to minimize.
[2023-03-13 19:29:22] [INFO ] Deduced a trap composed of 27 places in 339 ms of which 2 ms to minimize.
[2023-03-13 19:29:22] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 0 ms to minimize.
[2023-03-13 19:29:23] [INFO ] Deduced a trap composed of 38 places in 1258 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 19:29:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 19:29:23] [INFO ] After 25109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 224 ms.
Support contains 58 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 4 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.2 ms
Discarding 21 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 125 rules applied. Total rules applied 127 place count 692 transition count 497
Reduce places removed 125 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 144 rules applied. Total rules applied 271 place count 567 transition count 478
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 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 1 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 0 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 13 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 272 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 272 ms. Remains : 269/719 places, 218/638 transitions.
Incomplete random walk after 10000 steps, including 125 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 5) seen :3
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 10000 steps, including 24 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 218 rows 269 cols
[2023-03-13 19:29:24] [INFO ] Computed 89 place invariants in 12 ms
[2023-03-13 19:29:24] [INFO ] [Real]Absence check using 65 positive place invariants in 19 ms returned sat
[2023-03-13 19:29:24] [INFO ] [Real]Absence check using 65 positive and 24 generalized place invariants in 4 ms returned sat
[2023-03-13 19:29:25] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:29:25] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-13 19:29:25] [INFO ] [Nat]Absence check using 65 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-13 19:29:25] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:29:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 19:29:25] [INFO ] After 22ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:29:25] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 0 ms to minimize.
[2023-03-13 19:29:25] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2023-03-13 19:29:25] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 0 ms to minimize.
[2023-03-13 19:29:25] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 1 ms to minimize.
[2023-03-13 19:29:26] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2023-03-13 19:29:26] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 0 ms to minimize.
[2023-03-13 19:29:26] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 0 ms to minimize.
[2023-03-13 19:29:26] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 1 ms to minimize.
[2023-03-13 19:29:26] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2023-03-13 19:29:26] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 1 ms to minimize.
[2023-03-13 19:29:26] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 1 ms to minimize.
[2023-03-13 19:29:26] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 0 ms to minimize.
[2023-03-13 19:29:27] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 0 ms to minimize.
[2023-03-13 19:29:27] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 1 ms to minimize.
[2023-03-13 19:29:27] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 1 ms to minimize.
[2023-03-13 19:29:27] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2023-03-13 19:29:27] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2023-03-13 19:29:27] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 0 ms to minimize.
[2023-03-13 19:29:27] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 0 ms to minimize.
[2023-03-13 19:29:27] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 0 ms to minimize.
[2023-03-13 19:29:27] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2023-03-13 19:29:28] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 1 ms to minimize.
[2023-03-13 19:29:28] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 0 ms to minimize.
[2023-03-13 19:29:28] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 1 ms to minimize.
[2023-03-13 19:29:28] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 1 ms to minimize.
[2023-03-13 19:29:28] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 0 ms to minimize.
[2023-03-13 19:29:28] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 1 ms to minimize.
[2023-03-13 19:29:28] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2023-03-13 19:29:28] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 3328 ms
[2023-03-13 19:29:28] [INFO ] After 3474ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-13 19:29:28] [INFO ] After 3764ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 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.1 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 1 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 97 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 98 ms. Remains : 197/269 places, 157/218 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 424431 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 424431 steps, saw 164669 distinct states, run finished after 3003 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 19:29:32] [INFO ] Flow matrix only has 156 transitions (discarded 1 similar events)
// Phase 1: matrix 156 rows 197 cols
[2023-03-13 19:29:32] [INFO ] Computed 82 place invariants in 3 ms
[2023-03-13 19:29:32] [INFO ] [Real]Absence check using 65 positive place invariants in 8 ms returned sat
[2023-03-13 19:29:32] [INFO ] [Real]Absence check using 65 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-13 19:29:32] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:29:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-13 19:29:32] [INFO ] [Nat]Absence check using 65 positive and 17 generalized place invariants in 2 ms returned sat
[2023-03-13 19:29:32] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:29:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 19:29:32] [INFO ] After 18ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:29:32] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2023-03-13 19:29:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-13 19:29:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 19:29:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-13 19:29:32] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-13 19:29:32] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 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 9 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 9 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 8 ms. Remains 197 /197 variables (removed 0) and now considering 157/157 (removed 0) transitions.
[2023-03-13 19:29:32] [INFO ] Flow matrix only has 156 transitions (discarded 1 similar events)
[2023-03-13 19:29:32] [INFO ] Invariant cache hit.
[2023-03-13 19:29:32] [INFO ] Implicit Places using invariants in 133 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 135 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 13 ms. Remains 160 /167 variables (removed 7) and now considering 135/154 (removed 19) transitions.
[2023-03-13 19:29:32] [INFO ] Flow matrix only has 134 transitions (discarded 1 similar events)
// Phase 1: matrix 134 rows 160 cols
[2023-03-13 19:29:32] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-13 19:29:32] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-13 19:29:32] [INFO ] Flow matrix only has 134 transitions (discarded 1 similar events)
[2023-03-13 19:29:32] [INFO ] Invariant cache hit.
[2023-03-13 19:29:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 19:29:32] [INFO ] Implicit Places using invariants and state equation in 163 ms returned [14, 93, 95, 97, 99, 102, 103, 105]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 245 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 14 ms. Remains 145 /152 variables (removed 7) and now considering 128/135 (removed 7) transitions.
[2023-03-13 19:29:32] [INFO ] Flow matrix only has 127 transitions (discarded 1 similar events)
// Phase 1: matrix 127 rows 145 cols
[2023-03-13 19:29:32] [INFO ] Computed 47 place invariants in 1 ms
[2023-03-13 19:29:33] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-13 19:29:33] [INFO ] Flow matrix only has 127 transitions (discarded 1 similar events)
[2023-03-13 19:29:33] [INFO ] Invariant cache hit.
[2023-03-13 19:29:33] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-13 19:29:33] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 248 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 665 ms. Remains : 145/197 places, 128/157 transitions.
Incomplete random walk after 10000 steps, including 345 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 2721 steps, including 21 resets, run visited all 1 properties in 4 ms. (steps per millisecond=680 )
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 37351 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_20
(NrP: 782 NrTr: 697 NrArc: 2011)

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

net check time: 0m 0.000sec

init dd package: 0m 3.033sec


before gc: list nodes free: 318994

after gc: idd nodes used:42554143, unused:21445857; list nodes free:89432002

RS generation: 43m45.054sec


-> last computed set: #nodes 42553563 (4.3e+07) #states 519,782,965,612,147,195 (17)


CANNOT_COMPUTE


BK_STOP 1678738441003

--------------------
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:
p145
p310
p629
p640
p137
p138
p139
p140
p141
p142
p144
p146
p147
p148
p150
p151
p152
p153
p154
p155
p157
p158
p159
p160
p161
p162
p163
p309
p311
p313
p314
p315
p370
p375
p376
p380
p381
p450
p451
p455
p456
p460
p461
p465
p466
p628
p630
p631
p632
p633
p634
p635
p636
p637
p638
p639
p641
p642
p643
p644
p645
p646
p647

The net has transition(s) that can never fire:
t616
t617
t618
t619
t620
t621
t622
t623
t324
t328
t332
t342
t343
t345
t346
t448
t449
t450
t451
t452
t454
t455
t456
t457
t458
t460
t461
t462
t464
t465
t466
t467
t468
t551
t552
t561
t562
t614
t615
t256
t260
t264
t268
t97
t98
t99
t100
t101
t102
t103
t104
t105
t106
t107
t108
t109
t94
t95
t96

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.002sec

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-20"
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-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 r042-tajo-167813696000606"
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 ;