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.r426-tajo-167905978700287.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 ShieldRVt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978700287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.0K Feb 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 23:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 23:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 23:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 23:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 239K Mar 5 18:23 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 ShieldRVt-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679347993968

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:33:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 21:33:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:33:16] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-20 21:33:16] [INFO ] Transformed 1003 places.
[2023-03-20 21:33:16] [INFO ] Transformed 1003 transitions.
[2023-03-20 21:33:16] [INFO ] Found NUPN structural information;
[2023-03-20 21:33:16] [INFO ] Parsed PT model containing 1003 places and 1003 transitions and 2366 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=23 ) properties (out of 16) seen :9
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1003 rows 1003 cols
[2023-03-20 21:33:16] [INFO ] Computed 81 place invariants in 32 ms
[2023-03-20 21:33:17] [INFO ] [Real]Absence check using 81 positive place invariants in 30 ms returned sat
[2023-03-20 21:33:17] [INFO ] After 569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 21:33:17] [INFO ] [Nat]Absence check using 81 positive place invariants in 26 ms returned sat
[2023-03-20 21:33:19] [INFO ] After 1109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 21:33:19] [INFO ] Deduced a trap composed of 29 places in 343 ms of which 8 ms to minimize.
[2023-03-20 21:33:19] [INFO ] Deduced a trap composed of 27 places in 294 ms of which 2 ms to minimize.
[2023-03-20 21:33:20] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 1 ms to minimize.
[2023-03-20 21:33:20] [INFO ] Deduced a trap composed of 37 places in 284 ms of which 2 ms to minimize.
[2023-03-20 21:33:20] [INFO ] Deduced a trap composed of 38 places in 260 ms of which 2 ms to minimize.
[2023-03-20 21:33:20] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 0 ms to minimize.
[2023-03-20 21:33:21] [INFO ] Deduced a trap composed of 53 places in 235 ms of which 1 ms to minimize.
[2023-03-20 21:33:21] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 2 ms to minimize.
[2023-03-20 21:33:21] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 1 ms to minimize.
[2023-03-20 21:33:22] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 1 ms to minimize.
[2023-03-20 21:33:22] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 1 ms to minimize.
[2023-03-20 21:33:22] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 1 ms to minimize.
[2023-03-20 21:33:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3563 ms
[2023-03-20 21:33:23] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 1 ms to minimize.
[2023-03-20 21:33:23] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 1 ms to minimize.
[2023-03-20 21:33:23] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 1 ms to minimize.
[2023-03-20 21:33:23] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 0 ms to minimize.
[2023-03-20 21:33:24] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 0 ms to minimize.
[2023-03-20 21:33:24] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 0 ms to minimize.
[2023-03-20 21:33:24] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 1 ms to minimize.
[2023-03-20 21:33:24] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 1 ms to minimize.
[2023-03-20 21:33:25] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 1 ms to minimize.
[2023-03-20 21:33:25] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 1 ms to minimize.
[2023-03-20 21:33:25] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 1 ms to minimize.
[2023-03-20 21:33:25] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 0 ms to minimize.
[2023-03-20 21:33:25] [INFO ] Deduced a trap composed of 33 places in 178 ms of which 1 ms to minimize.
[2023-03-20 21:33:26] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 0 ms to minimize.
[2023-03-20 21:33:26] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 0 ms to minimize.
[2023-03-20 21:33:26] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 0 ms to minimize.
[2023-03-20 21:33:26] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 0 ms to minimize.
[2023-03-20 21:33:26] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 1 ms to minimize.
[2023-03-20 21:33:27] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 0 ms to minimize.
[2023-03-20 21:33:27] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 1 ms to minimize.
[2023-03-20 21:33:27] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 1 ms to minimize.
[2023-03-20 21:33:27] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 5 ms to minimize.
[2023-03-20 21:33:28] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 2 ms to minimize.
[2023-03-20 21:33:28] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 2 ms to minimize.
[2023-03-20 21:33:28] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 0 ms to minimize.
[2023-03-20 21:33:28] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 2 ms to minimize.
[2023-03-20 21:33:29] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 1 ms to minimize.
[2023-03-20 21:33:29] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2023-03-20 21:33:29] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 1 ms to minimize.
[2023-03-20 21:33:29] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 0 ms to minimize.
[2023-03-20 21:33:29] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 0 ms to minimize.
[2023-03-20 21:33:29] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 1 ms to minimize.
[2023-03-20 21:33:30] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 0 ms to minimize.
[2023-03-20 21:33:30] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 1 ms to minimize.
[2023-03-20 21:33:30] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 0 ms to minimize.
[2023-03-20 21:33:30] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 0 ms to minimize.
[2023-03-20 21:33:30] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 7904 ms
[2023-03-20 21:33:31] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 1 ms to minimize.
[2023-03-20 21:33:31] [INFO ] Deduced a trap composed of 44 places in 218 ms of which 1 ms to minimize.
[2023-03-20 21:33:31] [INFO ] Deduced a trap composed of 23 places in 374 ms of which 2 ms to minimize.
[2023-03-20 21:33:32] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 1 ms to minimize.
[2023-03-20 21:33:32] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 1 ms to minimize.
[2023-03-20 21:33:32] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 1 ms to minimize.
[2023-03-20 21:33:33] [INFO ] Deduced a trap composed of 40 places in 240 ms of which 1 ms to minimize.
[2023-03-20 21:33:33] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 0 ms to minimize.
[2023-03-20 21:33:33] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 1 ms to minimize.
[2023-03-20 21:33:34] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 0 ms to minimize.
[2023-03-20 21:33:34] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 1 ms to minimize.
[2023-03-20 21:33:34] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 0 ms to minimize.
[2023-03-20 21:33:34] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 1 ms to minimize.
[2023-03-20 21:33:35] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 1 ms to minimize.
[2023-03-20 21:33:35] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 1 ms to minimize.
[2023-03-20 21:33:35] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 2 ms to minimize.
[2023-03-20 21:33:35] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 0 ms to minimize.
[2023-03-20 21:33:35] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 2 ms to minimize.
[2023-03-20 21:33:36] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 1 ms to minimize.
[2023-03-20 21:33:36] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2023-03-20 21:33:36] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 1 ms to minimize.
[2023-03-20 21:33:36] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 0 ms to minimize.
[2023-03-20 21:33:36] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5617 ms
[2023-03-20 21:33:37] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 0 ms to minimize.
[2023-03-20 21:33:37] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 1 ms to minimize.
[2023-03-20 21:33:37] [INFO ] Deduced a trap composed of 37 places in 237 ms of which 1 ms to minimize.
[2023-03-20 21:33:37] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 1 ms to minimize.
[2023-03-20 21:33:38] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 0 ms to minimize.
[2023-03-20 21:33:38] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 1 ms to minimize.
[2023-03-20 21:33:38] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 1 ms to minimize.
[2023-03-20 21:33:39] [INFO ] Deduced a trap composed of 38 places in 304 ms of which 2 ms to minimize.
[2023-03-20 21:33:39] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 1 ms to minimize.
[2023-03-20 21:33:39] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 1 ms to minimize.
[2023-03-20 21:33:39] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 1 ms to minimize.
[2023-03-20 21:33:39] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 1 ms to minimize.
[2023-03-20 21:33:40] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 1 ms to minimize.
[2023-03-20 21:33:40] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 1 ms to minimize.
[2023-03-20 21:33:40] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 0 ms to minimize.
[2023-03-20 21:33:40] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 0 ms to minimize.
[2023-03-20 21:33:40] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 0 ms to minimize.
[2023-03-20 21:33:40] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4189 ms
[2023-03-20 21:33:41] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 1 ms to minimize.
[2023-03-20 21:33:41] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 1 ms to minimize.
[2023-03-20 21:33:42] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 1 ms to minimize.
[2023-03-20 21:33:42] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 1 ms to minimize.
[2023-03-20 21:33:42] [INFO ] Deduced a trap composed of 32 places in 221 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-20 21:33:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 21:33:42] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 286 ms.
Support contains 125 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1003 transition count 805
Reduce places removed 198 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 1 with 229 rules applied. Total rules applied 427 place count 805 transition count 774
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 458 place count 774 transition count 774
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 458 place count 774 transition count 678
Deduced a syphon composed of 96 places in 2 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 650 place count 678 transition count 678
Discarding 124 places :
Symmetric choice reduction at 3 with 124 rule applications. Total rules 774 place count 554 transition count 554
Iterating global reduction 3 with 124 rules applied. Total rules applied 898 place count 554 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 900 place count 554 transition count 552
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 901 place count 553 transition count 552
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 39 Pre rules applied. Total rules applied 901 place count 553 transition count 513
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 979 place count 514 transition count 513
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 1 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 5 with 276 rules applied. Total rules applied 1255 place count 376 transition count 375
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1329 place count 339 transition count 396
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1337 place count 339 transition count 388
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1345 place count 331 transition count 388
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 1353 place count 331 transition count 388
Applied a total of 1353 rules in 235 ms. Remains 331 /1003 variables (removed 672) and now considering 388/1003 (removed 615) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 331/1003 places, 388/1003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 7) seen :3
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :1
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 388 rows 331 cols
[2023-03-20 21:33:43] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-20 21:33:43] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:33:43] [INFO ] [Nat]Absence check using 81 positive place invariants in 12 ms returned sat
[2023-03-20 21:33:43] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:33:43] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-20 21:33:44] [INFO ] After 209ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:33:44] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2023-03-20 21:33:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-03-20 21:33:44] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2023-03-20 21:33:44] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2023-03-20 21:33:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2023-03-20 21:33:44] [INFO ] After 789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 221 ms.
[2023-03-20 21:33:44] [INFO ] After 1325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 58 ms.
Support contains 55 out of 331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 388/388 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 331 transition count 371
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 314 transition count 371
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 34 place count 314 transition count 347
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 82 place count 290 transition count 347
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 288 transition count 345
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 288 transition count 345
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 170 place count 246 transition count 303
Renaming transitions due to excessive name length > 1024 char.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 188 place count 237 transition count 312
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 237 transition count 311
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 192 place count 237 transition count 308
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 195 place count 234 transition count 308
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 234 transition count 307
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 200 place count 234 transition count 307
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 233 transition count 306
Applied a total of 201 rules in 120 ms. Remains 233 /331 variables (removed 98) and now considering 306/388 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 233/331 places, 306/388 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 313776 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 313776 steps, saw 157916 distinct states, run finished after 3003 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 306 rows 233 cols
[2023-03-20 21:33:48] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-20 21:33:48] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:33:48] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned sat
[2023-03-20 21:33:48] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:33:48] [INFO ] State equation strengthened by 114 read => feed constraints.
[2023-03-20 21:33:48] [INFO ] After 152ms SMT Verify possible using 114 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:33:48] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 1 ms to minimize.
[2023-03-20 21:33:48] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2023-03-20 21:33:49] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2023-03-20 21:33:49] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2023-03-20 21:33:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 333 ms
[2023-03-20 21:33:49] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-20 21:33:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-20 21:33:49] [INFO ] After 782ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 114 ms.
[2023-03-20 21:33:49] [INFO ] After 1085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 49 ms.
Support contains 55 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 306/306 transitions.
Applied a total of 0 rules in 15 ms. Remains 233 /233 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 233/233 places, 306/306 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 306/306 transitions.
Applied a total of 0 rules in 12 ms. Remains 233 /233 variables (removed 0) and now considering 306/306 (removed 0) transitions.
[2023-03-20 21:33:49] [INFO ] Invariant cache hit.
[2023-03-20 21:33:49] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-20 21:33:49] [INFO ] Invariant cache hit.
[2023-03-20 21:33:49] [INFO ] State equation strengthened by 114 read => feed constraints.
[2023-03-20 21:33:50] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2023-03-20 21:33:50] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-20 21:33:50] [INFO ] Invariant cache hit.
[2023-03-20 21:33:50] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 895 ms. Remains : 233/233 places, 306/306 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 233 transition count 294
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 233 transition count 294
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 233 transition count 288
Applied a total of 30 rules in 22 ms. Remains 233 /233 variables (removed 0) and now considering 288/306 (removed 18) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 288 rows 233 cols
[2023-03-20 21:33:50] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-20 21:33:50] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:33:50] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-20 21:33:50] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:33:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 21:33:50] [INFO ] After 87ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:33:51] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2023-03-20 21:33:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-20 21:33:51] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-20 21:33:51] [INFO ] After 635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:33:51] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-20 21:33:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 233 places, 306 transitions and 1450 arcs took 3 ms.
[2023-03-20 21:33:51] [INFO ] Flatten gal took : 86 ms
Total runtime 35699 ms.
There are residual formulas that ITS could not solve within timeout
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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldRVt_PT_020B
(NrP: 233 NrTr: 306 NrArc: 1450)

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

net check time: 0m 0.000sec

init dd package: 0m 3.163sec


before gc: list nodes free: 8587

after gc: idd nodes used:1687, unused:63998313; list nodes free:281008804

before gc: list nodes free: 1976980

after gc: idd nodes used:1931, unused:63998069; list nodes free:283104626

before gc: list nodes free: 2080300

after gc: idd nodes used:2091, unused:63997909; list nodes free:287298079

before gc: list nodes free: 155948

after gc: idd nodes used:3001, unused:63996999; list nodes free:289390864

before gc: list nodes free: 1133594

after gc: idd nodes used:3245, unused:63996755; list nodes free:291486658

RS generation: 12m19.864sec


-> reachability set: #nodes 2620 (2.6e+03) #states 3,091,903,894,220,008,625,583,320,635,155,884 (33)



starting MCC model checker
--------------------------

checking: AG [[[p175<=0 & 0<=p175] | [p181<=0 & 0<=p181]]]
normalized: ~ [E [true U ~ [[[p175<=0 & 0<=p175] | [p181<=0 & 0<=p181]]]]]

abstracting: (0<=p181)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p181<=0)
states: 3,091,903,894,220,008,625,583,319,418,474,924 (33)
abstracting: (0<=p175)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p175<=0)
states: 2,318,923,018,760,368,721,592,567,502,611,884 (33)
-> the formula is TRUE

FORMULA ShieldRVt-PT-020B-ReachabilityFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [[[[p62<=1 & 1<=p62] & [p145<=1 & 1<=p145]] & [[p222<=1 & 1<=p222] & [[[p137<=0 & 0<=p137] | [[p40<=1 & 1<=p40] | [[p109<=1 & 1<=p109] & [p225<=1 & 1<=p225]]]] & [[p174<=1 & 1<=p174] | [[p164<=1 & 1<=p164] & [[p167<=1 & 1<=p167] & [p176<=1 & 1<=p176]]]]]]]]
normalized: E [true U [[[[[[[p176<=1 & 1<=p176] & [p167<=1 & 1<=p167]] & [p164<=1 & 1<=p164]] | [p174<=1 & 1<=p174]] & [[[[p225<=1 & 1<=p225] & [p109<=1 & 1<=p109]] | [p40<=1 & 1<=p40]] | [p137<=0 & 0<=p137]]] & [p222<=1 & 1<=p222]] & [[p145<=1 & 1<=p145] & [p62<=1 & 1<=p62]]]]

abstracting: (1<=p62)
states: 772,975,908,157,062,565,688,776,851,456,000 (32)
abstracting: (p62<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p145)
states: 1,032,593,214,637,485,136,456,301,150,208,000 (33)
abstracting: (p145<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p222)
states: 702,705,430,504,547,414,905,300,144,200,000 (32)
abstracting: (p222<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (0<=p137)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p137<=0)
states: 2,473,587,069,114,173,370,247,886,171,514,284 (33)
abstracting: (1<=p40)
states: 1,030,634,631,577,540,649,025,980,596,224,000 (33)
abstracting: (p40<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p109)
states: 1,030,634,631,406,716,878,968,200,894,873,600 (33)
abstracting: (p109<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p225)
states: 491,552 (5)
abstracting: (p225<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p174)
states: 9,245,761,536 (9)
abstracting: (p174<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p164)
states: 774,444,910,978,113,852,342,233,527,019,520 (32)
abstracting: (p164<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p167)
states: 1,032,593,214,637,485,136,456,308,814,571,520 (33)
abstracting: (p167<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p176)
states: 772,971,071,650,364,408,800,899,520,512,000 (32)
abstracting: (p176<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)

before gc: list nodes free: 556949

after gc: idd nodes used:25472, unused:63974528; list nodes free:295577430

before gc: list nodes free: 1061859

after gc: idd nodes used:25499, unused:63974501; list nodes free:295577320

before gc: list nodes free: 1517352

after gc: idd nodes used:25536, unused:63974464; list nodes free:295577120

before gc: list nodes free: 1549150

after gc: idd nodes used:30515, unused:63969485; list nodes free:295554295

before gc: list nodes free: 1858741

after gc: idd nodes used:25685, unused:63974315; list nodes free:295576465

before gc: list nodes free: 907339

after gc: idd nodes used:26524, unused:63973476; list nodes free:295572476

before gc: list nodes free: 240854

after gc: idd nodes used:32516, unused:63967484; list nodes free:297641843

before gc: list nodes free: 362281

after gc: idd nodes used:26632, unused:63973368; list nodes free:297669126

before gc: list nodes free: 133676

after gc: idd nodes used:26887, unused:63973113; list nodes free:297667886

before gc: list nodes free: 408033

after gc: idd nodes used:26741, unused:63973259; list nodes free:297668586

before gc: list nodes free: 890426

after gc: idd nodes used:26683, unused:63973317; list nodes free:297668890

before gc: list nodes free: 854198

after gc: idd nodes used:27741, unused:63972259; list nodes free:297663827
MC time: 23m49.000sec

checking: EF [[[[[p214<=1 & 1<=p214] & [p209<=1 & 1<=p209]] & [[p208<=1 & 1<=p208] & [p198<=1 & 1<=p198]]] & [[[[[[p71<=1 & 1<=p71] | [p120<=1 & 1<=p120]] & [[p130<=0 & 0<=p130] | [[p219<=0 & 0<=p219] | [[p113<=0 & 0<=p113] & [p190<=0 & 0<=p190]]]]] | [p45<=1 & 1<=p45]] & [p162<=0 & 0<=p162]] & [[[[[[[[[[p16<=1 & 1<=p16] & [p24<=1 & 1<=p24]] & [[p31<=1 & 1<=p31] & [p3<=1 & 1<=p3]]] | [[p59<=1 & 1<=p59] & [[p63<=1 & 1<=p63] & [p68<=1 & 1<=p68]]]] | [p54<=1 & 1<=p54]] & [[[p206<=1 & 1<=p206] & [p38<=1 & 1<=p38]] | [p133<=1 & 1<=p133]]] & [[p200<=1 & 1<=p200] & [p103<=1 & 1<=p103]]] | [[[p7<=0 & 0<=p7] & [p157<=1 & 1<=p157]] | [[[p207<=1 & 1<=p207] & [p221<=1 & 1<=p221]] & [[p232<=1 & 1<=p232] & [p169<=1 & 1<=p169]]]]] | [[p151<=0 & 0<=p151] | [[p139<=0 & 0<=p139] | [p142<=0 & 0<=p142]]]] & [[p51<=1 & 1<=p51] | [[[p122<=0 & 0<=p122] & [p52<=0 & 0<=p52]] & [[p26<=1 & 1<=p26] & [[p25<=0 & 0<=p25] | [[p231<=1 & 1<=p231] | [[p189<=0 & 0<=p189] & [p134<=0 & 0<=p134]]]]]]]]]]]
normalized: E [true U [[[[[[[[[p190<=0 & 0<=p190] & [p113<=0 & 0<=p113]] | [p219<=0 & 0<=p219]] | [p130<=0 & 0<=p130]] & [[p120<=1 & 1<=p120] | [p71<=1 & 1<=p71]]] | [p45<=1 & 1<=p45]] & [p162<=0 & 0<=p162]] & [[[[[[[[p134<=0 & 0<=p134] & [p189<=0 & 0<=p189]] | [p231<=1 & 1<=p231]] | [p25<=0 & 0<=p25]] & [p26<=1 & 1<=p26]] & [[p52<=0 & 0<=p52] & [p122<=0 & 0<=p122]]] | [p51<=1 & 1<=p51]] & [[[[p142<=0 & 0<=p142] | [p139<=0 & 0<=p139]] | [p151<=0 & 0<=p151]] | [[[[[p169<=1 & 1<=p169] & [p232<=1 & 1<=p232]] & [[p221<=1 & 1<=p221] & [p207<=1 & 1<=p207]]] | [[p157<=1 & 1<=p157] & [p7<=0 & 0<=p7]]] | [[[p103<=1 & 1<=p103] & [p200<=1 & 1<=p200]] & [[[p133<=1 & 1<=p133] | [[p38<=1 & 1<=p38] & [p206<=1 & 1<=p206]]] & [[p54<=1 & 1<=p54] | [[[[p68<=1 & 1<=p68] & [p63<=1 & 1<=p63]] & [p59<=1 & 1<=p59]] | [[[p3<=1 & 1<=p3] & [p31<=1 & 1<=p31]] & [[p24<=1 & 1<=p24] & [p16<=1 & 1<=p16]]]]]]]]]]] & [[[p198<=1 & 1<=p198] & [p208<=1 & 1<=p208]] & [[p209<=1 & 1<=p209] & [p214<=1 & 1<=p214]]]]]

abstracting: (1<=p214)
states: 1,030,634,631,406,669,541,861,106,878,497,942 (33)
abstracting: (p214<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p209)
states: 1,030,634,631,406,669,541,861,106,878,160,000 (33)
abstracting: (p209<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p208)
states: 618,380,778,844,001,725,116,664,127,233,942 (32)
abstracting: (p208<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p198)
states: 618,380,778,844,001,725,116,664,126,896,000 (32)
abstracting: (p198<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p16)
states: 1,031,031,946,222,202,394,681,284,834,027,520 (33)
abstracting: (p16<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p24)
states: 1,029,840,001,775,899,859,313,053,267,783,680 (33)
abstracting: (p24<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p31)
states: 1,029,840,001,775,899,859,313,048,158,208,000 (33)
abstracting: (p31<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p3)
states: 1,029,840,001,775,751,847,766,899,562,496,000 (33)
abstracting: (p3<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p59)
states: 1,030,634,631,577,540,649,025,988,260,587,520 (33)
abstracting: (p59<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p63)
states: 772,975,995,382,793,871,158,996,953,835,520 (32)
abstracting: (p63<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p68)
states: 1,030,634,616,759,880,005,816,282,667,008,000 (33)
abstracting: (p68<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p54)
states: 618,380,774,464,204,123,233,621,899,673,600 (32)
abstracting: (p54<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p206)
states: 618,380,778,844,001,725,116,664,126,896,000 (32)
abstracting: (p206<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p38)
states: 772,975,973,512,284,379,604,606,619,648,000 (32)
abstracting: (p38<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p133)
states: 514,497,908,433,343,148,086,021,519,733,760 (32)
abstracting: (p133<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p200)
states: 618,380,778,844,001,725,116,664,126,896,000 (32)
abstracting: (p200<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p103)
states: 772,975,966,231,607,388,373,416,775,680,000 (32)
abstracting: (p103<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (0<=p7)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p7<=0)
states: 2,319,523,892,888,182,405,462,633,580,307,884 (33)
abstracting: (1<=p157)
states: 772,974,339,586,789,573,864,184,057,856,000 (32)
abstracting: (p157<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p207)
states: 618,380,778,844,001,725,116,664,126,896,000 (32)
abstracting: (p207<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p221)
states: 1,054,058,145,756,821,122,357,950,216,422,888 (33)
abstracting: (p221<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p232)
states: 632,434,887,454,092,673,414,770,130,087,220 (32)
abstracting: (p232<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p169)
states: 441,703,357,405,508,516,566,150,000,091,136 (32)
abstracting: (p169<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (0<=p151)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p151<=0)
states: 2,061,349,204,986,047,170,948,752,113,427,884 (33)
abstracting: (0<=p139)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p139<=0)
states: 2,473,427,184,768,757,195,794,812,013,198,764 (33)
abstracting: (0<=p142)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p142<=0)
states: 2,061,349,204,986,047,170,948,752,113,427,884 (33)
abstracting: (1<=p51)
states: 1,030,634,605,667,993,411,804,619,073,536,000 (33)
abstracting: (p51<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (0<=p122)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p122<=0)
states: 2,061,269,262,813,291,746,615,119,740,282,284 (33)
abstracting: (0<=p52)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p52<=0)
states: 2,473,523,108,806,310,497,642,100,831,610,284 (33)
abstracting: (1<=p26)
states: 1,030,634,631,065,618,048,080,037,560,320,000 (33)
abstracting: (p26<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (0<=p25)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p25<=0)
states: 3,090,711,949,773,706,090,215,086,514,124,204 (33)
abstracting: (1<=p231)
states: 632,434,887,454,092,673,414,770,129,780,000 (32)
abstracting: (p231<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (0<=p189)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p189<=0)
states: 3,091,903,894,220,008,625,583,319,418,474,924 (33)
abstracting: (0<=p134)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p134<=0)
states: 2,577,405,985,786,665,477,497,299,115,422,124 (33)
abstracting: (0<=p162)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p162<=0)
states: 2,323,315,125,315,790,566,646,985,692,947,884 (33)
abstracting: (1<=p45)
states: 772,975,973,512,284,379,604,606,619,648,000 (32)
abstracting: (p45<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p71)
states: 1,030,634,616,759,880,005,816,282,667,008,000 (33)
abstracting: (p71<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p120)
states: 772,975,973,554,990,322,119,051,544,985,600 (32)
abstracting: (p120<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (0<=p130)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p130<=0)
states: 2,576,086,939,937,372,569,393,072,163,399,084 (33)
abstracting: (0<=p219)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p219<=0)
states: 2,389,198,463,715,461,210,678,020,490,832,996 (33)
abstracting: (0<=p113)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p113<=0)
states: 2,061,269,321,400,355,216,580,197,894,727,084 (33)
abstracting: (0<=p190)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p190<=0)
states: 2,208,516,787,027,542,582,830,738,564,883,884 (33)

before gc: list nodes free: 2324336

after gc: idd nodes used:91468, unused:63908532; list nodes free:297369563

before gc: list nodes free: 2857133

after gc: idd nodes used:98204, unused:63901796; list nodes free:297338414

before gc: list nodes free: 2905188

after gc: idd nodes used:91969, unused:63908031; list nodes free:297367191

before gc: list nodes free: 2757140

after gc: idd nodes used:92048, unused:63907952; list nodes free:297366867

before gc: list nodes free: 3015501

after gc: idd nodes used:98483, unused:63901517; list nodes free:297337024
MC time: 11m54.999sec

checking: EF [[[[p62<=1 & 1<=p62] & [p145<=1 & 1<=p145]] & [[p222<=1 & 1<=p222] & [[[p137<=0 & 0<=p137] | [[p40<=1 & 1<=p40] | [[p109<=1 & 1<=p109] & [p225<=1 & 1<=p225]]]] & [[p174<=1 & 1<=p174] | [[p164<=1 & 1<=p164] & [[p167<=1 & 1<=p167] & [p176<=1 & 1<=p176]]]]]]]]
normalized: E [true U [[[[[[[p176<=1 & 1<=p176] & [p167<=1 & 1<=p167]] & [p164<=1 & 1<=p164]] | [p174<=1 & 1<=p174]] & [[[[p225<=1 & 1<=p225] & [p109<=1 & 1<=p109]] | [p40<=1 & 1<=p40]] | [p137<=0 & 0<=p137]]] & [p222<=1 & 1<=p222]] & [[p145<=1 & 1<=p145] & [p62<=1 & 1<=p62]]]]

abstracting: (1<=p62)
states: 772,975,908,157,062,565,688,776,851,456,000 (32)
abstracting: (p62<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p145)
states: 1,032,593,214,637,485,136,456,301,150,208,000 (33)
abstracting: (p145<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p222)
states: 702,705,430,504,547,414,905,300,144,200,000 (32)
abstracting: (p222<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (0<=p137)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (p137<=0)
states: 2,473,587,069,114,173,370,247,886,171,514,284 (33)
abstracting: (1<=p40)
states: 1,030,634,631,577,540,649,025,980,596,224,000 (33)
abstracting: (p40<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p109)
states: 1,030,634,631,406,716,878,968,200,894,873,600 (33)
abstracting: (p109<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p225)
states: 491,552 (5)
abstracting: (p225<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p174)
states: 9,245,761,536 (9)
abstracting: (p174<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p164)
states: 774,444,910,978,113,852,342,233,527,019,520 (32)
abstracting: (p164<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p167)
states: 1,032,593,214,637,485,136,456,308,814,571,520 (33)
abstracting: (p167<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)
abstracting: (1<=p176)
states: 772,971,071,650,364,408,800,899,520,512,000 (32)
abstracting: (p176<=1)
states: 3,091,903,894,220,008,625,583,320,635,155,884 (33)

before gc: list nodes free: 2877617

after gc: idd nodes used:82370, unused:63917630; list nodes free:297411664

before gc: list nodes free: 3448957

after gc: idd nodes used:82459, unused:63917541; list nodes free:297411235

before gc: list nodes free: 3624769

after gc: idd nodes used:82451, unused:63917549; list nodes free:297411261

before gc: list nodes free: 3824247

after gc: idd nodes used:82512, unused:63917488; list nodes free:297410999

before gc: list nodes free: 3901146

after gc: idd nodes used:82543, unused:63917457; list nodes free:297410846
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6064316 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16100136 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 ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
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.001sec

1199 1283 1277 1331 1302 1309 1281 1344 1323 1330 1345 1332 1321 1366 1305 1377 1394 1383 1266 1376 1320 1359 1376 1397 1374 1378 1316 1430 1404 1423 1370 1259 1409 1422 1399 1438 1454 1442 1369 1469 1467 1429 1472 1463 1448 1458 1348 1437 1389 1482 1455 1480 1452 1503 1474 1471 1496 1459 1457 1544 1360 1548 1481 1462 1509 1595 1570 1583 1575 1584 1542 1555 1582 1592 1559 1581 1606 1502 1603 1540 1630 1717 1683 1615 1660 1665 1692 1552 1657 1706 1641 1664 1629 1628 1611 1592 1590 1643 1705 1670 1613 1610 1592 1677 1680 1659 1618 1592 1641 1857 1892 1877 1873 1847 1883 1860 1890 1863 1859 1846 1896 1855 1883 1826 1876 1857 1919 1899 1938 1904 1876 1884 1810 1901 1773 1818 1854 1944 1825 1785 1879 1972 1919 1769 1865 1846 1803 1806 1900 1811 1933 1849 1828 1899 1848 1910 1940 1869 1877 1840 1951 1926 1907 1760 1858 1978 1970 1942 1895 1987 1931 1981 1949 1955 1920 1927 1915 2976 2914 2913 2871 2878 2857 2889 2895 2844 2939 2875 2951 2986 2972 2872 2946 2889 2962 2908 2971 2877 2995 2907 2938 2959 2968 2915 2957 2893 2954 2969 2931 2978 2853 2967 2928 2889 2948 2951 2907 2927 2896 2966 2974 2945 2980 2975 2950 2979 2997 2959 2941 2924 2941 2974 2976 2951 2965 2905 2961 2901 2887 2936 2999 2930 2954 2966 2983 2993 2955 2941 2947 2955 2924 2913 2949 2981 2957 2930 2927 2955 2937 3001 2876 2996 3021 2998 2888 2909 2932 3014 2973 2892 2990 2994 2904 2942 2996 2927 2997 2920 2939 2977 3008 2922 2888 2925 2983 2977 2998 2892 2977 2946 3012 2980 2986 2910 2971 2981 2872 2966 3002 2922 2893 2939 2931 2968 2921 2981 2944 3005 2987 2896 2975 2917 2970 2889 2998 2969 2965 3002 2993 2944 3015 2968 3018 2997 2965 2996 2988 2949 2962 2981 2979 3004 2932 2919 3020 2992 2972 2986 2918 2785 2929 2933 2974 3035 2979 2984 2933 3002 2907 2866 2988 2968 2999 2993 2959 2923 3001 2729 3018 2957 2984 3005 2870 2964 2993 3012 2970 2954 2978 2979 3040 2907 2946 2990 2962 2925 3004 3005 2970 2977 2963 2944 3004 2951 3023 3036 2978 2944 2918 3020 3016 2995 3042 2832 3035 3021 3023 3007 3048 2972 3029 2987 3023 3025 3046 2917 3068 3042 2992 2980 2970 2877 2955 2975 2997 3034 2945 2991 2922 3035 2905 3056 2982 3007 2993 3032 3046 3004 2967 3008 3006 3016 2976 2923 3040 2980 2995 3042 2954 3012 2981 2932 3037 3057 2992 3012 3045 3005 3062 3080 3047 3010 3056 3037 2967 3064 2879 3010 3031 3070 3029 3068 2997 3013 3025 3028 2957 2999 3013 2951 3014 3062 3031 3054 3013 3022 3075 2984 2964 3042 3035 2934 3011 3001 3036 3085 3043 3018 3074 3059 2987 3078 3061
iterations count:49374934 (161355), effective:8197932 (26790)

initing FirstDep: 0m 0.001sec

4707 4817 4789 4726 4878 4829 4694 4670 4795 4876 4849 4758 4718 5624 5714 5781 5917 5524 5883 6052 6000 6051 5822 6045 5834 5847 6033
sat_reach.icc:155: Timeout: after 1428 sec

6162 6430 6487 6550 6562 6642 6600 6644 6788 6724 6593 6645
sat_reach.icc:155: Timeout: after 714 sec

4707 4817 4789 4726 4878 4829 4694 4670 4795 4876 4849 4758 4718

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="ShieldRVt-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldRVt-PT-020B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978700287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-020B.tgz
mv ShieldRVt-PT-020B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;