Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978700302.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVt-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978700302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 8.4K Feb 25 23:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 23:08 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:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 23:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 364K 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 ShieldRVt-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679349057480

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=ShieldRVt-PT-030B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:50:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 21:50:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:50:59] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-20 21:50:59] [INFO ] Transformed 1503 places.
[2023-03-20 21:50:59] [INFO ] Transformed 1503 transitions.
[2023-03-20 21:50:59] [INFO ] Found NUPN structural information;
[2023-03-20 21:50:59] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 15) seen :8
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1503 rows 1503 cols
[2023-03-20 21:50:59] [INFO ] Computed 121 place invariants in 22 ms
[2023-03-20 21:51:00] [INFO ] After 496ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 21:51:00] [INFO ] [Nat]Absence check using 121 positive place invariants in 51 ms returned sat
[2023-03-20 21:51:02] [INFO ] After 2117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 21:51:03] [INFO ] Deduced a trap composed of 34 places in 439 ms of which 6 ms to minimize.
[2023-03-20 21:51:03] [INFO ] Deduced a trap composed of 31 places in 406 ms of which 2 ms to minimize.
[2023-03-20 21:51:04] [INFO ] Deduced a trap composed of 32 places in 463 ms of which 2 ms to minimize.
[2023-03-20 21:51:04] [INFO ] Deduced a trap composed of 36 places in 401 ms of which 2 ms to minimize.
[2023-03-20 21:51:05] [INFO ] Deduced a trap composed of 35 places in 389 ms of which 2 ms to minimize.
[2023-03-20 21:51:05] [INFO ] Deduced a trap composed of 20 places in 380 ms of which 1 ms to minimize.
[2023-03-20 21:51:06] [INFO ] Deduced a trap composed of 50 places in 367 ms of which 1 ms to minimize.
[2023-03-20 21:51:06] [INFO ] Deduced a trap composed of 33 places in 360 ms of which 1 ms to minimize.
[2023-03-20 21:51:07] [INFO ] Deduced a trap composed of 51 places in 365 ms of which 1 ms to minimize.
[2023-03-20 21:51:07] [INFO ] Deduced a trap composed of 39 places in 373 ms of which 2 ms to minimize.
[2023-03-20 21:51:07] [INFO ] Deduced a trap composed of 51 places in 215 ms of which 1 ms to minimize.
[2023-03-20 21:51:08] [INFO ] Deduced a trap composed of 44 places in 299 ms of which 1 ms to minimize.
[2023-03-20 21:51:08] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 1 ms to minimize.
[2023-03-20 21:51:08] [INFO ] Deduced a trap composed of 30 places in 290 ms of which 1 ms to minimize.
[2023-03-20 21:51:09] [INFO ] Deduced a trap composed of 46 places in 285 ms of which 1 ms to minimize.
[2023-03-20 21:51:09] [INFO ] Deduced a trap composed of 54 places in 288 ms of which 1 ms to minimize.
[2023-03-20 21:51:09] [INFO ] Deduced a trap composed of 56 places in 255 ms of which 0 ms to minimize.
[2023-03-20 21:51:10] [INFO ] Deduced a trap composed of 37 places in 279 ms of which 0 ms to minimize.
[2023-03-20 21:51:10] [INFO ] Deduced a trap composed of 59 places in 279 ms of which 1 ms to minimize.
[2023-03-20 21:51:10] [INFO ] Deduced a trap composed of 47 places in 253 ms of which 1 ms to minimize.
[2023-03-20 21:51:11] [INFO ] Deduced a trap composed of 51 places in 290 ms of which 1 ms to minimize.
[2023-03-20 21:51:11] [INFO ] Deduced a trap composed of 68 places in 280 ms of which 1 ms to minimize.
[2023-03-20 21:51:11] [INFO ] Deduced a trap composed of 49 places in 476 ms of which 1 ms to minimize.
[2023-03-20 21:51:12] [INFO ] Deduced a trap composed of 45 places in 278 ms of which 1 ms to minimize.
[2023-03-20 21:51:12] [INFO ] Deduced a trap composed of 45 places in 300 ms of which 0 ms to minimize.
[2023-03-20 21:51:13] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 1 ms to minimize.
[2023-03-20 21:51:13] [INFO ] Deduced a trap composed of 42 places in 264 ms of which 2 ms to minimize.
[2023-03-20 21:51:13] [INFO ] Deduced a trap composed of 45 places in 243 ms of which 1 ms to minimize.
[2023-03-20 21:51:13] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 1 ms to minimize.
[2023-03-20 21:51:14] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 0 ms to minimize.
[2023-03-20 21:51:14] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 1 ms to minimize.
[2023-03-20 21:51:14] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 1 ms to minimize.
[2023-03-20 21:51:14] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 0 ms to minimize.
[2023-03-20 21:51:15] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 0 ms to minimize.
[2023-03-20 21:51:15] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 1 ms to minimize.
[2023-03-20 21:51:15] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 1 ms to minimize.
[2023-03-20 21:51:15] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 1 ms to minimize.
[2023-03-20 21:51:16] [INFO ] Deduced a trap composed of 48 places in 239 ms of which 1 ms to minimize.
[2023-03-20 21:51:16] [INFO ] Deduced a trap composed of 50 places in 230 ms of which 2 ms to minimize.
[2023-03-20 21:51:16] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 2 ms to minimize.
[2023-03-20 21:51:17] [INFO ] Deduced a trap composed of 58 places in 194 ms of which 1 ms to minimize.
[2023-03-20 21:51:17] [INFO ] Deduced a trap composed of 51 places in 208 ms of which 1 ms to minimize.
[2023-03-20 21:51:17] [INFO ] Deduced a trap composed of 55 places in 190 ms of which 1 ms to minimize.
[2023-03-20 21:51:17] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 1 ms to minimize.
[2023-03-20 21:51:18] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 0 ms to minimize.
[2023-03-20 21:51:18] [INFO ] Deduced a trap composed of 59 places in 191 ms of which 1 ms to minimize.
[2023-03-20 21:51:18] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 0 ms to minimize.
[2023-03-20 21:51:18] [INFO ] Deduced a trap composed of 53 places in 162 ms of which 1 ms to minimize.
[2023-03-20 21:51:18] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 1 ms to minimize.
[2023-03-20 21:51:18] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 15977 ms
[2023-03-20 21:51:19] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 1 ms to minimize.
[2023-03-20 21:51:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 320 ms
[2023-03-20 21:51:19] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 1 ms to minimize.
[2023-03-20 21:51:20] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 2 ms to minimize.
[2023-03-20 21:51:20] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 0 ms to minimize.
[2023-03-20 21:51:20] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 1 ms to minimize.
[2023-03-20 21:51:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1146 ms
[2023-03-20 21:51:21] [INFO ] Deduced a trap composed of 42 places in 293 ms of which 0 ms to minimize.
[2023-03-20 21:51:21] [INFO ] Deduced a trap composed of 45 places in 314 ms of which 5 ms to minimize.
[2023-03-20 21:51:22] [INFO ] Deduced a trap composed of 40 places in 279 ms of which 1 ms to minimize.
[2023-03-20 21:51:22] [INFO ] Deduced a trap composed of 28 places in 287 ms of which 1 ms to minimize.
[2023-03-20 21:51:22] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 1 ms to minimize.
[2023-03-20 21:51:23] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 1 ms to minimize.
[2023-03-20 21:51:23] [INFO ] Deduced a trap composed of 41 places in 229 ms of which 1 ms to minimize.
[2023-03-20 21:51:23] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 1 ms to minimize.
[2023-03-20 21:51:23] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 1 ms to minimize.
[2023-03-20 21:51:24] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 2 ms to minimize.
[2023-03-20 21:51:24] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 2 ms to minimize.
[2023-03-20 21:51:24] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 0 ms to minimize.
[2023-03-20 21:51:24] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 3 ms to minimize.
[2023-03-20 21:51:25] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 2 ms to minimize.
[2023-03-20 21:51:25] [INFO ] Deduced a trap composed of 46 places in 187 ms of which 1 ms to minimize.
[2023-03-20 21:51:25] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 0 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-20 21:51:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 21:51:25] [INFO ] After 25084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 158 ms.
Support contains 43 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions removed 450 transitions
Trivial Post-agglo rules discarded 450 transitions
Performed 450 trivial Post agglomeration. Transition count delta: 450
Iterating post reduction 0 with 450 rules applied. Total rules applied 450 place count 1503 transition count 1053
Reduce places removed 450 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 452 rules applied. Total rules applied 902 place count 1053 transition count 1051
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 909 place count 1052 transition count 1045
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 915 place count 1046 transition count 1045
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 121 Pre rules applied. Total rules applied 915 place count 1046 transition count 924
Deduced a syphon composed of 121 places in 1 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 1157 place count 925 transition count 924
Discarding 197 places :
Symmetric choice reduction at 4 with 197 rule applications. Total rules 1354 place count 728 transition count 727
Iterating global reduction 4 with 197 rules applied. Total rules applied 1551 place count 728 transition count 727
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 80 Pre rules applied. Total rules applied 1551 place count 728 transition count 647
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 4 with 160 rules applied. Total rules applied 1711 place count 648 transition count 647
Performed 258 Post agglomeration using F-continuation condition.Transition count delta: 258
Deduced a syphon composed of 258 places in 1 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 4 with 516 rules applied. Total rules applied 2227 place count 390 transition count 389
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: -71
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 2393 place count 307 transition count 460
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2394 place count 307 transition count 459
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 2399 place count 307 transition count 454
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 2404 place count 302 transition count 454
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 2408 place count 302 transition count 450
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2409 place count 302 transition count 450
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2410 place count 301 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2411 place count 300 transition count 449
Applied a total of 2411 rules in 334 ms. Remains 300 /1503 variables (removed 1203) and now considering 449/1503 (removed 1054) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 300/1503 places, 449/1503 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 7) seen :3
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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
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 31 ms. (steps per millisecond=322 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 449 rows 300 cols
[2023-03-20 21:51:26] [INFO ] Computed 120 place invariants in 9 ms
[2023-03-20 21:51:26] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 21:51:26] [INFO ] [Nat]Absence check using 120 positive place invariants in 17 ms returned sat
[2023-03-20 21:51:26] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 21:51:26] [INFO ] State equation strengthened by 167 read => feed constraints.
[2023-03-20 21:51:26] [INFO ] After 248ms SMT Verify possible using 167 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 21:51:26] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-03-20 21:51:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-20 21:51:27] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2023-03-20 21:51:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-20 21:51:27] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-20 21:51:27] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2023-03-20 21:51:27] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2023-03-20 21:51:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 262 ms
[2023-03-20 21:51:27] [INFO ] After 884ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 243 ms.
[2023-03-20 21:51:27] [INFO ] After 1403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 64 ms.
Support contains 26 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 449/449 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 300 transition count 444
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 295 transition count 444
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 295 transition count 438
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 289 transition count 438
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 36 place count 282 transition count 431
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 48 place count 276 transition count 435
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 276 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 275 transition count 434
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 275 transition count 434
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 274 transition count 433
Applied a total of 52 rules in 71 ms. Remains 274 /300 variables (removed 26) and now considering 433/449 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 274/300 places, 433/449 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) 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
Interrupted probabilistic random walk after 211595 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211595 steps, saw 149936 distinct states, run finished after 3003 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 433 rows 274 cols
[2023-03-20 21:51:31] [INFO ] Computed 120 place invariants in 3 ms
[2023-03-20 21:51:31] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 21:51:31] [INFO ] [Nat]Absence check using 120 positive place invariants in 14 ms returned sat
[2023-03-20 21:51:31] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 21:51:31] [INFO ] State equation strengthened by 163 read => feed constraints.
[2023-03-20 21:51:31] [INFO ] After 224ms SMT Verify possible using 163 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 21:51:32] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2023-03-20 21:51:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-20 21:51:32] [INFO ] After 517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 184 ms.
[2023-03-20 21:51:32] [INFO ] After 926ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 48 ms.
Support contains 26 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 433/433 transitions.
Applied a total of 0 rules in 17 ms. Remains 274 /274 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 274/274 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 433/433 transitions.
Applied a total of 0 rules in 14 ms. Remains 274 /274 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2023-03-20 21:51:32] [INFO ] Invariant cache hit.
[2023-03-20 21:51:32] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-20 21:51:32] [INFO ] Invariant cache hit.
[2023-03-20 21:51:32] [INFO ] State equation strengthened by 163 read => feed constraints.
[2023-03-20 21:51:33] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
[2023-03-20 21:51:33] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-20 21:51:33] [INFO ] Invariant cache hit.
[2023-03-20 21:51:33] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1141 ms. Remains : 274/274 places, 433/433 transitions.
Graph (trivial) has 97 edges and 274 vertex of which 4 / 274 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 948 edges and 272 vertex of which 270 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 94 edges and 268 vertex of which 4 / 268 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 266 transition count 424
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 93 edges and 264 vertex of which 6 / 264 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 261 transition count 415
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 91 edges and 258 vertex of which 8 / 258 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 254 transition count 404
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 87 edges and 250 vertex of which 8 / 250 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 246 transition count 390
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 83 edges and 242 vertex of which 6 / 242 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 239 transition count 376
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 80 edges and 236 vertex of which 6 / 236 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 5 with 16 rules applied. Total rules applied 89 place count 233 transition count 364
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 78 edges and 230 vertex of which 6 / 230 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 6 with 15 rules applied. Total rules applied 104 place count 227 transition count 353
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 74 edges and 225 vertex of which 2 / 225 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 13 rules applied. Total rules applied 117 place count 224 transition count 343
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 73 edges and 223 vertex of which 2 / 223 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 8 with 5 rules applied. Total rules applied 122 place count 222 transition count 340
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 760 edges and 221 vertex of which 218 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 9 with 6 rules applied. Total rules applied 128 place count 218 transition count 333
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 128 place count 218 transition count 331
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 5 rules applied. Total rules applied 133 place count 215 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 136 place count 213 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 139 place count 213 transition count 327
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 11 with 9 rules applied. Total rules applied 148 place count 213 transition count 318
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 11 with 17 rules applied. Total rules applied 165 place count 213 transition count 318
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 11 with 13 rules applied. Total rules applied 178 place count 213 transition count 305
Applied a total of 178 rules in 65 ms. Remains 213 /274 variables (removed 61) and now considering 305/433 (removed 128) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 305 rows 213 cols
[2023-03-20 21:51:33] [INFO ] Computed 90 place invariants in 2 ms
[2023-03-20 21:51:33] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 21:51:33] [INFO ] [Nat]Absence check using 90 positive place invariants in 11 ms returned sat
[2023-03-20 21:51:33] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 21:51:33] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2023-03-20 21:51:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-20 21:51:33] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2023-03-20 21:51:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-20 21:51:34] [INFO ] After 299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-20 21:51:34] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-20 21:51:34] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-20 21:51:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 274 places, 433 transitions and 2367 arcs took 3 ms.
[2023-03-20 21:51:34] [INFO ] Flatten gal took : 71 ms
Total runtime 35218 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: ShieldRVt_PT_030B
(NrP: 274 NrTr: 433 NrArc: 2367)

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

net check time: 0m 0.000sec

init dd package: 0m 3.137sec


before gc: list nodes free: 1487519

after gc: idd nodes used:63740, unused:63936260; list nodes free:291216365

before gc: list nodes free: 1471869

after gc: idd nodes used:61308, unused:63938692; list nodes free:291228584

before gc: list nodes free: 355267

after gc: idd nodes used:62672, unused:63937328; list nodes free:291222849

before gc: list nodes free: 322084

after gc: idd nodes used:62676, unused:63937324; list nodes free:291222885

before gc: list nodes free: 1584048

after gc: idd nodes used:62740, unused:63937260; list nodes free:293319125

before gc: list nodes free: 1226784

after gc: idd nodes used:60310, unused:63939690; list nodes free:293331244

before gc: list nodes free: 2408055

after gc: idd nodes used:60541, unused:63939459; list nodes free:293330950

before gc: list nodes free: 2265130

after gc: idd nodes used:61393, unused:63938607; list nodes free:293326380

before gc: list nodes free: 1962427

after gc: idd nodes used:61225, unused:63938775; list nodes free:293327297

before gc: list nodes free: 1421558

after gc: idd nodes used:61648, unused:63938352; list nodes free:293325378
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6130364 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16100344 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.002sec

60859 62581 60151 61465 62221 60019 61903 60427 62587 61651 60781 60487 63895 62527 60685 61651 62071 60751 62701 62215 60739 62959 62563 61927 61183 62123 61435 60527 60855 61233 60425 63053 61459 62151 60797 60473 61889 65027 60653 62163 60625 61317 61999 61185 60679 62401 60893 61149 60829 60571 61217 62839 60905 62157 61713 60933 60851 60467 60489 60619 61081 60589 60901 60765 60777 61373 61475 60591 61191 60771 60559 61655 60543 60665 61677 60737 61525 60741 60441 61433 61393 61141 62893 60631 60419 61415 60661 60325 61027 61253 61431 60389 60993 60709 60393 60851 60599 60523 61081 66689 60933 64477 61759 60923 61317 61699 60967 62295 61511 60995 61803 60707 62415 65243 61019 62443 61281 60751 61471 64037 62287 63875 61797 61237 61803 63095 64095 61575 61775 61263 62751 60927 62955 62279 61247 61443 62709 61629 61277 61841 61117 61717 62823 61675 61393 61845 61941 63609 61329 62975 62079 62891 65583 63401 61237 61879 62339 61685 61587 63375 61103 61743 61895 63743 61455 62617 61665 62149 61365 63503 63119 61211 61327 61249 60573 62335 61243 61159 61799 61487 61473 61687 61883 62527 61619 61061 60393 60849 62323 61847 61229 62413 61569 61317 62205 61421 61355 62223 62227 62487 62697 60879 61975 61497 62093 62183 62481 61271 61485 61345 62579 61347 67175 60995 62749 61515 60303 60991 60827 60011 62185 60937 63323 61495 60755 59825 60075 60485 61509 60887 60943 61495 60199 60041 61789 60791 64483 61827 59849 60921 61413 61133 62433 61637 60871 60691 60503 62087 60283 60253 60959 61337 60223 61071 61681 62109 62113 62117 60117 60747 61433 60393 62931 62567 60419 60647 60881 60261 62239 62323 61219 60967 63139 61345 60243 60679 63985 62897 65147 61867 61999 60541 60315 62595 62485 61681 63305 60413 60359 60521 59987 61017 60119 60945 60279 61369 61237 60069 61749 61891 61931 62451 62343 60039 60455 63803 62591 63861 61609 63105 60267 60191 62199 62265 63337 62601 60309 60167 60043 61067 61511 60349 60945 62641 60365 60415 60897 62525 61455 61603 59999 60309 60005 60265 60333 60271 60161 59879 60177 59880 59904 60571 59895 59846 60426 59930 60057 60269 59877 60512 60290 59880 60248 59741 60212 60827 61379 60116 59990 59950 60670 60127 60656 60066 59891 61265 60671 59892 59963 60326 61215 60590 59714 60396 60164 60335 60189 60526 60126 60791 60253 60793 60157 61118 60928 59935 59971 60703 61135 59972 59703 60480 60274 60041 60979 60233 60265 59898 59845 60149 60662 59936 60576 59825 61295 60315 60319 60450 61652 59838 62210 60253 59776 60378 60143 59813 61669 60659 60396 60060 59942 59871 62021 60561 60336 59790 59839 60702 60724 60703 60067 59911 60301 59733 61369 60223 60020 60474 60624 59719 59907 59738 61603 61251 61617 61050 61812 60727 60962 61148 60598 61104 61365 60171 60222 60588 60180 60199 60382 61470 61263 61427 60422 60734 60420 60234 60904 60416 60526 60680 60524 60457 60878 60417 60448 60173 60927 60127 60835 60618 60315 60896 60934 60278 60700 60736 60708 60582 63635 60501 60260 60621 60584 60329 60366 61006 61182 61216 61027 60375 60914 60324 60376 60659 60411 60297 60396 61362 60857 60897 60819 60427 60385 61025 60247 61396 60496 60220 60386 60232 60155 60412 60386 60155 60355 60111 60645 60330 60126 60835 60217 60371 60158 60037 60357 60063 60436 60222 60083 60299 60406 60667 60687 60917 60342 60640 60452 60163 60452 60648 60372 60892 60686 60109 60836 60444 60418 60822 60585 59970 60200 63276 60303 62191 60762 60364 60448 60633 60271 60933 60643 60063 60623 60251 60963 62513 60367 61105 60408 60271 60658 60670 61106 61656 60663 60519 61526 60638 60353 61532 60490 60443 61315 61335 60734 60898 60632 60337 61349 60377 60604 61099 60771 61179 61271 61311 60567 60458 60494 60976 60668 61923 60793 60856 60636 60353 60405 60987 60619 61213 61503 60405 60580 60675 60413 61473 61433 60412 60736 60363 61209 60511 60432 61064 60752 60702 60523 60574 61036 60885 60595 60913 60313 60538 60948 60701 61667 60920 60596 61057 60529 61227 61394 60590 60928 60157 61200 60785 60789 61137 60909 59949 60596 60146 59965 60605 60691 59803 59935 59909 60879 61004 61338 60410 59869 60127 59900 60154 60469 61755 60004 62264 60042 60465 59870 62676 60984 61729 60207 60697 59837 60455 59898 60280 60339 60824 60651 60020 60616 60880 60810 60193 60788 60330 60631 60203 61263 60102 59830 60649 60187 60194 60886 60120 60103 59980 60557 59972 60040 60612 60491 59959 62531 60366 59895 60525 60220 59938 61836 60700 60564 60078 59892 60054 59771 60403

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="ShieldRVt-PT-030B"
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 ShieldRVt-PT-030B, 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 r426-tajo-167905978700302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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