About the Execution of Marcie+red for ShieldPPPs-PT-040A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9988.415 | 3600000.00 | 3683768.00 | 142.50 | ???????T???????? | normal |
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-167903718000482.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 ShieldPPPs-PT-040A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718000482
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.7K Feb 26 02:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 02:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 02:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:10 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 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 02:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 02:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 02:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 355K 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 ShieldPPPs-PT-040A-CTLFireability-00
FORMULA_NAME ShieldPPPs-PT-040A-CTLFireability-01
FORMULA_NAME ShieldPPPs-PT-040A-CTLFireability-02
FORMULA_NAME ShieldPPPs-PT-040A-CTLFireability-03
FORMULA_NAME ShieldPPPs-PT-040A-CTLFireability-04
FORMULA_NAME ShieldPPPs-PT-040A-CTLFireability-05
FORMULA_NAME ShieldPPPs-PT-040A-CTLFireability-06
FORMULA_NAME ShieldPPPs-PT-040A-CTLFireability-07
FORMULA_NAME ShieldPPPs-PT-040A-CTLFireability-08
FORMULA_NAME ShieldPPPs-PT-040A-CTLFireability-09
FORMULA_NAME ShieldPPPs-PT-040A-CTLFireability-10
FORMULA_NAME ShieldPPPs-PT-040A-CTLFireability-11
FORMULA_NAME ShieldPPPs-PT-040A-CTLFireability-12
FORMULA_NAME ShieldPPPs-PT-040A-CTLFireability-13
FORMULA_NAME ShieldPPPs-PT-040A-CTLFireability-14
FORMULA_NAME ShieldPPPs-PT-040A-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679517729105
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=ShieldPPPs-PT-040A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 20:42:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 20:42:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 20:42:11] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2023-03-22 20:42:11] [INFO ] Transformed 1243 places.
[2023-03-22 20:42:11] [INFO ] Transformed 1043 transitions.
[2023-03-22 20:42:11] [INFO ] Found NUPN structural information;
[2023-03-22 20:42:11] [INFO ] Parsed PT model containing 1243 places and 1043 transitions and 4006 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 206 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 102 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
// Phase 1: matrix 1043 rows 1243 cols
[2023-03-22 20:42:12] [INFO ] Computed 441 place invariants in 27 ms
[2023-03-22 20:42:13] [INFO ] Implicit Places using invariants in 1180 ms returned []
[2023-03-22 20:42:13] [INFO ] Invariant cache hit.
[2023-03-22 20:42:14] [INFO ] Implicit Places using invariants and state equation in 1764 ms returned []
Implicit Place search using SMT with State Equation took 2974 ms to find 0 implicit places.
[2023-03-22 20:42:14] [INFO ] Invariant cache hit.
[2023-03-22 20:42:15] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4028 ms. Remains : 1243/1243 places, 1043/1043 transitions.
Support contains 206 out of 1243 places after structural reductions.
[2023-03-22 20:42:16] [INFO ] Flatten gal took : 137 ms
[2023-03-22 20:42:16] [INFO ] Flatten gal took : 72 ms
[2023-03-22 20:42:16] [INFO ] Input system was already deterministic with 1043 transitions.
Support contains 201 out of 1243 places (down from 206) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 102) seen :97
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) 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 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 20:42:17] [INFO ] Invariant cache hit.
[2023-03-22 20:42:17] [INFO ] [Real]Absence check using 441 positive place invariants in 82 ms returned sat
[2023-03-22 20:42:18] [INFO ] After 1524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 20:42:19] [INFO ] [Nat]Absence check using 441 positive place invariants in 94 ms returned sat
[2023-03-22 20:42:20] [INFO ] After 1487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 20:42:21] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 8 ms to minimize.
[2023-03-22 20:42:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-03-22 20:42:21] [INFO ] After 2564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 737 ms.
[2023-03-22 20:42:22] [INFO ] After 3824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 456 ms.
Support contains 17 out of 1243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1241 transition count 1041
Partial Free-agglomeration rule applied 349 times.
Drop transitions removed 349 transitions
Iterating global reduction 0 with 349 rules applied. Total rules applied 353 place count 1241 transition count 1041
Applied a total of 353 rules in 265 ms. Remains 1241 /1243 variables (removed 2) and now considering 1041/1043 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 1241/1243 places, 1041/1043 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1041 rows 1241 cols
[2023-03-22 20:42:23] [INFO ] Computed 441 place invariants in 84 ms
[2023-03-22 20:42:24] [INFO ] [Real]Absence check using 415 positive place invariants in 85 ms returned sat
[2023-03-22 20:42:24] [INFO ] [Real]Absence check using 415 positive and 26 generalized place invariants in 5 ms returned sat
[2023-03-22 20:42:24] [INFO ] After 930ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:42:25] [INFO ] [Nat]Absence check using 415 positive place invariants in 186 ms returned sat
[2023-03-22 20:42:25] [INFO ] [Nat]Absence check using 415 positive and 26 generalized place invariants in 7 ms returned sat
[2023-03-22 20:42:25] [INFO ] After 598ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:42:26] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 1 ms to minimize.
[2023-03-22 20:42:26] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 0 ms to minimize.
[2023-03-22 20:42:26] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 1 ms to minimize.
[2023-03-22 20:42:26] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-22 20:42:26] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 14 ms to minimize.
[2023-03-22 20:42:27] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2023-03-22 20:42:27] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 1 ms to minimize.
[2023-03-22 20:42:27] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2023-03-22 20:42:27] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2023-03-22 20:42:27] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2023-03-22 20:42:28] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2023-03-22 20:42:28] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2023-03-22 20:42:28] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2023-03-22 20:42:28] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-22 20:42:28] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2023-03-22 20:42:28] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2023-03-22 20:42:28] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2023-03-22 20:42:29] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 0 ms to minimize.
[2023-03-22 20:42:29] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-22 20:42:29] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2023-03-22 20:42:29] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2023-03-22 20:42:29] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2023-03-22 20:42:30] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 1 ms to minimize.
[2023-03-22 20:42:30] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2023-03-22 20:42:30] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2023-03-22 20:42:30] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 4749 ms
[2023-03-22 20:42:30] [INFO ] After 5415ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-22 20:42:30] [INFO ] After 6009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 4 out of 1241 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1241/1241 places, 1041/1041 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 1241 transition count 1041
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1240 transition count 1040
Applied a total of 4 rules in 256 ms. Remains 1240 /1241 variables (removed 1) and now considering 1040/1041 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 1240/1241 places, 1040/1041 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 225362 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 225362 steps, saw 217949 distinct states, run finished after 3002 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1040 rows 1240 cols
[2023-03-22 20:42:34] [INFO ] Computed 441 place invariants in 65 ms
[2023-03-22 20:42:34] [INFO ] [Real]Absence check using 423 positive place invariants in 161 ms returned sat
[2023-03-22 20:42:34] [INFO ] [Real]Absence check using 423 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-22 20:42:35] [INFO ] After 1087ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:42:35] [INFO ] [Nat]Absence check using 423 positive place invariants in 79 ms returned sat
[2023-03-22 20:42:35] [INFO ] [Nat]Absence check using 423 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-22 20:42:36] [INFO ] After 643ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:42:36] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2023-03-22 20:42:36] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2023-03-22 20:42:37] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2023-03-22 20:42:37] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2023-03-22 20:42:37] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2023-03-22 20:42:38] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 14 ms to minimize.
[2023-03-22 20:42:38] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2023-03-22 20:42:38] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 0 ms to minimize.
[2023-03-22 20:42:38] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 0 ms to minimize.
[2023-03-22 20:42:39] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 0 ms to minimize.
[2023-03-22 20:42:39] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 0 ms to minimize.
[2023-03-22 20:42:39] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 0 ms to minimize.
[2023-03-22 20:42:39] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 0 ms to minimize.
[2023-03-22 20:42:39] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 0 ms to minimize.
[2023-03-22 20:42:40] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2023-03-22 20:42:40] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2023-03-22 20:42:41] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 0 ms to minimize.
[2023-03-22 20:42:41] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2023-03-22 20:42:42] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2023-03-22 20:42:42] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2023-03-22 20:42:42] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2023-03-22 20:42:42] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 0 ms to minimize.
[2023-03-22 20:42:42] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 1 ms to minimize.
[2023-03-22 20:42:43] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2023-03-22 20:42:44] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 1 ms to minimize.
[2023-03-22 20:42:44] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 3 ms to minimize.
[2023-03-22 20:42:44] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2023-03-22 20:42:44] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2023-03-22 20:42:45] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 1 ms to minimize.
[2023-03-22 20:42:45] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2023-03-22 20:42:45] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
[2023-03-22 20:42:45] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2023-03-22 20:42:45] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2023-03-22 20:42:45] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2023-03-22 20:42:46] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 0 ms to minimize.
[2023-03-22 20:42:46] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 7 ms to minimize.
[2023-03-22 20:42:46] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2023-03-22 20:42:46] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 5 ms to minimize.
[2023-03-22 20:42:47] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
[2023-03-22 20:42:47] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2023-03-22 20:42:47] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 13 ms to minimize.
[2023-03-22 20:42:47] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
[2023-03-22 20:42:47] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2023-03-22 20:42:48] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 0 ms to minimize.
[2023-03-22 20:42:48] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2023-03-22 20:42:48] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2023-03-22 20:42:48] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 0 ms to minimize.
[2023-03-22 20:42:48] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2023-03-22 20:42:48] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2023-03-22 20:42:49] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2023-03-22 20:42:49] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 1 ms to minimize.
[2023-03-22 20:42:49] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2023-03-22 20:42:49] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2023-03-22 20:42:49] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
[2023-03-22 20:42:49] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 0 ms to minimize.
[2023-03-22 20:42:50] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2023-03-22 20:42:50] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 13726 ms
[2023-03-22 20:42:50] [INFO ] After 14442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-22 20:42:50] [INFO ] After 14959ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 1240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1240/1240 places, 1040/1040 transitions.
Applied a total of 0 rules in 61 ms. Remains 1240 /1240 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1240/1240 places, 1040/1040 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1240/1240 places, 1040/1040 transitions.
Applied a total of 0 rules in 39 ms. Remains 1240 /1240 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
[2023-03-22 20:42:50] [INFO ] Invariant cache hit.
[2023-03-22 20:42:51] [INFO ] Implicit Places using invariants in 848 ms returned []
[2023-03-22 20:42:51] [INFO ] Invariant cache hit.
[2023-03-22 20:42:53] [INFO ] Implicit Places using invariants and state equation in 2132 ms returned []
Implicit Place search using SMT with State Equation took 3005 ms to find 0 implicit places.
[2023-03-22 20:42:53] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-22 20:42:53] [INFO ] Invariant cache hit.
[2023-03-22 20:42:54] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3771 ms. Remains : 1240/1240 places, 1040/1040 transitions.
Applied a total of 0 rules in 35 ms. Remains 1240 /1240 variables (removed 0) and now considering 1040/1040 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 20:42:54] [INFO ] Invariant cache hit.
[2023-03-22 20:42:54] [INFO ] [Real]Absence check using 423 positive place invariants in 113 ms returned sat
[2023-03-22 20:42:54] [INFO ] [Real]Absence check using 423 positive and 18 generalized place invariants in 16 ms returned sat
[2023-03-22 20:42:55] [INFO ] After 839ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 20:42:55] [INFO ] [Nat]Absence check using 423 positive place invariants in 78 ms returned sat
[2023-03-22 20:42:55] [INFO ] [Nat]Absence check using 423 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-22 20:42:55] [INFO ] After 569ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 20:42:56] [INFO ] Deduced a trap composed of 8 places in 260 ms of which 0 ms to minimize.
[2023-03-22 20:42:56] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 0 ms to minimize.
[2023-03-22 20:42:56] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 1 ms to minimize.
[2023-03-22 20:42:57] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2023-03-22 20:42:57] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2023-03-22 20:42:57] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 0 ms to minimize.
[2023-03-22 20:42:57] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
[2023-03-22 20:42:58] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2023-03-22 20:42:58] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2023-03-22 20:42:58] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2023-03-22 20:42:58] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2023-03-22 20:42:59] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 0 ms to minimize.
[2023-03-22 20:42:59] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 1 ms to minimize.
[2023-03-22 20:42:59] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2023-03-22 20:42:59] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2023-03-22 20:42:59] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 0 ms to minimize.
[2023-03-22 20:43:00] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2023-03-22 20:43:00] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 0 ms to minimize.
[2023-03-22 20:43:00] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 2 ms to minimize.
[2023-03-22 20:43:00] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-22 20:43:01] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2023-03-22 20:43:01] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2023-03-22 20:43:01] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2023-03-22 20:43:01] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2023-03-22 20:43:02] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 0 ms to minimize.
[2023-03-22 20:43:02] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2023-03-22 20:43:03] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2023-03-22 20:43:03] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2023-03-22 20:43:03] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2023-03-22 20:43:03] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2023-03-22 20:43:03] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2023-03-22 20:43:03] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2023-03-22 20:43:04] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2023-03-22 20:43:04] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 1 ms to minimize.
[2023-03-22 20:43:04] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2023-03-22 20:43:04] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 0 ms to minimize.
[2023-03-22 20:43:05] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 0 ms to minimize.
[2023-03-22 20:43:05] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 13 ms to minimize.
[2023-03-22 20:43:05] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 0 ms to minimize.
[2023-03-22 20:43:05] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2023-03-22 20:43:06] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2023-03-22 20:43:06] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2023-03-22 20:43:06] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2023-03-22 20:43:06] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2023-03-22 20:43:06] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 0 ms to minimize.
[2023-03-22 20:43:07] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 1 ms to minimize.
[2023-03-22 20:43:07] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2023-03-22 20:43:07] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 1 ms to minimize.
[2023-03-22 20:43:07] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 0 ms to minimize.
[2023-03-22 20:43:07] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2023-03-22 20:43:08] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2023-03-22 20:43:08] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2023-03-22 20:43:08] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2023-03-22 20:43:08] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2023-03-22 20:43:09] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2023-03-22 20:43:09] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2023-03-22 20:43:09] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
[2023-03-22 20:43:09] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2023-03-22 20:43:09] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 1 ms to minimize.
[2023-03-22 20:43:09] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2023-03-22 20:43:10] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2023-03-22 20:43:10] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 1 ms to minimize.
[2023-03-22 20:43:11] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2023-03-22 20:43:11] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2023-03-22 20:43:11] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2023-03-22 20:43:11] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
[2023-03-22 20:43:12] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2023-03-22 20:43:12] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 1 ms to minimize.
[2023-03-22 20:43:12] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2023-03-22 20:43:12] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2023-03-22 20:43:12] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2023-03-22 20:43:12] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 0 ms to minimize.
[2023-03-22 20:43:13] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 0 ms to minimize.
[2023-03-22 20:43:13] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2023-03-22 20:43:13] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2023-03-22 20:43:13] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2023-03-22 20:43:13] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2023-03-22 20:43:14] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2023-03-22 20:43:14] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2023-03-22 20:43:14] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 0 ms to minimize.
[2023-03-22 20:43:14] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2023-03-22 20:43:14] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 0 ms to minimize.
[2023-03-22 20:43:15] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 0 ms to minimize.
[2023-03-22 20:43:15] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 0 ms to minimize.
[2023-03-22 20:43:15] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2023-03-22 20:43:15] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2023-03-22 20:43:16] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2023-03-22 20:43:16] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2023-03-22 20:43:16] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2023-03-22 20:43:16] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2023-03-22 20:43:16] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2023-03-22 20:43:16] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2023-03-22 20:43:16] [INFO ] Trap strengthening (SAT) tested/added 93/92 trap constraints in 20874 ms
[2023-03-22 20:43:16] [INFO ] After 21482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 287 ms.
[2023-03-22 20:43:17] [INFO ] After 22106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 20:43:17] [INFO ] Flatten gal took : 71 ms
[2023-03-22 20:43:17] [INFO ] Flatten gal took : 93 ms
[2023-03-22 20:43:17] [INFO ] Input system was already deterministic with 1043 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1241 transition count 1041
Applied a total of 4 rules in 66 ms. Remains 1241 /1243 variables (removed 2) and now considering 1041/1043 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 1241/1243 places, 1041/1043 transitions.
[2023-03-22 20:43:17] [INFO ] Flatten gal took : 43 ms
[2023-03-22 20:43:17] [INFO ] Flatten gal took : 45 ms
[2023-03-22 20:43:17] [INFO ] Input system was already deterministic with 1041 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1241 transition count 1041
Applied a total of 4 rules in 59 ms. Remains 1241 /1243 variables (removed 2) and now considering 1041/1043 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 1241/1243 places, 1041/1043 transitions.
[2023-03-22 20:43:17] [INFO ] Flatten gal took : 40 ms
[2023-03-22 20:43:17] [INFO ] Flatten gal took : 41 ms
[2023-03-22 20:43:17] [INFO ] Input system was already deterministic with 1041 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 22 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 1243/1243 places, 1043/1043 transitions.
[2023-03-22 20:43:18] [INFO ] Flatten gal took : 38 ms
[2023-03-22 20:43:18] [INFO ] Flatten gal took : 40 ms
[2023-03-22 20:43:18] [INFO ] Input system was already deterministic with 1043 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 21 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 1243/1243 places, 1043/1043 transitions.
[2023-03-22 20:43:18] [INFO ] Flatten gal took : 38 ms
[2023-03-22 20:43:18] [INFO ] Flatten gal took : 39 ms
[2023-03-22 20:43:18] [INFO ] Input system was already deterministic with 1043 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 21 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 1243/1243 places, 1043/1043 transitions.
[2023-03-22 20:43:18] [INFO ] Flatten gal took : 37 ms
[2023-03-22 20:43:18] [INFO ] Flatten gal took : 38 ms
[2023-03-22 20:43:18] [INFO ] Input system was already deterministic with 1043 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 21 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 1243/1243 places, 1043/1043 transitions.
[2023-03-22 20:43:18] [INFO ] Flatten gal took : 36 ms
[2023-03-22 20:43:18] [INFO ] Flatten gal took : 38 ms
[2023-03-22 20:43:18] [INFO ] Input system was already deterministic with 1043 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1241 transition count 1041
Applied a total of 4 rules in 57 ms. Remains 1241 /1243 variables (removed 2) and now considering 1041/1043 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 1241/1243 places, 1041/1043 transitions.
[2023-03-22 20:43:18] [INFO ] Flatten gal took : 36 ms
[2023-03-22 20:43:18] [INFO ] Flatten gal took : 37 ms
[2023-03-22 20:43:18] [INFO ] Input system was already deterministic with 1041 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 1241 transition count 1041
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 1240 transition count 1040
Applied a total of 4 rules in 100 ms. Remains 1240 /1243 variables (removed 3) and now considering 1040/1043 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 100 ms. Remains : 1240/1243 places, 1040/1043 transitions.
[2023-03-22 20:43:18] [INFO ] Flatten gal took : 27 ms
[2023-03-22 20:43:18] [INFO ] Flatten gal took : 29 ms
[2023-03-22 20:43:19] [INFO ] Input system was already deterministic with 1040 transitions.
Finished random walk after 1617 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=115 )
FORMULA ShieldPPPs-PT-040A-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 21 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 1243/1243 places, 1043/1043 transitions.
[2023-03-22 20:43:19] [INFO ] Flatten gal took : 34 ms
[2023-03-22 20:43:19] [INFO ] Flatten gal took : 35 ms
[2023-03-22 20:43:19] [INFO ] Input system was already deterministic with 1043 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 21 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 1243/1243 places, 1043/1043 transitions.
[2023-03-22 20:43:19] [INFO ] Flatten gal took : 34 ms
[2023-03-22 20:43:19] [INFO ] Flatten gal took : 36 ms
[2023-03-22 20:43:19] [INFO ] Input system was already deterministic with 1043 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 21 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 1243/1243 places, 1043/1043 transitions.
[2023-03-22 20:43:19] [INFO ] Flatten gal took : 35 ms
[2023-03-22 20:43:19] [INFO ] Flatten gal took : 37 ms
[2023-03-22 20:43:19] [INFO ] Input system was already deterministic with 1043 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 21 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 1243/1243 places, 1043/1043 transitions.
[2023-03-22 20:43:19] [INFO ] Flatten gal took : 34 ms
[2023-03-22 20:43:19] [INFO ] Flatten gal took : 36 ms
[2023-03-22 20:43:19] [INFO ] Input system was already deterministic with 1043 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 21 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 1243/1243 places, 1043/1043 transitions.
[2023-03-22 20:43:19] [INFO ] Flatten gal took : 34 ms
[2023-03-22 20:43:19] [INFO ] Flatten gal took : 36 ms
[2023-03-22 20:43:19] [INFO ] Input system was already deterministic with 1043 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 21 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 1243/1243 places, 1043/1043 transitions.
[2023-03-22 20:43:19] [INFO ] Flatten gal took : 34 ms
[2023-03-22 20:43:19] [INFO ] Flatten gal took : 36 ms
[2023-03-22 20:43:20] [INFO ] Input system was already deterministic with 1043 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1241 transition count 1041
Applied a total of 4 rules in 52 ms. Remains 1241 /1243 variables (removed 2) and now considering 1041/1043 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 1241/1243 places, 1041/1043 transitions.
[2023-03-22 20:43:20] [INFO ] Flatten gal took : 35 ms
[2023-03-22 20:43:20] [INFO ] Flatten gal took : 37 ms
[2023-03-22 20:43:20] [INFO ] Input system was already deterministic with 1041 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Reduce places removed 1 places and 1 transitions.
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 2 place count 1241 transition count 1041
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 1240 transition count 1040
Applied a total of 4 rules in 75 ms. Remains 1240 /1243 variables (removed 3) and now considering 1040/1043 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 75 ms. Remains : 1240/1243 places, 1040/1043 transitions.
[2023-03-22 20:43:20] [INFO ] Flatten gal took : 26 ms
[2023-03-22 20:43:20] [INFO ] Flatten gal took : 28 ms
[2023-03-22 20:43:20] [INFO ] Input system was already deterministic with 1040 transitions.
[2023-03-22 20:43:20] [INFO ] Flatten gal took : 37 ms
[2023-03-22 20:43:20] [INFO ] Flatten gal took : 37 ms
[2023-03-22 20:43:20] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-22 20:43:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1243 places, 1043 transitions and 4006 arcs took 4 ms.
Total runtime 69012 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: 1243 NrTr: 1043 NrArc: 4006)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.100sec
net check time: 0m 0.000sec
init dd package: 0m 3.402sec
before gc: list nodes free: 1670238
after gc: idd nodes used:50467, unused:63949533; list nodes free:278681313
before gc: list nodes free: 1085198
after gc: idd nodes used:105982, unused:63894018; list nodes free:282612152
before gc: list nodes free: 1396488
after gc: idd nodes used:85691, unused:63914309; list nodes free:284810571
before gc: list nodes free: 1958866
after gc: idd nodes used:111823, unused:63888177; list nodes free:286787001
before gc: list nodes free: 4166486
after gc: idd nodes used:99628, unused:63900372; list nodes free:286843935
before gc: list nodes free: 7237667
after gc: idd nodes used:106883, unused:63893117; list nodes free:286808285
before gc: list nodes free: 1067255
after gc: idd nodes used:111142, unused:63888858; list nodes free:286789033
before gc: list nodes free: 7527575
after gc: idd nodes used:114085, unused:63885915; list nodes free:286775371
before gc: list nodes free: 4370841
after gc: idd nodes used:109213, unused:63890787; list nodes free:286798563
before gc: list nodes free: 3596621
after gc: idd nodes used:122869, unused:63877131; list nodes free:286732093
before gc: list nodes free: 1491664
after gc: idd nodes used:129016, unused:63870984; list nodes free:286706387
before gc: list nodes free: 4692936
after gc: idd nodes used:111355, unused:63888645; list nodes free:286788023
before gc: list nodes free: 1816703
after gc: idd nodes used:114788, unused:63885212; list nodes free:286772397
before gc: list nodes free: 5929041
after gc: idd nodes used:116289, unused:63883711; list nodes free:286764529
before gc: list nodes free: 1709852
after gc: idd nodes used:120279, unused:63879721; list nodes free:286746612
before gc: list nodes free: 4197174
after gc: idd nodes used:122738, unused:63877262; list nodes free:286733797
before gc: list nodes free: 7608173
after gc: idd nodes used:114804, unused:63885196; list nodes free:286773353
before gc: list nodes free: 7607495
after gc: idd nodes used:131887, unused:63868113; list nodes free:286688960
before gc: list nodes free: 1430298
after gc: idd nodes used:149918, unused:63850082; list nodes free:290801219
before gc: list nodes free: 2414398
after gc: idd nodes used:151270, unused:63848730; list nodes free:290792020
before gc: list nodes free: 3170894
after gc: idd nodes used:164644, unused:63835356; list nodes free:290728531
before gc: list nodes free: 1927479
after gc: idd nodes used:163562, unused:63836438; list nodes free:290731962
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6157956 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096900 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.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.017sec
40243 51981 48507 91106 94111 84520 112114 104525 100461 104774 108456 112612 110197 106583 115721 112154 111049 117951 110026 129127 137390 113536 114746 112158 115657 113382 115988 120396 112997 111029 114944 113852 130035 148533 158632 175361 154749
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="ShieldPPPs-PT-040A"
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 ShieldPPPs-PT-040A, 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-167903718000482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-040A.tgz
mv ShieldPPPs-PT-040A 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 ;