Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903716700158.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPs-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716700158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 846K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679429022915

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=ShieldIIPs-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 20:03:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 20:03:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 20:03:45] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2023-03-21 20:03:45] [INFO ] Transformed 3003 places.
[2023-03-21 20:03:45] [INFO ] Transformed 2953 transitions.
[2023-03-21 20:03:45] [INFO ] Found NUPN structural information;
[2023-03-21 20:03:45] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 400 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 488 ms. (steps per millisecond=20 ) properties (out of 14) seen :10
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2953 rows 3003 cols
[2023-03-21 20:03:46] [INFO ] Computed 451 place invariants in 37 ms
[2023-03-21 20:03:47] [INFO ] After 1061ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 20:03:48] [INFO ] [Nat]Absence check using 451 positive place invariants in 335 ms returned sat
[2023-03-21 20:03:54] [INFO ] After 5508ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 20:03:56] [INFO ] Deduced a trap composed of 19 places in 1274 ms of which 39 ms to minimize.
[2023-03-21 20:03:57] [INFO ] Deduced a trap composed of 18 places in 1164 ms of which 6 ms to minimize.
[2023-03-21 20:03:59] [INFO ] Deduced a trap composed of 21 places in 1455 ms of which 14 ms to minimize.
[2023-03-21 20:04:00] [INFO ] Deduced a trap composed of 17 places in 1068 ms of which 19 ms to minimize.
[2023-03-21 20:04:01] [INFO ] Deduced a trap composed of 18 places in 1003 ms of which 15 ms to minimize.
[2023-03-21 20:04:02] [INFO ] Deduced a trap composed of 28 places in 1036 ms of which 16 ms to minimize.
[2023-03-21 20:04:04] [INFO ] Deduced a trap composed of 16 places in 1136 ms of which 4 ms to minimize.
[2023-03-21 20:04:05] [INFO ] Deduced a trap composed of 28 places in 1175 ms of which 2 ms to minimize.
[2023-03-21 20:04:08] [INFO ] Deduced a trap composed of 14 places in 1128 ms of which 2 ms to minimize.
[2023-03-21 20:04:09] [INFO ] Deduced a trap composed of 24 places in 1147 ms of which 2 ms to minimize.
[2023-03-21 20:04:10] [INFO ] Deduced a trap composed of 18 places in 924 ms of which 2 ms to minimize.
[2023-03-21 20:04:12] [INFO ] Deduced a trap composed of 20 places in 1098 ms of which 2 ms to minimize.
[2023-03-21 20:04:13] [INFO ] Deduced a trap composed of 18 places in 1087 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:04:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:04:13] [INFO ] After 25792ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 418 ms.
Support contains 93 out of 3003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Drop transitions removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 3003 transition count 2719
Reduce places removed 234 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 239 rules applied. Total rules applied 473 place count 2769 transition count 2714
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 478 place count 2764 transition count 2714
Performed 245 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 245 Pre rules applied. Total rules applied 478 place count 2764 transition count 2469
Deduced a syphon composed of 245 places in 8 ms
Reduce places removed 245 places and 0 transitions.
Iterating global reduction 3 with 490 rules applied. Total rules applied 968 place count 2519 transition count 2469
Discarding 330 places :
Symmetric choice reduction at 3 with 330 rule applications. Total rules 1298 place count 2189 transition count 2139
Iterating global reduction 3 with 330 rules applied. Total rules applied 1628 place count 2189 transition count 2139
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 133 Pre rules applied. Total rules applied 1628 place count 2189 transition count 2006
Deduced a syphon composed of 133 places in 15 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 1894 place count 2056 transition count 2006
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 700
Deduced a syphon composed of 700 places in 15 ms
Reduce places removed 700 places and 0 transitions.
Iterating global reduction 3 with 1400 rules applied. Total rules applied 3294 place count 1356 transition count 1306
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 320 times.
Drop transitions removed 320 transitions
Iterating global reduction 3 with 320 rules applied. Total rules applied 3614 place count 1356 transition count 1306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3615 place count 1355 transition count 1305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3616 place count 1354 transition count 1305
Applied a total of 3616 rules in 999 ms. Remains 1354 /3003 variables (removed 1649) and now considering 1305/2953 (removed 1648) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1000 ms. Remains : 1354/3003 places, 1305/2953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 4) seen :2
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1305 rows 1354 cols
[2023-03-21 20:04:15] [INFO ] Computed 450 place invariants in 31 ms
[2023-03-21 20:04:15] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 20:04:15] [INFO ] [Nat]Absence check using 441 positive place invariants in 102 ms returned sat
[2023-03-21 20:04:15] [INFO ] [Nat]Absence check using 441 positive and 9 generalized place invariants in 5 ms returned sat
[2023-03-21 20:04:16] [INFO ] After 1080ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 20:04:17] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2023-03-21 20:04:17] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2023-03-21 20:04:17] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 0 ms to minimize.
[2023-03-21 20:04:18] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 0 ms to minimize.
[2023-03-21 20:04:18] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 1 ms to minimize.
[2023-03-21 20:04:18] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2023-03-21 20:04:19] [INFO ] Deduced a trap composed of 6 places in 363 ms of which 1 ms to minimize.
[2023-03-21 20:04:19] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 0 ms to minimize.
[2023-03-21 20:04:19] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 1 ms to minimize.
[2023-03-21 20:04:20] [INFO ] Deduced a trap composed of 7 places in 295 ms of which 1 ms to minimize.
[2023-03-21 20:04:20] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2023-03-21 20:04:20] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 1 ms to minimize.
[2023-03-21 20:04:21] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 0 ms to minimize.
[2023-03-21 20:04:21] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 1 ms to minimize.
[2023-03-21 20:04:21] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 0 ms to minimize.
[2023-03-21 20:04:22] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2023-03-21 20:04:22] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 0 ms to minimize.
[2023-03-21 20:04:22] [INFO ] Deduced a trap composed of 5 places in 284 ms of which 1 ms to minimize.
[2023-03-21 20:04:23] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 1 ms to minimize.
[2023-03-21 20:04:23] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 0 ms to minimize.
[2023-03-21 20:04:23] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 1 ms to minimize.
[2023-03-21 20:04:23] [INFO ] Deduced a trap composed of 9 places in 228 ms of which 1 ms to minimize.
[2023-03-21 20:04:24] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 0 ms to minimize.
[2023-03-21 20:04:24] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 0 ms to minimize.
[2023-03-21 20:04:24] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2023-03-21 20:04:24] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2023-03-21 20:04:25] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 14 ms to minimize.
[2023-03-21 20:04:25] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 1 ms to minimize.
[2023-03-21 20:04:25] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 1 ms to minimize.
[2023-03-21 20:04:26] [INFO ] Deduced a trap composed of 9 places in 367 ms of which 1 ms to minimize.
[2023-03-21 20:04:26] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 0 ms to minimize.
[2023-03-21 20:04:26] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 9475 ms
[2023-03-21 20:04:27] [INFO ] Deduced a trap composed of 6 places in 254 ms of which 0 ms to minimize.
[2023-03-21 20:04:27] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 1 ms to minimize.
[2023-03-21 20:04:27] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 0 ms to minimize.
[2023-03-21 20:04:28] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 1 ms to minimize.
[2023-03-21 20:04:28] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 0 ms to minimize.
[2023-03-21 20:04:28] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 0 ms to minimize.
[2023-03-21 20:04:29] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 0 ms to minimize.
[2023-03-21 20:04:29] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-21 20:04:29] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 0 ms to minimize.
[2023-03-21 20:04:30] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
[2023-03-21 20:04:30] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 1 ms to minimize.
[2023-03-21 20:04:30] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 9 ms to minimize.
[2023-03-21 20:04:30] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 1 ms to minimize.
[2023-03-21 20:04:31] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 1 ms to minimize.
[2023-03-21 20:04:31] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 1 ms to minimize.
[2023-03-21 20:04:31] [INFO ] Deduced a trap composed of 16 places in 263 ms of which 1 ms to minimize.
[2023-03-21 20:04:32] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 0 ms to minimize.
[2023-03-21 20:04:32] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 1 ms to minimize.
[2023-03-21 20:04:32] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2023-03-21 20:04:32] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 0 ms to minimize.
[2023-03-21 20:04:33] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 13 ms to minimize.
[2023-03-21 20:04:33] [INFO ] Deduced a trap composed of 15 places in 263 ms of which 0 ms to minimize.
[2023-03-21 20:04:33] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 2 ms to minimize.
[2023-03-21 20:04:33] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 1 ms to minimize.
[2023-03-21 20:04:34] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2023-03-21 20:04:34] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2023-03-21 20:04:34] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 7784 ms
[2023-03-21 20:04:34] [INFO ] After 18764ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 470 ms.
[2023-03-21 20:04:35] [INFO ] After 19643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 90 ms.
Support contains 43 out of 1354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1354/1354 places, 1305/1305 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1354 transition count 1301
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1350 transition count 1301
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 8 place count 1350 transition count 1289
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 32 place count 1338 transition count 1289
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 4 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 94 place count 1307 transition count 1258
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 108 place count 1307 transition count 1258
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 1301 transition count 1252
Applied a total of 114 rules in 377 ms. Remains 1301 /1354 variables (removed 53) and now considering 1252/1305 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 378 ms. Remains : 1301/1354 places, 1252/1305 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 2) seen :1
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1252 rows 1301 cols
[2023-03-21 20:04:35] [INFO ] Computed 450 place invariants in 33 ms
[2023-03-21 20:04:36] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:04:36] [INFO ] [Nat]Absence check using 446 positive place invariants in 114 ms returned sat
[2023-03-21 20:04:36] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 18 ms returned sat
[2023-03-21 20:04:37] [INFO ] After 713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 20:04:37] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 0 ms to minimize.
[2023-03-21 20:04:37] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2023-03-21 20:04:38] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 0 ms to minimize.
[2023-03-21 20:04:38] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2023-03-21 20:04:38] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 0 ms to minimize.
[2023-03-21 20:04:39] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 1 ms to minimize.
[2023-03-21 20:04:39] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2023-03-21 20:04:39] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 1 ms to minimize.
[2023-03-21 20:04:39] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 1 ms to minimize.
[2023-03-21 20:04:40] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2023-03-21 20:04:40] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 0 ms to minimize.
[2023-03-21 20:04:40] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-21 20:04:40] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 0 ms to minimize.
[2023-03-21 20:04:41] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 0 ms to minimize.
[2023-03-21 20:04:41] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2023-03-21 20:04:41] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 0 ms to minimize.
[2023-03-21 20:04:41] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2023-03-21 20:04:42] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2023-03-21 20:04:42] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 0 ms to minimize.
[2023-03-21 20:04:42] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2023-03-21 20:04:42] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 0 ms to minimize.
[2023-03-21 20:04:43] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 1 ms to minimize.
[2023-03-21 20:04:43] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 1 ms to minimize.
[2023-03-21 20:04:43] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2023-03-21 20:04:43] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-21 20:04:43] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2023-03-21 20:04:43] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6608 ms
[2023-03-21 20:04:43] [INFO ] After 7450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-21 20:04:44] [INFO ] After 7975ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 50 ms.
Support contains 27 out of 1301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1301/1301 places, 1252/1252 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1301 transition count 1251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1300 transition count 1251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1300 transition count 1249
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1298 transition count 1249
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 34 place count 1284 transition count 1235
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 1284 transition count 1235
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 1280 transition count 1231
Applied a total of 39 rules in 168 ms. Remains 1280 /1301 variables (removed 21) and now considering 1231/1252 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 1280/1301 places, 1231/1252 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 147034 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 147034 steps, saw 92230 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1231 rows 1280 cols
[2023-03-21 20:04:47] [INFO ] Computed 450 place invariants in 5 ms
[2023-03-21 20:04:47] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:04:47] [INFO ] [Nat]Absence check using 446 positive place invariants in 74 ms returned sat
[2023-03-21 20:04:47] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-21 20:04:48] [INFO ] After 754ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 20:04:49] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 0 ms to minimize.
[2023-03-21 20:04:49] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2023-03-21 20:04:49] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2023-03-21 20:04:49] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 1 ms to minimize.
[2023-03-21 20:04:50] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 0 ms to minimize.
[2023-03-21 20:04:50] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
[2023-03-21 20:04:50] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 0 ms to minimize.
[2023-03-21 20:04:50] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2023-03-21 20:04:51] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 0 ms to minimize.
[2023-03-21 20:04:51] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2023-03-21 20:04:51] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2023-03-21 20:04:51] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 0 ms to minimize.
[2023-03-21 20:04:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2915 ms
[2023-03-21 20:04:51] [INFO ] After 3744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-21 20:04:51] [INFO ] After 4178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 27 out of 1280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1280/1280 places, 1231/1231 transitions.
Applied a total of 0 rules in 48 ms. Remains 1280 /1280 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1280/1280 places, 1231/1231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1280/1280 places, 1231/1231 transitions.
Applied a total of 0 rules in 36 ms. Remains 1280 /1280 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
[2023-03-21 20:04:51] [INFO ] Invariant cache hit.
[2023-03-21 20:04:52] [INFO ] Implicit Places using invariants in 919 ms returned []
[2023-03-21 20:04:52] [INFO ] Invariant cache hit.
[2023-03-21 20:04:55] [INFO ] Implicit Places using invariants and state equation in 2355 ms returned []
Implicit Place search using SMT with State Equation took 3302 ms to find 0 implicit places.
[2023-03-21 20:04:55] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-21 20:04:55] [INFO ] Invariant cache hit.
[2023-03-21 20:04:56] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4174 ms. Remains : 1280/1280 places, 1231/1231 transitions.
Applied a total of 0 rules in 38 ms. Remains 1280 /1280 variables (removed 0) and now considering 1231/1231 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 20:04:56] [INFO ] Invariant cache hit.
[2023-03-21 20:04:56] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:04:56] [INFO ] [Nat]Absence check using 446 positive place invariants in 119 ms returned sat
[2023-03-21 20:04:56] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-21 20:04:57] [INFO ] After 942ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 20:04:57] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 0 ms to minimize.
[2023-03-21 20:04:58] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2023-03-21 20:04:58] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2023-03-21 20:04:58] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2023-03-21 20:04:58] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2023-03-21 20:04:59] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 0 ms to minimize.
[2023-03-21 20:04:59] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2023-03-21 20:04:59] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 0 ms to minimize.
[2023-03-21 20:04:59] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 0 ms to minimize.
[2023-03-21 20:05:00] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 1 ms to minimize.
[2023-03-21 20:05:00] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 0 ms to minimize.
[2023-03-21 20:05:00] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 1 ms to minimize.
[2023-03-21 20:05:00] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 0 ms to minimize.
[2023-03-21 20:05:00] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2023-03-21 20:05:01] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 0 ms to minimize.
[2023-03-21 20:05:01] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2023-03-21 20:05:01] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2023-03-21 20:05:01] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2023-03-21 20:05:01] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 0 ms to minimize.
[2023-03-21 20:05:02] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2023-03-21 20:05:02] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2023-03-21 20:05:02] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2023-03-21 20:05:02] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2023-03-21 20:05:02] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2023-03-21 20:05:02] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5308 ms
[2023-03-21 20:05:03] [INFO ] After 6366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 144 ms.
[2023-03-21 20:05:03] [INFO ] After 6882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-21 20:05:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-21 20:05:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1280 places, 1231 transitions and 5790 arcs took 13 ms.
[2023-03-21 20:05:03] [INFO ] Flatten gal took : 172 ms
Total runtime 78438 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/922/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 11268780 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095572 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
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="ShieldIIPs-PT-050B"
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 ShieldIIPs-PT-050B, 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 r393-oct2-167903716700158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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