Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788400070.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldIIPs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788400070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 14:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 14:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 332K May 18 16:43 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-020B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716938326135

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=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-28 23:18:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 23:18:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 23:18:48] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-05-28 23:18:48] [INFO ] Transformed 1203 places.
[2024-05-28 23:18:48] [INFO ] Transformed 1183 transitions.
[2024-05-28 23:18:48] [INFO ] Found NUPN structural information;
[2024-05-28 23:18:48] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 16) seen :13
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) 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 3) seen :1
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1183 rows 1203 cols
[2024-05-28 23:18:49] [INFO ] Computed 181 invariants in 32 ms
[2024-05-28 23:18:49] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 23:18:49] [INFO ] [Nat]Absence check using 181 positive place invariants in 86 ms returned sat
[2024-05-28 23:18:50] [INFO ] After 870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 23:18:51] [INFO ] Deduced a trap composed of 11 places in 300 ms of which 12 ms to minimize.
[2024-05-28 23:18:51] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 2 ms to minimize.
[2024-05-28 23:18:51] [INFO ] Deduced a trap composed of 22 places in 290 ms of which 3 ms to minimize.
[2024-05-28 23:18:52] [INFO ] Deduced a trap composed of 34 places in 264 ms of which 1 ms to minimize.
[2024-05-28 23:18:52] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 2 ms to minimize.
[2024-05-28 23:18:52] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 1 ms to minimize.
[2024-05-28 23:18:53] [INFO ] Deduced a trap composed of 30 places in 261 ms of which 1 ms to minimize.
[2024-05-28 23:18:53] [INFO ] Deduced a trap composed of 47 places in 265 ms of which 1 ms to minimize.
[2024-05-28 23:18:53] [INFO ] Deduced a trap composed of 20 places in 235 ms of which 1 ms to minimize.
[2024-05-28 23:18:54] [INFO ] Deduced a trap composed of 37 places in 259 ms of which 0 ms to minimize.
[2024-05-28 23:18:54] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 1 ms to minimize.
[2024-05-28 23:18:54] [INFO ] Deduced a trap composed of 33 places in 255 ms of which 1 ms to minimize.
[2024-05-28 23:18:55] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 0 ms to minimize.
[2024-05-28 23:18:55] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 1 ms to minimize.
[2024-05-28 23:18:55] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 1 ms to minimize.
[2024-05-28 23:18:55] [INFO ] Deduced a trap composed of 36 places in 244 ms of which 1 ms to minimize.
[2024-05-28 23:18:56] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 1 ms to minimize.
[2024-05-28 23:18:56] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 1 ms to minimize.
[2024-05-28 23:18:56] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 0 ms to minimize.
[2024-05-28 23:18:56] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 0 ms to minimize.
[2024-05-28 23:18:57] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 1 ms to minimize.
[2024-05-28 23:18:57] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 1 ms to minimize.
[2024-05-28 23:18:57] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 1 ms to minimize.
[2024-05-28 23:18:58] [INFO ] Deduced a trap composed of 54 places in 196 ms of which 1 ms to minimize.
[2024-05-28 23:18:58] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 0 ms to minimize.
[2024-05-28 23:18:58] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 1 ms to minimize.
[2024-05-28 23:18:59] [INFO ] Deduced a trap composed of 28 places in 255 ms of which 1 ms to minimize.
[2024-05-28 23:18:59] [INFO ] Deduced a trap composed of 28 places in 244 ms of which 1 ms to minimize.
[2024-05-28 23:18:59] [INFO ] Deduced a trap composed of 34 places in 251 ms of which 1 ms to minimize.
[2024-05-28 23:18:59] [INFO ] Deduced a trap composed of 33 places in 249 ms of which 1 ms to minimize.
[2024-05-28 23:19:00] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 1 ms to minimize.
[2024-05-28 23:19:00] [INFO ] Deduced a trap composed of 34 places in 247 ms of which 1 ms to minimize.
[2024-05-28 23:19:00] [INFO ] Deduced a trap composed of 25 places in 235 ms of which 1 ms to minimize.
[2024-05-28 23:19:01] [INFO ] Deduced a trap composed of 29 places in 235 ms of which 1 ms to minimize.
[2024-05-28 23:19:01] [INFO ] Deduced a trap composed of 27 places in 326 ms of which 1 ms to minimize.
[2024-05-28 23:19:02] [INFO ] Deduced a trap composed of 27 places in 323 ms of which 0 ms to minimize.
[2024-05-28 23:19:02] [INFO ] Deduced a trap composed of 22 places in 315 ms of which 2 ms to minimize.
[2024-05-28 23:19:02] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 1 ms to minimize.
[2024-05-28 23:19:03] [INFO ] Deduced a trap composed of 26 places in 296 ms of which 1 ms to minimize.
[2024-05-28 23:19:03] [INFO ] Deduced a trap composed of 20 places in 257 ms of which 1 ms to minimize.
[2024-05-28 23:19:03] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 1 ms to minimize.
[2024-05-28 23:19:04] [INFO ] Deduced a trap composed of 22 places in 246 ms of which 0 ms to minimize.
[2024-05-28 23:19:04] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 1 ms to minimize.
[2024-05-28 23:19:04] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 1 ms to minimize.
[2024-05-28 23:19:05] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 1 ms to minimize.
[2024-05-28 23:19:05] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 1 ms to minimize.
[2024-05-28 23:19:05] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 1 ms to minimize.
[2024-05-28 23:19:06] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 1 ms to minimize.
[2024-05-28 23:19:06] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 1 ms to minimize.
[2024-05-28 23:19:06] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 1 ms to minimize.
[2024-05-28 23:19:06] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 1 ms to minimize.
[2024-05-28 23:19:07] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 1 ms to minimize.
[2024-05-28 23:19:07] [INFO ] Deduced a trap composed of 18 places in 274 ms of which 1 ms to minimize.
[2024-05-28 23:19:07] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 1 ms to minimize.
[2024-05-28 23:19:08] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 1 ms to minimize.
[2024-05-28 23:19:08] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 3 ms to minimize.
[2024-05-28 23:19:08] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 1 ms to minimize.
[2024-05-28 23:19:09] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 1 ms to minimize.
[2024-05-28 23:19:09] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 1 ms to minimize.
[2024-05-28 23:19:09] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 0 ms to minimize.
[2024-05-28 23:19:10] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 0 ms to minimize.
[2024-05-28 23:19:10] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 0 ms to minimize.
[2024-05-28 23:19:10] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 1 ms to minimize.
[2024-05-28 23:19:10] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 1 ms to minimize.
[2024-05-28 23:19:11] [INFO ] Deduced a trap composed of 29 places in 210 ms of which 0 ms to minimize.
[2024-05-28 23:19:11] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 0 ms to minimize.
[2024-05-28 23:19:11] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 0 ms to minimize.
[2024-05-28 23:19:11] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 1 ms to minimize.
[2024-05-28 23:19:12] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 0 ms to minimize.
[2024-05-28 23:19:12] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 1 ms to minimize.
[2024-05-28 23:19:12] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 0 ms to minimize.
[2024-05-28 23:19:12] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 1 ms to minimize.
[2024-05-28 23:19:13] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 1 ms to minimize.
[2024-05-28 23:19:13] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 1 ms to minimize.
[2024-05-28 23:19:13] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 1 ms to minimize.
[2024-05-28 23:19:13] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 0 ms to minimize.
[2024-05-28 23:19:14] [INFO ] Deduced a trap composed of 31 places in 166 ms of which 1 ms to minimize.
[2024-05-28 23:19:14] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 1 ms to minimize.
[2024-05-28 23:19:14] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 1 ms to minimize.
[2024-05-28 23:19:15] [INFO ] Deduced a trap composed of 11 places in 519 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-28 23:19:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-28 23:19:15] [INFO ] After 25539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 59 ms.
Support contains 67 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 1203 transition count 1102
Reduce places removed 81 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 88 rules applied. Total rules applied 169 place count 1122 transition count 1095
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 176 place count 1115 transition count 1095
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 176 place count 1115 transition count 994
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 378 place count 1014 transition count 994
Discarding 124 places :
Symmetric choice reduction at 3 with 124 rule applications. Total rules 502 place count 890 transition count 870
Iterating global reduction 3 with 124 rules applied. Total rules applied 626 place count 890 transition count 870
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 626 place count 890 transition count 831
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 704 place count 851 transition count 831
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 280
Deduced a syphon composed of 280 places in 3 ms
Reduce places removed 280 places and 0 transitions.
Iterating global reduction 3 with 560 rules applied. Total rules applied 1264 place count 571 transition count 551
Partial Free-agglomeration rule applied 121 times.
Drop transitions removed 121 transitions
Iterating global reduction 3 with 121 rules applied. Total rules applied 1385 place count 571 transition count 551
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1386 place count 570 transition count 550
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1387 place count 569 transition count 550
Applied a total of 1387 rules in 347 ms. Remains 569 /1203 variables (removed 634) and now considering 550/1183 (removed 633) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 348 ms. Remains : 569/1203 places, 550/1183 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 236145 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 236145 steps, saw 75235 distinct states, run finished after 3003 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 550 rows 569 cols
[2024-05-28 23:19:18] [INFO ] Computed 180 invariants in 19 ms
[2024-05-28 23:19:18] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 23:19:19] [INFO ] [Nat]Absence check using 177 positive place invariants in 30 ms returned sat
[2024-05-28 23:19:19] [INFO ] [Nat]Absence check using 177 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-28 23:19:19] [INFO ] After 402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 23:19:19] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2024-05-28 23:19:19] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-28 23:19:19] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-05-28 23:19:19] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2024-05-28 23:19:20] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-28 23:19:20] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2024-05-28 23:19:20] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-28 23:19:20] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 652 ms
[2024-05-28 23:19:20] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2024-05-28 23:19:20] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2024-05-28 23:19:20] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
[2024-05-28 23:19:20] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2024-05-28 23:19:21] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2024-05-28 23:19:21] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2024-05-28 23:19:21] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2024-05-28 23:19:21] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 1 ms to minimize.
[2024-05-28 23:19:21] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 0 ms to minimize.
[2024-05-28 23:19:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1417 ms
[2024-05-28 23:19:21] [INFO ] After 2634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 208 ms.
[2024-05-28 23:19:21] [INFO ] After 2991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 34 ms.
Support contains 67 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 550/550 transitions.
Applied a total of 0 rules in 16 ms. Remains 569 /569 variables (removed 0) and now considering 550/550 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 569/569 places, 550/550 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 550/550 transitions.
Applied a total of 0 rules in 19 ms. Remains 569 /569 variables (removed 0) and now considering 550/550 (removed 0) transitions.
[2024-05-28 23:19:22] [INFO ] Invariant cache hit.
[2024-05-28 23:19:22] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-28 23:19:22] [INFO ] Invariant cache hit.
[2024-05-28 23:19:22] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
[2024-05-28 23:19:23] [INFO ] Redundant transitions in 43 ms returned []
[2024-05-28 23:19:23] [INFO ] Invariant cache hit.
[2024-05-28 23:19:23] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1342 ms. Remains : 569/569 places, 550/550 transitions.
Applied a total of 0 rules in 20 ms. Remains 569 /569 variables (removed 0) and now considering 550/550 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-28 23:19:23] [INFO ] Invariant cache hit.
[2024-05-28 23:19:23] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 23:19:23] [INFO ] [Nat]Absence check using 177 positive place invariants in 27 ms returned sat
[2024-05-28 23:19:23] [INFO ] [Nat]Absence check using 177 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-28 23:19:23] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-28 23:19:24] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2024-05-28 23:19:24] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-28 23:19:24] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-28 23:19:24] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 0 ms to minimize.
[2024-05-28 23:19:24] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-28 23:19:24] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2024-05-28 23:19:24] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2024-05-28 23:19:24] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 0 ms to minimize.
[2024-05-28 23:19:24] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-28 23:19:25] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-28 23:19:25] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2024-05-28 23:19:25] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2024-05-28 23:19:25] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-28 23:19:25] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2024-05-28 23:19:25] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-28 23:19:25] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1523 ms
[2024-05-28 23:19:25] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 0 ms to minimize.
[2024-05-28 23:19:25] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-28 23:19:25] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-28 23:19:26] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2024-05-28 23:19:26] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2024-05-28 23:19:26] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-28 23:19:26] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2024-05-28 23:19:26] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2024-05-28 23:19:26] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-28 23:19:26] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-28 23:19:26] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-28 23:19:26] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-28 23:19:26] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2024-05-28 23:19:26] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-28 23:19:27] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 0 ms to minimize.
[2024-05-28 23:19:27] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-28 23:19:27] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-28 23:19:27] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1700 ms
[2024-05-28 23:19:27] [INFO ] After 3748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 200 ms.
[2024-05-28 23:19:27] [INFO ] After 4075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-28 23:19:27] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-05-28 23:19:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 569 places, 550 transitions and 2464 arcs took 3 ms.
[2024-05-28 23:19:28] [INFO ] Flatten gal took : 89 ms
Total runtime 40078 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-020B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
ReachabilityFireability

FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-2024-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716938369721

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 10 (type EXCL) for 3 ShieldIIPs-PT-020B-ReachabilityFireability-2024-12
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 3 ShieldIIPs-PT-020B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 3 ShieldIIPs-PT-020B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 9 (type SRCH) for 3 ShieldIIPs-PT-020B-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 10 (type EXCL) for ShieldIIPs-PT-020B-ReachabilityFireability-2024-12
lola: result : true
lola: markings : 22
lola: fired transitions : 21
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 6 (type FNDP) for ShieldIIPs-PT-020B-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 7 (type EQUN) for ShieldIIPs-PT-020B-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 9 (type SRCH) for ShieldIIPs-PT-020B-ReachabilityFireability-2024-12 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 0 ShieldIIPs-PT-020B-ReachabilityFireability-2024-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 0 ShieldIIPs-PT-020B-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 0 ShieldIIPs-PT-020B-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 0 ShieldIIPs-PT-020B-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type FNDP) for ShieldIIPs-PT-020B-ReachabilityFireability-2024-12
lola: result : true
lola: fired transitions : 48
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 16 (type SRCH) for ShieldIIPs-PT-020B-ReachabilityFireability-2024-02
lola: result : true
lola: markings : 97
lola: fired transitions : 96
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for ShieldIIPs-PT-020B-ReachabilityFireability-2024-02 (obsolete)
lola: CANCELED task # 14 (type EQUN) for ShieldIIPs-PT-020B-ReachabilityFireability-2024-02 (obsolete)
lola: CANCELED task # 17 (type EXCL) for ShieldIIPs-PT-020B-ReachabilityFireability-2024-02 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-020B-ReachabilityFireability-2024-02: AG false tandem / insertion
ShieldIIPs-PT-020B-ReachabilityFireability-2024-12: EF true tandem / relaxed


Time elapsed: 0 secs. Pages in use: 2

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-020B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPs-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 r373-tall-171683788400070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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