fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r395-oct2-167903718400126
Last Updated
May 14, 2023

About the Execution of Smart+red for ShieldIIPs-PT-030B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8751.647 3600000.00 3670278.00 128.60 FFTTFFFFFFFFTFTF normal

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.r395-oct2-167903718400126.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 smartxred
Input is ShieldIIPs-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718400126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 16:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 16:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 503K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679556561058

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-030B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:29:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 07:29:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:29:23] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2023-03-23 07:29:23] [INFO ] Transformed 1803 places.
[2023-03-23 07:29:23] [INFO ] Transformed 1773 transitions.
[2023-03-23 07:29:23] [INFO ] Found NUPN structural information;
[2023-03-23 07:29:23] [INFO ] Parsed PT model containing 1803 places and 1773 transitions and 5346 arcs in 339 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 12) seen :9
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1773 rows 1803 cols
[2023-03-23 07:29:24] [INFO ] Computed 271 place invariants in 22 ms
[2023-03-23 07:29:25] [INFO ] After 732ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 07:29:25] [INFO ] [Nat]Absence check using 271 positive place invariants in 146 ms returned sat
[2023-03-23 07:29:27] [INFO ] After 1801ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 07:29:28] [INFO ] Deduced a trap composed of 38 places in 526 ms of which 43 ms to minimize.
[2023-03-23 07:29:29] [INFO ] Deduced a trap composed of 31 places in 582 ms of which 1 ms to minimize.
[2023-03-23 07:29:29] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 1 ms to minimize.
[2023-03-23 07:29:30] [INFO ] Deduced a trap composed of 34 places in 508 ms of which 2 ms to minimize.
[2023-03-23 07:29:30] [INFO ] Deduced a trap composed of 31 places in 405 ms of which 37 ms to minimize.
[2023-03-23 07:29:31] [INFO ] Deduced a trap composed of 29 places in 416 ms of which 1 ms to minimize.
[2023-03-23 07:29:32] [INFO ] Deduced a trap composed of 29 places in 572 ms of which 3 ms to minimize.
[2023-03-23 07:29:32] [INFO ] Deduced a trap composed of 34 places in 485 ms of which 1 ms to minimize.
[2023-03-23 07:29:33] [INFO ] Deduced a trap composed of 28 places in 326 ms of which 1 ms to minimize.
[2023-03-23 07:29:33] [INFO ] Deduced a trap composed of 39 places in 377 ms of which 1 ms to minimize.
[2023-03-23 07:29:34] [INFO ] Deduced a trap composed of 39 places in 510 ms of which 1 ms to minimize.
[2023-03-23 07:29:34] [INFO ] Deduced a trap composed of 26 places in 339 ms of which 1 ms to minimize.
[2023-03-23 07:29:34] [INFO ] Deduced a trap composed of 48 places in 299 ms of which 1 ms to minimize.
[2023-03-23 07:29:35] [INFO ] Deduced a trap composed of 37 places in 511 ms of which 2 ms to minimize.
[2023-03-23 07:29:36] [INFO ] Deduced a trap composed of 35 places in 564 ms of which 1 ms to minimize.
[2023-03-23 07:29:36] [INFO ] Deduced a trap composed of 38 places in 317 ms of which 1 ms to minimize.
[2023-03-23 07:29:37] [INFO ] Deduced a trap composed of 33 places in 309 ms of which 1 ms to minimize.
[2023-03-23 07:29:37] [INFO ] Deduced a trap composed of 33 places in 307 ms of which 1 ms to minimize.
[2023-03-23 07:29:38] [INFO ] Deduced a trap composed of 26 places in 643 ms of which 1 ms to minimize.
[2023-03-23 07:29:39] [INFO ] Deduced a trap composed of 19 places in 502 ms of which 2 ms to minimize.
[2023-03-23 07:29:39] [INFO ] Deduced a trap composed of 18 places in 430 ms of which 1 ms to minimize.
[2023-03-23 07:29:40] [INFO ] Deduced a trap composed of 20 places in 531 ms of which 2 ms to minimize.
[2023-03-23 07:29:40] [INFO ] Deduced a trap composed of 22 places in 544 ms of which 2 ms to minimize.
[2023-03-23 07:29:41] [INFO ] Deduced a trap composed of 23 places in 427 ms of which 2 ms to minimize.
[2023-03-23 07:29:41] [INFO ] Deduced a trap composed of 21 places in 423 ms of which 1 ms to minimize.
[2023-03-23 07:29:42] [INFO ] Deduced a trap composed of 27 places in 449 ms of which 1 ms to minimize.
[2023-03-23 07:29:43] [INFO ] Deduced a trap composed of 21 places in 457 ms of which 1 ms to minimize.
[2023-03-23 07:29:43] [INFO ] Deduced a trap composed of 37 places in 511 ms of which 1 ms to minimize.
[2023-03-23 07:29:44] [INFO ] Deduced a trap composed of 36 places in 443 ms of which 2 ms to minimize.
[2023-03-23 07:29:44] [INFO ] Deduced a trap composed of 35 places in 669 ms of which 1 ms to minimize.
[2023-03-23 07:29:45] [INFO ] Deduced a trap composed of 26 places in 378 ms of which 2 ms to minimize.
[2023-03-23 07:29:46] [INFO ] Deduced a trap composed of 26 places in 581 ms of which 4 ms to minimize.
[2023-03-23 07:29:46] [INFO ] Deduced a trap composed of 27 places in 417 ms of which 1 ms to minimize.
[2023-03-23 07:29:47] [INFO ] Deduced a trap composed of 29 places in 508 ms of which 5 ms to minimize.
[2023-03-23 07:29:47] [INFO ] Deduced a trap composed of 35 places in 409 ms of which 1 ms to minimize.
[2023-03-23 07:29:48] [INFO ] Deduced a trap composed of 30 places in 414 ms of which 1 ms to minimize.
[2023-03-23 07:29:48] [INFO ] Deduced a trap composed of 24 places in 406 ms of which 1 ms to minimize.
[2023-03-23 07:29:49] [INFO ] Deduced a trap composed of 36 places in 349 ms of which 1 ms to minimize.
[2023-03-23 07:29:49] [INFO ] Deduced a trap composed of 32 places in 380 ms of which 1 ms to minimize.
[2023-03-23 07:29:50] [INFO ] Deduced a trap composed of 32 places in 382 ms of which 0 ms to minimize.
[2023-03-23 07:29:50] [INFO ] Deduced a trap composed of 28 places in 433 ms of which 1 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 07:29:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:29:50] [INFO ] After 25286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 130 ms.
Support contains 35 out of 1803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Drop transitions removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 145 place count 1803 transition count 1628
Reduce places removed 145 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 148 rules applied. Total rules applied 293 place count 1658 transition count 1625
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 296 place count 1655 transition count 1625
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 296 place count 1655 transition count 1475
Deduced a syphon composed of 150 places in 9 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 596 place count 1505 transition count 1475
Discarding 206 places :
Symmetric choice reduction at 3 with 206 rule applications. Total rules 802 place count 1299 transition count 1269
Iterating global reduction 3 with 206 rules applied. Total rules applied 1008 place count 1299 transition count 1269
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 1008 place count 1299 transition count 1181
Deduced a syphon composed of 88 places in 6 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1184 place count 1211 transition count 1181
Performed 426 Post agglomeration using F-continuation condition.Transition count delta: 426
Deduced a syphon composed of 426 places in 4 ms
Reduce places removed 426 places and 0 transitions.
Iterating global reduction 3 with 852 rules applied. Total rules applied 2036 place count 785 transition count 755
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 199 times.
Drop transitions removed 199 transitions
Iterating global reduction 3 with 199 rules applied. Total rules applied 2235 place count 785 transition count 755
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2236 place count 784 transition count 754
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2237 place count 783 transition count 754
Applied a total of 2237 rules in 564 ms. Remains 783 /1803 variables (removed 1020) and now considering 754/1773 (removed 1019) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 565 ms. Remains : 783/1803 places, 754/1773 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :2
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 783 cols
[2023-03-23 07:29:51] [INFO ] Computed 270 place invariants in 18 ms
[2023-03-23 07:29:51] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 07:29:51] [INFO ] [Nat]Absence check using 268 positive place invariants in 62 ms returned sat
[2023-03-23 07:29:51] [INFO ] [Nat]Absence check using 268 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-23 07:29:52] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 07:29:52] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 1 ms to minimize.
[2023-03-23 07:29:52] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2023-03-23 07:29:52] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2023-03-23 07:29:52] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2023-03-23 07:29:53] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2023-03-23 07:29:53] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2023-03-23 07:29:53] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2023-03-23 07:29:53] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2023-03-23 07:29:53] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2023-03-23 07:29:53] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 0 ms to minimize.
[2023-03-23 07:29:53] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2023-03-23 07:29:54] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 0 ms to minimize.
[2023-03-23 07:29:54] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 1 ms to minimize.
[2023-03-23 07:29:54] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2023-03-23 07:29:54] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 32 ms to minimize.
[2023-03-23 07:29:54] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2023-03-23 07:29:54] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2409 ms
[2023-03-23 07:29:54] [INFO ] After 2869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-23 07:29:54] [INFO ] After 3112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 28 ms.
Support contains 9 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 754/754 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 783 transition count 753
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 782 transition count 753
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 782 transition count 752
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 781 transition count 752
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 38 place count 764 transition count 735
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 764 transition count 735
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 758 transition count 729
Applied a total of 50 rules in 115 ms. Remains 758 /783 variables (removed 25) and now considering 729/754 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 758/783 places, 729/754 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5390 steps, run visited all 1 properties in 85 ms. (steps per millisecond=63 )
Probabilistic random walk after 5390 steps, saw 5126 distinct states, run finished after 85 ms. (steps per millisecond=63 ) properties seen :1
FORMULA ShieldIIPs-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 31593 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (PT), instance 030B
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 1803 places, 1773 transitions, 5346 arcs.
Final Score: 82756.907
Took : 52 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPs-PT-030B-ReachabilityCardinality-00 (reachable & potential(( (! ( (tk(P1601)) <= ( 1 ) )) & (! ( ( 1 ) <= (tk(P650)) )) )))
PROPERTY: ShieldIIPs-PT-030B-ReachabilityCardinality-01 (reachable & potential((! ( (tk(P1056)) <= ( 1 ) ))))
PROPERTY: ShieldIIPs-PT-030B-ReachabilityCardinality-02 (reachable &!potential( ( (tk(P1667)) <= ( 1 ) )))
PROPERTY: ShieldIIPs-PT-030B-ReachabilityCardinality-03 (reachable & potential(( ( ( ( (tk(P249)) <= ( 0 ) ) & ( (tk(P1365)) <= (tk(P150)) ) ) & (! ( (tk(P1573)) <= ( 1 ) )) ) | ( ( (! ( ( ( (! ( ( (tk(P725)) <= ( 1 ) ) & ( (tk(P762)) <= (tk(P691)) ) )) & ( (tk(P1132)) <= ( 0 ) ) ) | ( ( ( ( (tk(P993)) <= ( 1 ) ) & ( (tk(P490)) <= ( 0 ) ) ) | ( ( ( 1 ) <= (tk(P1056)) ) | ( (tk(P638)) <= ( 0 ) ) ) ) | ( (tk(P1054)) <= (tk(P940)) ) ) ) | (! ( ( 1 ) <= (tk(P414)) )) )) | (! ( (! ( ( ( ( ( 1 ) <= (tk(P102)) ) & ( (tk(P1569)) <= (tk(P50)) ) ) & ( ( 1 ) <= (tk(P843)) ) ) & (! ( ( 1 ) <= (tk(P615)) )) )) | ( (tk(P217)) <= ( 0 ) ) )) ) & (! ( ( ( ( (tk(P839)) <= ( 0 ) ) | ( (! ( (tk(P167)) <= (tk(P1669)) )) & ( (tk(P745)) <= (tk(P1572)) ) ) ) & ( ( ( (tk(P348)) <= (tk(P526)) ) | (! ( ( (tk(P1225)) <= ( 1 ) ) | ( (tk(P1355)) <= ( 1 ) ) )) ) & ( ( 1 ) <= (tk(P661)) ) ) ) & ( (tk(P829)) <= ( 0 ) ) )) ) )))
PROPERTY: ShieldIIPs-PT-030B-ReachabilityCardinality-04 (reachable &!potential( ( ( ( ( 1 ) <= (tk(P603)) ) & (! ( ( ( ( ( ( ( 1 ) <= (tk(P228)) ) | ( ( ( 1 ) <= (tk(P1236)) ) & ( (tk(P1429)) <= ( 0 ) ) ) ) & ( (! ( ( 1 ) <= (tk(P703)) )) | ( ( ( 1 ) <= (tk(P934)) ) | ( (tk(P834)) <= ( 1 ) ) ) ) ) | (! ( ( (tk(P1676)) <= ( 0 ) ) & ( (tk(P126)) <= (tk(P1284)) ) )) ) | ( ( (tk(P744)) <= (tk(P1156)) ) & ( (tk(P1132)) <= ( 1 ) ) ) ) & (! ( ( (! ( ( ( 1 ) <= (tk(P1556)) ) | ( ( 1 ) <= (tk(P806)) ) )) & (! ( ( (tk(P137)) <= ( 0 ) ) & ( (tk(P40)) <= ( 0 ) ) )) ) | ( ( ( ( (tk(P146)) <= (tk(P834)) ) & ( (tk(P552)) <= (tk(P1537)) ) ) | (! ( (tk(P1420)) <= ( 0 ) )) ) & ( (! ( ( 1 ) <= (tk(P86)) )) | ( ( ( 1 ) <= (tk(P3)) ) & ( (tk(P777)) <= (tk(P1666)) ) ) ) ) )) )) ) | ( ( (tk(P1769)) <= ( 1 ) ) & ( (! ( ( (tk(P1709)) <= (tk(P350)) ) | (! ( ( ( (tk(P1155)) <= ( 1 ) ) & ( (tk(P1523)) <= ( 1 ) ) ) & ( ( (tk(P1044)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P223)) ) ) )) )) | ( (tk(P1083)) <= (tk(P1468)) ) ) ) )))
PROPERTY: ShieldIIPs-PT-030B-ReachabilityCardinality-05 (reachable &!potential( ( (tk(P1078)) <= (tk(P240)) )))
PROPERTY: ShieldIIPs-PT-030B-ReachabilityCardinality-06 (reachable &!potential( (! ( ( 1 ) <= (tk(P1419)) ))))
PROPERTY: ShieldIIPs-PT-030B-ReachabilityCardinality-07 (reachable & potential((! ( (tk(P558)) <= ( 1 ) ))))
PROPERTY: ShieldIIPs-PT-030B-ReachabilityCardinality-08 (reachable &!potential( ( ( (! ( ( (tk(P1454)) <= ( 0 ) ) | ( (tk(P923)) <= ( 1 ) ) )) & ( (! ( ( ( (! ( ( ( 1 ) <= (tk(P909)) ) | ( (tk(P577)) <= (tk(P1189)) ) )) | ( ( (tk(P590)) <= (tk(P1130)) ) & (! ( ( 1 ) <= (tk(P809)) )) ) ) & ( (tk(P1744)) <= ( 0 ) ) ) & ( ( (! ( ( 1 ) <= (tk(P1204)) )) | (! ( (tk(P1244)) <= (tk(P548)) )) ) & ( (tk(P1494)) <= ( 0 ) ) ) )) & (! ( ( 1 ) <= (tk(P431)) )) ) ) | ( (! ( ( (tk(P618)) <= ( 0 ) ) | ( (tk(P53)) <= ( 0 ) ) )) | (! ( ( (tk(P493)) <= (tk(P1102)) ) & ( ( (tk(P1414)) <= (tk(P575)) ) & (! ( ( (tk(P1162)) <= ( 0 ) ) | ( (tk(P1385)) <= (tk(P980)) ) )) ) )) ) )))
PROPERTY: ShieldIIPs-PT-030B-ReachabilityCardinality-09 (reachable &!potential( ( ( ( (! ( (tk(P1478)) <= (tk(P961)) )) | ( ( ( ( (! ( (tk(P1010)) <= (tk(P919)) )) | (! ( (tk(P1167)) <= ( 0 ) )) ) & (! ( ( 1 ) <= (tk(P893)) )) ) & ( (! ( ( (tk(P1228)) <= ( 0 ) ) | ( ( (tk(P647)) <= (tk(P1102)) ) | ( (tk(P1549)) <= ( 1 ) ) ) )) | ( (tk(P1176)) <= ( 0 ) ) ) ) & ( (tk(P636)) <= ( 1 ) ) ) ) | ( (tk(P863)) <= (tk(P1305)) ) ) & ( ( ( ( (! ( ( ( (tk(P1691)) <= (tk(P15)) ) | ( (tk(P432)) <= ( 1 ) ) ) & ( ( ( ( 1 ) <= (tk(P355)) ) | ( (tk(P1780)) <= (tk(P798)) ) ) & ( (tk(P1169)) <= (tk(P1012)) ) ) )) | ( ( ( (tk(P513)) <= (tk(P38)) ) & ( ( (tk(P1797)) <= (tk(P552)) ) & (! ( (tk(P1421)) <= (tk(P980)) )) ) ) | (! ( ( ( (tk(P698)) <= ( 1 ) ) & ( (tk(P1011)) <= (tk(P1694)) ) ) & ( (tk(P265)) <= ( 1 ) ) )) ) ) & (! ( (! ( ( (tk(P122)) <= (tk(P1059)) ) | ( (tk(P1377)) <= ( 1 ) ) )) | ( ( (tk(P1394)) <= (tk(P585)) ) & ( (tk(P983)) <= (tk(P395)) ) ) )) ) | ( ( (tk(P942)) <= ( 1 ) ) & ( (tk(P1742)) <= (tk(P1429)) ) ) ) | ( (! ( (! ( (tk(P817)) <= ( 1 ) )) & ( ( (! ( ( 1 ) <= (tk(P704)) )) & ( ( (tk(P1416)) <= (tk(P86)) ) | ( ( 1 ) <= (tk(P1093)) ) ) ) & (! ( (tk(P538)) <= (tk(P1363)) )) ) )) | ( (! ( ( (! ( (tk(P1796)) <= (tk(P1139)) )) | ( ( ( (tk(P489)) <= (tk(P89)) ) | ( ( 1 ) <= (tk(P856)) ) ) | ( ( ( 1 ) <= (tk(P370)) ) & ( ( 1 ) <= (tk(P1418)) ) ) ) ) | ( ( 1 ) <= (tk(P1068)) ) )) & (! ( (tk(P637)) <= ( 0 ) )) ) ) ) )))
PROPERTY: ShieldIIPs-PT-030B-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P1041)) <= (tk(P1454)) )))
PROPERTY: ShieldIIPs-PT-030B-ReachabilityCardinality-11 (reachable &!potential( (! ( ( 1 ) <= (tk(P1040)) ))))
PROPERTY: ShieldIIPs-PT-030B-ReachabilityCardinality-12 (reachable & potential(( ( (tk(P1333)) <= (tk(P611)) ) & ( ( ( (tk(P1528)) <= ( 1 ) ) | ( (tk(P88)) <= (tk(P1434)) ) ) & ( (! ( ( ( ( ( (tk(P512)) <= ( 0 ) ) | ( (tk(P652)) <= (tk(P130)) ) ) | ( ( (tk(P703)) <= (tk(P345)) ) & ( (tk(P452)) <= (tk(P143)) ) ) ) & (! ( ( ( 1 ) <= (tk(P1509)) ) | ( (tk(P423)) <= ( 0 ) ) )) ) | ( (tk(P730)) <= (tk(P1162)) ) )) & (! ( (! ( ( ( ( 1 ) <= (tk(P555)) ) | ( (tk(P334)) <= (tk(P1314)) ) ) & ( ( ( 1 ) <= (tk(P248)) ) | ( ( 1 ) <= (tk(P501)) ) ) )) & ( (tk(P563)) <= (tk(P1767)) ) )) ) ) )))
PROPERTY: ShieldIIPs-PT-030B-ReachabilityCardinality-13 (reachable &!potential( (! ( ( (! ( ( 1 ) <= (tk(P331)) )) | ( ( (! ( (tk(P555)) <= ( 1 ) )) | ( (tk(P1023)) <= (tk(P1022)) ) ) | ( ( ( 1 ) <= (tk(P1178)) ) & (! ( (! ( (tk(P639)) <= (tk(P464)) )) & ( (tk(P345)) <= (tk(P310)) ) )) ) ) ) & (! ( ( ( ( (tk(P1662)) <= ( 1 ) ) & ( ( ( 1 ) <= (tk(P321)) ) & ( ( ( ( 1 ) <= (tk(P496)) ) & ( (tk(P864)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P277)) ) | ( ( 1 ) <= (tk(P1641)) ) ) ) ) ) | ( ( (! ( (tk(P1115)) <= (tk(P1289)) )) & (! ( (tk(P664)) <= ( 0 ) )) ) | ( (tk(P872)) <= ( 0 ) ) ) ) | ( ( (tk(P225)) <= (tk(P209)) ) & ( (tk(P1026)) <= ( 1 ) ) ) )) ))))
PROPERTY: ShieldIIPs-PT-030B-ReachabilityCardinality-14 (reachable & potential(( (! ( ( ( (! ( ( (tk(P1081)) <= ( 1 ) ) & ( ( ( 1 ) <= (tk(P235)) ) | ( (tk(P521)) <= (tk(P1132)) ) ) )) & ( ( ( ( (tk(P1728)) <= (tk(P856)) ) & ( ( (tk(P28)) <= (tk(P973)) ) & ( (tk(P107)) <= (tk(P1007)) ) ) ) | ( ( ( (tk(P652)) <= (tk(P363)) ) & ( (tk(P1778)) <= ( 1 ) ) ) | ( (tk(P1245)) <= ( 1 ) ) ) ) & (! ( (tk(P756)) <= (tk(P494)) )) ) ) | (! ( ( (tk(P1609)) <= ( 0 ) ) & ( (! ( ( (tk(P1757)) <= (tk(P506)) ) | ( (tk(P1742)) <= (tk(P501)) ) )) & ( (tk(P1013)) <= ( 1 ) ) ) )) ) & (! ( ( (tk(P782)) <= ( 0 ) ) & ( (! ( (tk(P1008)) <= (tk(P187)) )) & ( ( ( 1 ) <= (tk(P398)) ) & ( (tk(P424)) <= (tk(P1547)) ) ) ) )) )) & ( ( ( ( ( ( (tk(P111)) <= ( 0 ) ) | ( (! ( ( 1 ) <= (tk(P1719)) )) | (! ( ( (tk(P1799)) <= ( 0 ) ) | ( (tk(P1306)) <= ( 1 ) ) )) ) ) & ( ( (! ( (tk(P1201)) <= (tk(P1224)) )) & ( ( ( (tk(P1224)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P1029)) ) ) & ( ( ( 1 ) <= (tk(P677)) ) | ( ( 1 ) <= (tk(P1274)) ) ) ) ) | ( ( (! ( ( 1 ) <= (tk(P44)) )) | ( ( ( 1 ) <= (tk(P1231)) ) | ( (tk(P1802)) <= (tk(P1210)) ) ) ) & ( (tk(P1582)) <= (tk(P1398)) ) ) ) ) & ( ( (tk(P328)) <= ( 1 ) ) | ( ( ( ( ( (tk(P1547)) <= (tk(P1048)) ) & ( (tk(P401)) <= (tk(P670)) ) ) | ( (tk(P1259)) <= (tk(P1074)) ) ) & (! ( (tk(P5)) <= ( 0 ) )) ) | ( ( (tk(P183)) <= (tk(P319)) ) & ( (! ( (tk(P231)) <= (tk(P260)) )) & ( ( 1 ) <= (tk(P43)) ) ) ) ) ) ) | ( ( ( ( (! ( ( 1 ) <= (tk(P136)) )) | ( (! ( (tk(P1033)) <= ( 1 ) )) & ( ( (tk(P416)) <= (tk(P819)) ) & ( (tk(P1606)) <= ( 0 ) ) ) ) ) | ( ( ( ( ( 1 ) <= (tk(P1140)) ) | ( (tk(P1215)) <= (tk(P1062)) ) ) & ( ( ( 1 ) <= (tk(P479)) ) & ( (tk(P1417)) <= ( 0 ) ) ) ) & ( ( ( (tk(P1545)) <= (tk(P405)) ) & ( ( 1 ) <= (tk(P1744)) ) ) & ( ( (tk(P678)) <= ( 0 ) ) | ( (tk(P1289)) <= (tk(P1129)) ) ) ) ) ) & ( ( ( ( ( (tk(P1484)) <= ( 0 ) ) & ( (tk(P1425)) <= (tk(P82)) ) ) & ( ( ( 1 ) <= (tk(P716)) ) | ( (tk(P1421)) <= (tk(P1205)) ) ) ) | ( (tk(P307)) <= ( 1 ) ) ) | ( ( 1 ) <= (tk(P1645)) ) ) ) & (! ( ( 1 ) <= (tk(P1077)) )) ) ) | ( ( ( ( ( 1 ) <= (tk(P978)) ) & ( (! ( ( 1 ) <= (tk(P414)) )) & (! ( (tk(P443)) <= ( 1 ) )) ) ) & ( (tk(P873)) <= (tk(P1012)) ) ) | (! ( (! ( ( ( (tk(P615)) <= (tk(P222)) ) & ( (tk(P804)) <= ( 1 ) ) ) | ( ( (tk(P615)) <= (tk(P1298)) ) & ( (tk(P346)) <= ( 1 ) ) ) )) | ( (! ( (tk(P1585)) <= ( 1 ) )) & (! ( (tk(P1501)) <= ( 0 ) )) ) )) ) ) )))
PROPERTY: ShieldIIPs-PT-030B-ReachabilityCardinality-15 (reachable &!potential( ( (! ( (! ( ( ( 1 ) <= (tk(P910)) ) | ( ( ( ( (tk(P74)) <= (tk(P1637)) ) & ( ( (tk(P1552)) <= ( 1 ) ) & ( (tk(P1224)) <= ( 0 ) ) ) ) & ( ( ( (tk(P1309)) <= ( 0 ) ) | ( (tk(P1204)) <= (tk(P1736)) ) ) | (! ( (tk(P1716)) <= (tk(P1740)) )) ) ) & ( ( (! ( (tk(P1141)) <= ( 0 ) )) | (! ( (tk(P796)) <= (tk(P1229)) )) ) & ( (! ( ( 1 ) <= (tk(P404)) )) & ( ( ( 1 ) <= (tk(P294)) ) & ( (tk(P1331)) <= (tk(P159)) ) ) ) ) ) )) & ( ( 1 ) <= (tk(P579)) ) )) & ( ( ( ( ( ( ( 1 ) <= (tk(P1781)) ) | (! ( ( (tk(P990)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P392)) ) )) ) | ( ( ( ( ( (tk(P194)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P463)) ) ) & ( ( 1 ) <= (tk(P1700)) ) ) | ( ( ( 1 ) <= (tk(P1217)) ) | ( (tk(P44)) <= (tk(P1459)) ) ) ) | (! ( ( 1 ) <= (tk(P604)) )) ) ) | (! ( (tk(P488)) <= ( 0 ) )) ) | ( (! ( (tk(P1202)) <= ( 0 ) )) & ( (! ( (tk(P1313)) <= (tk(P1544)) )) & ( ( ( 1 ) <= (tk(P861)) ) & ( ( ( ( ( 1 ) <= (tk(P546)) ) & ( (tk(P456)) <= (tk(P1423)) ) ) | ( ( ( 1 ) <= (tk(P446)) ) | ( (tk(P1369)) <= ( 0 ) ) ) ) & ( (! ( ( 1 ) <= (tk(P1074)) )) | ( ( (tk(P1377)) <= (tk(P1520)) ) & ( (tk(P144)) <= (tk(P175)) ) ) ) ) ) ) ) ) | ( (! ( ( ( (tk(P14)) <= (tk(P1803)) ) & ( (! ( ( ( 1 ) <= (tk(P466)) ) | ( (tk(P339)) <= ( 1 ) ) )) | ( ( ( ( 1 ) <= (tk(P726)) ) | ( (tk(P236)) <= (tk(P1492)) ) ) | ( ( 1 ) <= (tk(P458)) ) ) ) ) | ( (tk(P938)) <= ( 0 ) ) )) | ( ( ( ( (tk(P1757)) <= (tk(P1448)) ) & ( ( ( ( ( 1 ) <= (tk(P1341)) ) | ( (tk(P582)) <= ( 1 ) ) ) & (! ( ( 1 ) <= (tk(P444)) )) ) & ( ( ( ( 1 ) <= (tk(P666)) ) | ( (tk(P1194)) <= (tk(P349)) ) ) | (! ( (tk(P397)) <= (tk(P1133)) )) ) ) ) | (! ( ( 1 ) <= (tk(P1664)) )) ) & ( ( (tk(P630)) <= (tk(P51)) ) & ( (! ( (tk(P1281)) <= (tk(P45)) )) | ( ( (tk(P471)) <= ( 0 ) ) | ( ( (tk(P301)) <= (tk(P938)) ) & ( ( ( 1 ) <= (tk(P220)) ) & ( (tk(P4)) <= ( 1 ) ) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 7400852 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16108268 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-030B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ShieldIIPs-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 r395-oct2-167903718400126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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