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.r425-tajo-167905978000302.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 ltsminxred
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 r425-tajo-167905978000302
=====================================================================

--------------------
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 1679309770496

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 10:56:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 10:56:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:56:12] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2023-03-20 10:56:12] [INFO ] Transformed 1503 places.
[2023-03-20 10:56:12] [INFO ] Transformed 1503 transitions.
[2023-03-20 10:56:12] [INFO ] Found NUPN structural information;
[2023-03-20 10:56:12] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 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 709 ms. (steps per millisecond=14 ) properties (out of 15) seen :9
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
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 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1503 rows 1503 cols
[2023-03-20 10:56:14] [INFO ] Computed 121 place invariants in 22 ms
[2023-03-20 10:56:14] [INFO ] After 580ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 10:56:15] [INFO ] [Nat]Absence check using 121 positive place invariants in 65 ms returned sat
[2023-03-20 10:56:16] [INFO ] After 1576ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 10:56:17] [INFO ] Deduced a trap composed of 43 places in 404 ms of which 20 ms to minimize.
[2023-03-20 10:56:17] [INFO ] Deduced a trap composed of 38 places in 313 ms of which 1 ms to minimize.
[2023-03-20 10:56:17] [INFO ] Deduced a trap composed of 40 places in 301 ms of which 5 ms to minimize.
[2023-03-20 10:56:18] [INFO ] Deduced a trap composed of 31 places in 273 ms of which 2 ms to minimize.
[2023-03-20 10:56:18] [INFO ] Deduced a trap composed of 38 places in 247 ms of which 4 ms to minimize.
[2023-03-20 10:56:19] [INFO ] Deduced a trap composed of 26 places in 365 ms of which 1 ms to minimize.
[2023-03-20 10:56:19] [INFO ] Deduced a trap composed of 41 places in 246 ms of which 3 ms to minimize.
[2023-03-20 10:56:19] [INFO ] Deduced a trap composed of 51 places in 233 ms of which 1 ms to minimize.
[2023-03-20 10:56:19] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 1 ms to minimize.
[2023-03-20 10:56:20] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 1 ms to minimize.
[2023-03-20 10:56:20] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 1 ms to minimize.
[2023-03-20 10:56:20] [INFO ] Deduced a trap composed of 40 places in 228 ms of which 1 ms to minimize.
[2023-03-20 10:56:21] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 1 ms to minimize.
[2023-03-20 10:56:21] [INFO ] Deduced a trap composed of 61 places in 217 ms of which 1 ms to minimize.
[2023-03-20 10:56:21] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 0 ms to minimize.
[2023-03-20 10:56:21] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 0 ms to minimize.
[2023-03-20 10:56:22] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 1 ms to minimize.
[2023-03-20 10:56:22] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 1 ms to minimize.
[2023-03-20 10:56:22] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 1 ms to minimize.
[2023-03-20 10:56:22] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 0 ms to minimize.
[2023-03-20 10:56:23] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 1 ms to minimize.
[2023-03-20 10:56:23] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 1 ms to minimize.
[2023-03-20 10:56:23] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 0 ms to minimize.
[2023-03-20 10:56:23] [INFO ] Deduced a trap composed of 74 places in 149 ms of which 0 ms to minimize.
[2023-03-20 10:56:24] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 1 ms to minimize.
[2023-03-20 10:56:24] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 1 ms to minimize.
[2023-03-20 10:56:24] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 1 ms to minimize.
[2023-03-20 10:56:24] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 1 ms to minimize.
[2023-03-20 10:56:24] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 7872 ms
[2023-03-20 10:56:25] [INFO ] Deduced a trap composed of 50 places in 347 ms of which 1 ms to minimize.
[2023-03-20 10:56:25] [INFO ] Deduced a trap composed of 43 places in 290 ms of which 0 ms to minimize.
[2023-03-20 10:56:26] [INFO ] Deduced a trap composed of 23 places in 376 ms of which 1 ms to minimize.
[2023-03-20 10:56:26] [INFO ] Deduced a trap composed of 42 places in 349 ms of which 1 ms to minimize.
[2023-03-20 10:56:26] [INFO ] Deduced a trap composed of 53 places in 284 ms of which 1 ms to minimize.
[2023-03-20 10:56:27] [INFO ] Deduced a trap composed of 46 places in 241 ms of which 5 ms to minimize.
[2023-03-20 10:56:27] [INFO ] Deduced a trap composed of 25 places in 286 ms of which 1 ms to minimize.
[2023-03-20 10:56:27] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 0 ms to minimize.
[2023-03-20 10:56:28] [INFO ] Deduced a trap composed of 42 places in 301 ms of which 1 ms to minimize.
[2023-03-20 10:56:28] [INFO ] Deduced a trap composed of 52 places in 265 ms of which 1 ms to minimize.
[2023-03-20 10:56:28] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 0 ms to minimize.
[2023-03-20 10:56:28] [INFO ] Deduced a trap composed of 53 places in 236 ms of which 2 ms to minimize.
[2023-03-20 10:56:29] [INFO ] Deduced a trap composed of 54 places in 218 ms of which 1 ms to minimize.
[2023-03-20 10:56:29] [INFO ] Deduced a trap composed of 61 places in 239 ms of which 1 ms to minimize.
[2023-03-20 10:56:29] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 1 ms to minimize.
[2023-03-20 10:56:30] [INFO ] Deduced a trap composed of 61 places in 196 ms of which 1 ms to minimize.
[2023-03-20 10:56:30] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 1 ms to minimize.
[2023-03-20 10:56:30] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 1 ms to minimize.
[2023-03-20 10:56:30] [INFO ] Deduced a trap composed of 58 places in 268 ms of which 1 ms to minimize.
[2023-03-20 10:56:31] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 1 ms to minimize.
[2023-03-20 10:56:31] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6235 ms
[2023-03-20 10:56:31] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 1 ms to minimize.
[2023-03-20 10:56:32] [INFO ] Deduced a trap composed of 29 places in 233 ms of which 3 ms to minimize.
[2023-03-20 10:56:32] [INFO ] Deduced a trap composed of 51 places in 222 ms of which 2 ms to minimize.
[2023-03-20 10:56:32] [INFO ] Deduced a trap composed of 43 places in 248 ms of which 2 ms to minimize.
[2023-03-20 10:56:32] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 1 ms to minimize.
[2023-03-20 10:56:33] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 1 ms to minimize.
[2023-03-20 10:56:33] [INFO ] Deduced a trap composed of 59 places in 170 ms of which 1 ms to minimize.
[2023-03-20 10:56:33] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 2 ms to minimize.
[2023-03-20 10:56:33] [INFO ] Deduced a trap composed of 60 places in 163 ms of which 1 ms to minimize.
[2023-03-20 10:56:34] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 1 ms to minimize.
[2023-03-20 10:56:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2609 ms
[2023-03-20 10:56:35] [INFO ] Deduced a trap composed of 26 places in 320 ms of which 1 ms to minimize.
[2023-03-20 10:56:35] [INFO ] Deduced a trap composed of 35 places in 327 ms of which 1 ms to minimize.
[2023-03-20 10:56:36] [INFO ] Deduced a trap composed of 28 places in 300 ms of which 1 ms to minimize.
[2023-03-20 10:56:36] [INFO ] Deduced a trap composed of 22 places in 321 ms of which 1 ms to minimize.
[2023-03-20 10:56:36] [INFO ] Deduced a trap composed of 38 places in 288 ms of which 0 ms to minimize.
[2023-03-20 10:56:37] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 1 ms to minimize.
[2023-03-20 10:56:37] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 2 ms to minimize.
[2023-03-20 10:56:38] [INFO ] Deduced a trap composed of 39 places in 273 ms of which 1 ms to minimize.
[2023-03-20 10:56:38] [INFO ] Deduced a trap composed of 51 places in 256 ms of which 2 ms to minimize.
[2023-03-20 10:56:38] [INFO ] Deduced a trap composed of 35 places in 257 ms of which 9 ms to minimize.
[2023-03-20 10:56:38] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 4 ms to minimize.
[2023-03-20 10:56:39] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 1 ms to minimize.
[2023-03-20 10:56:39] [INFO ] Deduced a trap composed of 38 places in 398 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-20 10:56:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 10:56:39] [INFO ] After 25338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 225 ms.
Support contains 41 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions removed 451 transitions
Trivial Post-agglo rules discarded 451 transitions
Performed 451 trivial Post agglomeration. Transition count delta: 451
Iterating post reduction 0 with 451 rules applied. Total rules applied 451 place count 1503 transition count 1052
Reduce places removed 451 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 453 rules applied. Total rules applied 904 place count 1052 transition count 1050
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 911 place count 1051 transition count 1044
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 917 place count 1045 transition count 1044
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 122 Pre rules applied. Total rules applied 917 place count 1045 transition count 922
Deduced a syphon composed of 122 places in 1 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 1161 place count 923 transition count 922
Discarding 198 places :
Symmetric choice reduction at 4 with 198 rule applications. Total rules 1359 place count 725 transition count 724
Iterating global reduction 4 with 198 rules applied. Total rules applied 1557 place count 725 transition count 724
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 80 Pre rules applied. Total rules applied 1557 place count 725 transition count 644
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 4 with 160 rules applied. Total rules applied 1717 place count 645 transition count 644
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 2233 place count 387 transition count 386
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 2401 place count 303 transition count 458
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2402 place count 303 transition count 457
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 2407 place count 303 transition count 452
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 2412 place count 298 transition count 452
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 2416 place count 298 transition count 448
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2417 place count 298 transition count 448
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2418 place count 297 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2419 place count 296 transition count 447
Applied a total of 2419 rules in 483 ms. Remains 296 /1503 variables (removed 1207) and now considering 447/1503 (removed 1056) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 483 ms. Remains : 296/1503 places, 447/1503 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 6) seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 447 rows 296 cols
[2023-03-20 10:56:41] [INFO ] Computed 120 place invariants in 3 ms
[2023-03-20 10:56:41] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 10:56:41] [INFO ] [Nat]Absence check using 120 positive place invariants in 20 ms returned sat
[2023-03-20 10:56:41] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 10:56:41] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-20 10:56:42] [INFO ] After 433ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 10:56:42] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2023-03-20 10:56:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-20 10:56:42] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2023-03-20 10:56:42] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2023-03-20 10:56:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2023-03-20 10:56:42] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-03-20 10:56:42] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-20 10:56:42] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2023-03-20 10:56:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 214 ms
[2023-03-20 10:56:42] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2023-03-20 10:56:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-20 10:56:42] [INFO ] After 1156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 251 ms.
[2023-03-20 10:56:43] [INFO ] After 1710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 41 ms.
Support contains 40 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 447/447 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 296 transition count 446
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 295 transition count 446
Applied a total of 2 rules in 22 ms. Remains 295 /296 variables (removed 1) and now considering 446/447 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 295/296 places, 446/447 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 151745 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151745 steps, saw 103802 distinct states, run finished after 3004 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 446 rows 295 cols
[2023-03-20 10:56:46] [INFO ] Computed 120 place invariants in 2 ms
[2023-03-20 10:56:46] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 10:56:46] [INFO ] [Nat]Absence check using 120 positive place invariants in 15 ms returned sat
[2023-03-20 10:56:47] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 10:56:47] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-20 10:56:47] [INFO ] After 304ms SMT Verify possible using 169 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 10:56:47] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2023-03-20 10:56:47] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2023-03-20 10:56:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2023-03-20 10:56:47] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2023-03-20 10:56:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-20 10:56:47] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2023-03-20 10:56:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-20 10:56:47] [INFO ] After 843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-20 10:56:48] [INFO ] After 1268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 43 ms.
Support contains 40 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 446/446 transitions.
Applied a total of 0 rules in 21 ms. Remains 295 /295 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 295/295 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 446/446 transitions.
Applied a total of 0 rules in 8 ms. Remains 295 /295 variables (removed 0) and now considering 446/446 (removed 0) transitions.
[2023-03-20 10:56:48] [INFO ] Invariant cache hit.
[2023-03-20 10:56:48] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-20 10:56:48] [INFO ] Invariant cache hit.
[2023-03-20 10:56:48] [INFO ] State equation strengthened by 169 read => feed constraints.
[2023-03-20 10:56:49] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
[2023-03-20 10:56:49] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-20 10:56:49] [INFO ] Invariant cache hit.
[2023-03-20 10:56:49] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1155 ms. Remains : 295/295 places, 446/446 transitions.
Graph (trivial) has 90 edges and 295 vertex of which 4 / 295 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 987 edges and 293 vertex of which 291 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 87 edges and 289 vertex of which 4 / 289 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 287 transition count 437
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 86 edges and 285 vertex of which 6 / 285 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 282 transition count 428
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 84 edges and 279 vertex of which 6 / 279 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 276 transition count 417
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 81 edges and 273 vertex of which 6 / 273 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 3 with 14 rules applied. Total rules applied 49 place count 270 transition count 407
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 78 edges and 267 vertex of which 2 / 267 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 4 with 16 rules applied. Total rules applied 65 place count 266 transition count 395
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 77 edges and 265 vertex of which 2 / 265 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 5 with 7 rules applied. Total rules applied 72 place count 264 transition count 390
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 76 edges and 263 vertex of which 2 / 263 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 6 with 5 rules applied. Total rules applied 77 place count 262 transition count 387
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.
Iterating post reduction 7 with 5 rules applied. Total rules applied 82 place count 261 transition count 383
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 82 place count 261 transition count 381
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 5 rules applied. Total rules applied 87 place count 258 transition count 381
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 93 place count 254 transition count 379
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 98 place count 254 transition count 374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 100 place count 253 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 101 place count 253 transition count 372
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 115 place count 253 transition count 358
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 10 with 17 rules applied. Total rules applied 132 place count 253 transition count 358
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 143 place count 253 transition count 347
Applied a total of 143 rules in 89 ms. Remains 253 /295 variables (removed 42) and now considering 347/446 (removed 99) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 347 rows 253 cols
[2023-03-20 10:56:49] [INFO ] Computed 100 place invariants in 1 ms
[2023-03-20 10:56:49] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 10:56:49] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned sat
[2023-03-20 10:56:49] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 10:56:49] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2023-03-20 10:56:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-20 10:56:49] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-20 10:56:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-20 10:56:49] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2023-03-20 10:56:50] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2023-03-20 10:56:50] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2023-03-20 10:56:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 152 ms
[2023-03-20 10:56:50] [INFO ] After 514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-20 10:56:50] [INFO ] After 681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-20 10:56:50] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-20 10:56:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 295 places, 446 transitions and 2346 arcs took 3 ms.
[2023-03-20 10:56:50] [INFO ] Flatten gal took : 130 ms
Total runtime 38065 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/777/inv_0_ --invariant=/tmp/777/inv_1_ --invariant=/tmp/777/inv_2_ --invariant=/tmp/777/inv_3_ --invariant=/tmp/777/inv_4_ --inv-par
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679310334917

--------------------
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
mcc2023
rfs formula name ShieldRVt-PT-030B-ReachabilityCardinality-05
rfs formula type AG
rfs formula formula --invariant=/tmp/777/inv_0_
rfs formula name ShieldRVt-PT-030B-ReachabilityCardinality-06
rfs formula type EF
rfs formula formula --invariant=/tmp/777/inv_1_
rfs formula name ShieldRVt-PT-030B-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/777/inv_2_
rfs formula name ShieldRVt-PT-030B-ReachabilityCardinality-09
rfs formula type AG
rfs formula formula --invariant=/tmp/777/inv_3_
rfs formula name ShieldRVt-PT-030B-ReachabilityCardinality-14
rfs formula type EF
rfs formula formula --invariant=/tmp/777/inv_4_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 295 places, 446 transitions and 2346 arcs
pnml2lts-sym: Petri net ShieldRVt_PT_030B analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 446->185 groups
pnml2lts-sym: Regrouping took 0.070 real 0.070 user 0.000 sys
pnml2lts-sym: state vector length is 295; there are 185 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/777/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/777/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/777/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/777/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 375207 group checks and 0 next state calls
pnml2lts-sym: reachability took 469.800 real 1874.170 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.050 user 0.000 sys
pnml2lts-sym: state space has 7.59691375266568e+41 states, 25535 nodes
pnml2lts-sym: group_next: 4014 nodes total
pnml2lts-sym: group_explored: 2590 nodes, 53489227 short vectors total
pnml2lts-sym: max token count: 1

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="ltsminxred"
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 ltsminxred"
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 r425-tajo-167905978000302"
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 ;