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.r394-oct2-167903717700287.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 marciexred
Input is ShieldIIPt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717700287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 338K 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 ShieldIIPt-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679501172286

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 16:06:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 16:06:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 16:06:15] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2023-03-22 16:06:15] [INFO ] Transformed 1403 places.
[2023-03-22 16:06:15] [INFO ] Transformed 1303 transitions.
[2023-03-22 16:06:15] [INFO ] Found NUPN structural information;
[2023-03-22 16:06:15] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 361 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 16) seen :11
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1303 rows 1403 cols
[2023-03-22 16:06:16] [INFO ] Computed 181 place invariants in 47 ms
[2023-03-22 16:06:17] [INFO ] After 1044ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 16:06:18] [INFO ] [Nat]Absence check using 181 positive place invariants in 52 ms returned sat
[2023-03-22 16:06:20] [INFO ] After 2538ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 16:06:22] [INFO ] Deduced a trap composed of 21 places in 997 ms of which 21 ms to minimize.
[2023-03-22 16:06:22] [INFO ] Deduced a trap composed of 18 places in 567 ms of which 1 ms to minimize.
[2023-03-22 16:06:23] [INFO ] Deduced a trap composed of 33 places in 664 ms of which 15 ms to minimize.
[2023-03-22 16:06:24] [INFO ] Deduced a trap composed of 25 places in 797 ms of which 7 ms to minimize.
[2023-03-22 16:06:24] [INFO ] Deduced a trap composed of 20 places in 441 ms of which 27 ms to minimize.
[2023-03-22 16:06:25] [INFO ] Deduced a trap composed of 16 places in 319 ms of which 1 ms to minimize.
[2023-03-22 16:06:25] [INFO ] Deduced a trap composed of 28 places in 345 ms of which 1 ms to minimize.
[2023-03-22 16:06:26] [INFO ] Deduced a trap composed of 19 places in 426 ms of which 1 ms to minimize.
[2023-03-22 16:06:26] [INFO ] Deduced a trap composed of 41 places in 657 ms of which 1 ms to minimize.
[2023-03-22 16:06:27] [INFO ] Deduced a trap composed of 33 places in 309 ms of which 1 ms to minimize.
[2023-03-22 16:06:27] [INFO ] Deduced a trap composed of 18 places in 407 ms of which 0 ms to minimize.
[2023-03-22 16:06:27] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 1 ms to minimize.
[2023-03-22 16:06:28] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 2 ms to minimize.
[2023-03-22 16:06:28] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 1 ms to minimize.
[2023-03-22 16:06:28] [INFO ] Deduced a trap composed of 34 places in 268 ms of which 1 ms to minimize.
[2023-03-22 16:06:29] [INFO ] Deduced a trap composed of 40 places in 275 ms of which 1 ms to minimize.
[2023-03-22 16:06:29] [INFO ] Deduced a trap composed of 31 places in 292 ms of which 0 ms to minimize.
[2023-03-22 16:06:29] [INFO ] Deduced a trap composed of 29 places in 225 ms of which 1 ms to minimize.
[2023-03-22 16:06:30] [INFO ] Deduced a trap composed of 29 places in 259 ms of which 0 ms to minimize.
[2023-03-22 16:06:30] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 0 ms to minimize.
[2023-03-22 16:06:30] [INFO ] Deduced a trap composed of 36 places in 278 ms of which 1 ms to minimize.
[2023-03-22 16:06:31] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 1 ms to minimize.
[2023-03-22 16:06:31] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 0 ms to minimize.
[2023-03-22 16:06:31] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 10529 ms
[2023-03-22 16:06:32] [INFO ] Deduced a trap composed of 34 places in 443 ms of which 1 ms to minimize.
[2023-03-22 16:06:32] [INFO ] Deduced a trap composed of 14 places in 338 ms of which 0 ms to minimize.
[2023-03-22 16:06:32] [INFO ] Deduced a trap composed of 19 places in 315 ms of which 1 ms to minimize.
[2023-03-22 16:06:33] [INFO ] Deduced a trap composed of 21 places in 301 ms of which 1 ms to minimize.
[2023-03-22 16:06:33] [INFO ] Deduced a trap composed of 20 places in 300 ms of which 1 ms to minimize.
[2023-03-22 16:06:34] [INFO ] Deduced a trap composed of 27 places in 533 ms of which 2 ms to minimize.
[2023-03-22 16:06:34] [INFO ] Deduced a trap composed of 22 places in 362 ms of which 1 ms to minimize.
[2023-03-22 16:06:35] [INFO ] Deduced a trap composed of 26 places in 494 ms of which 1 ms to minimize.
[2023-03-22 16:06:35] [INFO ] Deduced a trap composed of 21 places in 470 ms of which 1 ms to minimize.
[2023-03-22 16:06:36] [INFO ] Deduced a trap composed of 16 places in 318 ms of which 1 ms to minimize.
[2023-03-22 16:06:36] [INFO ] Deduced a trap composed of 23 places in 523 ms of which 1 ms to minimize.
[2023-03-22 16:06:37] [INFO ] Deduced a trap composed of 12 places in 285 ms of which 1 ms to minimize.
[2023-03-22 16:06:37] [INFO ] Deduced a trap composed of 20 places in 425 ms of which 1 ms to minimize.
[2023-03-22 16:06:38] [INFO ] Deduced a trap composed of 23 places in 404 ms of which 3 ms to minimize.
[2023-03-22 16:06:38] [INFO ] Deduced a trap composed of 24 places in 316 ms of which 1 ms to minimize.
[2023-03-22 16:06:39] [INFO ] Deduced a trap composed of 19 places in 306 ms of which 1 ms to minimize.
[2023-03-22 16:06:39] [INFO ] Deduced a trap composed of 33 places in 304 ms of which 1 ms to minimize.
[2023-03-22 16:06:39] [INFO ] Deduced a trap composed of 24 places in 432 ms of which 1 ms to minimize.
[2023-03-22 16:06:40] [INFO ] Deduced a trap composed of 22 places in 379 ms of which 1 ms to minimize.
[2023-03-22 16:06:40] [INFO ] Deduced a trap composed of 36 places in 378 ms of which 1 ms to minimize.
[2023-03-22 16:06:41] [INFO ] Deduced a trap composed of 17 places in 363 ms of which 1 ms to minimize.
[2023-03-22 16:06:41] [INFO ] Deduced a trap composed of 30 places in 276 ms of which 0 ms to minimize.
[2023-03-22 16:06:42] [INFO ] Deduced a trap composed of 22 places in 442 ms of which 1 ms to minimize.
[2023-03-22 16:06:42] [INFO ] Deduced a trap composed of 29 places in 287 ms of which 1 ms to minimize.
[2023-03-22 16:06:42] [INFO ] Deduced a trap composed of 28 places in 336 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-22 16:06:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 16:06:42] [INFO ] After 25316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 127 ms.
Support contains 119 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions removed 243 transitions
Trivial Post-agglo rules discarded 243 transitions
Performed 243 trivial Post agglomeration. Transition count delta: 243
Iterating post reduction 0 with 243 rules applied. Total rules applied 243 place count 1403 transition count 1060
Reduce places removed 243 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 245 rules applied. Total rules applied 488 place count 1160 transition count 1058
Reduce places removed 1 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 2 with 37 rules applied. Total rules applied 525 place count 1159 transition count 1022
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 561 place count 1123 transition count 1022
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 91 Pre rules applied. Total rules applied 561 place count 1123 transition count 931
Deduced a syphon composed of 91 places in 3 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 743 place count 1032 transition count 931
Discarding 128 places :
Symmetric choice reduction at 4 with 128 rule applications. Total rules 871 place count 904 transition count 803
Iterating global reduction 4 with 128 rules applied. Total rules applied 999 place count 904 transition count 803
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 999 place count 904 transition count 762
Deduced a syphon composed of 41 places in 3 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1081 place count 863 transition count 762
Performed 277 Post agglomeration using F-continuation condition.Transition count delta: 277
Deduced a syphon composed of 277 places in 1 ms
Reduce places removed 277 places and 0 transitions.
Iterating global reduction 4 with 554 rules applied. Total rules applied 1635 place count 586 transition count 485
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1713 place count 547 transition count 498
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 1718 place count 547 transition count 493
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1723 place count 542 transition count 493
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 1738 place count 542 transition count 493
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1739 place count 542 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1740 place count 541 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1741 place count 540 transition count 492
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1741 place count 540 transition count 491
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1743 place count 539 transition count 491
Applied a total of 1743 rules in 407 ms. Remains 539 /1403 variables (removed 864) and now considering 491/1303 (removed 812) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 419 ms. Remains : 539/1403 places, 491/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 148870 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148870 steps, saw 86962 distinct states, run finished after 3002 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 491 rows 539 cols
[2023-03-22 16:06:46] [INFO ] Computed 180 place invariants in 3 ms
[2023-03-22 16:06:46] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 16:06:47] [INFO ] [Nat]Absence check using 180 positive place invariants in 33 ms returned sat
[2023-03-22 16:06:47] [INFO ] After 572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 16:06:47] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-22 16:06:48] [INFO ] After 681ms SMT Verify possible using 89 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 16:06:48] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2023-03-22 16:06:48] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2023-03-22 16:06:49] [INFO ] Deduced a trap composed of 8 places in 297 ms of which 13 ms to minimize.
[2023-03-22 16:06:49] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 0 ms to minimize.
[2023-03-22 16:06:49] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 40 ms to minimize.
[2023-03-22 16:06:49] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 1 ms to minimize.
[2023-03-22 16:06:50] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 1 ms to minimize.
[2023-03-22 16:06:50] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 1 ms to minimize.
[2023-03-22 16:06:50] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2023-03-22 16:06:50] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2023-03-22 16:06:50] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2023-03-22 16:06:50] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2023-03-22 16:06:50] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2413 ms
[2023-03-22 16:06:51] [INFO ] Deduced a trap composed of 7 places in 293 ms of which 0 ms to minimize.
[2023-03-22 16:06:51] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2023-03-22 16:06:51] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2023-03-22 16:06:51] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 14 ms to minimize.
[2023-03-22 16:06:51] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2023-03-22 16:06:52] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2023-03-22 16:06:52] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2023-03-22 16:06:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1332 ms
[2023-03-22 16:06:52] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2023-03-22 16:06:52] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 1 ms to minimize.
[2023-03-22 16:06:53] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 19 ms to minimize.
[2023-03-22 16:06:53] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2023-03-22 16:06:53] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2023-03-22 16:06:53] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2023-03-22 16:06:53] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2023-03-22 16:06:53] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2023-03-22 16:06:54] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 0 ms to minimize.
[2023-03-22 16:06:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1612 ms
[2023-03-22 16:06:54] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2023-03-22 16:06:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-22 16:06:54] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2023-03-22 16:06:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-22 16:06:54] [INFO ] After 6997ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 536 ms.
[2023-03-22 16:06:55] [INFO ] After 8301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 166 ms.
Support contains 119 out of 539 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 491/491 transitions.
Applied a total of 0 rules in 27 ms. Remains 539 /539 variables (removed 0) and now considering 491/491 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 539/539 places, 491/491 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 539/539 places, 491/491 transitions.
Applied a total of 0 rules in 22 ms. Remains 539 /539 variables (removed 0) and now considering 491/491 (removed 0) transitions.
[2023-03-22 16:06:55] [INFO ] Invariant cache hit.
[2023-03-22 16:06:55] [INFO ] Implicit Places using invariants in 198 ms returned [523]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 200 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 538/539 places, 491/491 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 537 transition count 490
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 537 transition count 490
Applied a total of 2 rules in 27 ms. Remains 537 /538 variables (removed 1) and now considering 490/491 (removed 1) transitions.
// Phase 1: matrix 490 rows 537 cols
[2023-03-22 16:06:55] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-22 16:06:55] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-22 16:06:55] [INFO ] Invariant cache hit.
[2023-03-22 16:06:56] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-03-22 16:06:57] [INFO ] Implicit Places using invariants and state equation in 1391 ms returned []
Implicit Place search using SMT with State Equation took 1660 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 537/539 places, 490/491 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1910 ms. Remains : 537/539 places, 490/491 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 177668 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 177668 steps, saw 103904 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-22 16:07:00] [INFO ] Invariant cache hit.
[2023-03-22 16:07:00] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 16:07:01] [INFO ] [Nat]Absence check using 179 positive place invariants in 35 ms returned sat
[2023-03-22 16:07:01] [INFO ] After 604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 16:07:01] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-03-22 16:07:02] [INFO ] After 684ms SMT Verify possible using 88 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 16:07:02] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 1 ms to minimize.
[2023-03-22 16:07:02] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2023-03-22 16:07:03] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2023-03-22 16:07:03] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 0 ms to minimize.
[2023-03-22 16:07:03] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 1 ms to minimize.
[2023-03-22 16:07:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1118 ms
[2023-03-22 16:07:03] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-22 16:07:04] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 1 ms to minimize.
[2023-03-22 16:07:04] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 0 ms to minimize.
[2023-03-22 16:07:04] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 0 ms to minimize.
[2023-03-22 16:07:04] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 1 ms to minimize.
[2023-03-22 16:07:05] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 1 ms to minimize.
[2023-03-22 16:07:05] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2023-03-22 16:07:05] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 1 ms to minimize.
[2023-03-22 16:07:05] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 1 ms to minimize.
[2023-03-22 16:07:05] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2023-03-22 16:07:05] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2023-03-22 16:07:06] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2023-03-22 16:07:06] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2443 ms
[2023-03-22 16:07:06] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 1 ms to minimize.
[2023-03-22 16:07:06] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 0 ms to minimize.
[2023-03-22 16:07:07] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 1 ms to minimize.
[2023-03-22 16:07:07] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 0 ms to minimize.
[2023-03-22 16:07:07] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-22 16:07:07] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 0 ms to minimize.
[2023-03-22 16:07:07] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2023-03-22 16:07:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1521 ms
[2023-03-22 16:07:08] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2023-03-22 16:07:08] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 0 ms to minimize.
[2023-03-22 16:07:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2023-03-22 16:07:08] [INFO ] After 6608ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1266 ms.
[2023-03-22 16:07:09] [INFO ] After 8741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 73 ms.
Support contains 119 out of 537 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 537/537 places, 490/490 transitions.
Applied a total of 0 rules in 29 ms. Remains 537 /537 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 537/537 places, 490/490 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 537/537 places, 490/490 transitions.
Applied a total of 0 rules in 11 ms. Remains 537 /537 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-22 16:07:09] [INFO ] Invariant cache hit.
[2023-03-22 16:07:10] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-22 16:07:10] [INFO ] Invariant cache hit.
[2023-03-22 16:07:10] [INFO ] State equation strengthened by 88 read => feed constraints.
[2023-03-22 16:07:11] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
[2023-03-22 16:07:11] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-22 16:07:11] [INFO ] Invariant cache hit.
[2023-03-22 16:07:11] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1971 ms. Remains : 537/537 places, 490/490 transitions.
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 537 transition count 490
Applied a total of 42 rules in 25 ms. Remains 537 /537 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 490 rows 537 cols
[2023-03-22 16:07:11] [INFO ] Computed 179 place invariants in 3 ms
[2023-03-22 16:07:11] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 16:07:12] [INFO ] [Nat]Absence check using 179 positive place invariants in 40 ms returned sat
[2023-03-22 16:07:12] [INFO ] After 594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 16:07:12] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 16:07:13] [INFO ] After 516ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 16:07:13] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 0 ms to minimize.
[2023-03-22 16:07:13] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 0 ms to minimize.
[2023-03-22 16:07:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 368 ms
[2023-03-22 16:07:14] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2023-03-22 16:07:14] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 0 ms to minimize.
[2023-03-22 16:07:14] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2023-03-22 16:07:14] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2023-03-22 16:07:14] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 0 ms to minimize.
[2023-03-22 16:07:15] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2023-03-22 16:07:15] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
[2023-03-22 16:07:15] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2023-03-22 16:07:15] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2023-03-22 16:07:15] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 0 ms to minimize.
[2023-03-22 16:07:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1829 ms
[2023-03-22 16:07:16] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2023-03-22 16:07:16] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2023-03-22 16:07:16] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
[2023-03-22 16:07:16] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2023-03-22 16:07:16] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2023-03-22 16:07:17] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2023-03-22 16:07:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1219 ms
[2023-03-22 16:07:17] [INFO ] After 4534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 619 ms.
[2023-03-22 16:07:18] [INFO ] After 6065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-22 16:07:18] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 12 ms.
[2023-03-22 16:07:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 537 places, 490 transitions and 1958 arcs took 6 ms.
[2023-03-22 16:07:18] [INFO ] Flatten gal took : 80 ms
Total runtime 63474 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldIIPt_PT_020B
(NrP: 537 NrTr: 490 NrArc: 1958)

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

net check time: 0m 0.000sec

init dd package: 0m 3.078sec


before gc: list nodes free: 1187230

after gc: idd nodes used:43502344, unused:20497656; list nodes free:90190363

RS generation: 19m41.835sec


-> last computed set: #nodes 43501808 (4.4e+07) #states 52,675,007,646 (10)


CANNOT_COMPUTE


BK_STOP 1679502450326

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.002sec

idd.cc:820: DD Exception: No free nodes

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ShieldIIPt-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 r394-oct2-167903717700287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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