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-167905978000318.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-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978000318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 9.3K Feb 25 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 23:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 23:10 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.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 12K Feb 25 23:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 23:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 23:11 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 489K 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-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679310001325

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-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 11:00:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 11:00:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:00:02] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2023-03-20 11:00:02] [INFO ] Transformed 2003 places.
[2023-03-20 11:00:02] [INFO ] Transformed 2003 transitions.
[2023-03-20 11:00:02] [INFO ] Found NUPN structural information;
[2023-03-20 11:00:02] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 14) seen :5
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2003 rows 2003 cols
[2023-03-20 11:00:03] [INFO ] Computed 161 place invariants in 42 ms
[2023-03-20 11:00:04] [INFO ] After 761ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 11:00:05] [INFO ] [Nat]Absence check using 161 positive place invariants in 60 ms returned sat
[2023-03-20 11:00:09] [INFO ] After 3805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 11:00:10] [INFO ] Deduced a trap composed of 45 places in 397 ms of which 9 ms to minimize.
[2023-03-20 11:00:10] [INFO ] Deduced a trap composed of 30 places in 404 ms of which 2 ms to minimize.
[2023-03-20 11:00:11] [INFO ] Deduced a trap composed of 39 places in 346 ms of which 2 ms to minimize.
[2023-03-20 11:00:11] [INFO ] Deduced a trap composed of 41 places in 409 ms of which 3 ms to minimize.
[2023-03-20 11:00:11] [INFO ] Deduced a trap composed of 27 places in 353 ms of which 2 ms to minimize.
[2023-03-20 11:00:12] [INFO ] Deduced a trap composed of 51 places in 295 ms of which 1 ms to minimize.
[2023-03-20 11:00:12] [INFO ] Deduced a trap composed of 50 places in 275 ms of which 1 ms to minimize.
[2023-03-20 11:00:13] [INFO ] Deduced a trap composed of 61 places in 276 ms of which 1 ms to minimize.
[2023-03-20 11:00:13] [INFO ] Deduced a trap composed of 68 places in 285 ms of which 1 ms to minimize.
[2023-03-20 11:00:13] [INFO ] Deduced a trap composed of 60 places in 263 ms of which 1 ms to minimize.
[2023-03-20 11:00:14] [INFO ] Deduced a trap composed of 73 places in 228 ms of which 0 ms to minimize.
[2023-03-20 11:00:14] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 0 ms to minimize.
[2023-03-20 11:00:14] [INFO ] Deduced a trap composed of 58 places in 225 ms of which 1 ms to minimize.
[2023-03-20 11:00:14] [INFO ] Deduced a trap composed of 55 places in 218 ms of which 0 ms to minimize.
[2023-03-20 11:00:15] [INFO ] Deduced a trap composed of 53 places in 219 ms of which 1 ms to minimize.
[2023-03-20 11:00:15] [INFO ] Deduced a trap composed of 53 places in 220 ms of which 1 ms to minimize.
[2023-03-20 11:00:15] [INFO ] Deduced a trap composed of 55 places in 215 ms of which 1 ms to minimize.
[2023-03-20 11:00:15] [INFO ] Deduced a trap composed of 56 places in 204 ms of which 1 ms to minimize.
[2023-03-20 11:00:16] [INFO ] Deduced a trap composed of 60 places in 199 ms of which 2 ms to minimize.
[2023-03-20 11:00:16] [INFO ] Deduced a trap composed of 62 places in 197 ms of which 1 ms to minimize.
[2023-03-20 11:00:16] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 1 ms to minimize.
[2023-03-20 11:00:16] [INFO ] Deduced a trap composed of 57 places in 163 ms of which 1 ms to minimize.
[2023-03-20 11:00:17] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 7263 ms
[2023-03-20 11:00:17] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 0 ms to minimize.
[2023-03-20 11:00:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-03-20 11:00:18] [INFO ] Deduced a trap composed of 22 places in 412 ms of which 1 ms to minimize.
[2023-03-20 11:00:18] [INFO ] Deduced a trap composed of 33 places in 407 ms of which 4 ms to minimize.
[2023-03-20 11:00:19] [INFO ] Deduced a trap composed of 35 places in 401 ms of which 1 ms to minimize.
[2023-03-20 11:00:19] [INFO ] Deduced a trap composed of 44 places in 393 ms of which 1 ms to minimize.
[2023-03-20 11:00:19] [INFO ] Deduced a trap composed of 37 places in 380 ms of which 3 ms to minimize.
[2023-03-20 11:00:20] [INFO ] Deduced a trap composed of 37 places in 366 ms of which 1 ms to minimize.
[2023-03-20 11:00:20] [INFO ] Deduced a trap composed of 55 places in 360 ms of which 2 ms to minimize.
[2023-03-20 11:00:21] [INFO ] Deduced a trap composed of 58 places in 364 ms of which 1 ms to minimize.
[2023-03-20 11:00:21] [INFO ] Deduced a trap composed of 50 places in 349 ms of which 2 ms to minimize.
[2023-03-20 11:00:22] [INFO ] Deduced a trap composed of 38 places in 365 ms of which 1 ms to minimize.
[2023-03-20 11:00:22] [INFO ] Deduced a trap composed of 59 places in 343 ms of which 3 ms to minimize.
[2023-03-20 11:00:22] [INFO ] Deduced a trap composed of 25 places in 330 ms of which 1 ms to minimize.
[2023-03-20 11:00:23] [INFO ] Deduced a trap composed of 51 places in 332 ms of which 1 ms to minimize.
[2023-03-20 11:00:23] [INFO ] Deduced a trap composed of 32 places in 329 ms of which 1 ms to minimize.
[2023-03-20 11:00:24] [INFO ] Deduced a trap composed of 45 places in 330 ms of which 2 ms to minimize.
[2023-03-20 11:00:24] [INFO ] Deduced a trap composed of 33 places in 322 ms of which 1 ms to minimize.
[2023-03-20 11:00:24] [INFO ] Deduced a trap composed of 36 places in 322 ms of which 1 ms to minimize.
[2023-03-20 11:00:25] [INFO ] Deduced a trap composed of 28 places in 378 ms of which 1 ms to minimize.
[2023-03-20 11:00:26] [INFO ] Deduced a trap composed of 19 places in 381 ms of which 1 ms to minimize.
[2023-03-20 11:00:26] [INFO ] Deduced a trap composed of 29 places in 374 ms of which 1 ms to minimize.
[2023-03-20 11:00:27] [INFO ] Deduced a trap composed of 41 places in 367 ms of which 1 ms to minimize.
[2023-03-20 11:00:27] [INFO ] Deduced a trap composed of 29 places in 400 ms of which 3 ms to minimize.
[2023-03-20 11:00:28] [INFO ] Deduced a trap composed of 46 places in 370 ms of which 1 ms to minimize.
[2023-03-20 11:00:28] [INFO ] Deduced a trap composed of 42 places in 350 ms of which 1 ms to minimize.
[2023-03-20 11:00:28] [INFO ] Deduced a trap composed of 29 places in 343 ms of which 1 ms to minimize.
[2023-03-20 11:00:29] [INFO ] Deduced a trap composed of 46 places in 345 ms of which 1 ms to minimize.
[2023-03-20 11:00:29] [INFO ] Deduced a trap composed of 41 places in 331 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 11:00:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 11:00:29] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 615 ms.
Support contains 125 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Drop transitions removed 536 transitions
Trivial Post-agglo rules discarded 536 transitions
Performed 536 trivial Post agglomeration. Transition count delta: 536
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 2003 transition count 1467
Reduce places removed 536 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 538 rules applied. Total rules applied 1074 place count 1467 transition count 1465
Reduce places removed 1 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 2 with 28 rules applied. Total rules applied 1102 place count 1466 transition count 1438
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 1129 place count 1439 transition count 1438
Performed 169 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 169 Pre rules applied. Total rules applied 1129 place count 1439 transition count 1269
Deduced a syphon composed of 169 places in 3 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 1467 place count 1270 transition count 1269
Discarding 237 places :
Symmetric choice reduction at 4 with 237 rule applications. Total rules 1704 place count 1033 transition count 1032
Iterating global reduction 4 with 237 rules applied. Total rules applied 1941 place count 1033 transition count 1032
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 96 Pre rules applied. Total rules applied 1941 place count 1033 transition count 936
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 2133 place count 937 transition count 936
Performed 329 Post agglomeration using F-continuation condition.Transition count delta: 329
Deduced a syphon composed of 329 places in 2 ms
Reduce places removed 329 places and 0 transitions.
Iterating global reduction 4 with 658 rules applied. Total rules applied 2791 place count 608 transition count 607
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 2981 place count 513 transition count 673
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2982 place count 513 transition count 672
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 2992 place count 513 transition count 662
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 3002 place count 503 transition count 662
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3003 place count 503 transition count 661
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 3006 place count 503 transition count 661
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3007 place count 503 transition count 660
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3008 place count 502 transition count 659
Applied a total of 3008 rules in 452 ms. Remains 502 /2003 variables (removed 1501) and now considering 659/2003 (removed 1344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 453 ms. Remains : 502/2003 places, 659/2003 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 9) seen :1
FORMULA ShieldRVt-PT-040B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) 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 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 659 rows 502 cols
[2023-03-20 11:00:31] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-20 11:00:31] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 11:00:31] [INFO ] [Nat]Absence check using 161 positive place invariants in 20 ms returned sat
[2023-03-20 11:00:32] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 11:00:32] [INFO ] State equation strengthened by 237 read => feed constraints.
[2023-03-20 11:00:32] [INFO ] After 734ms SMT Verify possible using 237 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 11:00:33] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2023-03-20 11:00:33] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2023-03-20 11:00:33] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2023-03-20 11:00:33] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2023-03-20 11:00:33] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2023-03-20 11:00:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 400 ms
[2023-03-20 11:00:33] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 4 ms to minimize.
[2023-03-20 11:00:33] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2023-03-20 11:00:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2023-03-20 11:00:33] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2023-03-20 11:00:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-20 11:00:33] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2023-03-20 11:00:34] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-20 11:00:34] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2023-03-20 11:00:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2023-03-20 11:00:34] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2023-03-20 11:00:34] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2023-03-20 11:00:34] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2023-03-20 11:00:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 314 ms
[2023-03-20 11:00:34] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2023-03-20 11:00:34] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-20 11:00:35] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
[2023-03-20 11:00:35] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2023-03-20 11:00:35] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2023-03-20 11:00:35] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2023-03-20 11:00:35] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2023-03-20 11:00:35] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2023-03-20 11:00:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1050 ms
[2023-03-20 11:00:35] [INFO ] After 3696ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 869 ms.
[2023-03-20 11:00:36] [INFO ] After 5137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 63 ms.
Support contains 124 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 659/659 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 501 transition count 659
Applied a total of 2 rules in 36 ms. Remains 501 /502 variables (removed 1) and now considering 659/659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 501/502 places, 659/659 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 144110 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 144110 steps, saw 90529 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 659 rows 501 cols
[2023-03-20 11:00:40] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-20 11:00:40] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 11:00:40] [INFO ] [Nat]Absence check using 161 positive place invariants in 20 ms returned sat
[2023-03-20 11:00:41] [INFO ] After 449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 11:00:41] [INFO ] State equation strengthened by 239 read => feed constraints.
[2023-03-20 11:00:41] [INFO ] After 753ms SMT Verify possible using 239 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 11:00:42] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2023-03-20 11:00:42] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2023-03-20 11:00:42] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2023-03-20 11:00:42] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2023-03-20 11:00:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 415 ms
[2023-03-20 11:00:42] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2023-03-20 11:00:42] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2023-03-20 11:00:42] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-20 11:00:42] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2023-03-20 11:00:43] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2023-03-20 11:00:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 527 ms
[2023-03-20 11:00:43] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2023-03-20 11:00:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-20 11:00:43] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2023-03-20 11:00:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-20 11:00:43] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2023-03-20 11:00:44] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2023-03-20 11:00:44] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2023-03-20 11:00:44] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 0 ms to minimize.
[2023-03-20 11:00:44] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2023-03-20 11:00:44] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-20 11:00:44] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2023-03-20 11:00:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 725 ms
[2023-03-20 11:00:44] [INFO ] After 3382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 832 ms.
[2023-03-20 11:00:45] [INFO ] After 4840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 105 ms.
Support contains 124 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 659/659 transitions.
Applied a total of 0 rules in 11 ms. Remains 501 /501 variables (removed 0) and now considering 659/659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 501/501 places, 659/659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 659/659 transitions.
Applied a total of 0 rules in 13 ms. Remains 501 /501 variables (removed 0) and now considering 659/659 (removed 0) transitions.
[2023-03-20 11:00:45] [INFO ] Invariant cache hit.
[2023-03-20 11:00:45] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-20 11:00:45] [INFO ] Invariant cache hit.
[2023-03-20 11:00:46] [INFO ] State equation strengthened by 239 read => feed constraints.
[2023-03-20 11:00:46] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
[2023-03-20 11:00:46] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-20 11:00:46] [INFO ] Invariant cache hit.
[2023-03-20 11:00:47] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1531 ms. Remains : 501/501 places, 659/659 transitions.
Graph (trivial) has 83 edges and 501 vertex of which 4 / 501 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 1515 edges and 499 vertex of which 497 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 80 edges and 495 vertex of which 4 / 495 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 493 transition count 650
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 79 edges and 491 vertex of which 4 / 491 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 489 transition count 641
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 489 transition count 637
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 51 place count 489 transition count 610
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 71 place count 489 transition count 610
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 489 transition count 609
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 82 place count 489 transition count 599
Applied a total of 82 rules in 52 ms. Remains 489 /501 variables (removed 12) and now considering 599/659 (removed 60) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 599 rows 489 cols
[2023-03-20 11:00:47] [INFO ] Computed 156 place invariants in 2 ms
[2023-03-20 11:00:47] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 11:00:47] [INFO ] [Nat]Absence check using 156 positive place invariants in 18 ms returned sat
[2023-03-20 11:00:47] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 11:00:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 11:00:48] [INFO ] After 267ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 339 ms
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 199 ms
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-20 11:00:49] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2023-03-20 11:00:49] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-20 11:00:49] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2023-03-20 11:00:49] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2023-03-20 11:00:49] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2023-03-20 11:00:49] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2023-03-20 11:00:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 368 ms
[2023-03-20 11:00:49] [INFO ] After 1544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 273 ms.
[2023-03-20 11:00:49] [INFO ] After 2389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-20 11:00:49] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-20 11:00:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 501 places, 659 transitions and 3050 arcs took 4 ms.
[2023-03-20 11:00:49] [INFO ] Flatten gal took : 82 ms
Total runtime 47155 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/834/inv_0_ --invariant=/tmp/834/inv_1_ --invariant=/tmp/834/inv_2_ --invariant=/tmp/834/inv_3_ --invariant=/tmp/834/inv_4_ --invariant=/tmp/834/inv_5_ --invariant=/tmp/834/inv_6_ --invariant=/tmp/834/inv_7_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 15566392 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16097732 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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

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-040B"
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-040B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905978000318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-040B.tgz
mv ShieldRVt-PT-040B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;