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-167903717800319.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-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717800319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:06 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 4.1K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 9.6K Feb 25 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:07 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 686K 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-040B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679504487624

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-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 17:01:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 17:01:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:01:30] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2023-03-22 17:01:30] [INFO ] Transformed 2803 places.
[2023-03-22 17:01:30] [INFO ] Transformed 2603 transitions.
[2023-03-22 17:01:30] [INFO ] Found NUPN structural information;
[2023-03-22 17:01:30] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 391 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 16) seen :8
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2603 rows 2803 cols
[2023-03-22 17:01:31] [INFO ] Computed 361 place invariants in 34 ms
[2023-03-22 17:01:32] [INFO ] After 1131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 17:01:34] [INFO ] [Nat]Absence check using 361 positive place invariants in 213 ms returned sat
[2023-03-22 17:01:44] [INFO ] After 9974ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 17:01:47] [INFO ] Deduced a trap composed of 18 places in 1918 ms of which 10 ms to minimize.
[2023-03-22 17:01:48] [INFO ] Deduced a trap composed of 21 places in 1437 ms of which 26 ms to minimize.
[2023-03-22 17:01:50] [INFO ] Deduced a trap composed of 14 places in 1379 ms of which 4 ms to minimize.
[2023-03-22 17:01:51] [INFO ] Deduced a trap composed of 19 places in 1380 ms of which 51 ms to minimize.
[2023-03-22 17:01:52] [INFO ] Deduced a trap composed of 16 places in 1006 ms of which 31 ms to minimize.
[2023-03-22 17:01:53] [INFO ] Deduced a trap composed of 28 places in 785 ms of which 1 ms to minimize.
[2023-03-22 17:01:54] [INFO ] Deduced a trap composed of 18 places in 1006 ms of which 7 ms to minimize.
[2023-03-22 17:01:56] [INFO ] Deduced a trap composed of 26 places in 1164 ms of which 2 ms to minimize.
[2023-03-22 17:01:57] [INFO ] Deduced a trap composed of 18 places in 767 ms of which 1 ms to minimize.
[2023-03-22 17:01:58] [INFO ] Deduced a trap composed of 29 places in 790 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 17:01:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 17:01:58] [INFO ] After 25265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 953 ms.
Support contains 156 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 2803 transition count 2042
Reduce places removed 561 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 563 rules applied. Total rules applied 1124 place count 2242 transition count 2040
Reduce places removed 1 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 2 with 27 rules applied. Total rules applied 1151 place count 2241 transition count 2014
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 1177 place count 2215 transition count 2014
Performed 172 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 172 Pre rules applied. Total rules applied 1177 place count 2215 transition count 1842
Deduced a syphon composed of 172 places in 6 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 4 with 344 rules applied. Total rules applied 1521 place count 2043 transition count 1842
Discarding 272 places :
Symmetric choice reduction at 4 with 272 rule applications. Total rules 1793 place count 1771 transition count 1570
Iterating global reduction 4 with 272 rules applied. Total rules applied 2065 place count 1771 transition count 1570
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 94 Pre rules applied. Total rules applied 2065 place count 1771 transition count 1476
Deduced a syphon composed of 94 places in 8 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 2253 place count 1677 transition count 1476
Performed 608 Post agglomeration using F-continuation condition.Transition count delta: 608
Deduced a syphon composed of 608 places in 2 ms
Reduce places removed 608 places and 0 transitions.
Iterating global reduction 4 with 1216 rules applied. Total rules applied 3469 place count 1069 transition count 868
Renaming transitions due to excessive name length > 1024 char.
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 88 places in 3 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 3645 place count 981 transition count 909
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3646 place count 981 transition count 908
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 3654 place count 981 transition count 900
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 3662 place count 973 transition count 900
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 6 with 34 rules applied. Total rules applied 3696 place count 973 transition count 900
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 3698 place count 973 transition count 900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3699 place count 972 transition count 899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3701 place count 970 transition count 899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3701 place count 970 transition count 898
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3703 place count 969 transition count 898
Applied a total of 3703 rules in 902 ms. Remains 969 /2803 variables (removed 1834) and now considering 898/2603 (removed 1705) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 903 ms. Remains : 969/2803 places, 898/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 80191 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80191 steps, saw 55320 distinct states, run finished after 3004 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 898 rows 969 cols
[2023-03-22 17:02:03] [INFO ] Computed 359 place invariants in 4 ms
[2023-03-22 17:02:04] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 17:02:04] [INFO ] [Nat]Absence check using 359 positive place invariants in 139 ms returned sat
[2023-03-22 17:02:06] [INFO ] After 1109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 17:02:06] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-22 17:02:06] [INFO ] After 790ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 17:02:07] [INFO ] Deduced a trap composed of 4 places in 272 ms of which 1 ms to minimize.
[2023-03-22 17:02:07] [INFO ] Deduced a trap composed of 3 places in 489 ms of which 1 ms to minimize.
[2023-03-22 17:02:08] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2023-03-22 17:02:08] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 0 ms to minimize.
[2023-03-22 17:02:08] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2023-03-22 17:02:08] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 0 ms to minimize.
[2023-03-22 17:02:09] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
[2023-03-22 17:02:09] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2023-03-22 17:02:09] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 0 ms to minimize.
[2023-03-22 17:02:09] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2801 ms
[2023-03-22 17:02:10] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2023-03-22 17:02:10] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 1 ms to minimize.
[2023-03-22 17:02:10] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 1 ms to minimize.
[2023-03-22 17:02:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 829 ms
[2023-03-22 17:02:11] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2023-03-22 17:02:11] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 0 ms to minimize.
[2023-03-22 17:02:11] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 13 ms to minimize.
[2023-03-22 17:02:11] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 6 ms to minimize.
[2023-03-22 17:02:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 993 ms
[2023-03-22 17:02:13] [INFO ] Deduced a trap composed of 4 places in 994 ms of which 1 ms to minimize.
[2023-03-22 17:02:13] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 7 ms to minimize.
[2023-03-22 17:02:13] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2023-03-22 17:02:13] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 0 ms to minimize.
[2023-03-22 17:02:13] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2023-03-22 17:02:14] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 1 ms to minimize.
[2023-03-22 17:02:14] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2023-03-22 17:02:14] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 47 ms to minimize.
[2023-03-22 17:02:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2576 ms
[2023-03-22 17:02:14] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 0 ms to minimize.
[2023-03-22 17:02:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2023-03-22 17:02:15] [INFO ] After 9145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 896 ms.
[2023-03-22 17:02:16] [INFO ] After 11973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 215 ms.
Support contains 156 out of 969 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 969/969 places, 898/898 transitions.
Applied a total of 0 rules in 27 ms. Remains 969 /969 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 969/969 places, 898/898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 969/969 places, 898/898 transitions.
Applied a total of 0 rules in 22 ms. Remains 969 /969 variables (removed 0) and now considering 898/898 (removed 0) transitions.
[2023-03-22 17:02:16] [INFO ] Invariant cache hit.
[2023-03-22 17:02:16] [INFO ] Implicit Places using invariants in 442 ms returned [958]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 455 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 968/969 places, 898/898 transitions.
Applied a total of 0 rules in 24 ms. Remains 968 /968 variables (removed 0) and now considering 898/898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 501 ms. Remains : 968/969 places, 898/898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 381 ms. (steps per millisecond=26 ) properties (out of 8) seen :1
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :1
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 898 rows 968 cols
[2023-03-22 17:02:17] [INFO ] Computed 358 place invariants in 5 ms
[2023-03-22 17:02:18] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 17:02:18] [INFO ] [Nat]Absence check using 358 positive place invariants in 102 ms returned sat
[2023-03-22 17:02:19] [INFO ] After 867ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 17:02:19] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-22 17:02:20] [INFO ] After 525ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 17:02:20] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 1 ms to minimize.
[2023-03-22 17:02:20] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2023-03-22 17:02:20] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 1 ms to minimize.
[2023-03-22 17:02:21] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2023-03-22 17:02:21] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 1 ms to minimize.
[2023-03-22 17:02:21] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 0 ms to minimize.
[2023-03-22 17:02:21] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1598 ms
[2023-03-22 17:02:21] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2023-03-22 17:02:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-22 17:02:22] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 0 ms to minimize.
[2023-03-22 17:02:22] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 0 ms to minimize.
[2023-03-22 17:02:22] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2023-03-22 17:02:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 887 ms
[2023-03-22 17:02:23] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
[2023-03-22 17:02:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-22 17:02:23] [INFO ] After 4055ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 683 ms.
[2023-03-22 17:02:24] [INFO ] After 6178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 184 ms.
Support contains 61 out of 968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 898/898 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 968 transition count 874
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 944 transition count 873
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 943 transition count 873
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 50 place count 943 transition count 845
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 106 place count 915 transition count 845
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 109 place count 912 transition count 842
Iterating global reduction 3 with 3 rules applied. Total rules applied 112 place count 912 transition count 842
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 112 place count 912 transition count 841
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 911 transition count 841
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 208 place count 864 transition count 794
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 244 place count 846 transition count 810
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 245 place count 846 transition count 809
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 246 place count 845 transition count 809
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 845 transition count 809
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 259 place count 833 transition count 797
Applied a total of 259 rules in 135 ms. Remains 833 /968 variables (removed 135) and now considering 797/898 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 833/968 places, 797/898 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 95497 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95497 steps, saw 75474 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 797 rows 833 cols
[2023-03-22 17:02:28] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-22 17:02:28] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 17:02:28] [INFO ] [Nat]Absence check using 358 positive place invariants in 79 ms returned sat
[2023-03-22 17:02:29] [INFO ] After 849ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 17:02:29] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-22 17:02:30] [INFO ] After 471ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 17:02:30] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2023-03-22 17:02:30] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 1 ms to minimize.
[2023-03-22 17:02:31] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
[2023-03-22 17:02:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 551 ms
[2023-03-22 17:02:31] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 0 ms to minimize.
[2023-03-22 17:02:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2023-03-22 17:02:31] [INFO ] After 1979ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 389 ms.
[2023-03-22 17:02:32] [INFO ] After 3720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 201 ms.
Support contains 61 out of 833 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 833/833 places, 797/797 transitions.
Applied a total of 0 rules in 17 ms. Remains 833 /833 variables (removed 0) and now considering 797/797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 833/833 places, 797/797 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 833/833 places, 797/797 transitions.
Applied a total of 0 rules in 16 ms. Remains 833 /833 variables (removed 0) and now considering 797/797 (removed 0) transitions.
[2023-03-22 17:02:32] [INFO ] Invariant cache hit.
[2023-03-22 17:02:33] [INFO ] Implicit Places using invariants in 702 ms returned []
[2023-03-22 17:02:33] [INFO ] Invariant cache hit.
[2023-03-22 17:02:33] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-22 17:02:35] [INFO ] Implicit Places using invariants and state equation in 1868 ms returned []
Implicit Place search using SMT with State Equation took 2593 ms to find 0 implicit places.
[2023-03-22 17:02:35] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-22 17:02:35] [INFO ] Invariant cache hit.
[2023-03-22 17:02:35] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3136 ms. Remains : 833/833 places, 797/797 transitions.
Partial Free-agglomeration rule applied 95 times.
Drop transitions removed 95 transitions
Iterating global reduction 0 with 95 rules applied. Total rules applied 95 place count 833 transition count 797
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 833 transition count 794
Applied a total of 98 rules in 82 ms. Remains 833 /833 variables (removed 0) and now considering 794/797 (removed 3) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 794 rows 833 cols
[2023-03-22 17:02:35] [INFO ] Computed 358 place invariants in 6 ms
[2023-03-22 17:02:35] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 17:02:36] [INFO ] [Nat]Absence check using 358 positive place invariants in 58 ms returned sat
[2023-03-22 17:02:36] [INFO ] After 691ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 17:02:36] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-22 17:02:37] [INFO ] After 501ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-22 17:02:37] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 1 ms to minimize.
[2023-03-22 17:02:37] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 1 ms to minimize.
[2023-03-22 17:02:38] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2023-03-22 17:02:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 643 ms
[2023-03-22 17:02:38] [INFO ] After 1764ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 541 ms.
[2023-03-22 17:02:39] [INFO ] After 3388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-22 17:02:39] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 20 ms.
[2023-03-22 17:02:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 833 places, 797 transitions and 3729 arcs took 12 ms.
[2023-03-22 17:02:39] [INFO ] Flatten gal took : 102 ms
Total runtime 69303 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_040B
(NrP: 833 NrTr: 797 NrArc: 3729)

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

net check time: 0m 0.012sec

init dd package: 0m 2.961sec


before gc: list nodes free: 461095

after gc: idd nodes used:375755, unused:63624245; list nodes free:281417034

before gc: list nodes free: 3304493

after gc: idd nodes used:2414792, unused:61585208; list nodes free:272420854

before gc: list nodes free: 6883837

after gc: idd nodes used:2251872, unused:61748128; list nodes free:273249334
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6290660 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097600 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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.003sec

2398632

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-040B"
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-040B, 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-167903717800319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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