Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 21:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 21:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 21:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 376K 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 ShieldPPPt-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679575672526

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 12:47:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 12:47:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 12:47:55] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2023-03-23 12:47:55] [INFO ] Transformed 1563 places.
[2023-03-23 12:47:55] [INFO ] Transformed 1423 transitions.
[2023-03-23 12:47:55] [INFO ] Found NUPN structural information;
[2023-03-23 12:47:55] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 312 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 12) seen :7
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1423 rows 1563 cols
[2023-03-23 12:47:56] [INFO ] Computed 221 place invariants in 35 ms
[2023-03-23 12:47:57] [INFO ] After 836ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 12:47:57] [INFO ] [Nat]Absence check using 221 positive place invariants in 84 ms returned sat
[2023-03-23 12:48:00] [INFO ] After 2147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 12:48:00] [INFO ] Deduced a trap composed of 22 places in 453 ms of which 14 ms to minimize.
[2023-03-23 12:48:01] [INFO ] Deduced a trap composed of 39 places in 498 ms of which 2 ms to minimize.
[2023-03-23 12:48:01] [INFO ] Deduced a trap composed of 21 places in 379 ms of which 10 ms to minimize.
[2023-03-23 12:48:02] [INFO ] Deduced a trap composed of 36 places in 322 ms of which 1 ms to minimize.
[2023-03-23 12:48:02] [INFO ] Deduced a trap composed of 20 places in 324 ms of which 1 ms to minimize.
[2023-03-23 12:48:03] [INFO ] Deduced a trap composed of 29 places in 719 ms of which 2 ms to minimize.
[2023-03-23 12:48:04] [INFO ] Deduced a trap composed of 22 places in 441 ms of which 14 ms to minimize.
[2023-03-23 12:48:04] [INFO ] Deduced a trap composed of 29 places in 285 ms of which 1 ms to minimize.
[2023-03-23 12:48:04] [INFO ] Deduced a trap composed of 30 places in 302 ms of which 1 ms to minimize.
[2023-03-23 12:48:05] [INFO ] Deduced a trap composed of 38 places in 376 ms of which 1 ms to minimize.
[2023-03-23 12:48:05] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 1 ms to minimize.
[2023-03-23 12:48:06] [INFO ] Deduced a trap composed of 29 places in 638 ms of which 1 ms to minimize.
[2023-03-23 12:48:06] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 1 ms to minimize.
[2023-03-23 12:48:07] [INFO ] Deduced a trap composed of 30 places in 284 ms of which 1 ms to minimize.
[2023-03-23 12:48:07] [INFO ] Deduced a trap composed of 33 places in 383 ms of which 1 ms to minimize.
[2023-03-23 12:48:07] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 0 ms to minimize.
[2023-03-23 12:48:08] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 7720 ms
[2023-03-23 12:48:08] [INFO ] Deduced a trap composed of 20 places in 336 ms of which 0 ms to minimize.
[2023-03-23 12:48:08] [INFO ] Deduced a trap composed of 38 places in 330 ms of which 1 ms to minimize.
[2023-03-23 12:48:09] [INFO ] Deduced a trap composed of 28 places in 268 ms of which 1 ms to minimize.
[2023-03-23 12:48:09] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 2 ms to minimize.
[2023-03-23 12:48:10] [INFO ] Deduced a trap composed of 23 places in 367 ms of which 1 ms to minimize.
[2023-03-23 12:48:10] [INFO ] Deduced a trap composed of 30 places in 290 ms of which 13 ms to minimize.
[2023-03-23 12:48:10] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 1 ms to minimize.
[2023-03-23 12:48:11] [INFO ] Deduced a trap composed of 27 places in 231 ms of which 0 ms to minimize.
[2023-03-23 12:48:11] [INFO ] Deduced a trap composed of 25 places in 336 ms of which 1 ms to minimize.
[2023-03-23 12:48:11] [INFO ] Deduced a trap composed of 27 places in 390 ms of which 1 ms to minimize.
[2023-03-23 12:48:12] [INFO ] Deduced a trap composed of 30 places in 473 ms of which 1 ms to minimize.
[2023-03-23 12:48:12] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 0 ms to minimize.
[2023-03-23 12:48:13] [INFO ] Deduced a trap composed of 22 places in 476 ms of which 1 ms to minimize.
[2023-03-23 12:48:13] [INFO ] Deduced a trap composed of 25 places in 299 ms of which 1 ms to minimize.
[2023-03-23 12:48:14] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 0 ms to minimize.
[2023-03-23 12:48:14] [INFO ] Deduced a trap composed of 32 places in 256 ms of which 0 ms to minimize.
[2023-03-23 12:48:14] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 4 ms to minimize.
[2023-03-23 12:48:14] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 1 ms to minimize.
[2023-03-23 12:48:15] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 1 ms to minimize.
[2023-03-23 12:48:15] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 6940 ms
[2023-03-23 12:48:15] [INFO ] Deduced a trap composed of 23 places in 338 ms of which 1 ms to minimize.
[2023-03-23 12:48:16] [INFO ] Deduced a trap composed of 25 places in 372 ms of which 1 ms to minimize.
[2023-03-23 12:48:16] [INFO ] Deduced a trap composed of 25 places in 363 ms of which 1 ms to minimize.
[2023-03-23 12:48:17] [INFO ] Deduced a trap composed of 26 places in 421 ms of which 1 ms to minimize.
[2023-03-23 12:48:17] [INFO ] Deduced a trap composed of 35 places in 338 ms of which 1 ms to minimize.
[2023-03-23 12:48:17] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 1 ms to minimize.
[2023-03-23 12:48:18] [INFO ] Deduced a trap composed of 31 places in 500 ms of which 1 ms to minimize.
[2023-03-23 12:48:18] [INFO ] Deduced a trap composed of 31 places in 315 ms of which 13 ms to minimize.
[2023-03-23 12:48:19] [INFO ] Deduced a trap composed of 23 places in 407 ms of which 1 ms to minimize.
[2023-03-23 12:48:19] [INFO ] Deduced a trap composed of 31 places in 342 ms of which 1 ms to minimize.
[2023-03-23 12:48:20] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 0 ms to minimize.
[2023-03-23 12:48:20] [INFO ] Deduced a trap composed of 28 places in 360 ms of which 0 ms to minimize.
[2023-03-23 12:48:20] [INFO ] Deduced a trap composed of 23 places in 316 ms of which 1 ms to minimize.
[2023-03-23 12:48:21] [INFO ] Deduced a trap composed of 30 places in 384 ms of which 10 ms to minimize.
[2023-03-23 12:48:21] [INFO ] Deduced a trap composed of 37 places in 243 ms of which 0 ms to minimize.
[2023-03-23 12:48:22] [INFO ] Deduced a trap composed of 32 places in 505 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-23 12:48:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 12:48:22] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 231 ms.
Support contains 54 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions removed 339 transitions
Trivial Post-agglo rules discarded 339 transitions
Performed 339 trivial Post agglomeration. Transition count delta: 339
Iterating post reduction 0 with 339 rules applied. Total rules applied 339 place count 1563 transition count 1084
Reduce places removed 339 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 353 rules applied. Total rules applied 692 place count 1224 transition count 1070
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 706 place count 1210 transition count 1070
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 706 place count 1210 transition count 986
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 874 place count 1126 transition count 986
Discarding 130 places :
Symmetric choice reduction at 3 with 130 rule applications. Total rules 1004 place count 996 transition count 856
Iterating global reduction 3 with 130 rules applied. Total rules applied 1134 place count 996 transition count 856
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 1134 place count 996 transition count 803
Deduced a syphon composed of 53 places in 4 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 1240 place count 943 transition count 803
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 322
Deduced a syphon composed of 322 places in 1 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 3 with 644 rules applied. Total rules applied 1884 place count 621 transition count 481
Renaming transitions due to excessive name length > 1024 char.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1984 place count 571 transition count 481
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1988 place count 571 transition count 477
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1992 place count 567 transition count 477
Partial Free-agglomeration rule applied 47 times.
Drop transitions removed 47 transitions
Iterating global reduction 4 with 47 rules applied. Total rules applied 2039 place count 567 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2040 place count 566 transition count 476
Applied a total of 2040 rules in 384 ms. Remains 566 /1563 variables (removed 997) and now considering 476/1423 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 566/1563 places, 476/1423 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :1
FORMULA ShieldPPPt-PT-020B-ReachabilityCardinality-01 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 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 476 rows 566 cols
[2023-03-23 12:48:23] [INFO ] Computed 221 place invariants in 3 ms
[2023-03-23 12:48:23] [INFO ] [Real]Absence check using 221 positive place invariants in 32 ms returned sat
[2023-03-23 12:48:23] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:48:23] [INFO ] [Nat]Absence check using 221 positive place invariants in 50 ms returned sat
[2023-03-23 12:48:23] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:48:23] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-23 12:48:23] [INFO ] After 83ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:48:24] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2023-03-23 12:48:24] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2023-03-23 12:48:24] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 3 ms to minimize.
[2023-03-23 12:48:24] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 0 ms to minimize.
[2023-03-23 12:48:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 776 ms
[2023-03-23 12:48:24] [INFO ] After 1044ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-23 12:48:24] [INFO ] After 1597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 21 ms.
Support contains 14 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 476/476 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 566 transition count 465
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 555 transition count 465
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 22 place count 555 transition count 456
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 546 transition count 456
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 545 transition count 455
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 545 transition count 455
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 69 place count 531 transition count 442
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 531 transition count 440
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 71 place count 531 transition count 438
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 529 transition count 438
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 89 place count 522 transition count 437
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 96 place count 522 transition count 437
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 104 place count 514 transition count 429
Applied a total of 104 rules in 111 ms. Remains 514 /566 variables (removed 52) and now considering 429/476 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 514/566 places, 429/476 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 139217 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139217 steps, saw 117078 distinct states, run finished after 3003 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 429 rows 514 cols
[2023-03-23 12:48:28] [INFO ] Computed 220 place invariants in 2 ms
[2023-03-23 12:48:28] [INFO ] [Real]Absence check using 220 positive place invariants in 54 ms returned sat
[2023-03-23 12:48:28] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:48:28] [INFO ] [Nat]Absence check using 220 positive place invariants in 57 ms returned sat
[2023-03-23 12:48:29] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:48:29] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-23 12:48:29] [INFO ] After 122ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:48:29] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 31 ms to minimize.
[2023-03-23 12:48:29] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2023-03-23 12:48:30] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 0 ms to minimize.
[2023-03-23 12:48:30] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 1 ms to minimize.
[2023-03-23 12:48:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 894 ms
[2023-03-23 12:48:30] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2023-03-23 12:48:30] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 0 ms to minimize.
[2023-03-23 12:48:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
[2023-03-23 12:48:30] [INFO ] After 1411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-23 12:48:30] [INFO ] After 2125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 36 ms.
Support contains 14 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 429/429 transitions.
Applied a total of 0 rules in 30 ms. Remains 514 /514 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 514/514 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 429/429 transitions.
Applied a total of 0 rules in 12 ms. Remains 514 /514 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2023-03-23 12:48:30] [INFO ] Invariant cache hit.
[2023-03-23 12:48:31] [INFO ] Implicit Places using invariants in 559 ms returned [497, 501]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 576 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 512/514 places, 429/429 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 510 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 510 transition count 427
Applied a total of 4 rules in 16 ms. Remains 510 /512 variables (removed 2) and now considering 427/429 (removed 2) transitions.
// Phase 1: matrix 427 rows 510 cols
[2023-03-23 12:48:31] [INFO ] Computed 218 place invariants in 2 ms
[2023-03-23 12:48:32] [INFO ] Implicit Places using invariants in 659 ms returned []
[2023-03-23 12:48:32] [INFO ] Invariant cache hit.
[2023-03-23 12:48:32] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-23 12:48:33] [INFO ] Implicit Places using invariants and state equation in 971 ms returned []
Implicit Place search using SMT with State Equation took 1655 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 510/514 places, 427/429 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2259 ms. Remains : 510/514 places, 427/429 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 3) 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 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 164175 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 164175 steps, saw 139429 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 12:48:36] [INFO ] Invariant cache hit.
[2023-03-23 12:48:36] [INFO ] [Real]Absence check using 218 positive place invariants in 30 ms returned sat
[2023-03-23 12:48:36] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:48:36] [INFO ] [Nat]Absence check using 218 positive place invariants in 45 ms returned sat
[2023-03-23 12:48:37] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:48:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-23 12:48:37] [INFO ] After 104ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:48:37] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 27 ms to minimize.
[2023-03-23 12:48:37] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2023-03-23 12:48:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 420 ms
[2023-03-23 12:48:37] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 1 ms to minimize.
[2023-03-23 12:48:37] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 2 ms to minimize.
[2023-03-23 12:48:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 367 ms
[2023-03-23 12:48:38] [INFO ] After 989ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-23 12:48:38] [INFO ] After 1572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 34 ms.
Support contains 14 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 427/427 transitions.
Applied a total of 0 rules in 17 ms. Remains 510 /510 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 510/510 places, 427/427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 427/427 transitions.
Applied a total of 0 rules in 13 ms. Remains 510 /510 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2023-03-23 12:48:38] [INFO ] Invariant cache hit.
[2023-03-23 12:48:38] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-23 12:48:38] [INFO ] Invariant cache hit.
[2023-03-23 12:48:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-23 12:48:39] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
[2023-03-23 12:48:39] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-23 12:48:39] [INFO ] Invariant cache hit.
[2023-03-23 12:48:39] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1693 ms. Remains : 510/510 places, 427/427 transitions.
Partial Free-agglomeration rule applied 106 times.
Drop transitions removed 106 transitions
Iterating global reduction 0 with 106 rules applied. Total rules applied 106 place count 510 transition count 427
Applied a total of 106 rules in 28 ms. Remains 510 /510 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 427 rows 510 cols
[2023-03-23 12:48:39] [INFO ] Computed 218 place invariants in 15 ms
[2023-03-23 12:48:40] [INFO ] [Real]Absence check using 218 positive place invariants in 39 ms returned sat
[2023-03-23 12:48:40] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 12:48:40] [INFO ] [Nat]Absence check using 218 positive place invariants in 35 ms returned sat
[2023-03-23 12:48:40] [INFO ] After 428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 12:48:40] [INFO ] State equation strengthened by 94 read => feed constraints.
[2023-03-23 12:48:40] [INFO ] After 124ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:48:41] [INFO ] Deduced a trap composed of 5 places in 466 ms of which 18 ms to minimize.
[2023-03-23 12:48:41] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 14 ms to minimize.
[2023-03-23 12:48:41] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2023-03-23 12:48:42] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 0 ms to minimize.
[2023-03-23 12:48:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1139 ms
[2023-03-23 12:48:42] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 0 ms to minimize.
[2023-03-23 12:48:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2023-03-23 12:48:42] [INFO ] After 1755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 190 ms.
[2023-03-23 12:48:42] [INFO ] After 2563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-23 12:48:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-23 12:48:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 510 places, 427 transitions and 1825 arcs took 3 ms.
[2023-03-23 12:48:43] [INFO ] Flatten gal took : 72 ms
Total runtime 47766 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPt (PT), instance 020B
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 510 places, 427 transitions, 1825 arcs.
Final Score: 6260.725
Took : 16 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldPPPt-PT-020B-ReachabilityCardinality-07 (reachable & potential(( ( (tk(P98)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P98)) ) )))
PROPERTY: ShieldPPPt-PT-020B-ReachabilityCardinality-12 (reachable &!potential( ( ( ( ( (tk(P213)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P213)) ) ) | ( ( (tk(P188)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P188)) ) ) ) | ( ( ( ( ( (tk(P407)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P407)) ) ) | ( ( (tk(P42)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P42)) ) ) ) & ( ( ( (tk(P264)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P264)) ) ) | ( ( ( (tk(P203)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P203)) ) ) & ( ( ( (tk(P64)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P64)) ) ) | ( ( (tk(P413)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P413)) ) ) ) ) ) ) | ( ( ( ( (tk(P74)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P74)) ) ) & ( ( (tk(P207)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P207)) ) ) ) & ( ( ( (tk(P465)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P465)) ) ) & ( ( (tk(P179)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P179)) ) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-020B-ReachabilityCardinality-14 (reachable &!potential( ( ( (tk(P46)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P46)) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 1760204 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16105816 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
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-020B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is ShieldPPPt-PT-020B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r395-oct2-167903719000638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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