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.r427-tajo-167905979500303.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldRVt-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r427-tajo-167905979500303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 8.4K Feb 25 23:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 23:08 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.4K 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.6K Feb 25 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 23:09 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 364K 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-030B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679383850943

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-21 07:30:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 07:30:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 07:30:52] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-21 07:30:52] [INFO ] Transformed 1503 places.
[2023-03-21 07:30:52] [INFO ] Transformed 1503 transitions.
[2023-03-21 07:30:52] [INFO ] Found NUPN structural information;
[2023-03-21 07:30:52] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 16) seen :9
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
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 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1503 rows 1503 cols
[2023-03-21 07:30:53] [INFO ] Computed 121 place invariants in 25 ms
[2023-03-21 07:30:54] [INFO ] After 586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 07:30:54] [INFO ] [Nat]Absence check using 121 positive place invariants in 57 ms returned sat
[2023-03-21 07:30:57] [INFO ] After 2500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 07:30:58] [INFO ] Deduced a trap composed of 24 places in 489 ms of which 22 ms to minimize.
[2023-03-21 07:30:58] [INFO ] Deduced a trap composed of 31 places in 448 ms of which 1 ms to minimize.
[2023-03-21 07:30:59] [INFO ] Deduced a trap composed of 28 places in 399 ms of which 2 ms to minimize.
[2023-03-21 07:30:59] [INFO ] Deduced a trap composed of 25 places in 388 ms of which 2 ms to minimize.
[2023-03-21 07:31:00] [INFO ] Deduced a trap composed of 43 places in 366 ms of which 2 ms to minimize.
[2023-03-21 07:31:00] [INFO ] Deduced a trap composed of 46 places in 353 ms of which 1 ms to minimize.
[2023-03-21 07:31:01] [INFO ] Deduced a trap composed of 44 places in 327 ms of which 1 ms to minimize.
[2023-03-21 07:31:01] [INFO ] Deduced a trap composed of 37 places in 331 ms of which 1 ms to minimize.
[2023-03-21 07:31:01] [INFO ] Deduced a trap composed of 35 places in 317 ms of which 1 ms to minimize.
[2023-03-21 07:31:02] [INFO ] Deduced a trap composed of 53 places in 339 ms of which 1 ms to minimize.
[2023-03-21 07:31:02] [INFO ] Deduced a trap composed of 35 places in 315 ms of which 1 ms to minimize.
[2023-03-21 07:31:03] [INFO ] Deduced a trap composed of 28 places in 331 ms of which 1 ms to minimize.
[2023-03-21 07:31:03] [INFO ] Deduced a trap composed of 27 places in 308 ms of which 1 ms to minimize.
[2023-03-21 07:31:03] [INFO ] Deduced a trap composed of 25 places in 326 ms of which 0 ms to minimize.
[2023-03-21 07:31:04] [INFO ] Deduced a trap composed of 36 places in 339 ms of which 2 ms to minimize.
[2023-03-21 07:31:04] [INFO ] Deduced a trap composed of 34 places in 322 ms of which 1 ms to minimize.
[2023-03-21 07:31:04] [INFO ] Deduced a trap composed of 35 places in 273 ms of which 1 ms to minimize.
[2023-03-21 07:31:05] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 1 ms to minimize.
[2023-03-21 07:31:05] [INFO ] Deduced a trap composed of 38 places in 223 ms of which 1 ms to minimize.
[2023-03-21 07:31:05] [INFO ] Deduced a trap composed of 43 places in 266 ms of which 1 ms to minimize.
[2023-03-21 07:31:06] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 0 ms to minimize.
[2023-03-21 07:31:06] [INFO ] Deduced a trap composed of 32 places in 255 ms of which 2 ms to minimize.
[2023-03-21 07:31:06] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 1 ms to minimize.
[2023-03-21 07:31:07] [INFO ] Deduced a trap composed of 40 places in 290 ms of which 2 ms to minimize.
[2023-03-21 07:31:07] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 1 ms to minimize.
[2023-03-21 07:31:07] [INFO ] Deduced a trap composed of 39 places in 290 ms of which 1 ms to minimize.
[2023-03-21 07:31:08] [INFO ] Deduced a trap composed of 43 places in 279 ms of which 1 ms to minimize.
[2023-03-21 07:31:08] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 0 ms to minimize.
[2023-03-21 07:31:08] [INFO ] Deduced a trap composed of 27 places in 284 ms of which 1 ms to minimize.
[2023-03-21 07:31:09] [INFO ] Deduced a trap composed of 39 places in 250 ms of which 1 ms to minimize.
[2023-03-21 07:31:09] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 1 ms to minimize.
[2023-03-21 07:31:09] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 1 ms to minimize.
[2023-03-21 07:31:10] [INFO ] Deduced a trap composed of 37 places in 240 ms of which 1 ms to minimize.
[2023-03-21 07:31:10] [INFO ] Deduced a trap composed of 42 places in 265 ms of which 2 ms to minimize.
[2023-03-21 07:31:10] [INFO ] Deduced a trap composed of 61 places in 200 ms of which 1 ms to minimize.
[2023-03-21 07:31:10] [INFO ] Deduced a trap composed of 60 places in 223 ms of which 1 ms to minimize.
[2023-03-21 07:31:11] [INFO ] Deduced a trap composed of 60 places in 222 ms of which 1 ms to minimize.
[2023-03-21 07:31:11] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 1 ms to minimize.
[2023-03-21 07:31:11] [INFO ] Deduced a trap composed of 52 places in 208 ms of which 1 ms to minimize.
[2023-03-21 07:31:12] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 1 ms to minimize.
[2023-03-21 07:31:12] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 1 ms to minimize.
[2023-03-21 07:31:12] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 1 ms to minimize.
[2023-03-21 07:31:12] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 0 ms to minimize.
[2023-03-21 07:31:13] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 0 ms to minimize.
[2023-03-21 07:31:13] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 0 ms to minimize.
[2023-03-21 07:31:13] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 1 ms to minimize.
[2023-03-21 07:31:13] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2023-03-21 07:31:13] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 0 ms to minimize.
[2023-03-21 07:31:14] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 1 ms to minimize.
[2023-03-21 07:31:14] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 1 ms to minimize.
[2023-03-21 07:31:14] [INFO ] Deduced a trap composed of 38 places in 202 ms of which 2 ms to minimize.
[2023-03-21 07:31:14] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 0 ms to minimize.
[2023-03-21 07:31:15] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 17324 ms
[2023-03-21 07:31:15] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 1 ms to minimize.
[2023-03-21 07:31:15] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 2 ms to minimize.
[2023-03-21 07:31:15] [INFO ] Deduced a trap composed of 56 places in 192 ms of which 0 ms to minimize.
[2023-03-21 07:31:16] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 1 ms to minimize.
[2023-03-21 07:31:16] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 2 ms to minimize.
[2023-03-21 07:31:16] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 1 ms to minimize.
[2023-03-21 07:31:16] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 1 ms to minimize.
[2023-03-21 07:31:16] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 0 ms to minimize.
[2023-03-21 07:31:17] [INFO ] Deduced a trap composed of 55 places in 157 ms of which 1 ms to minimize.
[2023-03-21 07:31:18] [INFO ] Deduced a trap composed of 46 places in 491 ms of which 1 ms to minimize.
[2023-03-21 07:31:18] [INFO ] Deduced a trap composed of 48 places in 469 ms of which 1 ms to minimize.
[2023-03-21 07:31:19] [INFO ] Deduced a trap composed of 30 places in 498 ms of which 2 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-21 07:31:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 07:31:19] [INFO ] After 25181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 474 ms.
Support contains 205 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions removed 291 transitions
Trivial Post-agglo rules discarded 291 transitions
Performed 291 trivial Post agglomeration. Transition count delta: 291
Iterating post reduction 0 with 291 rules applied. Total rules applied 291 place count 1503 transition count 1212
Reduce places removed 291 places and 0 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 1 with 339 rules applied. Total rules applied 630 place count 1212 transition count 1164
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 678 place count 1164 transition count 1164
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 678 place count 1164 transition count 1040
Deduced a syphon composed of 124 places in 4 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 3 with 248 rules applied. Total rules applied 926 place count 1040 transition count 1040
Discarding 169 places :
Symmetric choice reduction at 3 with 169 rule applications. Total rules 1095 place count 871 transition count 871
Iterating global reduction 3 with 169 rules applied. Total rules applied 1264 place count 871 transition count 871
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1264 place count 871 transition count 825
Deduced a syphon composed of 46 places in 4 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1356 place count 825 transition count 825
Performed 221 Post agglomeration using F-continuation condition.Transition count delta: 221
Deduced a syphon composed of 221 places in 3 ms
Reduce places removed 221 places and 0 transitions.
Iterating global reduction 3 with 442 rules applied. Total rules applied 1798 place count 604 transition count 604
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1892 place count 557 transition count 621
Free-agglomeration rule applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1906 place count 557 transition count 607
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 1920 place count 543 transition count 607
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1922 place count 543 transition count 605
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1932 place count 543 transition count 605
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1933 place count 543 transition count 605
Applied a total of 1933 rules in 413 ms. Remains 543 /1503 variables (removed 960) and now considering 605/1503 (removed 898) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 543/1503 places, 605/1503 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 7) seen :4
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 605 rows 543 cols
[2023-03-21 07:31:20] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-21 07:31:20] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 07:31:20] [INFO ] [Nat]Absence check using 121 positive place invariants in 23 ms returned sat
[2023-03-21 07:31:21] [INFO ] After 592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 07:31:21] [INFO ] State equation strengthened by 99 read => feed constraints.
[2023-03-21 07:31:22] [INFO ] After 411ms SMT Verify possible using 99 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 07:31:22] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2023-03-21 07:31:22] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2023-03-21 07:31:22] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2023-03-21 07:31:22] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2023-03-21 07:31:22] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2023-03-21 07:31:22] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2023-03-21 07:31:23] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2023-03-21 07:31:23] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2023-03-21 07:31:23] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2023-03-21 07:31:23] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2023-03-21 07:31:23] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2023-03-21 07:31:23] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2023-03-21 07:31:23] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2023-03-21 07:31:23] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2023-03-21 07:31:24] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2023-03-21 07:31:24] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 0 ms to minimize.
[2023-03-21 07:31:24] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2023-03-21 07:31:24] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2023-03-21 07:31:24] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2374 ms
[2023-03-21 07:31:24] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2023-03-21 07:31:24] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2023-03-21 07:31:24] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2023-03-21 07:31:25] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2023-03-21 07:31:25] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2023-03-21 07:31:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 744 ms
[2023-03-21 07:31:25] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2023-03-21 07:31:25] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-21 07:31:25] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2023-03-21 07:31:26] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2023-03-21 07:31:26] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2023-03-21 07:31:26] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2023-03-21 07:31:26] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2023-03-21 07:31:26] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2023-03-21 07:31:26] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2023-03-21 07:31:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1240 ms
[2023-03-21 07:31:26] [INFO ] After 5154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 684 ms.
[2023-03-21 07:31:27] [INFO ] After 6602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 53 ms.
Support contains 139 out of 543 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 543/543 places, 605/605 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 543 transition count 579
Reduce places removed 26 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 33 rules applied. Total rules applied 59 place count 517 transition count 572
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 66 place count 510 transition count 572
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 66 place count 510 transition count 557
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 96 place count 495 transition count 557
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 100 place count 491 transition count 553
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 491 transition count 553
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 104 place count 491 transition count 552
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 490 transition count 552
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 162 place count 462 transition count 524
Renaming transitions due to excessive name length > 1024 char.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 176 place count 455 transition count 531
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 177 place count 455 transition count 530
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 182 place count 455 transition count 525
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 187 place count 450 transition count 525
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 192 place count 450 transition count 525
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 450 transition count 525
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 449 transition count 524
Applied a total of 194 rules in 146 ms. Remains 449 /543 variables (removed 94) and now considering 524/605 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 449/543 places, 524/605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 196754 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 196754 steps, saw 133428 distinct states, run finished after 3004 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 524 rows 449 cols
[2023-03-21 07:31:30] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-21 07:31:31] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 07:31:31] [INFO ] [Nat]Absence check using 121 positive place invariants in 14 ms returned sat
[2023-03-21 07:31:31] [INFO ] After 475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 07:31:31] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-21 07:31:31] [INFO ] After 317ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 07:31:32] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2023-03-21 07:31:32] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2023-03-21 07:31:32] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2023-03-21 07:31:32] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2023-03-21 07:31:32] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2023-03-21 07:31:32] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2023-03-21 07:31:32] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-21 07:31:32] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2023-03-21 07:31:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 893 ms
[2023-03-21 07:31:33] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2023-03-21 07:31:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-21 07:31:33] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 0 ms to minimize.
[2023-03-21 07:31:33] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2023-03-21 07:31:33] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2023-03-21 07:31:33] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2023-03-21 07:31:33] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2023-03-21 07:31:34] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2023-03-21 07:31:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 788 ms
[2023-03-21 07:31:34] [INFO ] After 2459ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 291 ms.
[2023-03-21 07:31:34] [INFO ] After 3327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 74 ms.
Support contains 139 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 524/524 transitions.
Applied a total of 0 rules in 22 ms. Remains 449 /449 variables (removed 0) and now considering 524/524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 449/449 places, 524/524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 524/524 transitions.
Applied a total of 0 rules in 25 ms. Remains 449 /449 variables (removed 0) and now considering 524/524 (removed 0) transitions.
[2023-03-21 07:31:34] [INFO ] Invariant cache hit.
[2023-03-21 07:31:34] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-21 07:31:34] [INFO ] Invariant cache hit.
[2023-03-21 07:31:34] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-21 07:31:35] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2023-03-21 07:31:35] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-21 07:31:35] [INFO ] Invariant cache hit.
[2023-03-21 07:31:35] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1086 ms. Remains : 449/449 places, 524/524 transitions.
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 449 transition count 508
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 27 place count 449 transition count 508
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 31 place count 449 transition count 504
Applied a total of 31 rules in 39 ms. Remains 449 /449 variables (removed 0) and now considering 504/524 (removed 20) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 504 rows 449 cols
[2023-03-21 07:31:35] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-21 07:31:35] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 07:31:35] [INFO ] [Nat]Absence check using 121 positive place invariants in 14 ms returned sat
[2023-03-21 07:31:36] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 07:31:36] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2023-03-21 07:31:36] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-21 07:31:36] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 0 ms to minimize.
[2023-03-21 07:31:36] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2023-03-21 07:31:36] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2023-03-21 07:31:36] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2023-03-21 07:31:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 573 ms
[2023-03-21 07:31:36] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2023-03-21 07:31:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2023-03-21 07:31:37] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2023-03-21 07:31:37] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2023-03-21 07:31:37] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2023-03-21 07:31:37] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2023-03-21 07:31:37] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2023-03-21 07:31:37] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2023-03-21 07:31:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 689 ms
[2023-03-21 07:31:37] [INFO ] After 2000ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-21 07:31:38] [INFO ] After 2378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-21 07:31:38] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2023-03-21 07:31:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 449 places, 524 transitions and 2026 arcs took 6 ms.
[2023-03-21 07:31:38] [INFO ] Flatten gal took : 83 ms
Total runtime 45826 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldRVt (PT), instance 030B
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 449 places, 524 transitions, 2026 arcs.
Final Score: 6811.195
Took : 18 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679383917377

--------------------
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
ERROR in file model.sm near line 3076:
syntax error

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-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is ShieldRVt-PT-030B, 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 r427-tajo-167905979500303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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