Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977700110.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977700110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 18:19 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.6K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 244K 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 ShieldRVs-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVs-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679298796864

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=ShieldRVs-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 07:53:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 07:53:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 07:53:18] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2023-03-20 07:53:18] [INFO ] Transformed 803 places.
[2023-03-20 07:53:19] [INFO ] Transformed 903 transitions.
[2023-03-20 07:53:19] [INFO ] Found NUPN structural information;
[2023-03-20 07:53:19] [INFO ] Parsed PT model containing 803 places and 903 transitions and 2880 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 11 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 15) seen :8
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 903 rows 803 cols
[2023-03-20 07:53:19] [INFO ] Computed 81 place invariants in 21 ms
[2023-03-20 07:53:20] [INFO ] [Real]Absence check using 81 positive place invariants in 24 ms returned sat
[2023-03-20 07:53:20] [INFO ] After 614ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 07:53:20] [INFO ] [Nat]Absence check using 81 positive place invariants in 23 ms returned sat
[2023-03-20 07:53:22] [INFO ] After 1107ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-20 07:53:22] [INFO ] Deduced a trap composed of 22 places in 348 ms of which 6 ms to minimize.
[2023-03-20 07:53:22] [INFO ] Deduced a trap composed of 34 places in 264 ms of which 1 ms to minimize.
[2023-03-20 07:53:23] [INFO ] Deduced a trap composed of 51 places in 259 ms of which 1 ms to minimize.
[2023-03-20 07:53:23] [INFO ] Deduced a trap composed of 52 places in 245 ms of which 2 ms to minimize.
[2023-03-20 07:53:23] [INFO ] Deduced a trap composed of 28 places in 218 ms of which 14 ms to minimize.
[2023-03-20 07:53:23] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 1 ms to minimize.
[2023-03-20 07:53:24] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 1 ms to minimize.
[2023-03-20 07:53:24] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 6 ms to minimize.
[2023-03-20 07:53:24] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 0 ms to minimize.
[2023-03-20 07:53:24] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 0 ms to minimize.
[2023-03-20 07:53:25] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 1 ms to minimize.
[2023-03-20 07:53:25] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 1 ms to minimize.
[2023-03-20 07:53:25] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
[2023-03-20 07:53:25] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 1 ms to minimize.
[2023-03-20 07:53:25] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 0 ms to minimize.
[2023-03-20 07:53:25] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 0 ms to minimize.
[2023-03-20 07:53:26] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 1 ms to minimize.
[2023-03-20 07:53:26] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 0 ms to minimize.
[2023-03-20 07:53:26] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 1 ms to minimize.
[2023-03-20 07:53:26] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 0 ms to minimize.
[2023-03-20 07:53:26] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 0 ms to minimize.
[2023-03-20 07:53:27] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 13 ms to minimize.
[2023-03-20 07:53:27] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 1 ms to minimize.
[2023-03-20 07:53:27] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 0 ms to minimize.
[2023-03-20 07:53:27] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 1 ms to minimize.
[2023-03-20 07:53:27] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 1 ms to minimize.
[2023-03-20 07:53:27] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 13 ms to minimize.
[2023-03-20 07:53:28] [INFO ] Deduced a trap composed of 37 places in 167 ms of which 0 ms to minimize.
[2023-03-20 07:53:28] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 0 ms to minimize.
[2023-03-20 07:53:28] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 1 ms to minimize.
[2023-03-20 07:53:28] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 0 ms to minimize.
[2023-03-20 07:53:28] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 1 ms to minimize.
[2023-03-20 07:53:29] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 1 ms to minimize.
[2023-03-20 07:53:29] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 1 ms to minimize.
[2023-03-20 07:53:29] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 15 ms to minimize.
[2023-03-20 07:53:29] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 0 ms to minimize.
[2023-03-20 07:53:29] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 0 ms to minimize.
[2023-03-20 07:53:30] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 0 ms to minimize.
[2023-03-20 07:53:30] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 0 ms to minimize.
[2023-03-20 07:53:30] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 2 ms to minimize.
[2023-03-20 07:53:30] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 1 ms to minimize.
[2023-03-20 07:53:30] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 0 ms to minimize.
[2023-03-20 07:53:31] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 1 ms to minimize.
[2023-03-20 07:53:31] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 1 ms to minimize.
[2023-03-20 07:53:31] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 0 ms to minimize.
[2023-03-20 07:53:31] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 0 ms to minimize.
[2023-03-20 07:53:31] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 1 ms to minimize.
[2023-03-20 07:53:32] [INFO ] Deduced a trap composed of 32 places in 157 ms of which 0 ms to minimize.
[2023-03-20 07:53:32] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 1 ms to minimize.
[2023-03-20 07:53:32] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 1 ms to minimize.
[2023-03-20 07:53:32] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 2 ms to minimize.
[2023-03-20 07:53:32] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 1 ms to minimize.
[2023-03-20 07:53:33] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 1 ms to minimize.
[2023-03-20 07:53:33] [INFO ] Deduced a trap composed of 38 places in 144 ms of which 0 ms to minimize.
[2023-03-20 07:53:33] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 1 ms to minimize.
[2023-03-20 07:53:33] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 8 ms to minimize.
[2023-03-20 07:53:33] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 1 ms to minimize.
[2023-03-20 07:53:33] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 2 ms to minimize.
[2023-03-20 07:53:34] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 1 ms to minimize.
[2023-03-20 07:53:34] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 1 ms to minimize.
[2023-03-20 07:53:34] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 1 ms to minimize.
[2023-03-20 07:53:34] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 0 ms to minimize.
[2023-03-20 07:53:34] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 0 ms to minimize.
[2023-03-20 07:53:34] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2023-03-20 07:53:35] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2023-03-20 07:53:35] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 0 ms to minimize.
[2023-03-20 07:53:35] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 1 ms to minimize.
[2023-03-20 07:53:35] [INFO ] Trap strengthening (SAT) tested/added 68/67 trap constraints in 13127 ms
[2023-03-20 07:53:35] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 4 ms to minimize.
[2023-03-20 07:53:36] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 2 ms to minimize.
[2023-03-20 07:53:36] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 1 ms to minimize.
[2023-03-20 07:53:36] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 0 ms to minimize.
[2023-03-20 07:53:36] [INFO ] Deduced a trap composed of 60 places in 180 ms of which 0 ms to minimize.
[2023-03-20 07:53:36] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 1 ms to minimize.
[2023-03-20 07:53:37] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 1 ms to minimize.
[2023-03-20 07:53:37] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2023-03-20 07:53:37] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2023-03-20 07:53:37] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 1 ms to minimize.
[2023-03-20 07:53:37] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 0 ms to minimize.
[2023-03-20 07:53:37] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 1 ms to minimize.
[2023-03-20 07:53:38] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
[2023-03-20 07:53:38] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 0 ms to minimize.
[2023-03-20 07:53:38] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 0 ms to minimize.
[2023-03-20 07:53:38] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 1 ms to minimize.
[2023-03-20 07:53:38] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 1 ms to minimize.
[2023-03-20 07:53:38] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 0 ms to minimize.
[2023-03-20 07:53:39] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2023-03-20 07:53:39] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 0 ms to minimize.
[2023-03-20 07:53:39] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 1 ms to minimize.
[2023-03-20 07:53:39] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 0 ms to minimize.
[2023-03-20 07:53:39] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 0 ms to minimize.
[2023-03-20 07:53:40] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 0 ms to minimize.
[2023-03-20 07:53:40] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 1 ms to minimize.
[2023-03-20 07:53:40] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 0 ms to minimize.
[2023-03-20 07:53:40] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 1 ms to minimize.
[2023-03-20 07:53:40] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 1 ms to minimize.
[2023-03-20 07:53:41] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 1 ms to minimize.
[2023-03-20 07:53:41] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 0 ms to minimize.
[2023-03-20 07:53:41] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 1 ms to minimize.
[2023-03-20 07:53:41] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 0 ms to minimize.
[2023-03-20 07:53:41] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 0 ms to minimize.
[2023-03-20 07:53:41] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 1 ms to minimize.
[2023-03-20 07:53:42] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 1 ms to minimize.
[2023-03-20 07:53:42] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 0 ms to minimize.
[2023-03-20 07:53:42] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 0 ms to minimize.
[2023-03-20 07:53:42] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 1 ms to minimize.
[2023-03-20 07:53:42] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 0 ms to minimize.
[2023-03-20 07:53:43] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 0 ms to minimize.
[2023-03-20 07:53:43] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 0 ms to minimize.
[2023-03-20 07:53:43] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 0 ms to minimize.
[2023-03-20 07:53:43] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2023-03-20 07:53:43] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 8200 ms
[2023-03-20 07:53:44] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 1 ms to minimize.
[2023-03-20 07:53:44] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 1 ms to minimize.
[2023-03-20 07:53:44] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 1 ms to minimize.
[2023-03-20 07:53:44] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 1 ms to minimize.
[2023-03-20 07:53:44] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 1 ms to minimize.
[2023-03-20 07:53:45] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 1 ms to minimize.
[2023-03-20 07:53:45] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 1 ms to minimize.
[2023-03-20 07:53:45] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 1 ms to minimize.
[2023-03-20 07:53:45] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 07:53:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 07:53:45] [INFO ] After 25136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 162 ms.
Support contains 116 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 903/903 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 803 transition count 848
Reduce places removed 55 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 59 rules applied. Total rules applied 114 place count 748 transition count 844
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 118 place count 744 transition count 844
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 118 place count 744 transition count 758
Deduced a syphon composed of 86 places in 2 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 290 place count 658 transition count 758
Discarding 103 places :
Symmetric choice reduction at 3 with 103 rule applications. Total rules 393 place count 555 transition count 655
Iterating global reduction 3 with 103 rules applied. Total rules applied 496 place count 555 transition count 655
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 496 place count 555 transition count 621
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 564 place count 521 transition count 621
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 772 place count 417 transition count 517
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 795 place count 417 transition count 517
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 796 place count 416 transition count 516
Applied a total of 796 rules in 177 ms. Remains 416 /803 variables (removed 387) and now considering 516/903 (removed 387) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 416/803 places, 516/903 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 6) seen :2
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 516 rows 416 cols
[2023-03-20 07:53:46] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-20 07:53:46] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 07:53:46] [INFO ] [Nat]Absence check using 81 positive place invariants in 12 ms returned sat
[2023-03-20 07:53:46] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 07:53:47] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 0 ms to minimize.
[2023-03-20 07:53:47] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2023-03-20 07:53:47] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2023-03-20 07:53:47] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 9 ms to minimize.
[2023-03-20 07:53:47] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2023-03-20 07:53:47] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2023-03-20 07:53:47] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2023-03-20 07:53:47] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2023-03-20 07:53:47] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2023-03-20 07:53:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 854 ms
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2023-03-20 07:53:48] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 773 ms
[2023-03-20 07:53:48] [INFO ] After 2018ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-20 07:53:48] [INFO ] After 2207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 59 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 516/516 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 416 transition count 505
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 405 transition count 504
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 404 transition count 504
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 24 place count 404 transition count 489
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 54 place count 389 transition count 489
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 56 place count 387 transition count 487
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 387 transition count 487
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 387 transition count 486
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 386 transition count 486
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 136 place count 348 transition count 448
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 148 place count 348 transition count 448
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 347 transition count 447
Applied a total of 149 rules in 96 ms. Remains 347 /416 variables (removed 69) and now considering 447/516 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 347/416 places, 447/516 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
FORMULA ShieldRVs-PT-020B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 447 rows 347 cols
[2023-03-20 07:53:49] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-20 07:53:49] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:53:49] [INFO ] [Nat]Absence check using 81 positive place invariants in 12 ms returned sat
[2023-03-20 07:53:49] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:53:49] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2023-03-20 07:53:49] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2023-03-20 07:53:50] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2023-03-20 07:53:50] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2023-03-20 07:53:50] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-20 07:53:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 516 ms
[2023-03-20 07:53:50] [INFO ] After 886ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-20 07:53:50] [INFO ] After 1087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 40 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 447/447 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 347 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 346 transition count 446
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 346 transition count 443
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 343 transition count 443
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 342 transition count 442
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 342 transition count 442
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 38 place count 328 transition count 428
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 328 transition count 428
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 327 transition count 427
Applied a total of 43 rules in 82 ms. Remains 327 /347 variables (removed 20) and now considering 427/447 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 327/347 places, 427/447 transitions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 827145 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :{}
Probabilistic random walk after 827145 steps, saw 147231 distinct states, run finished after 3002 ms. (steps per millisecond=275 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 427 rows 327 cols
[2023-03-20 07:53:53] [INFO ] Computed 81 place invariants in 9 ms
[2023-03-20 07:53:53] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:53:53] [INFO ] [Nat]Absence check using 81 positive place invariants in 12 ms returned sat
[2023-03-20 07:53:53] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:53:54] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2023-03-20 07:53:54] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2023-03-20 07:53:54] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2023-03-20 07:53:54] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2023-03-20 07:53:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 487 ms
[2023-03-20 07:53:54] [INFO ] After 761ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-20 07:53:54] [INFO ] After 954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 40 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 427/427 transitions.
Applied a total of 0 rules in 9 ms. Remains 327 /327 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 327/327 places, 427/427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 427/427 transitions.
Applied a total of 0 rules in 8 ms. Remains 327 /327 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2023-03-20 07:53:54] [INFO ] Invariant cache hit.
[2023-03-20 07:53:55] [INFO ] Implicit Places using invariants in 1290 ms returned []
[2023-03-20 07:53:55] [INFO ] Invariant cache hit.
[2023-03-20 07:53:56] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 1739 ms to find 0 implicit places.
[2023-03-20 07:53:56] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-20 07:53:56] [INFO ] Invariant cache hit.
[2023-03-20 07:53:56] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2136 ms. Remains : 327/327 places, 427/427 transitions.
Applied a total of 0 rules in 9 ms. Remains 327 /327 variables (removed 0) and now considering 427/427 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 07:53:56] [INFO ] Invariant cache hit.
[2023-03-20 07:53:56] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:53:56] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-20 07:53:57] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:53:57] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2023-03-20 07:53:57] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2023-03-20 07:53:57] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2023-03-20 07:53:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 330 ms
[2023-03-20 07:53:57] [INFO ] After 577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-20 07:53:57] [INFO ] After 739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 07:53:57] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-20 07:53:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 327 places, 427 transitions and 1968 arcs took 3 ms.
[2023-03-20 07:53:58] [INFO ] Flatten gal took : 139 ms
Total runtime 39383 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/976/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 623824 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098232 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="ShieldRVs-PT-020B"
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 ShieldRVs-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 r425-tajo-167905977700110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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