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-167903718400166.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 ShieldIIPs-PT-100A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718400166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 868K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679557454786

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=ShieldIIPs-PT-100A
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:44:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 07:44:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:44:18] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2023-03-23 07:44:18] [INFO ] Transformed 2503 places.
[2023-03-23 07:44:18] [INFO ] Transformed 2403 transitions.
[2023-03-23 07:44:18] [INFO ] Found NUPN structural information;
[2023-03-23 07:44:18] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 528 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 685 ms. (steps per millisecond=14 ) properties (out of 14) seen :8
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-23 07:44:20] [INFO ] Computed 901 place invariants in 71 ms
[2023-03-23 07:44:22] [INFO ] After 1469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 07:44:23] [INFO ] [Nat]Absence check using 901 positive place invariants in 645 ms returned sat
[2023-03-23 07:44:47] [INFO ] After 23054ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 07:44:47] [INFO ] After 23063ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-23 07:44:47] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 811 ms.
Support contains 89 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 30 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 31 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 645 times.
Drop transitions removed 645 transitions
Iterating global reduction 0 with 645 rules applied. Total rules applied 649 place count 2501 transition count 2401
Applied a total of 649 rules in 710 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 711 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 626 ms. (steps per millisecond=15 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 83219 steps, run timeout after 6001 ms. (steps per millisecond=13 ) properties seen :{0=1}
Probabilistic random walk after 83219 steps, saw 79879 distinct states, run finished after 6002 ms. (steps per millisecond=13 ) properties seen :1
FORMULA ShieldIIPs-PT-100A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-23 07:44:56] [INFO ] Computed 901 place invariants in 70 ms
[2023-03-23 07:44:58] [INFO ] [Real]Absence check using 886 positive place invariants in 384 ms returned sat
[2023-03-23 07:44:58] [INFO ] [Real]Absence check using 886 positive and 15 generalized place invariants in 9 ms returned sat
[2023-03-23 07:44:58] [INFO ] After 1484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 07:44:59] [INFO ] [Nat]Absence check using 886 positive place invariants in 560 ms returned sat
[2023-03-23 07:44:59] [INFO ] [Nat]Absence check using 886 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-23 07:45:23] [INFO ] After 23371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 07:45:23] [INFO ] State equation strengthened by 4 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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 07:45:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:45:23] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1033 ms.
Support contains 53 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 21 place count 2501 transition count 2401
Applied a total of 21 rules in 203 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 55534 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55534 steps, saw 53387 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-23 07:45:29] [INFO ] Computed 901 place invariants in 60 ms
[2023-03-23 07:45:30] [INFO ] [Real]Absence check using 891 positive place invariants in 253 ms returned sat
[2023-03-23 07:45:30] [INFO ] [Real]Absence check using 891 positive and 10 generalized place invariants in 3 ms returned sat
[2023-03-23 07:45:30] [INFO ] After 1240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 07:45:31] [INFO ] [Nat]Absence check using 891 positive place invariants in 265 ms returned sat
[2023-03-23 07:45:31] [INFO ] [Nat]Absence check using 891 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-23 07:45:55] [INFO ] After 23695ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 07:45:55] [INFO ] State equation strengthened by 4 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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 07:45:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:45:55] [INFO ] After 25063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1046 ms.
Support contains 53 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 94 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 91 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-23 07:45:56] [INFO ] Invariant cache hit.
[2023-03-23 07:45:59] [INFO ] Implicit Places using invariants in 2626 ms returned []
[2023-03-23 07:45:59] [INFO ] Invariant cache hit.
[2023-03-23 07:46:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 07:46:08] [INFO ] Implicit Places using invariants and state equation in 8772 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11425 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 130 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11647 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 48331 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 48331 steps, saw 46428 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-23 07:46:12] [INFO ] Computed 900 place invariants in 18 ms
[2023-03-23 07:46:13] [INFO ] [Real]Absence check using 890 positive place invariants in 262 ms returned sat
[2023-03-23 07:46:13] [INFO ] [Real]Absence check using 890 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-23 07:46:13] [INFO ] After 1001ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 07:46:15] [INFO ] [Nat]Absence check using 890 positive place invariants in 540 ms returned sat
[2023-03-23 07:46:15] [INFO ] [Nat]Absence check using 890 positive and 10 generalized place invariants in 4 ms returned sat
[2023-03-23 07:46:38] [INFO ] After 23297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 07:46:38] [INFO ] After 23322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-23 07:46:38] [INFO ] After 25063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 402 ms.
Support contains 53 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 107 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 88 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-23 07:46:39] [INFO ] Invariant cache hit.
[2023-03-23 07:46:41] [INFO ] Implicit Places using invariants in 1839 ms returned []
[2023-03-23 07:46:41] [INFO ] Invariant cache hit.
[2023-03-23 07:46:48] [INFO ] Implicit Places using invariants and state equation in 7245 ms returned []
Implicit Place search using SMT with State Equation took 9091 ms to find 0 implicit places.
[2023-03-23 07:46:48] [INFO ] Redundant transitions in 263 ms returned []
[2023-03-23 07:46:48] [INFO ] Invariant cache hit.
[2023-03-23 07:46:51] [INFO ] Dead Transitions using invariants and state equation in 2673 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12140 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 87 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-23 07:46:51] [INFO ] Invariant cache hit.
[2023-03-23 07:46:52] [INFO ] [Real]Absence check using 890 positive place invariants in 358 ms returned sat
[2023-03-23 07:46:52] [INFO ] [Real]Absence check using 890 positive and 10 generalized place invariants in 7 ms returned sat
[2023-03-23 07:46:52] [INFO ] After 1296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 07:46:53] [INFO ] [Nat]Absence check using 890 positive place invariants in 202 ms returned sat
[2023-03-23 07:46:53] [INFO ] [Nat]Absence check using 890 positive and 10 generalized place invariants in 3 ms returned sat
[2023-03-23 07:47:25] [INFO ] After 31486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 07:47:30] [INFO ] Deduced a trap composed of 5 places in 427 ms of which 6 ms to minimize.
[2023-03-23 07:47:30] [INFO ] Deduced a trap composed of 6 places in 438 ms of which 2 ms to minimize.
[2023-03-23 07:47:32] [INFO ] Deduced a trap composed of 12 places in 616 ms of which 1 ms to minimize.
[2023-03-23 07:47:33] [INFO ] Deduced a trap composed of 15 places in 315 ms of which 2 ms to minimize.
[2023-03-23 07:47:33] [INFO ] Deduced a trap composed of 5 places in 380 ms of which 14 ms to minimize.
[2023-03-23 07:47:34] [INFO ] Deduced a trap composed of 6 places in 343 ms of which 21 ms to minimize.
[2023-03-23 07:47:34] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 1 ms to minimize.
[2023-03-23 07:47:34] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 0 ms to minimize.
[2023-03-23 07:47:36] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 0 ms to minimize.
[2023-03-23 07:47:37] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 1 ms to minimize.
[2023-03-23 07:47:38] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 1 ms to minimize.
[2023-03-23 07:47:38] [INFO ] Deduced a trap composed of 5 places in 377 ms of which 2 ms to minimize.
[2023-03-23 07:47:39] [INFO ] Deduced a trap composed of 5 places in 605 ms of which 1 ms to minimize.
[2023-03-23 07:47:39] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2023-03-23 07:47:39] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2023-03-23 07:47:40] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 0 ms to minimize.
[2023-03-23 07:47:40] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
[2023-03-23 07:47:40] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2023-03-23 07:47:41] [INFO ] Deduced a trap composed of 5 places in 382 ms of which 1 ms to minimize.
[2023-03-23 07:47:42] [INFO ] Deduced a trap composed of 6 places in 1263 ms of which 1 ms to minimize.
[2023-03-23 07:47:43] [INFO ] Deduced a trap composed of 5 places in 882 ms of which 22 ms to minimize.
[2023-03-23 07:47:43] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 13 ms to minimize.
[2023-03-23 07:47:44] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 14552 ms
[2023-03-23 07:47:53] [INFO ] Deduced a trap composed of 19 places in 311 ms of which 1 ms to minimize.
[2023-03-23 07:47:53] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 1 ms to minimize.
[2023-03-23 07:47:54] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 0 ms to minimize.
[2023-03-23 07:47:55] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 0 ms to minimize.
[2023-03-23 07:47:55] [INFO ] Deduced a trap composed of 5 places in 596 ms of which 0 ms to minimize.
[2023-03-23 07:47:56] [INFO ] Deduced a trap composed of 6 places in 387 ms of which 1 ms to minimize.
[2023-03-23 07:47:56] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 0 ms to minimize.
[2023-03-23 07:47:57] [INFO ] Deduced a trap composed of 5 places in 367 ms of which 1 ms to minimize.
[2023-03-23 07:47:57] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2023-03-23 07:47:57] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 22 ms to minimize.
[2023-03-23 07:47:58] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2023-03-23 07:47:58] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2023-03-23 07:47:58] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2023-03-23 07:47:58] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 1 ms to minimize.
[2023-03-23 07:47:59] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 0 ms to minimize.
[2023-03-23 07:47:59] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
[2023-03-23 07:48:00] [INFO ] Deduced a trap composed of 6 places in 426 ms of which 1 ms to minimize.
[2023-03-23 07:48:03] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 12 ms to minimize.
[2023-03-23 07:48:03] [INFO ] Deduced a trap composed of 5 places in 473 ms of which 6 ms to minimize.
[2023-03-23 07:48:04] [INFO ] Deduced a trap composed of 6 places in 344 ms of which 1 ms to minimize.
[2023-03-23 07:48:04] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 2 ms to minimize.
[2023-03-23 07:48:05] [INFO ] Deduced a trap composed of 7 places in 464 ms of which 1 ms to minimize.
[2023-03-23 07:48:05] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
[2023-03-23 07:48:05] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
[2023-03-23 07:48:06] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2023-03-23 07:48:06] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2023-03-23 07:48:06] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
[2023-03-23 07:48:07] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 0 ms to minimize.
[2023-03-23 07:48:07] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 13 ms to minimize.
[2023-03-23 07:48:07] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2023-03-23 07:48:08] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2023-03-23 07:48:08] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2023-03-23 07:48:08] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 0 ms to minimize.
[2023-03-23 07:48:09] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 1 ms to minimize.
[2023-03-23 07:48:09] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 16506 ms
[2023-03-23 07:48:09] [INFO ] After 75307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 397 ms.
[2023-03-23 07:48:09] [INFO ] After 76764ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 07:48:09] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 27 ms.
[2023-03-23 07:48:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2401 transitions and 12212 arcs took 30 ms.
[2023-03-23 07:48:10] [INFO ] Flatten gal took : 563 ms
Total runtime 232919 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (PT), instance 100A
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: 2500 places, 2401 transitions, 12212 arcs.
Final Score: 2232807.608
Took : 27 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldIIPs-PT-100A-ReachabilityCardinality-03 (reachable & potential(( ( (tk(P67)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P67)) ) )))
PROPERTY: ShieldIIPs-PT-100A-ReachabilityCardinality-05 (reachable & potential(( ( ( ( ( (tk(P1166)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1166)) ) ) & ( ( (tk(P1919)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1919)) ) ) ) & ( ( ( ( (tk(P1635)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1635)) ) ) | ( ( (tk(P606)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P606)) ) ) ) & ( ( ( (tk(P1488)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1488)) ) ) | ( ( (tk(P1315)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1315)) ) ) ) ) ) & ( ( ( ( ( (tk(P408)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P408)) ) ) | ( ( (tk(P855)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P855)) ) ) ) & ( ( ( (tk(P898)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P898)) ) ) | ( ( ( (tk(P1543)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1543)) ) ) & ( ( (tk(P1624)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1624)) ) ) ) ) ) & ( ( ( ( (tk(P2470)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2470)) ) ) | ( ( ( ( ( (tk(P385)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P385)) ) ) & ( ( (tk(P1692)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1692)) ) ) ) & ( ( ( (tk(P1041)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1041)) ) ) & ( ( (tk(P2294)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2294)) ) ) ) ) & ( ( ( ( (tk(P468)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P468)) ) ) & ( ( (tk(P1902)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1902)) ) ) ) & ( ( ( (tk(P1279)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1279)) ) ) & ( ( ( ( (tk(P1474)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1474)) ) ) | ( ( (tk(P930)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P930)) ) ) ) & ( ( ( ( (tk(P2212)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2212)) ) ) | ( ( (tk(P210)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P210)) ) ) ) | ( ( ( (tk(P302)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P302)) ) ) | ( ( (tk(P846)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P846)) ) ) ) ) ) ) ) ) ) & ( ( ( ( (tk(P1914)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1914)) ) ) & ( ( (tk(P571)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P571)) ) ) ) | ( ( ( (tk(P2054)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2054)) ) ) & ( ( (tk(P456)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P456)) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPs-PT-100A-ReachabilityCardinality-07 (reachable &!potential( ( ( ( ( (tk(P1813)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1813)) ) ) | ( ( ( (tk(P1988)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1988)) ) ) & ( ( (tk(P606)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P606)) ) ) ) ) | ( ( ( ( (tk(P1494)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1494)) ) ) & ( ( (tk(P2033)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2033)) ) ) ) | ( ( ( (tk(P712)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P712)) ) ) & ( ( ( ( (tk(P1634)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1634)) ) ) | ( ( (tk(P1029)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1029)) ) ) ) | ( ( ( (tk(P2083)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2083)) ) ) | ( ( ( (tk(P1258)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1258)) ) ) | ( ( ( (tk(P1724)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1724)) ) ) & ( ( ( (tk(P1283)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1283)) ) ) & ( ( (tk(P212)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P212)) ) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldIIPs-PT-100A-ReachabilityCardinality-09 (reachable &!potential( ( ( ( ( (tk(P1336)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1336)) ) ) | ( ( (tk(P1735)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1735)) ) ) ) | ( ( ( (tk(P163)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P163)) ) ) | ( ( ( ( (tk(P2373)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2373)) ) ) & ( ( (tk(P1296)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1296)) ) ) ) & ( ( ( (tk(P2167)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2167)) ) ) & ( ( (tk(P1156)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1156)) ) ) ) ) ) )))
PROPERTY: ShieldIIPs-PT-100A-ReachabilityCardinality-14 (reachable & potential(( ( ( ( (tk(P771)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P771)) ) ) & ( ( (tk(P2236)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P2236)) ) ) ) & ( ( ( (tk(P986)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P986)) ) ) & ( ( (tk(P31)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P31)) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 14912124 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16100208 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ShieldIIPs-PT-100A"
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 ShieldIIPs-PT-100A, 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-167903718400166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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