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-167903717600158.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 ShieldIIPs-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717600158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 846K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679495491891

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 14:31:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 14:31:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:31:34] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2023-03-22 14:31:35] [INFO ] Transformed 3003 places.
[2023-03-22 14:31:35] [INFO ] Transformed 2953 transitions.
[2023-03-22 14:31:35] [INFO ] Found NUPN structural information;
[2023-03-22 14:31:35] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 454 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 14) seen :10
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2953 rows 3003 cols
[2023-03-22 14:31:35] [INFO ] Computed 451 place invariants in 35 ms
[2023-03-22 14:31:36] [INFO ] After 989ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 14:31:37] [INFO ] [Nat]Absence check using 451 positive place invariants in 216 ms returned sat
[2023-03-22 14:31:43] [INFO ] After 5250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 14:31:45] [INFO ] Deduced a trap composed of 19 places in 1420 ms of which 10 ms to minimize.
[2023-03-22 14:31:47] [INFO ] Deduced a trap composed of 18 places in 1161 ms of which 16 ms to minimize.
[2023-03-22 14:31:48] [INFO ] Deduced a trap composed of 21 places in 1508 ms of which 19 ms to minimize.
[2023-03-22 14:31:50] [INFO ] Deduced a trap composed of 17 places in 1233 ms of which 7 ms to minimize.
[2023-03-22 14:31:51] [INFO ] Deduced a trap composed of 18 places in 1069 ms of which 2 ms to minimize.
[2023-03-22 14:31:52] [INFO ] Deduced a trap composed of 28 places in 1163 ms of which 1 ms to minimize.
[2023-03-22 14:31:54] [INFO ] Deduced a trap composed of 16 places in 1321 ms of which 2 ms to minimize.
[2023-03-22 14:31:55] [INFO ] Deduced a trap composed of 28 places in 1389 ms of which 4 ms to minimize.
[2023-03-22 14:31:58] [INFO ] Deduced a trap composed of 14 places in 1233 ms of which 2 ms to minimize.
[2023-03-22 14:32:00] [INFO ] Deduced a trap composed of 24 places in 1632 ms of which 3 ms to minimize.
[2023-03-22 14:32:01] [INFO ] Deduced a trap composed of 18 places in 1194 ms of which 1 ms to minimize.
[2023-03-22 14:32:02] [INFO ] Deduced a trap composed of 20 places in 1078 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 14:32:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 14:32:02] [INFO ] After 26023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 451 ms.
Support contains 93 out of 3003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Drop transitions removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 3003 transition count 2719
Reduce places removed 234 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 239 rules applied. Total rules applied 473 place count 2769 transition count 2714
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 478 place count 2764 transition count 2714
Performed 245 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 245 Pre rules applied. Total rules applied 478 place count 2764 transition count 2469
Deduced a syphon composed of 245 places in 8 ms
Reduce places removed 245 places and 0 transitions.
Iterating global reduction 3 with 490 rules applied. Total rules applied 968 place count 2519 transition count 2469
Discarding 330 places :
Symmetric choice reduction at 3 with 330 rule applications. Total rules 1298 place count 2189 transition count 2139
Iterating global reduction 3 with 330 rules applied. Total rules applied 1628 place count 2189 transition count 2139
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 133 Pre rules applied. Total rules applied 1628 place count 2189 transition count 2006
Deduced a syphon composed of 133 places in 18 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 1894 place count 2056 transition count 2006
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 700
Deduced a syphon composed of 700 places in 7 ms
Reduce places removed 700 places and 0 transitions.
Iterating global reduction 3 with 1400 rules applied. Total rules applied 3294 place count 1356 transition count 1306
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 320 times.
Drop transitions removed 320 transitions
Iterating global reduction 3 with 320 rules applied. Total rules applied 3614 place count 1356 transition count 1306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3615 place count 1355 transition count 1305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3616 place count 1354 transition count 1305
Applied a total of 3616 rules in 1290 ms. Remains 1354 /3003 variables (removed 1649) and now considering 1305/2953 (removed 1648) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1291 ms. Remains : 1354/3003 places, 1305/2953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 4) seen :2
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1305 rows 1354 cols
[2023-03-22 14:32:05] [INFO ] Computed 450 place invariants in 45 ms
[2023-03-22 14:32:05] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 14:32:05] [INFO ] [Nat]Absence check using 441 positive place invariants in 211 ms returned sat
[2023-03-22 14:32:05] [INFO ] [Nat]Absence check using 441 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-22 14:32:07] [INFO ] After 1233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 14:32:07] [INFO ] Deduced a trap composed of 4 places in 563 ms of which 1 ms to minimize.
[2023-03-22 14:32:08] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 1 ms to minimize.
[2023-03-22 14:32:09] [INFO ] Deduced a trap composed of 5 places in 588 ms of which 1 ms to minimize.
[2023-03-22 14:32:09] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2023-03-22 14:32:09] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 1 ms to minimize.
[2023-03-22 14:32:09] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2023-03-22 14:32:10] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 1 ms to minimize.
[2023-03-22 14:32:10] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 0 ms to minimize.
[2023-03-22 14:32:10] [INFO ] Deduced a trap composed of 6 places in 318 ms of which 1 ms to minimize.
[2023-03-22 14:32:11] [INFO ] Deduced a trap composed of 7 places in 290 ms of which 13 ms to minimize.
[2023-03-22 14:32:11] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2023-03-22 14:32:11] [INFO ] Deduced a trap composed of 10 places in 283 ms of which 1 ms to minimize.
[2023-03-22 14:32:12] [INFO ] Deduced a trap composed of 3 places in 352 ms of which 1 ms to minimize.
[2023-03-22 14:32:12] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 0 ms to minimize.
[2023-03-22 14:32:13] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 1 ms to minimize.
[2023-03-22 14:32:13] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 13 ms to minimize.
[2023-03-22 14:32:13] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
[2023-03-22 14:32:14] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 0 ms to minimize.
[2023-03-22 14:32:14] [INFO ] Deduced a trap composed of 6 places in 491 ms of which 1 ms to minimize.
[2023-03-22 14:32:15] [INFO ] Deduced a trap composed of 10 places in 408 ms of which 1 ms to minimize.
[2023-03-22 14:32:15] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 0 ms to minimize.
[2023-03-22 14:32:15] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 9 ms to minimize.
[2023-03-22 14:32:16] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 1 ms to minimize.
[2023-03-22 14:32:16] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 1 ms to minimize.
[2023-03-22 14:32:16] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 1 ms to minimize.
[2023-03-22 14:32:17] [INFO ] Deduced a trap composed of 9 places in 322 ms of which 1 ms to minimize.
[2023-03-22 14:32:17] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 1 ms to minimize.
[2023-03-22 14:32:17] [INFO ] Deduced a trap composed of 17 places in 318 ms of which 14 ms to minimize.
[2023-03-22 14:32:18] [INFO ] Deduced a trap composed of 7 places in 372 ms of which 0 ms to minimize.
[2023-03-22 14:32:18] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 1 ms to minimize.
[2023-03-22 14:32:18] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 0 ms to minimize.
[2023-03-22 14:32:18] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 11584 ms
[2023-03-22 14:32:19] [INFO ] Deduced a trap composed of 6 places in 398 ms of which 1 ms to minimize.
[2023-03-22 14:32:19] [INFO ] Deduced a trap composed of 6 places in 339 ms of which 1 ms to minimize.
[2023-03-22 14:32:20] [INFO ] Deduced a trap composed of 5 places in 417 ms of which 1 ms to minimize.
[2023-03-22 14:32:20] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 0 ms to minimize.
[2023-03-22 14:32:21] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 1 ms to minimize.
[2023-03-22 14:32:21] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 0 ms to minimize.
[2023-03-22 14:32:21] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 1 ms to minimize.
[2023-03-22 14:32:22] [INFO ] Deduced a trap composed of 9 places in 431 ms of which 1 ms to minimize.
[2023-03-22 14:32:22] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 1 ms to minimize.
[2023-03-22 14:32:22] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 1 ms to minimize.
[2023-03-22 14:32:23] [INFO ] Deduced a trap composed of 22 places in 195 ms of which 1 ms to minimize.
[2023-03-22 14:32:23] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 0 ms to minimize.
[2023-03-22 14:32:23] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 1 ms to minimize.
[2023-03-22 14:32:23] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2023-03-22 14:32:24] [INFO ] Deduced a trap composed of 11 places in 474 ms of which 0 ms to minimize.
[2023-03-22 14:32:24] [INFO ] Deduced a trap composed of 16 places in 332 ms of which 0 ms to minimize.
[2023-03-22 14:32:25] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 0 ms to minimize.
[2023-03-22 14:32:25] [INFO ] Deduced a trap composed of 14 places in 462 ms of which 1 ms to minimize.
[2023-03-22 14:32:26] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 0 ms to minimize.
[2023-03-22 14:32:26] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 1 ms to minimize.
[2023-03-22 14:32:26] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 1 ms to minimize.
[2023-03-22 14:32:26] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 1 ms to minimize.
[2023-03-22 14:32:27] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 1 ms to minimize.
[2023-03-22 14:32:27] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 16 ms to minimize.
[2023-03-22 14:32:27] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 1 ms to minimize.
[2023-03-22 14:32:28] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 14 ms to minimize.
[2023-03-22 14:32:28] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 9108 ms
[2023-03-22 14:32:28] [INFO ] After 22348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 432 ms.
[2023-03-22 14:32:28] [INFO ] After 23243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 84 ms.
Support contains 43 out of 1354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1354/1354 places, 1305/1305 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1354 transition count 1301
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1350 transition count 1301
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 8 place count 1350 transition count 1289
Deduced a syphon composed of 12 places in 7 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 32 place count 1338 transition count 1289
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 3 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 94 place count 1307 transition count 1258
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 108 place count 1307 transition count 1258
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 1301 transition count 1252
Applied a total of 114 rules in 589 ms. Remains 1301 /1354 variables (removed 53) and now considering 1252/1305 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 589 ms. Remains : 1301/1354 places, 1252/1305 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :1
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1252 rows 1301 cols
[2023-03-22 14:32:29] [INFO ] Computed 450 place invariants in 17 ms
[2023-03-22 14:32:29] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:32:30] [INFO ] [Nat]Absence check using 446 positive place invariants in 116 ms returned sat
[2023-03-22 14:32:30] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-22 14:32:31] [INFO ] After 1003ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:32:31] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2023-03-22 14:32:31] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 0 ms to minimize.
[2023-03-22 14:32:32] [INFO ] Deduced a trap composed of 5 places in 378 ms of which 15 ms to minimize.
[2023-03-22 14:32:32] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2023-03-22 14:32:32] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 0 ms to minimize.
[2023-03-22 14:32:33] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2023-03-22 14:32:33] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 0 ms to minimize.
[2023-03-22 14:32:33] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 0 ms to minimize.
[2023-03-22 14:32:33] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2023-03-22 14:32:34] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 0 ms to minimize.
[2023-03-22 14:32:34] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 0 ms to minimize.
[2023-03-22 14:32:34] [INFO ] Deduced a trap composed of 9 places in 303 ms of which 1 ms to minimize.
[2023-03-22 14:32:34] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 0 ms to minimize.
[2023-03-22 14:32:35] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 0 ms to minimize.
[2023-03-22 14:32:35] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 13 ms to minimize.
[2023-03-22 14:32:35] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2023-03-22 14:32:36] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2023-03-22 14:32:36] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2023-03-22 14:32:36] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
[2023-03-22 14:32:36] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 0 ms to minimize.
[2023-03-22 14:32:36] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 1 ms to minimize.
[2023-03-22 14:32:37] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 1 ms to minimize.
[2023-03-22 14:32:37] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 0 ms to minimize.
[2023-03-22 14:32:37] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2023-03-22 14:32:37] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2023-03-22 14:32:38] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2023-03-22 14:32:38] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6948 ms
[2023-03-22 14:32:38] [INFO ] After 8046ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-22 14:32:38] [INFO ] After 8513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 27 out of 1301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1301/1301 places, 1252/1252 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 0 with 1 rules applied. Total rules applied 1 place count 1301 transition count 1251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1300 transition count 1251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1300 transition count 1249
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1298 transition count 1249
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 34 place count 1284 transition count 1235
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 1284 transition count 1235
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 1280 transition count 1231
Applied a total of 39 rules in 246 ms. Remains 1280 /1301 variables (removed 21) and now considering 1231/1252 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 1280/1301 places, 1231/1252 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 148891 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148891 steps, saw 92574 distinct states, run finished after 3003 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1231 rows 1280 cols
[2023-03-22 14:32:41] [INFO ] Computed 450 place invariants in 19 ms
[2023-03-22 14:32:42] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:32:42] [INFO ] [Nat]Absence check using 446 positive place invariants in 257 ms returned sat
[2023-03-22 14:32:42] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 14:32:43] [INFO ] After 952ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:32:43] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 1 ms to minimize.
[2023-03-22 14:32:44] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2023-03-22 14:32:44] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2023-03-22 14:32:44] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 0 ms to minimize.
[2023-03-22 14:32:44] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2023-03-22 14:32:45] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 0 ms to minimize.
[2023-03-22 14:32:45] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2023-03-22 14:32:45] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2023-03-22 14:32:45] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2023-03-22 14:32:45] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2023-03-22 14:32:46] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 0 ms to minimize.
[2023-03-22 14:32:46] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 0 ms to minimize.
[2023-03-22 14:32:46] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2740 ms
[2023-03-22 14:32:46] [INFO ] After 3751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-22 14:32:46] [INFO ] After 4468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 27 out of 1280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1280/1280 places, 1231/1231 transitions.
Applied a total of 0 rules in 30 ms. Remains 1280 /1280 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1280/1280 places, 1231/1231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1280/1280 places, 1231/1231 transitions.
Applied a total of 0 rules in 29 ms. Remains 1280 /1280 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
[2023-03-22 14:32:46] [INFO ] Invariant cache hit.
[2023-03-22 14:32:48] [INFO ] Implicit Places using invariants in 1607 ms returned []
[2023-03-22 14:32:48] [INFO ] Invariant cache hit.
[2023-03-22 14:32:51] [INFO ] Implicit Places using invariants and state equation in 3254 ms returned []
Implicit Place search using SMT with State Equation took 4876 ms to find 0 implicit places.
[2023-03-22 14:32:51] [INFO ] Redundant transitions in 98 ms returned []
[2023-03-22 14:32:51] [INFO ] Invariant cache hit.
[2023-03-22 14:32:53] [INFO ] Dead Transitions using invariants and state equation in 1533 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6551 ms. Remains : 1280/1280 places, 1231/1231 transitions.
Applied a total of 0 rules in 47 ms. Remains 1280 /1280 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 14:32:53] [INFO ] Invariant cache hit.
[2023-03-22 14:32:53] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 14:32:53] [INFO ] [Nat]Absence check using 446 positive place invariants in 177 ms returned sat
[2023-03-22 14:32:53] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-22 14:32:55] [INFO ] After 1225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 14:32:55] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 0 ms to minimize.
[2023-03-22 14:32:55] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2023-03-22 14:32:56] [INFO ] Deduced a trap composed of 8 places in 287 ms of which 0 ms to minimize.
[2023-03-22 14:32:56] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2023-03-22 14:32:56] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2023-03-22 14:32:56] [INFO ] Deduced a trap composed of 8 places in 232 ms of which 0 ms to minimize.
[2023-03-22 14:32:57] [INFO ] Deduced a trap composed of 8 places in 426 ms of which 1 ms to minimize.
[2023-03-22 14:32:57] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 0 ms to minimize.
[2023-03-22 14:32:57] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 0 ms to minimize.
[2023-03-22 14:32:58] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2023-03-22 14:32:58] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 1 ms to minimize.
[2023-03-22 14:32:58] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2023-03-22 14:32:58] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 17 ms to minimize.
[2023-03-22 14:32:59] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 1 ms to minimize.
[2023-03-22 14:32:59] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 0 ms to minimize.
[2023-03-22 14:32:59] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2023-03-22 14:32:59] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-22 14:32:59] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2023-03-22 14:33:00] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 1 ms to minimize.
[2023-03-22 14:33:00] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2023-03-22 14:33:00] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 1 ms to minimize.
[2023-03-22 14:33:00] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2023-03-22 14:33:00] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2023-03-22 14:33:01] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 0 ms to minimize.
[2023-03-22 14:33:01] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6165 ms
[2023-03-22 14:33:01] [INFO ] After 7457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-22 14:33:01] [INFO ] After 7982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 14:33:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 24 ms.
[2023-03-22 14:33:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1280 places, 1231 transitions and 5790 arcs took 7 ms.
[2023-03-22 14:33:02] [INFO ] Flatten gal took : 141 ms
Total runtime 87461 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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldIIPs_PT_050B
(NrP: 1280 NrTr: 1231 NrArc: 5790)

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

net check time: 0m 0.014sec

init dd package: 0m 3.119sec


before gc: list nodes free: 693168

after gc: idd nodes used:698123, unused:63301877; list nodes free:286119338

before gc: list nodes free: 1626288

after gc: idd nodes used:1123658, unused:62876342; list nodes free:288417578

before gc: list nodes free: 973558

after gc: idd nodes used:1309199, unused:62690801; list nodes free:287570743

before gc: list nodes free: 1418447

after gc: idd nodes used:1658941, unused:62341059; list nodes free:285955507

before gc: list nodes free: 618017

after gc: idd nodes used:1622989, unused:62377011; list nodes free:286126556

before gc: list nodes free: 2078753

after gc: idd nodes used:2136952, unused:61863048; list nodes free:283752188

before gc: list nodes free: 1623475

after gc: idd nodes used:2451850, unused:61548150; list nodes free:284322694
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6089632 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16094928 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:
++ 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 ReachabilityCardinality -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.008sec

153415 527206 898358 1254250 1305446 1541939 1609046 1878206 2149205 2477042

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-050B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldIIPs-PT-050B, examination is ReachabilityCardinality"
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-167903717600158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050B.tgz
mv ShieldIIPs-PT-050B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;