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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 13K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 860K 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-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-050B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679506043161

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=ShieldIIPt-PT-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 17:27:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 17:27:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:27:26] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-22 17:27:26] [INFO ] Transformed 3503 places.
[2023-03-22 17:27:26] [INFO ] Transformed 3253 transitions.
[2023-03-22 17:27:26] [INFO ] Found NUPN structural information;
[2023-03-22 17:27:26] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 371 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 15) seen :7
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) 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 50 ms. (steps per millisecond=200 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
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
Running SMT prover for 8 properties.
// Phase 1: matrix 3253 rows 3503 cols
[2023-03-22 17:27:27] [INFO ] Computed 451 place invariants in 32 ms
[2023-03-22 17:27:29] [INFO ] After 1528ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 17:27:31] [INFO ] [Nat]Absence check using 451 positive place invariants in 632 ms returned sat
[2023-03-22 17:27:40] [INFO ] After 8989ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 17:27:44] [INFO ] Deduced a trap composed of 20 places in 1657 ms of which 8 ms to minimize.
[2023-03-22 17:27:46] [INFO ] Deduced a trap composed of 19 places in 1033 ms of which 3 ms to minimize.
[2023-03-22 17:27:47] [INFO ] Deduced a trap composed of 12 places in 1002 ms of which 3 ms to minimize.
[2023-03-22 17:27:48] [INFO ] Deduced a trap composed of 32 places in 1305 ms of which 21 ms to minimize.
[2023-03-22 17:27:50] [INFO ] Deduced a trap composed of 30 places in 1707 ms of which 9 ms to minimize.
[2023-03-22 17:27:51] [INFO ] Deduced a trap composed of 23 places in 1203 ms of which 2 ms to minimize.
[2023-03-22 17:27:53] [INFO ] Deduced a trap composed of 24 places in 1349 ms of which 2 ms to minimize.
[2023-03-22 17:27:54] [INFO ] Deduced a trap composed of 29 places in 1201 ms of which 3 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:27:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 17:27:54] [INFO ] After 25274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 7 different solutions.
FORMULA ShieldIIPt-PT-050B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1114 ms.
Support contains 113 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions removed 772 transitions
Trivial Post-agglo rules discarded 772 transitions
Performed 772 trivial Post agglomeration. Transition count delta: 772
Iterating post reduction 0 with 772 rules applied. Total rules applied 772 place count 3503 transition count 2481
Reduce places removed 772 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 774 rules applied. Total rules applied 1546 place count 2731 transition count 2479
Reduce places removed 1 places and 0 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Iterating post reduction 2 with 38 rules applied. Total rules applied 1584 place count 2730 transition count 2442
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 1621 place count 2693 transition count 2442
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 203 Pre rules applied. Total rules applied 1621 place count 2693 transition count 2239
Deduced a syphon composed of 203 places in 7 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 4 with 406 rules applied. Total rules applied 2027 place count 2490 transition count 2239
Discarding 321 places :
Symmetric choice reduction at 4 with 321 rule applications. Total rules 2348 place count 2169 transition count 1918
Iterating global reduction 4 with 321 rules applied. Total rules applied 2669 place count 2169 transition count 1918
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 128 Pre rules applied. Total rules applied 2669 place count 2169 transition count 1790
Deduced a syphon composed of 128 places in 30 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 4 with 256 rules applied. Total rules applied 2925 place count 2041 transition count 1790
Performed 798 Post agglomeration using F-continuation condition.Transition count delta: 798
Deduced a syphon composed of 798 places in 3 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 4 with 1596 rules applied. Total rules applied 4521 place count 1243 transition count 992
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4723 place count 1142 transition count 1047
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 4791 place count 1108 transition count 1064
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4794 place count 1108 transition count 1061
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 4797 place count 1105 transition count 1061
Partial Free-agglomeration rule applied 43 times.
Drop transitions removed 43 transitions
Iterating global reduction 5 with 43 rules applied. Total rules applied 4840 place count 1105 transition count 1061
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4841 place count 1104 transition count 1060
Applied a total of 4841 rules in 1315 ms. Remains 1104 /3503 variables (removed 2399) and now considering 1060/3253 (removed 2193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1316 ms. Remains : 1104/3503 places, 1060/3253 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
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 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 75085 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75085 steps, saw 53106 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1060 rows 1104 cols
[2023-03-22 17:28:01] [INFO ] Computed 451 place invariants in 4 ms
[2023-03-22 17:28:01] [INFO ] After 377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 17:28:02] [INFO ] [Nat]Absence check using 451 positive place invariants in 104 ms returned sat
[2023-03-22 17:28:03] [INFO ] After 1161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 17:28:03] [INFO ] State equation strengthened by 360 read => feed constraints.
[2023-03-22 17:28:05] [INFO ] After 1869ms SMT Verify possible using 360 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 17:28:05] [INFO ] Deduced a trap composed of 5 places in 430 ms of which 1 ms to minimize.
[2023-03-22 17:28:06] [INFO ] Deduced a trap composed of 8 places in 278 ms of which 0 ms to minimize.
[2023-03-22 17:28:06] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-22 17:28:06] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2023-03-22 17:28:06] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 23 ms to minimize.
[2023-03-22 17:28:07] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
[2023-03-22 17:28:07] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2023-03-22 17:28:07] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2023-03-22 17:28:08] [INFO ] Deduced a trap composed of 6 places in 363 ms of which 0 ms to minimize.
[2023-03-22 17:28:08] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2023-03-22 17:28:08] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2023-03-22 17:28:08] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2023-03-22 17:28:08] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 0 ms to minimize.
[2023-03-22 17:28:09] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 6 ms to minimize.
[2023-03-22 17:28:09] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3815 ms
[2023-03-22 17:28:09] [INFO ] Deduced a trap composed of 6 places in 466 ms of which 1 ms to minimize.
[2023-03-22 17:28:10] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 1 ms to minimize.
[2023-03-22 17:28:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 817 ms
[2023-03-22 17:28:10] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 1 ms to minimize.
[2023-03-22 17:28:11] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2023-03-22 17:28:11] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 1 ms to minimize.
[2023-03-22 17:28:11] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 1 ms to minimize.
[2023-03-22 17:28:11] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2023-03-22 17:28:12] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 0 ms to minimize.
[2023-03-22 17:28:12] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2023-03-22 17:28:12] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 1 ms to minimize.
[2023-03-22 17:28:13] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 1 ms to minimize.
[2023-03-22 17:28:13] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 16 ms to minimize.
[2023-03-22 17:28:13] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 1 ms to minimize.
[2023-03-22 17:28:13] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3210 ms
[2023-03-22 17:28:14] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2023-03-22 17:28:14] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2023-03-22 17:28:15] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2023-03-22 17:28:15] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2023-03-22 17:28:15] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 26 ms to minimize.
[2023-03-22 17:28:15] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2023-03-22 17:28:16] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2023-03-22 17:28:16] [INFO ] Deduced a trap composed of 3 places in 234 ms of which 28 ms to minimize.
[2023-03-22 17:28:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2307 ms
[2023-03-22 17:28:20] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2023-03-22 17:28:21] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 1 ms to minimize.
[2023-03-22 17:28:21] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 0 ms to minimize.
[2023-03-22 17:28:21] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2023-03-22 17:28:21] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 1 ms to minimize.
[2023-03-22 17:28:22] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 1 ms to minimize.
[2023-03-22 17:28:22] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 0 ms to minimize.
[2023-03-22 17:28:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2109 ms
[2023-03-22 17:28:22] [INFO ] After 19205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 3946 ms.
[2023-03-22 17:28:26] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 418 ms.
Support contains 113 out of 1104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 1060/1060 transitions.
Applied a total of 0 rules in 108 ms. Remains 1104 /1104 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 1104/1104 places, 1060/1060 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1104/1104 places, 1060/1060 transitions.
Applied a total of 0 rules in 45 ms. Remains 1104 /1104 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
[2023-03-22 17:28:27] [INFO ] Invariant cache hit.
[2023-03-22 17:28:27] [INFO ] Implicit Places using invariants in 820 ms returned [1094]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 823 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1103/1104 places, 1060/1060 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1103 transition count 1059
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1102 transition count 1059
Applied a total of 2 rules in 81 ms. Remains 1102 /1103 variables (removed 1) and now considering 1059/1060 (removed 1) transitions.
// Phase 1: matrix 1059 rows 1102 cols
[2023-03-22 17:28:28] [INFO ] Computed 450 place invariants in 3 ms
[2023-03-22 17:28:29] [INFO ] Implicit Places using invariants in 1081 ms returned [1087]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1095 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1101/1104 places, 1059/1060 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1100 transition count 1058
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1100 transition count 1058
Applied a total of 2 rules in 76 ms. Remains 1100 /1101 variables (removed 1) and now considering 1058/1059 (removed 1) transitions.
// Phase 1: matrix 1058 rows 1100 cols
[2023-03-22 17:28:29] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-22 17:28:30] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2023-03-22 17:28:30] [INFO ] Invariant cache hit.
[2023-03-22 17:28:30] [INFO ] State equation strengthened by 358 read => feed constraints.
[2023-03-22 17:28:34] [INFO ] Implicit Places using invariants and state equation in 4727 ms returned []
Implicit Place search using SMT with State Equation took 5783 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1100/1104 places, 1058/1060 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7921 ms. Remains : 1100/1104 places, 1058/1060 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 70447 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70447 steps, saw 49190 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-22 17:28:39] [INFO ] Invariant cache hit.
[2023-03-22 17:28:39] [INFO ] After 363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 17:28:39] [INFO ] [Nat]Absence check using 449 positive place invariants in 97 ms returned sat
[2023-03-22 17:28:41] [INFO ] After 1138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 17:28:41] [INFO ] State equation strengthened by 358 read => feed constraints.
[2023-03-22 17:28:44] [INFO ] After 2902ms SMT Verify possible using 358 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 17:28:44] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2023-03-22 17:28:44] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
[2023-03-22 17:28:44] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 0 ms to minimize.
[2023-03-22 17:28:45] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 6 ms to minimize.
[2023-03-22 17:28:45] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 12 ms to minimize.
[2023-03-22 17:28:45] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 1 ms to minimize.
[2023-03-22 17:28:45] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 0 ms to minimize.
[2023-03-22 17:28:46] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2023-03-22 17:28:46] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 0 ms to minimize.
[2023-03-22 17:28:46] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 0 ms to minimize.
[2023-03-22 17:28:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2372 ms
[2023-03-22 17:28:46] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2023-03-22 17:28:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-03-22 17:28:47] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2023-03-22 17:28:47] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 9 ms to minimize.
[2023-03-22 17:28:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 550 ms
[2023-03-22 17:28:48] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2023-03-22 17:28:48] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2023-03-22 17:28:48] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2023-03-22 17:28:48] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 3 ms to minimize.
[2023-03-22 17:28:48] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2023-03-22 17:28:49] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 13 ms to minimize.
[2023-03-22 17:28:49] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-22 17:28:49] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2023-03-22 17:28:49] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2023-03-22 17:28:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1758 ms
[2023-03-22 17:28:50] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 0 ms to minimize.
[2023-03-22 17:28:50] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2023-03-22 17:28:50] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 0 ms to minimize.
[2023-03-22 17:28:51] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2023-03-22 17:28:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1010 ms
[2023-03-22 17:28:52] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2023-03-22 17:28:53] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 0 ms to minimize.
[2023-03-22 17:28:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 503 ms
[2023-03-22 17:28:53] [INFO ] After 11913ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2810 ms.
[2023-03-22 17:28:56] [INFO ] After 16514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 351 ms.
Support contains 113 out of 1100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1100/1100 places, 1058/1058 transitions.
Applied a total of 0 rules in 26 ms. Remains 1100 /1100 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1100/1100 places, 1058/1058 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1100/1100 places, 1058/1058 transitions.
Applied a total of 0 rules in 33 ms. Remains 1100 /1100 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
[2023-03-22 17:28:56] [INFO ] Invariant cache hit.
[2023-03-22 17:28:57] [INFO ] Implicit Places using invariants in 671 ms returned []
[2023-03-22 17:28:57] [INFO ] Invariant cache hit.
[2023-03-22 17:28:57] [INFO ] State equation strengthened by 358 read => feed constraints.
[2023-03-22 17:29:01] [INFO ] Implicit Places using invariants and state equation in 4807 ms returned []
Implicit Place search using SMT with State Equation took 5482 ms to find 0 implicit places.
[2023-03-22 17:29:02] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-22 17:29:02] [INFO ] Invariant cache hit.
[2023-03-22 17:29:02] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6373 ms. Remains : 1100/1100 places, 1058/1058 transitions.
Graph (complete) has 3093 edges and 1100 vertex of which 1099 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 180 times.
Drop transitions removed 180 transitions
Iterating global reduction 0 with 180 rules applied. Total rules applied 181 place count 1099 transition count 1058
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 182 place count 1099 transition count 1057
Applied a total of 182 rules in 115 ms. Remains 1099 /1100 variables (removed 1) and now considering 1057/1058 (removed 1) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 1057 rows 1099 cols
[2023-03-22 17:29:02] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-22 17:29:03] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 17:29:03] [INFO ] [Nat]Absence check using 448 positive place invariants in 116 ms returned sat
[2023-03-22 17:29:04] [INFO ] After 898ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 17:29:04] [INFO ] State equation strengthened by 162 read => feed constraints.
[2023-03-22 17:29:05] [INFO ] After 1069ms SMT Verify possible using 162 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 17:29:06] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2023-03-22 17:29:06] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2023-03-22 17:29:06] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2023-03-22 17:29:06] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2023-03-22 17:29:06] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
[2023-03-22 17:29:06] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 0 ms to minimize.
[2023-03-22 17:29:07] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2023-03-22 17:29:07] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2023-03-22 17:29:07] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2023-03-22 17:29:07] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2023-03-22 17:29:07] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 0 ms to minimize.
[2023-03-22 17:29:08] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2023-03-22 17:29:08] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
[2023-03-22 17:29:08] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
[2023-03-22 17:29:08] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 1 ms to minimize.
[2023-03-22 17:29:08] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2912 ms
[2023-03-22 17:29:08] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2023-03-22 17:29:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-22 17:29:09] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 0 ms to minimize.
[2023-03-22 17:29:09] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2023-03-22 17:29:09] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 1 ms to minimize.
[2023-03-22 17:29:09] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2023-03-22 17:29:10] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2023-03-22 17:29:10] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 0 ms to minimize.
[2023-03-22 17:29:10] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2023-03-22 17:29:10] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2023-03-22 17:29:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1623 ms
[2023-03-22 17:29:11] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 0 ms to minimize.
[2023-03-22 17:29:11] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2023-03-22 17:29:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 482 ms
[2023-03-22 17:29:11] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2023-03-22 17:29:11] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2023-03-22 17:29:12] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 1 ms to minimize.
[2023-03-22 17:29:12] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2023-03-22 17:29:12] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 0 ms to minimize.
[2023-03-22 17:29:12] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2023-03-22 17:29:12] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2023-03-22 17:29:13] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 3 ms to minimize.
[2023-03-22 17:29:13] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2023-03-22 17:29:13] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 0 ms to minimize.
[2023-03-22 17:29:13] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2023-03-22 17:29:13] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2163 ms
[2023-03-22 17:29:14] [INFO ] After 9701ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1370 ms.
[2023-03-22 17:29:15] [INFO ] After 12512ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-22 17:29:15] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 12 ms.
[2023-03-22 17:29:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1100 places, 1058 transitions and 5050 arcs took 14 ms.
[2023-03-22 17:29:16] [INFO ] Flatten gal took : 172 ms
Total runtime 110053 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: ShieldIIPt_PT_050B
(NrP: 1100 NrTr: 1058 NrArc: 5050)

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

net check time: 0m 0.000sec

init dd package: 0m 2.901sec


before gc: list nodes free: 815665

after gc: idd nodes used:49938747, unused:14061253; list nodes free:62313162

RS generation: 2m 2.673sec


-> last computed set: #nodes 49937667 (5.0e+07) #states 10,243,531,817,307,472,119 (19)


CANNOT_COMPUTE


BK_STOP 1679506310032

--------------------
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.006sec

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-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 ShieldIIPt-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-167903717800334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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