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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.1K Feb 25 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:46 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.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 762K 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 ShieldPPPt-PT-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679530083978

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=ShieldPPPt-PT-040B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 00:08:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 00:08:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:08:06] [INFO ] Load time of PNML (sax parser for PT used): 311 ms
[2023-03-23 00:08:06] [INFO ] Transformed 3123 places.
[2023-03-23 00:08:06] [INFO ] Transformed 2843 transitions.
[2023-03-23 00:08:06] [INFO ] Found NUPN structural information;
[2023-03-23 00:08:06] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 619 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 14) seen :3
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2843 rows 3123 cols
[2023-03-23 00:08:08] [INFO ] Computed 441 place invariants in 30 ms
[2023-03-23 00:08:10] [INFO ] [Real]Absence check using 441 positive place invariants in 324 ms returned sat
[2023-03-23 00:08:10] [INFO ] After 2082ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-23 00:08:11] [INFO ] [Nat]Absence check using 441 positive place invariants in 271 ms returned sat
[2023-03-23 00:08:18] [INFO ] After 5906ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-23 00:08:19] [INFO ] Deduced a trap composed of 22 places in 1081 ms of which 17 ms to minimize.
[2023-03-23 00:08:21] [INFO ] Deduced a trap composed of 23 places in 1226 ms of which 4 ms to minimize.
[2023-03-23 00:08:22] [INFO ] Deduced a trap composed of 24 places in 982 ms of which 2 ms to minimize.
[2023-03-23 00:08:23] [INFO ] Deduced a trap composed of 28 places in 925 ms of which 17 ms to minimize.
[2023-03-23 00:08:25] [INFO ] Deduced a trap composed of 32 places in 1421 ms of which 2 ms to minimize.
[2023-03-23 00:08:26] [INFO ] Deduced a trap composed of 34 places in 944 ms of which 2 ms to minimize.
[2023-03-23 00:08:27] [INFO ] Deduced a trap composed of 33 places in 1006 ms of which 16 ms to minimize.
[2023-03-23 00:08:28] [INFO ] Deduced a trap composed of 22 places in 898 ms of which 3 ms to minimize.
[2023-03-23 00:08:29] [INFO ] Deduced a trap composed of 25 places in 917 ms of which 2 ms to minimize.
[2023-03-23 00:08:30] [INFO ] Deduced a trap composed of 56 places in 949 ms of which 2 ms to minimize.
[2023-03-23 00:08:31] [INFO ] Deduced a trap composed of 13 places in 910 ms of which 2 ms to minimize.
[2023-03-23 00:08:32] [INFO ] Deduced a trap composed of 27 places in 792 ms of which 2 ms to minimize.
[2023-03-23 00:08:33] [INFO ] Deduced a trap composed of 44 places in 835 ms of which 2 ms to minimize.
[2023-03-23 00:08:34] [INFO ] Deduced a trap composed of 35 places in 889 ms of which 3 ms to minimize.
[2023-03-23 00:08:35] [INFO ] Deduced a trap composed of 53 places in 1115 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-23 00:08:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 00:08:35] [INFO ] After 25547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1011 ms.
Support contains 104 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions removed 686 transitions
Trivial Post-agglo rules discarded 686 transitions
Performed 686 trivial Post agglomeration. Transition count delta: 686
Iterating post reduction 0 with 686 rules applied. Total rules applied 686 place count 3123 transition count 2157
Reduce places removed 686 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 688 rules applied. Total rules applied 1374 place count 2437 transition count 2155
Reduce places removed 1 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 31 rules applied. Total rules applied 1405 place count 2436 transition count 2125
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 1435 place count 2406 transition count 2125
Performed 169 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 169 Pre rules applied. Total rules applied 1435 place count 2406 transition count 1956
Deduced a syphon composed of 169 places in 11 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 1773 place count 2237 transition count 1956
Discarding 258 places :
Symmetric choice reduction at 4 with 258 rule applications. Total rules 2031 place count 1979 transition count 1698
Iterating global reduction 4 with 258 rules applied. Total rules applied 2289 place count 1979 transition count 1698
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 2289 place count 1979 transition count 1597
Deduced a syphon composed of 101 places in 10 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2491 place count 1878 transition count 1597
Performed 632 Post agglomeration using F-continuation condition.Transition count delta: 632
Deduced a syphon composed of 632 places in 5 ms
Reduce places removed 632 places and 0 transitions.
Iterating global reduction 4 with 1264 rules applied. Total rules applied 3755 place count 1246 transition count 965
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 3957 place count 1145 transition count 965
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3959 place count 1144 transition count 965
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 3965 place count 1144 transition count 959
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 3971 place count 1138 transition count 959
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 4071 place count 1138 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4072 place count 1137 transition count 958
Applied a total of 4072 rules in 1025 ms. Remains 1137 /3123 variables (removed 1986) and now considering 958/2843 (removed 1885) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1026 ms. Remains : 1137/3123 places, 958/2843 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 94242 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94242 steps, saw 61436 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 958 rows 1137 cols
[2023-03-23 00:08:41] [INFO ] Computed 441 place invariants in 4 ms
[2023-03-23 00:08:42] [INFO ] [Real]Absence check using 441 positive place invariants in 171 ms returned sat
[2023-03-23 00:08:42] [INFO ] After 698ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 00:08:43] [INFO ] [Nat]Absence check using 441 positive place invariants in 105 ms returned sat
[2023-03-23 00:08:44] [INFO ] After 1166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 00:08:44] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-23 00:08:47] [INFO ] After 3396ms SMT Verify possible using 216 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 00:08:48] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2023-03-23 00:08:48] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2023-03-23 00:08:48] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
[2023-03-23 00:08:49] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 0 ms to minimize.
[2023-03-23 00:08:49] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 1 ms to minimize.
[2023-03-23 00:08:49] [INFO ] Deduced a trap composed of 10 places in 315 ms of which 0 ms to minimize.
[2023-03-23 00:08:49] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2023-03-23 00:08:50] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2023-03-23 00:08:50] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 0 ms to minimize.
[2023-03-23 00:08:50] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 0 ms to minimize.
[2023-03-23 00:08:50] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-23 00:08:51] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 1 ms to minimize.
[2023-03-23 00:08:51] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2023-03-23 00:08:51] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3274 ms
[2023-03-23 00:08:51] [INFO ] Deduced a trap composed of 5 places in 335 ms of which 1 ms to minimize.
[2023-03-23 00:08:52] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2023-03-23 00:08:52] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2023-03-23 00:08:52] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2023-03-23 00:08:52] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 0 ms to minimize.
[2023-03-23 00:08:53] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 0 ms to minimize.
[2023-03-23 00:08:53] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 1 ms to minimize.
[2023-03-23 00:08:53] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 0 ms to minimize.
[2023-03-23 00:08:53] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2023-03-23 00:08:54] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 1 ms to minimize.
[2023-03-23 00:08:54] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 0 ms to minimize.
[2023-03-23 00:08:54] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 1 ms to minimize.
[2023-03-23 00:08:54] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 1 ms to minimize.
[2023-03-23 00:08:55] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 0 ms to minimize.
[2023-03-23 00:08:55] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 0 ms to minimize.
[2023-03-23 00:08:55] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3973 ms
[2023-03-23 00:08:55] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 0 ms to minimize.
[2023-03-23 00:08:56] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 1 ms to minimize.
[2023-03-23 00:08:56] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2023-03-23 00:08:56] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 0 ms to minimize.
[2023-03-23 00:08:56] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 1 ms to minimize.
[2023-03-23 00:08:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1334 ms
[2023-03-23 00:08:57] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 1 ms to minimize.
[2023-03-23 00:08:57] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2023-03-23 00:08:57] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 7 ms to minimize.
[2023-03-23 00:08:58] [INFO ] Deduced a trap composed of 10 places in 379 ms of which 1 ms to minimize.
[2023-03-23 00:08:58] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 0 ms to minimize.
[2023-03-23 00:08:58] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 1 ms to minimize.
[2023-03-23 00:08:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1691 ms
[2023-03-23 00:08:58] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 1 ms to minimize.
[2023-03-23 00:08:59] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 0 ms to minimize.
[2023-03-23 00:08:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 579 ms
[2023-03-23 00:09:01] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 1 ms to minimize.
[2023-03-23 00:09:01] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 0 ms to minimize.
[2023-03-23 00:09:02] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2023-03-23 00:09:02] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2023-03-23 00:09:02] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2023-03-23 00:09:02] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 0 ms to minimize.
[2023-03-23 00:09:03] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 1 ms to minimize.
[2023-03-23 00:09:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2061 ms
[2023-03-23 00:09:03] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 14 ms to minimize.
[2023-03-23 00:09:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-23 00:09:04] [INFO ] Deduced a trap composed of 7 places in 328 ms of which 14 ms to minimize.
[2023-03-23 00:09:04] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 1 ms to minimize.
[2023-03-23 00:09:04] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 13 ms to minimize.
[2023-03-23 00:09:04] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 4 ms to minimize.
[2023-03-23 00:09:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1186 ms
[2023-03-23 00:09:05] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 1 ms to minimize.
[2023-03-23 00:09:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-03-23 00:09:05] [INFO ] After 20798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1538 ms.
[2023-03-23 00:09:06] [INFO ] After 24332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 333 ms.
Support contains 104 out of 1137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 958/958 transitions.
Applied a total of 0 rules in 34 ms. Remains 1137 /1137 variables (removed 0) and now considering 958/958 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1137/1137 places, 958/958 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 958/958 transitions.
Applied a total of 0 rules in 33 ms. Remains 1137 /1137 variables (removed 0) and now considering 958/958 (removed 0) transitions.
[2023-03-23 00:09:07] [INFO ] Invariant cache hit.
[2023-03-23 00:09:08] [INFO ] Implicit Places using invariants in 796 ms returned []
[2023-03-23 00:09:08] [INFO ] Invariant cache hit.
[2023-03-23 00:09:08] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-23 00:09:11] [INFO ] Implicit Places using invariants and state equation in 3082 ms returned []
Implicit Place search using SMT with State Equation took 3894 ms to find 0 implicit places.
[2023-03-23 00:09:11] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-23 00:09:11] [INFO ] Invariant cache hit.
[2023-03-23 00:09:11] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4622 ms. Remains : 1137/1137 places, 958/958 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 1137 transition count 957
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 1136 transition count 957
Partial Free-agglomeration rule applied 216 times.
Drop transitions removed 216 transitions
Iterating global reduction 0 with 216 rules applied. Total rules applied 218 place count 1136 transition count 957
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 221 place count 1136 transition count 954
Applied a total of 221 rules in 99 ms. Remains 1136 /1137 variables (removed 1) and now considering 954/958 (removed 4) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 954 rows 1136 cols
[2023-03-23 00:09:12] [INFO ] Computed 441 place invariants in 3 ms
[2023-03-23 00:09:12] [INFO ] [Real]Absence check using 441 positive place invariants in 70 ms returned sat
[2023-03-23 00:09:12] [INFO ] After 377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 00:09:12] [INFO ] [Nat]Absence check using 441 positive place invariants in 102 ms returned sat
[2023-03-23 00:09:14] [INFO ] After 1107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 00:09:14] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-03-23 00:09:16] [INFO ] After 2026ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 00:09:16] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 1 ms to minimize.
[2023-03-23 00:09:16] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 0 ms to minimize.
[2023-03-23 00:09:16] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2023-03-23 00:09:17] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 1 ms to minimize.
[2023-03-23 00:09:17] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 1 ms to minimize.
[2023-03-23 00:09:17] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2023-03-23 00:09:17] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2023-03-23 00:09:18] [INFO ] Deduced a trap composed of 8 places in 226 ms of which 0 ms to minimize.
[2023-03-23 00:09:18] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2023-03-23 00:09:18] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2023-03-23 00:09:18] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2023-03-23 00:09:18] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2023-03-23 00:09:19] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2023-03-23 00:09:19] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2023-03-23 00:09:19] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2023-03-23 00:09:19] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 0 ms to minimize.
[2023-03-23 00:09:19] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2023-03-23 00:09:20] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3867 ms
[2023-03-23 00:09:20] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 1 ms to minimize.
[2023-03-23 00:09:20] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 1 ms to minimize.
[2023-03-23 00:09:21] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2023-03-23 00:09:21] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 1 ms to minimize.
[2023-03-23 00:09:21] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 1 ms to minimize.
[2023-03-23 00:09:22] [INFO ] Deduced a trap composed of 7 places in 314 ms of which 1 ms to minimize.
[2023-03-23 00:09:22] [INFO ] Deduced a trap composed of 4 places in 570 ms of which 1 ms to minimize.
[2023-03-23 00:09:22] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 1 ms to minimize.
[2023-03-23 00:09:23] [INFO ] Deduced a trap composed of 7 places in 279 ms of which 1 ms to minimize.
[2023-03-23 00:09:23] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 0 ms to minimize.
[2023-03-23 00:09:23] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 1 ms to minimize.
[2023-03-23 00:09:23] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 1 ms to minimize.
[2023-03-23 00:09:24] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2023-03-23 00:09:24] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2023-03-23 00:09:24] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2023-03-23 00:09:24] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2023-03-23 00:09:24] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2023-03-23 00:09:25] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2023-03-23 00:09:25] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2023-03-23 00:09:25] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2023-03-23 00:09:25] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5264 ms
[2023-03-23 00:09:25] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2023-03-23 00:09:26] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2023-03-23 00:09:26] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2023-03-23 00:09:26] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 0 ms to minimize.
[2023-03-23 00:09:26] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2023-03-23 00:09:26] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 1 ms to minimize.
[2023-03-23 00:09:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1310 ms
[2023-03-23 00:09:27] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2023-03-23 00:09:27] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2023-03-23 00:09:27] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 0 ms to minimize.
[2023-03-23 00:09:28] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 1 ms to minimize.
[2023-03-23 00:09:28] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 1 ms to minimize.
[2023-03-23 00:09:28] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2023-03-23 00:09:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1331 ms
[2023-03-23 00:09:28] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 0 ms to minimize.
[2023-03-23 00:09:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-23 00:09:30] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 1 ms to minimize.
[2023-03-23 00:09:30] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 0 ms to minimize.
[2023-03-23 00:09:30] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 1 ms to minimize.
[2023-03-23 00:09:31] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 0 ms to minimize.
[2023-03-23 00:09:31] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 1 ms to minimize.
[2023-03-23 00:09:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1584 ms
[2023-03-23 00:09:31] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 1 ms to minimize.
[2023-03-23 00:09:32] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 1 ms to minimize.
[2023-03-23 00:09:32] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 1 ms to minimize.
[2023-03-23 00:09:32] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 7 ms to minimize.
[2023-03-23 00:09:32] [INFO ] Deduced a trap composed of 10 places in 269 ms of which 1 ms to minimize.
[2023-03-23 00:09:33] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 0 ms to minimize.
[2023-03-23 00:09:33] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 0 ms to minimize.
[2023-03-23 00:09:33] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 0 ms to minimize.
[2023-03-23 00:09:34] [INFO ] Deduced a trap composed of 8 places in 270 ms of which 0 ms to minimize.
[2023-03-23 00:09:34] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 0 ms to minimize.
[2023-03-23 00:09:34] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 1 ms to minimize.
[2023-03-23 00:09:34] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 0 ms to minimize.
[2023-03-23 00:09:35] [INFO ] Deduced a trap composed of 16 places in 198 ms of which 0 ms to minimize.
[2023-03-23 00:09:35] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3638 ms
[2023-03-23 00:09:35] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 0 ms to minimize.
[2023-03-23 00:09:35] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 8 ms to minimize.
[2023-03-23 00:09:36] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 0 ms to minimize.
[2023-03-23 00:09:36] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 22 ms to minimize.
[2023-03-23 00:09:36] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 2 ms to minimize.
[2023-03-23 00:09:37] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 1 ms to minimize.
[2023-03-23 00:09:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1754 ms
[2023-03-23 00:09:37] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 0 ms to minimize.
[2023-03-23 00:09:37] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 0 ms to minimize.
[2023-03-23 00:09:37] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 0 ms to minimize.
[2023-03-23 00:09:38] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 0 ms to minimize.
[2023-03-23 00:09:38] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 1 ms to minimize.
[2023-03-23 00:09:38] [INFO ] Deduced a trap composed of 7 places in 262 ms of which 0 ms to minimize.
[2023-03-23 00:09:38] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 1 ms to minimize.
[2023-03-23 00:09:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1796 ms
[2023-03-23 00:09:38] [INFO ] After 24872ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1733 ms.
[2023-03-23 00:09:40] [INFO ] After 28298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-23 00:09:40] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-23 00:09:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1137 places, 958 transitions and 4097 arcs took 16 ms.
[2023-03-23 00:09:41] [INFO ] Flatten gal took : 126 ms
Total runtime 94812 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: ShieldPPPt_PT_040B
(NrP: 1137 NrTr: 958 NrArc: 4097)

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

net check time: 0m 0.000sec

init dd package: 0m 2.818sec


before gc: list nodes free: 2011224

after gc: idd nodes used:50455, unused:63949545; list nodes free:293351732

before gc: list nodes free: 1122867

after gc: idd nodes used:203893, unused:63796107; list nodes free:298914620

before gc: list nodes free: 9633576

after gc: idd nodes used:256436, unused:63743564; list nodes free:298666100

before gc: list nodes free: 6982402

after gc: idd nodes used:297950, unused:63702050; list nodes free:298488760

before gc: list nodes free: 9531206

after gc: idd nodes used:364604, unused:63635396; list nodes free:298172633

before gc: list nodes free: 5817854

after gc: idd nodes used:856779, unused:63143221; list nodes free:295899347

before gc: list nodes free: 5143544

after gc: idd nodes used:786943, unused:63213057; list nodes free:296224697

before gc: list nodes free: 7994279

after gc: idd nodes used:980618, unused:63019382; list nodes free:295343709
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6026084 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16096232 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.004sec

18146 49917 99694 261738 203920 255289 320921 355188 878834

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

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