About the Execution of Marcie+red for ShieldIIPs-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6906.384 | 3600000.00 | 3704159.00 | 149.80 | [undef] | Time out reached |
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.r394-oct2-167903717500146.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 marciexred
Input is ShieldIIPs-PT-050A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717500146
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:34 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.8K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:48 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 426K 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-050A-CTLFireability-00
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-01
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-02
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-03
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-04
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-05
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-06
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-07
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-08
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-09
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-10
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-11
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-12
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-13
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-14
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679493973271
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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 14:06:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 14:06:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:06:16] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2023-03-22 14:06:16] [INFO ] Transformed 1253 places.
[2023-03-22 14:06:16] [INFO ] Transformed 1203 transitions.
[2023-03-22 14:06:16] [INFO ] Found NUPN structural information;
[2023-03-22 14:06:16] [INFO ] Parsed PT model containing 1253 places and 1203 transitions and 5406 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 172 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 83 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2023-03-22 14:06:16] [INFO ] Computed 451 place invariants in 15 ms
[2023-03-22 14:06:17] [INFO ] Implicit Places using invariants in 1540 ms returned []
[2023-03-22 14:06:17] [INFO ] Invariant cache hit.
[2023-03-22 14:06:19] [INFO ] Implicit Places using invariants and state equation in 2073 ms returned []
Implicit Place search using SMT with State Equation took 3688 ms to find 0 implicit places.
[2023-03-22 14:06:19] [INFO ] Invariant cache hit.
[2023-03-22 14:06:20] [INFO ] Dead Transitions using invariants and state equation in 993 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4771 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Support contains 172 out of 1253 places after structural reductions.
[2023-03-22 14:06:21] [INFO ] Flatten gal took : 176 ms
[2023-03-22 14:06:21] [INFO ] Flatten gal took : 95 ms
[2023-03-22 14:06:21] [INFO ] Input system was already deterministic with 1203 transitions.
Support contains 171 out of 1253 places (down from 172) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 67) seen :57
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-22 14:06:23] [INFO ] Invariant cache hit.
[2023-03-22 14:06:23] [INFO ] [Real]Absence check using 451 positive place invariants in 92 ms returned sat
[2023-03-22 14:06:25] [INFO ] After 2233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 14:06:26] [INFO ] [Nat]Absence check using 451 positive place invariants in 257 ms returned sat
[2023-03-22 14:06:30] [INFO ] After 3816ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 14:06:30] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 5 ms to minimize.
[2023-03-22 14:06:30] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 0 ms to minimize.
[2023-03-22 14:06:30] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2023-03-22 14:06:31] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 19 ms to minimize.
[2023-03-22 14:06:31] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2023-03-22 14:06:31] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 22 ms to minimize.
[2023-03-22 14:06:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1132 ms
[2023-03-22 14:06:31] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 1 ms to minimize.
[2023-03-22 14:06:32] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 1 ms to minimize.
[2023-03-22 14:06:32] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 1 ms to minimize.
[2023-03-22 14:06:32] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 22 ms to minimize.
[2023-03-22 14:06:33] [INFO ] Deduced a trap composed of 11 places in 324 ms of which 1 ms to minimize.
[2023-03-22 14:06:33] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2023-03-22 14:06:33] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2023-03-22 14:06:33] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 0 ms to minimize.
[2023-03-22 14:06:33] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2023-03-22 14:06:33] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 0 ms to minimize.
[2023-03-22 14:06:34] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2023-03-22 14:06:34] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 0 ms to minimize.
[2023-03-22 14:06:34] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2023-03-22 14:06:34] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2966 ms
[2023-03-22 14:06:35] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
[2023-03-22 14:06:35] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2023-03-22 14:06:36] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 27 ms to minimize.
[2023-03-22 14:06:36] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2023-03-22 14:06:36] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2023-03-22 14:06:36] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 0 ms to minimize.
[2023-03-22 14:06:36] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2023-03-22 14:06:36] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2023-03-22 14:06:37] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2023-03-22 14:06:37] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2023-03-22 14:06:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1966 ms
[2023-03-22 14:06:37] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 1 ms to minimize.
[2023-03-22 14:06:38] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 0 ms to minimize.
[2023-03-22 14:06:38] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2023-03-22 14:06:38] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2023-03-22 14:06:38] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2023-03-22 14:06:38] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2023-03-22 14:06:39] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2023-03-22 14:06:39] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2023-03-22 14:06:39] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 0 ms to minimize.
[2023-03-22 14:06:39] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 0 ms to minimize.
[2023-03-22 14:06:39] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2023-03-22 14:06:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2238 ms
[2023-03-22 14:06:40] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 0 ms to minimize.
[2023-03-22 14:06:40] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 0 ms to minimize.
[2023-03-22 14:06:40] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 9 ms to minimize.
[2023-03-22 14:06:40] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2023-03-22 14:06:40] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2023-03-22 14:06:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 943 ms
[2023-03-22 14:06:41] [INFO ] After 15047ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3668 ms.
[2023-03-22 14:06:45] [INFO ] After 19853ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 1300 ms.
Support contains 42 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Partial Free-agglomeration rule applied 326 times.
Drop transitions removed 326 transitions
Iterating global reduction 0 with 326 rules applied. Total rules applied 330 place count 1251 transition count 1201
Applied a total of 330 rules in 217 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 1251/1253 places, 1201/1203 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2023-03-22 14:06:47] [INFO ] Computed 451 place invariants in 24 ms
[2023-03-22 14:06:47] [INFO ] [Real]Absence check using 436 positive place invariants in 219 ms returned sat
[2023-03-22 14:06:47] [INFO ] [Real]Absence check using 436 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-22 14:06:49] [INFO ] After 1816ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 14:06:49] [INFO ] [Nat]Absence check using 436 positive place invariants in 147 ms returned sat
[2023-03-22 14:06:49] [INFO ] [Nat]Absence check using 436 positive and 15 generalized place invariants in 38 ms returned sat
[2023-03-22 14:06:51] [INFO ] After 1483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 14:06:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 14:06:53] [INFO ] After 1882ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 14:06:53] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 1 ms to minimize.
[2023-03-22 14:06:53] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 0 ms to minimize.
[2023-03-22 14:06:53] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2023-03-22 14:06:54] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2023-03-22 14:06:54] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2023-03-22 14:06:54] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
[2023-03-22 14:06:54] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2023-03-22 14:06:54] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2023-03-22 14:06:54] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2023-03-22 14:06:55] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2023-03-22 14:06:55] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 1 ms to minimize.
[2023-03-22 14:06:55] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 13 ms to minimize.
[2023-03-22 14:06:55] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2023-03-22 14:06:55] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2023-03-22 14:06:55] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2550 ms
[2023-03-22 14:06:56] [INFO ] Deduced a trap composed of 9 places in 276 ms of which 2 ms to minimize.
[2023-03-22 14:06:56] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 0 ms to minimize.
[2023-03-22 14:06:57] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 1 ms to minimize.
[2023-03-22 14:06:57] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
[2023-03-22 14:06:57] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2023-03-22 14:06:57] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 14 ms to minimize.
[2023-03-22 14:06:58] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2023-03-22 14:06:58] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2023-03-22 14:06:58] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2023-03-22 14:06:58] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2023-03-22 14:06:58] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2023-03-22 14:06:58] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2567 ms
[2023-03-22 14:06:59] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 0 ms to minimize.
[2023-03-22 14:06:59] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2023-03-22 14:06:59] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2023-03-22 14:06:59] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-22 14:06:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 676 ms
[2023-03-22 14:07:00] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2023-03-22 14:07:00] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 1 ms to minimize.
[2023-03-22 14:07:00] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 0 ms to minimize.
[2023-03-22 14:07:01] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2023-03-22 14:07:01] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2023-03-22 14:07:01] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2023-03-22 14:07:01] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2023-03-22 14:07:01] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-22 14:07:02] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-22 14:07:02] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2023-03-22 14:07:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2114 ms
[2023-03-22 14:07:02] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2023-03-22 14:07:02] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 0 ms to minimize.
[2023-03-22 14:07:02] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2023-03-22 14:07:03] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-22 14:07:03] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2023-03-22 14:07:03] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 1 ms to minimize.
[2023-03-22 14:07:03] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2023-03-22 14:07:04] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 0 ms to minimize.
[2023-03-22 14:07:04] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2023-03-22 14:07:04] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
[2023-03-22 14:07:04] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-22 14:07:04] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2023-03-22 14:07:04] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2491 ms
[2023-03-22 14:07:04] [INFO ] After 13533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1967 ms.
[2023-03-22 14:07:06] [INFO ] After 17637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 461 ms.
Support contains 33 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 1251 transition count 1201
Applied a total of 5 rules in 123 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2023-03-22 14:07:08] [INFO ] Computed 451 place invariants in 29 ms
[2023-03-22 14:07:08] [INFO ] [Real]Absence check using 440 positive place invariants in 107 ms returned sat
[2023-03-22 14:07:08] [INFO ] [Real]Absence check using 440 positive and 11 generalized place invariants in 23 ms returned sat
[2023-03-22 14:07:09] [INFO ] After 1820ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 14:07:10] [INFO ] [Nat]Absence check using 440 positive place invariants in 204 ms returned sat
[2023-03-22 14:07:10] [INFO ] [Nat]Absence check using 440 positive and 11 generalized place invariants in 32 ms returned sat
[2023-03-22 14:07:12] [INFO ] After 1622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 14:07:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 14:07:13] [INFO ] After 1602ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 14:07:14] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 0 ms to minimize.
[2023-03-22 14:07:14] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2023-03-22 14:07:14] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2023-03-22 14:07:14] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
[2023-03-22 14:07:15] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 0 ms to minimize.
[2023-03-22 14:07:15] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
[2023-03-22 14:07:15] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2023-03-22 14:07:15] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 1 ms to minimize.
[2023-03-22 14:07:15] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2023-03-22 14:07:16] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2023-03-22 14:07:16] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2023-03-22 14:07:16] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-22 14:07:16] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 1 ms to minimize.
[2023-03-22 14:07:16] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2023-03-22 14:07:16] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2023-03-22 14:07:17] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3151 ms
[2023-03-22 14:07:18] [INFO ] Deduced a trap composed of 8 places in 300 ms of which 0 ms to minimize.
[2023-03-22 14:07:18] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2023-03-22 14:07:18] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 0 ms to minimize.
[2023-03-22 14:07:19] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 0 ms to minimize.
[2023-03-22 14:07:19] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 0 ms to minimize.
[2023-03-22 14:07:19] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 0 ms to minimize.
[2023-03-22 14:07:19] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 0 ms to minimize.
[2023-03-22 14:07:20] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2023-03-22 14:07:20] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 0 ms to minimize.
[2023-03-22 14:07:20] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2023-03-22 14:07:20] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 0 ms to minimize.
[2023-03-22 14:07:21] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2023-03-22 14:07:21] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2023-03-22 14:07:21] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2023-03-22 14:07:22] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 0 ms to minimize.
[2023-03-22 14:07:22] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2023-03-22 14:07:22] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2023-03-22 14:07:22] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2023-03-22 14:07:23] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2023-03-22 14:07:23] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2023-03-22 14:07:23] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 0 ms to minimize.
[2023-03-22 14:07:23] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2023-03-22 14:07:24] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2023-03-22 14:07:24] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2023-03-22 14:07:24] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 0 ms to minimize.
[2023-03-22 14:07:24] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2023-03-22 14:07:24] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6961 ms
[2023-03-22 14:07:25] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-22 14:07:25] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-22 14:07:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 394 ms
[2023-03-22 14:07:25] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2023-03-22 14:07:25] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2023-03-22 14:07:26] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2023-03-22 14:07:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 525 ms
[2023-03-22 14:07:26] [INFO ] After 13961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1457 ms.
[2023-03-22 14:07:27] [INFO ] After 17696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 460 ms.
Support contains 28 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1251 transition count 1201
Applied a total of 2 rules in 73 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 113921 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{0=1}
Probabilistic random walk after 113921 steps, saw 109215 distinct states, run finished after 3003 ms. (steps per millisecond=37 ) properties seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2023-03-22 14:07:31] [INFO ] Computed 451 place invariants in 18 ms
[2023-03-22 14:07:32] [INFO ] [Real]Absence check using 440 positive place invariants in 132 ms returned sat
[2023-03-22 14:07:32] [INFO ] [Real]Absence check using 440 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-22 14:07:33] [INFO ] After 1755ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 14:07:33] [INFO ] [Nat]Absence check using 440 positive place invariants in 133 ms returned sat
[2023-03-22 14:07:33] [INFO ] [Nat]Absence check using 440 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-22 14:07:36] [INFO ] After 2322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 14:07:36] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 14:07:37] [INFO ] After 1077ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 14:07:38] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 0 ms to minimize.
[2023-03-22 14:07:38] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 1 ms to minimize.
[2023-03-22 14:07:38] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 1 ms to minimize.
[2023-03-22 14:07:39] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 0 ms to minimize.
[2023-03-22 14:07:39] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2023-03-22 14:07:39] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2023-03-22 14:07:39] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 1 ms to minimize.
[2023-03-22 14:07:39] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2023-03-22 14:07:40] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2023-03-22 14:07:40] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2023-03-22 14:07:40] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2023-03-22 14:07:40] [INFO ] Deduced a trap composed of 9 places in 336 ms of which 0 ms to minimize.
[2023-03-22 14:07:41] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 1 ms to minimize.
[2023-03-22 14:07:41] [INFO ] Deduced a trap composed of 9 places in 283 ms of which 0 ms to minimize.
[2023-03-22 14:07:42] [INFO ] Deduced a trap composed of 9 places in 312 ms of which 0 ms to minimize.
[2023-03-22 14:07:42] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2023-03-22 14:07:42] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 1 ms to minimize.
[2023-03-22 14:07:42] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4573 ms
[2023-03-22 14:07:42] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4573 ms
[2023-03-22 14:07:43] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 0 ms to minimize.
[2023-03-22 14:07:47] [INFO ] Deduced a trap composed of 9 places in 371 ms of which 1 ms to minimize.
[2023-03-22 14:07:48] [INFO ] Deduced a trap composed of 9 places in 406 ms of which 1 ms to minimize.
[2023-03-22 14:07:48] [INFO ] Deduced a trap composed of 9 places in 279 ms of which 1 ms to minimize.
[2023-03-22 14:07:48] [INFO ] Deduced a trap composed of 9 places in 312 ms of which 1 ms to minimize.
[2023-03-22 14:07:49] [INFO ] Deduced a trap composed of 9 places in 525 ms of which 1 ms to minimize.
[2023-03-22 14:07:49] [INFO ] Deduced a trap composed of 9 places in 364 ms of which 1 ms to minimize.
[2023-03-22 14:07:50] [INFO ] Deduced a trap composed of 17 places in 360 ms of which 0 ms to minimize.
[2023-03-22 14:07:50] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 0 ms to minimize.
[2023-03-22 14:07:50] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 1 ms to minimize.
[2023-03-22 14:07:51] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-22 14:07:51] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 1 ms to minimize.
[2023-03-22 14:07:51] [INFO ] Deduced a trap composed of 17 places in 313 ms of which 0 ms to minimize.
[2023-03-22 14:07:52] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 0 ms to minimize.
[2023-03-22 14:07:52] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 0 ms to minimize.
[2023-03-22 14:07:52] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 0 ms to minimize.
[2023-03-22 14:07:53] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 26 ms to minimize.
[2023-03-22 14:07:53] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2023-03-22 14:07:53] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 10167 ms
[2023-03-22 14:07:53] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-22 14:07:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-22 14:07:53] [INFO ] After 17499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2561 ms.
[2023-03-22 14:07:56] [INFO ] After 22898ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 455 ms.
Support contains 24 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1251 transition count 1201
Applied a total of 3 rules in 58 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 129905 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129905 steps, saw 124240 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2023-03-22 14:08:00] [INFO ] Computed 451 place invariants in 19 ms
[2023-03-22 14:08:00] [INFO ] [Real]Absence check using 443 positive place invariants in 75 ms returned sat
[2023-03-22 14:08:00] [INFO ] [Real]Absence check using 443 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-22 14:08:01] [INFO ] After 1242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 14:08:02] [INFO ] [Nat]Absence check using 443 positive place invariants in 120 ms returned sat
[2023-03-22 14:08:02] [INFO ] [Nat]Absence check using 443 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-22 14:08:04] [INFO ] After 2277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 14:08:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 14:08:07] [INFO ] After 2642ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 14:08:08] [INFO ] Deduced a trap composed of 9 places in 275 ms of which 1 ms to minimize.
[2023-03-22 14:08:08] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2023-03-22 14:08:09] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 0 ms to minimize.
[2023-03-22 14:08:09] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 0 ms to minimize.
[2023-03-22 14:08:09] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 1 ms to minimize.
[2023-03-22 14:08:09] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2023-03-22 14:08:10] [INFO ] Deduced a trap composed of 15 places in 266 ms of which 0 ms to minimize.
[2023-03-22 14:08:10] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 1 ms to minimize.
[2023-03-22 14:08:10] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 1 ms to minimize.
[2023-03-22 14:08:10] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 0 ms to minimize.
[2023-03-22 14:08:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2850 ms
[2023-03-22 14:08:11] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2023-03-22 14:08:11] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 0 ms to minimize.
[2023-03-22 14:08:12] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 0 ms to minimize.
[2023-03-22 14:08:12] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 0 ms to minimize.
[2023-03-22 14:08:12] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2023-03-22 14:08:12] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 1 ms to minimize.
[2023-03-22 14:08:13] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 0 ms to minimize.
[2023-03-22 14:08:13] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2023-03-22 14:08:13] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2175 ms
[2023-03-22 14:08:13] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2023-03-22 14:08:13] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 0 ms to minimize.
[2023-03-22 14:08:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 406 ms
[2023-03-22 14:08:13] [INFO ] After 9515ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 700 ms.
[2023-03-22 14:08:14] [INFO ] After 13064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 436 ms.
Support contains 24 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 30 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 31 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2023-03-22 14:08:15] [INFO ] Invariant cache hit.
[2023-03-22 14:08:16] [INFO ] Implicit Places using invariants in 1182 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1185 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1250/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 29 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1246 ms. Remains : 1250/1251 places, 1201/1201 transitions.
[2023-03-22 14:08:16] [INFO ] Flatten gal took : 111 ms
[2023-03-22 14:08:16] [INFO ] Flatten gal took : 126 ms
[2023-03-22 14:08:16] [INFO ] Input system was already deterministic with 1203 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 74 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 75 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2023-03-22 14:08:16] [INFO ] Flatten gal took : 56 ms
[2023-03-22 14:08:16] [INFO ] Flatten gal took : 58 ms
[2023-03-22 14:08:17] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 20 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2023-03-22 14:08:17] [INFO ] Flatten gal took : 67 ms
[2023-03-22 14:08:17] [INFO ] Flatten gal took : 65 ms
[2023-03-22 14:08:17] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 84 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 85 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2023-03-22 14:08:17] [INFO ] Flatten gal took : 81 ms
[2023-03-22 14:08:17] [INFO ] Flatten gal took : 56 ms
[2023-03-22 14:08:17] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 76 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2023-03-22 14:08:17] [INFO ] Flatten gal took : 52 ms
[2023-03-22 14:08:17] [INFO ] Flatten gal took : 53 ms
[2023-03-22 14:08:18] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 60 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2023-03-22 14:08:18] [INFO ] Flatten gal took : 48 ms
[2023-03-22 14:08:18] [INFO ] Flatten gal took : 50 ms
[2023-03-22 14:08:18] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 17 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2023-03-22 14:08:18] [INFO ] Flatten gal took : 48 ms
[2023-03-22 14:08:18] [INFO ] Flatten gal took : 50 ms
[2023-03-22 14:08:18] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 17 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2023-03-22 14:08:18] [INFO ] Flatten gal took : 47 ms
[2023-03-22 14:08:18] [INFO ] Flatten gal took : 50 ms
[2023-03-22 14:08:18] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 16 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2023-03-22 14:08:18] [INFO ] Flatten gal took : 51 ms
[2023-03-22 14:08:18] [INFO ] Flatten gal took : 49 ms
[2023-03-22 14:08:18] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 89 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 93 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2023-03-22 14:08:19] [INFO ] Flatten gal took : 62 ms
[2023-03-22 14:08:19] [INFO ] Flatten gal took : 54 ms
[2023-03-22 14:08:19] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 18 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2023-03-22 14:08:19] [INFO ] Flatten gal took : 47 ms
[2023-03-22 14:08:19] [INFO ] Flatten gal took : 54 ms
[2023-03-22 14:08:19] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 78 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 78 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2023-03-22 14:08:19] [INFO ] Flatten gal took : 48 ms
[2023-03-22 14:08:19] [INFO ] Flatten gal took : 52 ms
[2023-03-22 14:08:19] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 16 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2023-03-22 14:08:19] [INFO ] Flatten gal took : 48 ms
[2023-03-22 14:08:19] [INFO ] Flatten gal took : 49 ms
[2023-03-22 14:08:19] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 125 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 139 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2023-03-22 14:08:20] [INFO ] Flatten gal took : 61 ms
[2023-03-22 14:08:20] [INFO ] Flatten gal took : 49 ms
[2023-03-22 14:08:20] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 26 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2023-03-22 14:08:20] [INFO ] Flatten gal took : 48 ms
[2023-03-22 14:08:20] [INFO ] Flatten gal took : 52 ms
[2023-03-22 14:08:20] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 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 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 85 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 85 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2023-03-22 14:08:20] [INFO ] Flatten gal took : 74 ms
[2023-03-22 14:08:20] [INFO ] Flatten gal took : 51 ms
[2023-03-22 14:08:20] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 18 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2023-03-22 14:08:21] [INFO ] Flatten gal took : 57 ms
[2023-03-22 14:08:21] [INFO ] Flatten gal took : 48 ms
[2023-03-22 14:08:21] [INFO ] Input system was already deterministic with 1203 transitions.
[2023-03-22 14:08:21] [INFO ] Flatten gal took : 102 ms
[2023-03-22 14:08:21] [INFO ] Flatten gal took : 57 ms
[2023-03-22 14:08:21] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-22 14:08:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1253 places, 1203 transitions and 5406 arcs took 6 ms.
Total runtime 125606 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 1253 NrTr: 1203 NrArc: 5406)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.129sec
net check time: 0m 0.000sec
init dd package: 0m 2.902sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 9242312 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16096204 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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.007sec
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-050A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ShieldIIPs-PT-050A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r394-oct2-167903717500146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050A.tgz
mv ShieldIIPs-PT-050A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;