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-167903717400702.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 ShieldPPPt-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717400702
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 21:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 21:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 1.9M 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-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679471934635

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=ShieldPPPt-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:58:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 07:58:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:58:57] [INFO ] Load time of PNML (sax parser for PT used): 257 ms
[2023-03-22 07:58:58] [INFO ] Transformed 7803 places.
[2023-03-22 07:58:58] [INFO ] Transformed 7103 transitions.
[2023-03-22 07:58:58] [INFO ] Found NUPN structural information;
[2023-03-22 07:58:58] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 713 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 644 ms. (steps per millisecond=15 ) properties (out of 13) seen :3
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 7103 rows 7803 cols
[2023-03-22 07:58:59] [INFO ] Computed 1101 place invariants in 86 ms
[2023-03-22 07:59:02] [INFO ] After 2743ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 07:59:06] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1555 ms returned sat
[2023-03-22 07:59:22] [INFO ] After 14451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 07:59:27] [INFO ] After 19706ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 07:59:27] [INFO ] After 25090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 3832 ms.
Support contains 112 out of 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions removed 1824 transitions
Trivial Post-agglo rules discarded 1824 transitions
Performed 1824 trivial Post agglomeration. Transition count delta: 1824
Iterating post reduction 0 with 1824 rules applied. Total rules applied 1824 place count 7803 transition count 5279
Reduce places removed 1824 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1826 rules applied. Total rules applied 3650 place count 5979 transition count 5277
Reduce places removed 1 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 2 with 34 rules applied. Total rules applied 3684 place count 5978 transition count 5244
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 3717 place count 5945 transition count 5244
Performed 402 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 402 Pre rules applied. Total rules applied 3717 place count 5945 transition count 4842
Deduced a syphon composed of 402 places in 29 ms
Reduce places removed 402 places and 0 transitions.
Iterating global reduction 4 with 804 rules applied. Total rules applied 4521 place count 5543 transition count 4842
Discarding 679 places :
Symmetric choice reduction at 4 with 679 rule applications. Total rules 5200 place count 4864 transition count 4163
Iterating global reduction 4 with 679 rules applied. Total rules applied 5879 place count 4864 transition count 4163
Performed 281 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 281 Pre rules applied. Total rules applied 5879 place count 4864 transition count 3882
Deduced a syphon composed of 281 places in 19 ms
Reduce places removed 281 places and 0 transitions.
Iterating global reduction 4 with 562 rules applied. Total rules applied 6441 place count 4583 transition count 3882
Performed 1644 Post agglomeration using F-continuation condition.Transition count delta: 1644
Deduced a syphon composed of 1644 places in 39 ms
Reduce places removed 1644 places and 0 transitions.
Iterating global reduction 4 with 3288 rules applied. Total rules applied 9729 place count 2939 transition count 2238
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 13 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9931 place count 2838 transition count 2238
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 9 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10133 place count 2737 transition count 2238
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 78 places in 9 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 10289 place count 2659 transition count 2238
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 10296 place count 2659 transition count 2231
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 10303 place count 2652 transition count 2231
Partial Free-agglomeration rule applied 290 times.
Drop transitions removed 290 transitions
Iterating global reduction 5 with 290 rules applied. Total rules applied 10593 place count 2652 transition count 2231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10594 place count 2651 transition count 2230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10595 place count 2650 transition count 2230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 10595 place count 2650 transition count 2228
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 10599 place count 2648 transition count 2228
Applied a total of 10599 rules in 3894 ms. Remains 2648 /7803 variables (removed 5155) and now considering 2228/7103 (removed 4875) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3895 ms. Remains : 2648/7803 places, 2228/7103 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 44570 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 44570 steps, saw 28867 distinct states, run finished after 3002 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2228 rows 2648 cols
[2023-03-22 07:59:39] [INFO ] Computed 1100 place invariants in 52 ms
[2023-03-22 07:59:40] [INFO ] After 788ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 07:59:41] [INFO ] [Nat]Absence check using 1100 positive place invariants in 301 ms returned sat
[2023-03-22 07:59:45] [INFO ] After 2747ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 07:59:45] [INFO ] State equation strengthened by 275 read => feed constraints.
[2023-03-22 07:59:47] [INFO ] After 2133ms SMT Verify possible using 275 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 07:59:47] [INFO ] Deduced a trap composed of 5 places in 504 ms of which 10 ms to minimize.
[2023-03-22 07:59:48] [INFO ] Deduced a trap composed of 7 places in 483 ms of which 1 ms to minimize.
[2023-03-22 07:59:48] [INFO ] Deduced a trap composed of 7 places in 364 ms of which 13 ms to minimize.
[2023-03-22 07:59:49] [INFO ] Deduced a trap composed of 4 places in 544 ms of which 14 ms to minimize.
[2023-03-22 07:59:50] [INFO ] Deduced a trap composed of 3 places in 369 ms of which 1 ms to minimize.
[2023-03-22 07:59:50] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 1 ms to minimize.
[2023-03-22 07:59:50] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 0 ms to minimize.
[2023-03-22 07:59:51] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 1 ms to minimize.
[2023-03-22 07:59:51] [INFO ] Deduced a trap composed of 6 places in 334 ms of which 0 ms to minimize.
[2023-03-22 07:59:52] [INFO ] Deduced a trap composed of 3 places in 422 ms of which 1 ms to minimize.
[2023-03-22 07:59:52] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 1 ms to minimize.
[2023-03-22 07:59:53] [INFO ] Deduced a trap composed of 3 places in 344 ms of which 1 ms to minimize.
[2023-03-22 07:59:53] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 1 ms to minimize.
[2023-03-22 07:59:53] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 0 ms to minimize.
[2023-03-22 07:59:54] [INFO ] Deduced a trap composed of 6 places in 326 ms of which 1 ms to minimize.
[2023-03-22 07:59:54] [INFO ] Deduced a trap composed of 6 places in 309 ms of which 0 ms to minimize.
[2023-03-22 07:59:55] [INFO ] Deduced a trap composed of 8 places in 355 ms of which 1 ms to minimize.
[2023-03-22 07:59:55] [INFO ] Deduced a trap composed of 6 places in 375 ms of which 1 ms to minimize.
[2023-03-22 07:59:55] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 1 ms to minimize.
[2023-03-22 07:59:56] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 14 ms to minimize.
[2023-03-22 07:59:56] [INFO ] Deduced a trap composed of 8 places in 324 ms of which 0 ms to minimize.
[2023-03-22 07:59:57] [INFO ] Deduced a trap composed of 11 places in 291 ms of which 14 ms to minimize.
[2023-03-22 07:59:57] [INFO ] Deduced a trap composed of 11 places in 278 ms of which 1 ms to minimize.
[2023-03-22 07:59:57] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 10198 ms
[2023-03-22 07:59:58] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 0 ms to minimize.
[2023-03-22 07:59:58] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 1 ms to minimize.
[2023-03-22 07:59:59] [INFO ] Deduced a trap composed of 8 places in 513 ms of which 1 ms to minimize.
[2023-03-22 07:59:59] [INFO ] Deduced a trap composed of 9 places in 498 ms of which 1 ms to minimize.
[2023-03-22 08:00:00] [INFO ] Deduced a trap composed of 6 places in 322 ms of which 1 ms to minimize.
[2023-03-22 08:00:00] [INFO ] Deduced a trap composed of 10 places in 505 ms of which 1 ms to minimize.
[2023-03-22 08:00:01] [INFO ] Deduced a trap composed of 12 places in 454 ms of which 1 ms to minimize.
[2023-03-22 08:00:02] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 1 ms to minimize.
[2023-03-22 08:00:02] [INFO ] Deduced a trap composed of 9 places in 577 ms of which 1 ms to minimize.
[2023-03-22 08:00:03] [INFO ] Deduced a trap composed of 9 places in 537 ms of which 1 ms to minimize.
[2023-03-22 08:00:03] [INFO ] Deduced a trap composed of 9 places in 320 ms of which 15 ms to minimize.
[2023-03-22 08:00:03] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5969 ms
[2023-03-22 08:00:04] [INFO ] Deduced a trap composed of 8 places in 312 ms of which 1 ms to minimize.
[2023-03-22 08:00:05] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2023-03-22 08:00:05] [INFO ] Deduced a trap composed of 8 places in 346 ms of which 1 ms to minimize.
[2023-03-22 08:00:06] [INFO ] Deduced a trap composed of 8 places in 340 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 08:00:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 08:00:06] [INFO ] After 25348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1653 ms.
Support contains 112 out of 2648 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2648/2648 places, 2228/2228 transitions.
Applied a total of 0 rules in 94 ms. Remains 2648 /2648 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 2648/2648 places, 2228/2228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2648/2648 places, 2228/2228 transitions.
Applied a total of 0 rules in 95 ms. Remains 2648 /2648 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2023-03-22 08:00:07] [INFO ] Invariant cache hit.
[2023-03-22 08:00:09] [INFO ] Implicit Places using invariants in 1491 ms returned []
[2023-03-22 08:00:09] [INFO ] Invariant cache hit.
[2023-03-22 08:00:11] [INFO ] State equation strengthened by 275 read => feed constraints.
[2023-03-22 08:00:20] [INFO ] Implicit Places using invariants and state equation in 11127 ms returned [2629, 2633]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12634 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2646/2648 places, 2228/2228 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2644 transition count 2226
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2644 transition count 2226
Applied a total of 4 rules in 236 ms. Remains 2644 /2646 variables (removed 2) and now considering 2226/2228 (removed 2) transitions.
// Phase 1: matrix 2226 rows 2644 cols
[2023-03-22 08:00:20] [INFO ] Computed 1098 place invariants in 8 ms
[2023-03-22 08:00:22] [INFO ] Implicit Places using invariants in 2011 ms returned []
[2023-03-22 08:00:22] [INFO ] Invariant cache hit.
[2023-03-22 08:00:24] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-22 08:00:32] [INFO ] Implicit Places using invariants and state equation in 10119 ms returned []
Implicit Place search using SMT with State Equation took 12160 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2644/2648 places, 2226/2228 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25126 ms. Remains : 2644/2648 places, 2226/2228 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 552 ms. (steps per millisecond=18 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 47143 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47143 steps, saw 30609 distinct states, run finished after 3002 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-22 08:00:37] [INFO ] Invariant cache hit.
[2023-03-22 08:00:38] [INFO ] After 669ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 08:00:39] [INFO ] [Nat]Absence check using 1098 positive place invariants in 316 ms returned sat
[2023-03-22 08:00:43] [INFO ] After 3026ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 08:00:43] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-22 08:00:44] [INFO ] After 1932ms SMT Verify possible using 273 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 08:00:45] [INFO ] Deduced a trap composed of 4 places in 467 ms of which 1 ms to minimize.
[2023-03-22 08:00:46] [INFO ] Deduced a trap composed of 4 places in 482 ms of which 1 ms to minimize.
[2023-03-22 08:00:46] [INFO ] Deduced a trap composed of 5 places in 433 ms of which 1 ms to minimize.
[2023-03-22 08:00:47] [INFO ] Deduced a trap composed of 4 places in 496 ms of which 1 ms to minimize.
[2023-03-22 08:00:47] [INFO ] Deduced a trap composed of 5 places in 510 ms of which 1 ms to minimize.
[2023-03-22 08:00:48] [INFO ] Deduced a trap composed of 7 places in 568 ms of which 1 ms to minimize.
[2023-03-22 08:00:49] [INFO ] Deduced a trap composed of 7 places in 388 ms of which 1 ms to minimize.
[2023-03-22 08:00:49] [INFO ] Deduced a trap composed of 5 places in 466 ms of which 2 ms to minimize.
[2023-03-22 08:00:50] [INFO ] Deduced a trap composed of 7 places in 367 ms of which 0 ms to minimize.
[2023-03-22 08:00:50] [INFO ] Deduced a trap composed of 3 places in 529 ms of which 1 ms to minimize.
[2023-03-22 08:00:51] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 6 ms to minimize.
[2023-03-22 08:00:51] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6188 ms
[2023-03-22 08:00:52] [INFO ] Deduced a trap composed of 5 places in 371 ms of which 1 ms to minimize.
[2023-03-22 08:00:52] [INFO ] Deduced a trap composed of 4 places in 531 ms of which 15 ms to minimize.
[2023-03-22 08:00:53] [INFO ] Deduced a trap composed of 6 places in 355 ms of which 0 ms to minimize.
[2023-03-22 08:00:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1649 ms
[2023-03-22 08:00:53] [INFO ] Deduced a trap composed of 7 places in 393 ms of which 1 ms to minimize.
[2023-03-22 08:00:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 574 ms
[2023-03-22 08:00:55] [INFO ] Deduced a trap composed of 7 places in 1062 ms of which 2 ms to minimize.
[2023-03-22 08:00:56] [INFO ] Deduced a trap composed of 7 places in 1229 ms of which 2 ms to minimize.
[2023-03-22 08:00:58] [INFO ] Deduced a trap composed of 5 places in 1014 ms of which 9 ms to minimize.
[2023-03-22 08:00:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3880 ms
[2023-03-22 08:00:58] [INFO ] After 15878ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 2292 ms.
[2023-03-22 08:01:01] [INFO ] After 22681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 569 ms.
Support contains 112 out of 2644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2644/2644 places, 2226/2226 transitions.
Applied a total of 0 rules in 126 ms. Remains 2644 /2644 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 2644/2644 places, 2226/2226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2644/2644 places, 2226/2226 transitions.
Applied a total of 0 rules in 90 ms. Remains 2644 /2644 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2023-03-22 08:01:02] [INFO ] Invariant cache hit.
[2023-03-22 08:01:03] [INFO ] Implicit Places using invariants in 1861 ms returned []
[2023-03-22 08:01:03] [INFO ] Invariant cache hit.
[2023-03-22 08:01:05] [INFO ] State equation strengthened by 273 read => feed constraints.
[2023-03-22 08:01:14] [INFO ] Implicit Places using invariants and state equation in 10427 ms returned []
Implicit Place search using SMT with State Equation took 12312 ms to find 0 implicit places.
[2023-03-22 08:01:14] [INFO ] Redundant transitions in 164 ms returned []
[2023-03-22 08:01:14] [INFO ] Invariant cache hit.
[2023-03-22 08:01:16] [INFO ] Dead Transitions using invariants and state equation in 1794 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14408 ms. Remains : 2644/2644 places, 2226/2226 transitions.
Partial Free-agglomeration rule applied 564 times.
Drop transitions removed 564 transitions
Iterating global reduction 0 with 564 rules applied. Total rules applied 564 place count 2644 transition count 2226
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 565 place count 2644 transition count 2225
Applied a total of 565 rules in 413 ms. Remains 2644 /2644 variables (removed 0) and now considering 2225/2226 (removed 1) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 2225 rows 2644 cols
[2023-03-22 08:01:16] [INFO ] Computed 1098 place invariants in 16 ms
[2023-03-22 08:01:17] [INFO ] After 806ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 08:01:18] [INFO ] [Nat]Absence check using 1098 positive place invariants in 337 ms returned sat
[2023-03-22 08:01:21] [INFO ] After 2458ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 08:01:21] [INFO ] State equation strengthened by 525 read => feed constraints.
[2023-03-22 08:01:25] [INFO ] After 4161ms SMT Verify possible using 525 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 08:01:26] [INFO ] Deduced a trap composed of 6 places in 736 ms of which 1 ms to minimize.
[2023-03-22 08:01:27] [INFO ] Deduced a trap composed of 5 places in 780 ms of which 2 ms to minimize.
[2023-03-22 08:01:28] [INFO ] Deduced a trap composed of 5 places in 583 ms of which 1 ms to minimize.
[2023-03-22 08:01:29] [INFO ] Deduced a trap composed of 5 places in 611 ms of which 1 ms to minimize.
[2023-03-22 08:01:30] [INFO ] Deduced a trap composed of 6 places in 643 ms of which 1 ms to minimize.
[2023-03-22 08:01:30] [INFO ] Deduced a trap composed of 5 places in 687 ms of which 2 ms to minimize.
[2023-03-22 08:01:31] [INFO ] Deduced a trap composed of 5 places in 686 ms of which 14 ms to minimize.
[2023-03-22 08:01:32] [INFO ] Deduced a trap composed of 7 places in 646 ms of which 16 ms to minimize.
[2023-03-22 08:01:33] [INFO ] Deduced a trap composed of 7 places in 656 ms of which 1 ms to minimize.
[2023-03-22 08:01:33] [INFO ] Deduced a trap composed of 5 places in 706 ms of which 5 ms to minimize.
[2023-03-22 08:01:34] [INFO ] Deduced a trap composed of 4 places in 811 ms of which 30 ms to minimize.
[2023-03-22 08:01:35] [INFO ] Deduced a trap composed of 6 places in 667 ms of which 18 ms to minimize.
[2023-03-22 08:01:36] [INFO ] Deduced a trap composed of 5 places in 664 ms of which 1 ms to minimize.
[2023-03-22 08:01:37] [INFO ] Deduced a trap composed of 13 places in 567 ms of which 1 ms to minimize.
[2023-03-22 08:01:37] [INFO ] Deduced a trap composed of 6 places in 497 ms of which 1 ms to minimize.
[2023-03-22 08:01:38] [INFO ] Deduced a trap composed of 7 places in 590 ms of which 2 ms to minimize.
[2023-03-22 08:01:39] [INFO ] Deduced a trap composed of 12 places in 686 ms of which 2 ms to minimize.
[2023-03-22 08:01:39] [INFO ] Deduced a trap composed of 8 places in 635 ms of which 1 ms to minimize.
[2023-03-22 08:01:40] [INFO ] Deduced a trap composed of 6 places in 615 ms of which 1 ms to minimize.
[2023-03-22 08:01:41] [INFO ] Deduced a trap composed of 12 places in 527 ms of which 1 ms to minimize.
[2023-03-22 08:01:42] [INFO ] Deduced a trap composed of 10 places in 513 ms of which 1 ms to minimize.
[2023-03-22 08:01:42] [INFO ] Deduced a trap composed of 8 places in 554 ms of which 1 ms to minimize.
[2023-03-22 08:01:43] [INFO ] Deduced a trap composed of 6 places in 746 ms of which 2 ms to minimize.
[2023-03-22 08:01:43] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 17572 ms
[2023-03-22 08:01:44] [INFO ] Deduced a trap composed of 6 places in 635 ms of which 1 ms to minimize.
[2023-03-22 08:01:45] [INFO ] Deduced a trap composed of 9 places in 597 ms of which 1 ms to minimize.
[2023-03-22 08:01:46] [INFO ] Deduced a trap composed of 10 places in 561 ms of which 1 ms to minimize.
[2023-03-22 08:01:47] [INFO ] Deduced a trap composed of 7 places in 506 ms of which 1 ms to minimize.
[2023-03-22 08:01:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2977 ms
[2023-03-22 08:01:48] [INFO ] Deduced a trap composed of 5 places in 468 ms of which 1 ms to minimize.
[2023-03-22 08:01:48] [INFO ] Deduced a trap composed of 8 places in 530 ms of which 1 ms to minimize.
[2023-03-22 08:01:49] [INFO ] Deduced a trap composed of 5 places in 497 ms of which 1 ms to minimize.
[2023-03-22 08:01:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1904 ms
[2023-03-22 08:01:50] [INFO ] Deduced a trap composed of 5 places in 496 ms of which 1 ms to minimize.
[2023-03-22 08:01:50] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 1 ms to minimize.
[2023-03-22 08:01:51] [INFO ] Deduced a trap composed of 5 places in 440 ms of which 1 ms to minimize.
[2023-03-22 08:01:51] [INFO ] Deduced a trap composed of 7 places in 599 ms of which 2 ms to minimize.
[2023-03-22 08:01:52] [INFO ] Deduced a trap composed of 5 places in 575 ms of which 1 ms to minimize.
[2023-03-22 08:01:53] [INFO ] Deduced a trap composed of 6 places in 409 ms of which 1 ms to minimize.
[2023-03-22 08:01:53] [INFO ] Deduced a trap composed of 10 places in 570 ms of which 1 ms to minimize.
[2023-03-22 08:01:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4403 ms
[2023-03-22 08:01:57] [INFO ] Deduced a trap composed of 4 places in 580 ms of which 1 ms to minimize.
[2023-03-22 08:01:58] [INFO ] Deduced a trap composed of 6 places in 715 ms of which 1 ms to minimize.
[2023-03-22 08:01:59] [INFO ] Deduced a trap composed of 5 places in 570 ms of which 1 ms to minimize.
[2023-03-22 08:01:59] [INFO ] Deduced a trap composed of 5 places in 469 ms of which 1 ms to minimize.
[2023-03-22 08:02:00] [INFO ] Deduced a trap composed of 6 places in 586 ms of which 1 ms to minimize.
[2023-03-22 08:02:01] [INFO ] Deduced a trap composed of 9 places in 566 ms of which 2 ms to minimize.
[2023-03-22 08:02:02] [INFO ] Deduced a trap composed of 9 places in 662 ms of which 1 ms to minimize.
[2023-03-22 08:02:02] [INFO ] Deduced a trap composed of 5 places in 513 ms of which 1 ms to minimize.
[2023-03-22 08:02:03] [INFO ] Deduced a trap composed of 7 places in 610 ms of which 2 ms to minimize.
[2023-03-22 08:02:04] [INFO ] Deduced a trap composed of 9 places in 568 ms of which 1 ms to minimize.
[2023-03-22 08:02:04] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 7222 ms
[2023-03-22 08:02:04] [INFO ] After 42968ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 6970 ms.
[2023-03-22 08:02:11] [INFO ] After 54094ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-22 08:02:11] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-22 08:02:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2644 places, 2226 transitions and 9712 arcs took 11 ms.
[2023-03-22 08:02:12] [INFO ] Flatten gal took : 304 ms
Total runtime 195167 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/848/inv_0_ --invariant=/tmp/848/inv_1_ --invariant=/tmp/848/inv_2_ --invariant=/tmp/848/inv_3_ --invariant=/tmp/848/inv_4_ --invariant=/tmp/848/inv_5_ --invariant=/tmp/848/inv_6_ --invariant=/tmp/848/inv_7_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 8329936 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16091468 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="ShieldPPPt-PT-100B"
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 ShieldPPPt-PT-100B, 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-167903717400702"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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