About the Execution of Smart+red for ShieldIIPs-PT-030B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
764.432 | 116350.00 | 157900.00 | 59.80 | TFTT?FF?TF?TT??T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r395-oct2-167903718400127.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldIIPs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718400127
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 16:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 16:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 503K 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 ShieldIIPs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679556568063
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=ShieldIIPs-PT-030B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:29:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 07:29:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:29:31] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-03-23 07:29:31] [INFO ] Transformed 1803 places.
[2023-03-23 07:29:31] [INFO ] Transformed 1773 transitions.
[2023-03-23 07:29:31] [INFO ] Found NUPN structural information;
[2023-03-23 07:29:31] [INFO ] Parsed PT model containing 1803 places and 1773 transitions and 5346 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 16) seen :11
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1773 rows 1803 cols
[2023-03-23 07:29:32] [INFO ] Computed 271 place invariants in 26 ms
[2023-03-23 07:29:33] [INFO ] [Real]Absence check using 271 positive place invariants in 215 ms returned sat
[2023-03-23 07:29:33] [INFO ] After 1063ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 07:29:34] [INFO ] [Nat]Absence check using 271 positive place invariants in 153 ms returned sat
[2023-03-23 07:29:37] [INFO ] After 2959ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 07:29:38] [INFO ] Deduced a trap composed of 24 places in 744 ms of which 9 ms to minimize.
[2023-03-23 07:29:39] [INFO ] Deduced a trap composed of 22 places in 730 ms of which 2 ms to minimize.
[2023-03-23 07:29:40] [INFO ] Deduced a trap composed of 16 places in 723 ms of which 2 ms to minimize.
[2023-03-23 07:29:40] [INFO ] Deduced a trap composed of 25 places in 554 ms of which 2 ms to minimize.
[2023-03-23 07:29:41] [INFO ] Deduced a trap composed of 14 places in 1017 ms of which 13 ms to minimize.
[2023-03-23 07:29:43] [INFO ] Deduced a trap composed of 32 places in 859 ms of which 1 ms to minimize.
[2023-03-23 07:29:44] [INFO ] Deduced a trap composed of 33 places in 1000 ms of which 15 ms to minimize.
[2023-03-23 07:29:45] [INFO ] Deduced a trap composed of 18 places in 679 ms of which 1 ms to minimize.
[2023-03-23 07:29:46] [INFO ] Deduced a trap composed of 24 places in 534 ms of which 1 ms to minimize.
[2023-03-23 07:29:46] [INFO ] Deduced a trap composed of 27 places in 609 ms of which 6 ms to minimize.
[2023-03-23 07:29:47] [INFO ] Deduced a trap composed of 27 places in 673 ms of which 2 ms to minimize.
[2023-03-23 07:29:48] [INFO ] Deduced a trap composed of 16 places in 571 ms of which 1 ms to minimize.
[2023-03-23 07:29:48] [INFO ] Deduced a trap composed of 22 places in 432 ms of which 1 ms to minimize.
[2023-03-23 07:29:49] [INFO ] Deduced a trap composed of 20 places in 453 ms of which 1 ms to minimize.
[2023-03-23 07:29:49] [INFO ] Deduced a trap composed of 44 places in 428 ms of which 17 ms to minimize.
[2023-03-23 07:29:50] [INFO ] Deduced a trap composed of 15 places in 478 ms of which 1 ms to minimize.
[2023-03-23 07:29:51] [INFO ] Deduced a trap composed of 19 places in 688 ms of which 1 ms to minimize.
[2023-03-23 07:29:51] [INFO ] Deduced a trap composed of 21 places in 503 ms of which 1 ms to minimize.
[2023-03-23 07:29:52] [INFO ] Deduced a trap composed of 20 places in 519 ms of which 1 ms to minimize.
[2023-03-23 07:29:52] [INFO ] Deduced a trap composed of 21 places in 421 ms of which 1 ms to minimize.
[2023-03-23 07:29:53] [INFO ] Deduced a trap composed of 13 places in 370 ms of which 1 ms to minimize.
[2023-03-23 07:29:53] [INFO ] Deduced a trap composed of 21 places in 591 ms of which 5 ms to minimize.
[2023-03-23 07:29:54] [INFO ] Deduced a trap composed of 28 places in 399 ms of which 1 ms to minimize.
[2023-03-23 07:29:54] [INFO ] Deduced a trap composed of 23 places in 535 ms of which 1 ms to minimize.
[2023-03-23 07:29:55] [INFO ] Deduced a trap composed of 21 places in 499 ms of which 2 ms to minimize.
[2023-03-23 07:29:55] [INFO ] Deduced a trap composed of 24 places in 391 ms of which 1 ms to minimize.
[2023-03-23 07:29:56] [INFO ] Deduced a trap composed of 24 places in 594 ms of which 1 ms to minimize.
[2023-03-23 07:29:57] [INFO ] Deduced a trap composed of 21 places in 461 ms of which 2 ms to minimize.
[2023-03-23 07:29:57] [INFO ] Deduced a trap composed of 36 places in 503 ms of which 17 ms to minimize.
[2023-03-23 07:29:58] [INFO ] Deduced a trap composed of 22 places in 441 ms of which 9 ms to minimize.
[2023-03-23 07:29:58] [INFO ] Deduced a trap composed of 20 places in 493 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-23 07:29:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:29:58] [INFO ] After 25165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 210 ms.
Support contains 110 out of 1803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 1803 transition count 1645
Reduce places removed 128 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 136 rules applied. Total rules applied 264 place count 1675 transition count 1637
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 272 place count 1667 transition count 1637
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 146 Pre rules applied. Total rules applied 272 place count 1667 transition count 1491
Deduced a syphon composed of 146 places in 3 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 564 place count 1521 transition count 1491
Discarding 187 places :
Symmetric choice reduction at 3 with 187 rule applications. Total rules 751 place count 1334 transition count 1304
Iterating global reduction 3 with 187 rules applied. Total rules applied 938 place count 1334 transition count 1304
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 938 place count 1334 transition count 1239
Deduced a syphon composed of 65 places in 6 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1068 place count 1269 transition count 1239
Performed 421 Post agglomeration using F-continuation condition.Transition count delta: 421
Deduced a syphon composed of 421 places in 4 ms
Reduce places removed 421 places and 0 transitions.
Iterating global reduction 3 with 842 rules applied. Total rules applied 1910 place count 848 transition count 818
Partial Free-agglomeration rule applied 189 times.
Drop transitions removed 189 transitions
Iterating global reduction 3 with 189 rules applied. Total rules applied 2099 place count 848 transition count 818
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2100 place count 847 transition count 817
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2101 place count 846 transition count 817
Applied a total of 2101 rules in 497 ms. Remains 846 /1803 variables (removed 957) and now considering 817/1773 (removed 956) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 ms. Remains : 846/1803 places, 817/1773 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 127879 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127879 steps, saw 67077 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 817 rows 846 cols
[2023-03-23 07:30:03] [INFO ] Computed 270 place invariants in 15 ms
[2023-03-23 07:30:03] [INFO ] [Real]Absence check using 267 positive place invariants in 80 ms returned sat
[2023-03-23 07:30:03] [INFO ] [Real]Absence check using 267 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-23 07:30:03] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 07:30:03] [INFO ] [Nat]Absence check using 267 positive place invariants in 75 ms returned sat
[2023-03-23 07:30:03] [INFO ] [Nat]Absence check using 267 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-23 07:30:04] [INFO ] After 777ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 07:30:04] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 0 ms to minimize.
[2023-03-23 07:30:04] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 1 ms to minimize.
[2023-03-23 07:30:05] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 1 ms to minimize.
[2023-03-23 07:30:05] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 0 ms to minimize.
[2023-03-23 07:30:05] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 1 ms to minimize.
[2023-03-23 07:30:05] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 1 ms to minimize.
[2023-03-23 07:30:05] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-03-23 07:30:06] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2023-03-23 07:30:06] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2023-03-23 07:30:06] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2023-03-23 07:30:06] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 0 ms to minimize.
[2023-03-23 07:30:06] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2023-03-23 07:30:06] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2023-03-23 07:30:07] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-23 07:30:07] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 1 ms to minimize.
[2023-03-23 07:30:07] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2023-03-23 07:30:07] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3162 ms
[2023-03-23 07:30:07] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2023-03-23 07:30:07] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2023-03-23 07:30:08] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2023-03-23 07:30:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 438 ms
[2023-03-23 07:30:08] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 0 ms to minimize.
[2023-03-23 07:30:08] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2023-03-23 07:30:08] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2023-03-23 07:30:09] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 1 ms to minimize.
[2023-03-23 07:30:09] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 0 ms to minimize.
[2023-03-23 07:30:09] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 27 ms to minimize.
[2023-03-23 07:30:09] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 6 ms to minimize.
[2023-03-23 07:30:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1570 ms
[2023-03-23 07:30:10] [INFO ] Deduced a trap composed of 5 places in 758 ms of which 0 ms to minimize.
[2023-03-23 07:30:11] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2023-03-23 07:30:11] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 0 ms to minimize.
[2023-03-23 07:30:11] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 1 ms to minimize.
[2023-03-23 07:30:11] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2023-03-23 07:30:12] [INFO ] Deduced a trap composed of 16 places in 321 ms of which 0 ms to minimize.
[2023-03-23 07:30:12] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 0 ms to minimize.
[2023-03-23 07:30:12] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 0 ms to minimize.
[2023-03-23 07:30:12] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 14 ms to minimize.
[2023-03-23 07:30:12] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2023-03-23 07:30:13] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-23 07:30:13] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 15 ms to minimize.
[2023-03-23 07:30:13] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2023-03-23 07:30:13] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2023-03-23 07:30:13] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 0 ms to minimize.
[2023-03-23 07:30:14] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 0 ms to minimize.
[2023-03-23 07:30:14] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2023-03-23 07:30:14] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4403 ms
[2023-03-23 07:30:14] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 1 ms to minimize.
[2023-03-23 07:30:14] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 2 ms to minimize.
[2023-03-23 07:30:15] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2023-03-23 07:30:15] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2023-03-23 07:30:15] [INFO ] Deduced a trap composed of 14 places in 529 ms of which 0 ms to minimize.
[2023-03-23 07:30:16] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 0 ms to minimize.
[2023-03-23 07:30:16] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 0 ms to minimize.
[2023-03-23 07:30:16] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 15 ms to minimize.
[2023-03-23 07:30:16] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 1 ms to minimize.
[2023-03-23 07:30:17] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 1 ms to minimize.
[2023-03-23 07:30:17] [INFO ] Deduced a trap composed of 7 places in 314 ms of which 1 ms to minimize.
[2023-03-23 07:30:17] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 1 ms to minimize.
[2023-03-23 07:30:18] [INFO ] Deduced a trap composed of 16 places in 303 ms of which 1 ms to minimize.
[2023-03-23 07:30:18] [INFO ] Deduced a trap composed of 7 places in 514 ms of which 1 ms to minimize.
[2023-03-23 07:30:19] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 1 ms to minimize.
[2023-03-23 07:30:19] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 0 ms to minimize.
[2023-03-23 07:30:19] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2023-03-23 07:30:19] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2023-03-23 07:30:19] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2023-03-23 07:30:19] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2023-03-23 07:30:20] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2023-03-23 07:30:20] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2023-03-23 07:30:20] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 0 ms to minimize.
[2023-03-23 07:30:20] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2023-03-23 07:30:20] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 1 ms to minimize.
[2023-03-23 07:30:21] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 1 ms to minimize.
[2023-03-23 07:30:21] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2023-03-23 07:30:21] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2023-03-23 07:30:21] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-23 07:30:21] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7358 ms
[2023-03-23 07:30:21] [INFO ] After 18154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 515 ms.
[2023-03-23 07:30:22] [INFO ] After 19008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 227 ms.
Support contains 110 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 817/817 transitions.
Applied a total of 0 rules in 31 ms. Remains 846 /846 variables (removed 0) and now considering 817/817 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 846/846 places, 817/817 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 817/817 transitions.
Applied a total of 0 rules in 31 ms. Remains 846 /846 variables (removed 0) and now considering 817/817 (removed 0) transitions.
[2023-03-23 07:30:22] [INFO ] Invariant cache hit.
[2023-03-23 07:30:23] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-23 07:30:23] [INFO ] Invariant cache hit.
[2023-03-23 07:30:25] [INFO ] Implicit Places using invariants and state equation in 1968 ms returned []
Implicit Place search using SMT with State Equation took 2409 ms to find 0 implicit places.
[2023-03-23 07:30:25] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-23 07:30:25] [INFO ] Invariant cache hit.
[2023-03-23 07:30:25] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2985 ms. Remains : 846/846 places, 817/817 transitions.
Applied a total of 0 rules in 18 ms. Remains 846 /846 variables (removed 0) and now considering 817/817 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-23 07:30:25] [INFO ] Invariant cache hit.
[2023-03-23 07:30:25] [INFO ] [Real]Absence check using 267 positive place invariants in 53 ms returned sat
[2023-03-23 07:30:25] [INFO ] [Real]Absence check using 267 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-23 07:30:25] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 07:30:26] [INFO ] [Nat]Absence check using 267 positive place invariants in 64 ms returned sat
[2023-03-23 07:30:26] [INFO ] [Nat]Absence check using 267 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-23 07:30:27] [INFO ] After 1233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 07:30:27] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 1 ms to minimize.
[2023-03-23 07:30:28] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 0 ms to minimize.
[2023-03-23 07:30:28] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2023-03-23 07:30:28] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
[2023-03-23 07:30:28] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 0 ms to minimize.
[2023-03-23 07:30:29] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 1 ms to minimize.
[2023-03-23 07:30:29] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 0 ms to minimize.
[2023-03-23 07:30:29] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 1 ms to minimize.
[2023-03-23 07:30:30] [INFO ] Deduced a trap composed of 7 places in 331 ms of which 1 ms to minimize.
[2023-03-23 07:30:30] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 1 ms to minimize.
[2023-03-23 07:30:30] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2023-03-23 07:30:30] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 1 ms to minimize.
[2023-03-23 07:30:31] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 0 ms to minimize.
[2023-03-23 07:30:31] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 0 ms to minimize.
[2023-03-23 07:30:31] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 0 ms to minimize.
[2023-03-23 07:30:31] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 1 ms to minimize.
[2023-03-23 07:30:31] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 1 ms to minimize.
[2023-03-23 07:30:32] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 0 ms to minimize.
[2023-03-23 07:30:32] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 13 ms to minimize.
[2023-03-23 07:30:32] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2023-03-23 07:30:32] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 0 ms to minimize.
[2023-03-23 07:30:32] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5144 ms
[2023-03-23 07:30:33] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2023-03-23 07:30:33] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 0 ms to minimize.
[2023-03-23 07:30:33] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2023-03-23 07:30:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 509 ms
[2023-03-23 07:30:33] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 0 ms to minimize.
[2023-03-23 07:30:33] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2023-03-23 07:30:34] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2023-03-23 07:30:34] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2023-03-23 07:30:34] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2023-03-23 07:30:34] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 0 ms to minimize.
[2023-03-23 07:30:34] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-23 07:30:35] [INFO ] Deduced a trap composed of 17 places in 776 ms of which 0 ms to minimize.
[2023-03-23 07:30:36] [INFO ] Deduced a trap composed of 18 places in 306 ms of which 1 ms to minimize.
[2023-03-23 07:30:36] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2023-03-23 07:30:36] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2023-03-23 07:30:36] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2023-03-23 07:30:36] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2023-03-23 07:30:37] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 3 ms to minimize.
[2023-03-23 07:30:37] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2023-03-23 07:30:37] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2023-03-23 07:30:37] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 0 ms to minimize.
[2023-03-23 07:30:37] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4429 ms
[2023-03-23 07:30:38] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 1 ms to minimize.
[2023-03-23 07:30:38] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2023-03-23 07:30:38] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 1 ms to minimize.
[2023-03-23 07:30:39] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 1 ms to minimize.
[2023-03-23 07:30:39] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2023-03-23 07:30:39] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 1 ms to minimize.
[2023-03-23 07:30:39] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 0 ms to minimize.
[2023-03-23 07:30:40] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2023-03-23 07:30:40] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2023-03-23 07:30:40] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 0 ms to minimize.
[2023-03-23 07:30:40] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2023-03-23 07:30:40] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-23 07:30:41] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 1 ms to minimize.
[2023-03-23 07:30:41] [INFO ] Deduced a trap composed of 18 places in 250 ms of which 0 ms to minimize.
[2023-03-23 07:30:41] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3436 ms
[2023-03-23 07:30:41] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 1 ms to minimize.
[2023-03-23 07:30:42] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 0 ms to minimize.
[2023-03-23 07:30:42] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2023-03-23 07:30:42] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2023-03-23 07:30:42] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 1 ms to minimize.
[2023-03-23 07:30:43] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 0 ms to minimize.
[2023-03-23 07:30:43] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2023-03-23 07:30:43] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 1 ms to minimize.
[2023-03-23 07:30:44] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 1 ms to minimize.
[2023-03-23 07:30:44] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 0 ms to minimize.
[2023-03-23 07:30:44] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 1 ms to minimize.
[2023-03-23 07:30:44] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 0 ms to minimize.
[2023-03-23 07:30:45] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 0 ms to minimize.
[2023-03-23 07:30:45] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 1 ms to minimize.
[2023-03-23 07:30:45] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3858 ms
[2023-03-23 07:30:45] [INFO ] After 19173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 741 ms.
[2023-03-23 07:30:46] [INFO ] After 20360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-23 07:30:46] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 15 ms.
[2023-03-23 07:30:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 846 places, 817 transitions and 3714 arcs took 10 ms.
[2023-03-23 07:30:46] [INFO ] Flatten gal took : 114 ms
Total runtime 75469 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (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: 846 places, 817 transitions, 3714 arcs.
Final Score: 25127.596
Took : 37 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
BK_STOP 1679556684413
--------------------
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 5481:
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="ShieldIIPs-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 ShieldIIPs-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 r395-oct2-167903718400127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-030B.tgz
mv ShieldIIPs-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 '
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 ;