About the Execution of Marcie+red for BusinessProcesses-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9850.071 | 1819354.00 | 1855012.00 | 360.20 | ??????????????F? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813695900570.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BusinessProcesses-PT-16, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695900570
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.8K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 159K Mar 5 18:22 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 BusinessProcesses-PT-16-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-16-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678734039749
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=BusinessProcesses-PT-16
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:00:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:00:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:00:41] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-13 19:00:41] [INFO ] Transformed 638 places.
[2023-03-13 19:00:41] [INFO ] Transformed 578 transitions.
[2023-03-13 19:00:41] [INFO ] Found NUPN structural information;
[2023-03-13 19:00:41] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 7 ms.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Support contains 115 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 80 place count 550 transition count 495
Iterating global reduction 1 with 75 rules applied. Total rules applied 155 place count 550 transition count 495
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 191 place count 514 transition count 459
Iterating global reduction 1 with 36 rules applied. Total rules applied 227 place count 514 transition count 459
Applied a total of 227 rules in 97 ms. Remains 514 /630 variables (removed 116) and now considering 459/570 (removed 111) transitions.
// Phase 1: matrix 459 rows 514 cols
[2023-03-13 19:00:41] [INFO ] Computed 95 place invariants in 29 ms
[2023-03-13 19:00:42] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-13 19:00:42] [INFO ] Invariant cache hit.
[2023-03-13 19:00:42] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2023-03-13 19:00:42] [INFO ] Invariant cache hit.
[2023-03-13 19:00:42] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 514/630 places, 459/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1138 ms. Remains : 514/630 places, 459/570 transitions.
Support contains 115 out of 514 places after structural reductions.
[2023-03-13 19:00:43] [INFO ] Flatten gal took : 136 ms
[2023-03-13 19:00:43] [INFO ] Flatten gal took : 46 ms
[2023-03-13 19:00:43] [INFO ] Input system was already deterministic with 459 transitions.
Support contains 114 out of 514 places (down from 115) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 74) seen :29
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Running SMT prover for 45 properties.
[2023-03-13 19:00:44] [INFO ] Invariant cache hit.
[2023-03-13 19:00:45] [INFO ] [Real]Absence check using 56 positive place invariants in 16 ms returned sat
[2023-03-13 19:00:45] [INFO ] [Real]Absence check using 56 positive and 39 generalized place invariants in 11 ms returned sat
[2023-03-13 19:00:45] [INFO ] After 196ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2 real:41
[2023-03-13 19:00:48] [INFO ] Deduced a trap composed of 14 places in 3277 ms of which 9 ms to minimize.
[2023-03-13 19:00:48] [INFO ] Deduced a trap composed of 105 places in 185 ms of which 1 ms to minimize.
[2023-03-13 19:00:49] [INFO ] Deduced a trap composed of 105 places in 191 ms of which 14 ms to minimize.
[2023-03-13 19:00:49] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 13 ms to minimize.
[2023-03-13 19:00:49] [INFO ] Deduced a trap composed of 92 places in 191 ms of which 2 ms to minimize.
[2023-03-13 19:00:49] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 13 ms to minimize.
[2023-03-13 19:00:49] [INFO ] Deduced a trap composed of 93 places in 164 ms of which 0 ms to minimize.
[2023-03-13 19:00:50] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 14 ms to minimize.
[2023-03-13 19:00:50] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 0 ms to minimize.
[2023-03-13 19:00:50] [INFO ] Deduced a trap composed of 103 places in 172 ms of which 1 ms to minimize.
[2023-03-13 19:00:50] [INFO ] Deduced a trap composed of 93 places in 152 ms of which 1 ms to minimize.
[2023-03-13 19:00:50] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2023-03-13 19:00:50] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 1 ms to minimize.
[2023-03-13 19:00:51] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 1 ms to minimize.
[2023-03-13 19:00:51] [INFO ] Deduced a trap composed of 90 places in 165 ms of which 1 ms to minimize.
[2023-03-13 19:00:51] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 0 ms to minimize.
[2023-03-13 19:00:51] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 0 ms to minimize.
[2023-03-13 19:00:51] [INFO ] Deduced a trap composed of 95 places in 225 ms of which 0 ms to minimize.
[2023-03-13 19:00:52] [INFO ] Deduced a trap composed of 94 places in 208 ms of which 1 ms to minimize.
[2023-03-13 19:00:52] [INFO ] Deduced a trap composed of 94 places in 172 ms of which 1 ms to minimize.
[2023-03-13 19:00:52] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 1 ms to minimize.
[2023-03-13 19:00:52] [INFO ] Deduced a trap composed of 93 places in 172 ms of which 2 ms to minimize.
[2023-03-13 19:00:52] [INFO ] Deduced a trap composed of 90 places in 169 ms of which 1 ms to minimize.
[2023-03-13 19:00:53] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 1 ms to minimize.
[2023-03-13 19:00:53] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 0 ms to minimize.
[2023-03-13 19:00:53] [INFO ] Deduced a trap composed of 94 places in 186 ms of which 0 ms to minimize.
[2023-03-13 19:00:53] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 1 ms to minimize.
[2023-03-13 19:00:53] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 1 ms to minimize.
[2023-03-13 19:00:53] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 1 ms to minimize.
[2023-03-13 19:00:54] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 0 ms to minimize.
[2023-03-13 19:00:54] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 1 ms to minimize.
[2023-03-13 19:00:54] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 0 ms to minimize.
[2023-03-13 19:00:54] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 1 ms to minimize.
[2023-03-13 19:00:54] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 1 ms to minimize.
[2023-03-13 19:00:54] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 1 ms to minimize.
[2023-03-13 19:00:54] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 1 ms to minimize.
[2023-03-13 19:00:55] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 0 ms to minimize.
[2023-03-13 19:00:55] [INFO ] Deduced a trap composed of 95 places in 158 ms of which 0 ms to minimize.
[2023-03-13 19:00:55] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 1 ms to minimize.
[2023-03-13 19:00:55] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 2 ms to minimize.
[2023-03-13 19:00:55] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 0 ms to minimize.
[2023-03-13 19:00:56] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 1 ms to minimize.
[2023-03-13 19:00:56] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 1 ms to minimize.
[2023-03-13 19:00:56] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 0 ms to minimize.
[2023-03-13 19:00:56] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 0 ms to minimize.
[2023-03-13 19:00:56] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 0 ms to minimize.
[2023-03-13 19:00:56] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 11276 ms
[2023-03-13 19:00:56] [INFO ] After 11571ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:43
[2023-03-13 19:00:56] [INFO ] After 12143ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:43
[2023-03-13 19:00:57] [INFO ] [Nat]Absence check using 56 positive place invariants in 18 ms returned sat
[2023-03-13 19:00:57] [INFO ] [Nat]Absence check using 56 positive and 39 generalized place invariants in 13 ms returned sat
[2023-03-13 19:00:58] [INFO ] After 885ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :39
[2023-03-13 19:00:58] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2023-03-13 19:00:58] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2023-03-13 19:00:58] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 1 ms to minimize.
[2023-03-13 19:00:59] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2023-03-13 19:00:59] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 1 ms to minimize.
[2023-03-13 19:00:59] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 1 ms to minimize.
[2023-03-13 19:00:59] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 0 ms to minimize.
[2023-03-13 19:00:59] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 1 ms to minimize.
[2023-03-13 19:00:59] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 1 ms to minimize.
[2023-03-13 19:00:59] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2023-03-13 19:01:00] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 5 ms to minimize.
[2023-03-13 19:01:00] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 2 ms to minimize.
[2023-03-13 19:01:00] [INFO ] Deduced a trap composed of 79 places in 147 ms of which 0 ms to minimize.
[2023-03-13 19:01:00] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 0 ms to minimize.
[2023-03-13 19:01:00] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 0 ms to minimize.
[2023-03-13 19:01:00] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 0 ms to minimize.
[2023-03-13 19:01:01] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 0 ms to minimize.
[2023-03-13 19:01:01] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 2 ms to minimize.
[2023-03-13 19:01:01] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 1 ms to minimize.
[2023-03-13 19:01:01] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 0 ms to minimize.
[2023-03-13 19:01:01] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 1 ms to minimize.
[2023-03-13 19:01:01] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 1 ms to minimize.
[2023-03-13 19:01:02] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 1 ms to minimize.
[2023-03-13 19:01:02] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 1 ms to minimize.
[2023-03-13 19:01:02] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 0 ms to minimize.
[2023-03-13 19:01:02] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 1 ms to minimize.
[2023-03-13 19:01:02] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 0 ms to minimize.
[2023-03-13 19:01:02] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 0 ms to minimize.
[2023-03-13 19:01:02] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 1 ms to minimize.
[2023-03-13 19:01:03] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2023-03-13 19:01:03] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 0 ms to minimize.
[2023-03-13 19:01:03] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 0 ms to minimize.
[2023-03-13 19:01:03] [INFO ] Deduced a trap composed of 76 places in 136 ms of which 0 ms to minimize.
[2023-03-13 19:01:03] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 1 ms to minimize.
[2023-03-13 19:01:03] [INFO ] Deduced a trap composed of 90 places in 193 ms of which 1 ms to minimize.
[2023-03-13 19:01:04] [INFO ] Deduced a trap composed of 77 places in 181 ms of which 1 ms to minimize.
[2023-03-13 19:01:04] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 1 ms to minimize.
[2023-03-13 19:01:04] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 0 ms to minimize.
[2023-03-13 19:01:04] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 6045 ms
[2023-03-13 19:01:04] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2023-03-13 19:01:04] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 0 ms to minimize.
[2023-03-13 19:01:04] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 0 ms to minimize.
[2023-03-13 19:01:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 367 ms
[2023-03-13 19:01:05] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 1 ms to minimize.
[2023-03-13 19:01:05] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 0 ms to minimize.
[2023-03-13 19:01:05] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 1 ms to minimize.
[2023-03-13 19:01:05] [INFO ] Deduced a trap composed of 93 places in 179 ms of which 1 ms to minimize.
[2023-03-13 19:01:06] [INFO ] Deduced a trap composed of 93 places in 175 ms of which 1 ms to minimize.
[2023-03-13 19:01:06] [INFO ] Deduced a trap composed of 93 places in 182 ms of which 1 ms to minimize.
[2023-03-13 19:01:06] [INFO ] Deduced a trap composed of 101 places in 187 ms of which 1 ms to minimize.
[2023-03-13 19:01:06] [INFO ] Deduced a trap composed of 93 places in 179 ms of which 0 ms to minimize.
[2023-03-13 19:01:06] [INFO ] Deduced a trap composed of 95 places in 167 ms of which 1 ms to minimize.
[2023-03-13 19:01:07] [INFO ] Deduced a trap composed of 93 places in 174 ms of which 1 ms to minimize.
[2023-03-13 19:01:07] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 0 ms to minimize.
[2023-03-13 19:01:07] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 0 ms to minimize.
[2023-03-13 19:01:07] [INFO ] Deduced a trap composed of 103 places in 162 ms of which 1 ms to minimize.
[2023-03-13 19:01:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 2417 ms
[2023-03-13 19:01:07] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2023-03-13 19:01:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-13 19:01:08] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 1 ms to minimize.
[2023-03-13 19:01:08] [INFO ] Deduced a trap composed of 91 places in 168 ms of which 0 ms to minimize.
[2023-03-13 19:01:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 407 ms
[2023-03-13 19:01:08] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 1 ms to minimize.
[2023-03-13 19:01:09] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2023-03-13 19:01:09] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2023-03-13 19:01:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 428 ms
[2023-03-13 19:01:09] [INFO ] Deduced a trap composed of 90 places in 212 ms of which 0 ms to minimize.
[2023-03-13 19:01:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-03-13 19:01:09] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2023-03-13 19:01:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-13 19:01:10] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2023-03-13 19:01:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 119 ms
[2023-03-13 19:01:10] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
[2023-03-13 19:01:10] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 0 ms to minimize.
[2023-03-13 19:01:10] [INFO ] Deduced a trap composed of 94 places in 84 ms of which 1 ms to minimize.
[2023-03-13 19:01:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 432 ms
[2023-03-13 19:01:10] [INFO ] After 13286ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :36
Attempting to minimize the solution found.
Minimization took 964 ms.
[2023-03-13 19:01:11] [INFO ] After 15037ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :36
Fused 45 Parikh solutions to 36 different solutions.
Parikh walk visited 20 properties in 774 ms.
Support contains 24 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 459/459 transitions.
Graph (trivial) has 236 edges and 514 vertex of which 6 / 514 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1137 edges and 509 vertex of which 508 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 508 transition count 389
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 446 transition count 388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 445 transition count 388
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 128 place count 445 transition count 297
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 325 place count 339 transition count 297
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 351 place count 313 transition count 271
Iterating global reduction 3 with 26 rules applied. Total rules applied 377 place count 313 transition count 271
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 377 place count 313 transition count 269
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 381 place count 311 transition count 269
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 607 place count 196 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 609 place count 195 transition count 162
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 611 place count 195 transition count 160
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 613 place count 193 transition count 160
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 616 place count 193 transition count 160
Applied a total of 616 rules in 109 ms. Remains 193 /514 variables (removed 321) and now considering 160/459 (removed 299) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 193/514 places, 160/459 transitions.
Incomplete random walk after 10000 steps, including 377 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10001 steps, including 184 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 184 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 173 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 184 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 160 rows 193 cols
[2023-03-13 19:01:13] [INFO ] Computed 76 place invariants in 3 ms
[2023-03-13 19:01:13] [INFO ] [Real]Absence check using 55 positive place invariants in 6 ms returned sat
[2023-03-13 19:01:13] [INFO ] [Real]Absence check using 55 positive and 21 generalized place invariants in 4 ms returned sat
[2023-03-13 19:01:13] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-13 19:01:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 19:01:13] [INFO ] After 11ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:01:13] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:01:13] [INFO ] [Nat]Absence check using 55 positive place invariants in 6 ms returned sat
[2023-03-13 19:01:13] [INFO ] [Nat]Absence check using 55 positive and 21 generalized place invariants in 4 ms returned sat
[2023-03-13 19:01:13] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:01:13] [INFO ] After 11ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:01:13] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2023-03-13 19:01:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-13 19:01:13] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-13 19:01:13] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Parikh walk visited 2 properties in 1 ms.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2023-03-13 19:01:13] [INFO ] Flatten gal took : 22 ms
[2023-03-13 19:01:13] [INFO ] Flatten gal took : 21 ms
[2023-03-13 19:01:13] [INFO ] Input system was already deterministic with 459 transitions.
Support contains 92 out of 514 places (down from 94) after GAL structural reductions.
Computed a total of 142 stabilizing places and 135 stable transitions
Graph (complete) has 1144 edges and 514 vertex of which 513 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Graph (trivial) has 257 edges and 514 vertex of which 6 / 514 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1138 edges and 509 vertex of which 508 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 507 transition count 382
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 438 transition count 382
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 140 place count 438 transition count 281
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 358 place count 321 transition count 281
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 389 place count 290 transition count 250
Iterating global reduction 2 with 31 rules applied. Total rules applied 420 place count 290 transition count 250
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 420 place count 290 transition count 248
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 424 place count 288 transition count 248
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 227 rules applied. Total rules applied 651 place count 172 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 652 place count 171 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 653 place count 170 transition count 136
Applied a total of 653 rules in 51 ms. Remains 170 /514 variables (removed 344) and now considering 136/459 (removed 323) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 170/514 places, 136/459 transitions.
[2023-03-13 19:01:13] [INFO ] Flatten gal took : 8 ms
[2023-03-13 19:01:13] [INFO ] Flatten gal took : 8 ms
[2023-03-13 19:01:13] [INFO ] Input system was already deterministic with 136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 481 transition count 426
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 481 transition count 426
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 472 transition count 417
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 472 transition count 417
Applied a total of 84 rules in 35 ms. Remains 472 /514 variables (removed 42) and now considering 417/459 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 472/514 places, 417/459 transitions.
[2023-03-13 19:01:13] [INFO ] Flatten gal took : 14 ms
[2023-03-13 19:01:13] [INFO ] Flatten gal took : 15 ms
[2023-03-13 19:01:13] [INFO ] Input system was already deterministic with 417 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 481 transition count 426
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 481 transition count 426
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 472 transition count 417
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 472 transition count 417
Applied a total of 84 rules in 35 ms. Remains 472 /514 variables (removed 42) and now considering 417/459 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 472/514 places, 417/459 transitions.
[2023-03-13 19:01:13] [INFO ] Flatten gal took : 13 ms
[2023-03-13 19:01:13] [INFO ] Flatten gal took : 13 ms
[2023-03-13 19:01:13] [INFO ] Input system was already deterministic with 417 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 480 transition count 425
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 480 transition count 425
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 471 transition count 416
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 471 transition count 416
Applied a total of 86 rules in 44 ms. Remains 471 /514 variables (removed 43) and now considering 416/459 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 471/514 places, 416/459 transitions.
[2023-03-13 19:01:13] [INFO ] Flatten gal took : 13 ms
[2023-03-13 19:01:13] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:01:13] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 483 transition count 428
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 483 transition count 428
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 476 transition count 421
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 476 transition count 421
Applied a total of 76 rules in 23 ms. Remains 476 /514 variables (removed 38) and now considering 421/459 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 476/514 places, 421/459 transitions.
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 13 ms
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 13 ms
[2023-03-13 19:01:14] [INFO ] Input system was already deterministic with 421 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 480 transition count 425
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 480 transition count 425
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 471 transition count 416
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 471 transition count 416
Applied a total of 86 rules in 30 ms. Remains 471 /514 variables (removed 43) and now considering 416/459 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 471/514 places, 416/459 transitions.
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:01:14] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 480 transition count 425
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 480 transition count 425
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 76 place count 472 transition count 417
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 472 transition count 417
Applied a total of 84 rules in 33 ms. Remains 472 /514 variables (removed 42) and now considering 417/459 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 472/514 places, 417/459 transitions.
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:01:14] [INFO ] Input system was already deterministic with 417 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 481 transition count 426
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 481 transition count 426
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 472 transition count 417
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 472 transition count 417
Applied a total of 84 rules in 37 ms. Remains 472 /514 variables (removed 42) and now considering 417/459 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 472/514 places, 417/459 transitions.
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:01:14] [INFO ] Input system was already deterministic with 417 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 486 transition count 431
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 486 transition count 431
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 64 place count 478 transition count 423
Iterating global reduction 0 with 8 rules applied. Total rules applied 72 place count 478 transition count 423
Applied a total of 72 rules in 24 ms. Remains 478 /514 variables (removed 36) and now considering 423/459 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 478/514 places, 423/459 transitions.
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:01:14] [INFO ] Input system was already deterministic with 423 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 488 transition count 433
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 488 transition count 433
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 481 transition count 426
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 481 transition count 426
Applied a total of 66 rules in 30 ms. Remains 481 /514 variables (removed 33) and now considering 426/459 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 481/514 places, 426/459 transitions.
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:01:14] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 481 transition count 426
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 481 transition count 426
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 473 transition count 418
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 473 transition count 418
Applied a total of 82 rules in 27 ms. Remains 473 /514 variables (removed 41) and now considering 418/459 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 473/514 places, 418/459 transitions.
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:01:14] [INFO ] Input system was already deterministic with 418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 482 transition count 427
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 482 transition count 427
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 72 place count 474 transition count 419
Iterating global reduction 0 with 8 rules applied. Total rules applied 80 place count 474 transition count 419
Applied a total of 80 rules in 20 ms. Remains 474 /514 variables (removed 40) and now considering 419/459 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 474/514 places, 419/459 transitions.
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:01:14] [INFO ] Input system was already deterministic with 419 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 481 transition count 426
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 481 transition count 426
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 473 transition count 418
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 473 transition count 418
Applied a total of 82 rules in 26 ms. Remains 473 /514 variables (removed 41) and now considering 418/459 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 473/514 places, 418/459 transitions.
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:01:14] [INFO ] Input system was already deterministic with 418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 485 transition count 430
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 485 transition count 430
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 477 transition count 422
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 477 transition count 422
Applied a total of 74 rules in 33 ms. Remains 477 /514 variables (removed 37) and now considering 422/459 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 477/514 places, 422/459 transitions.
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 9 ms
[2023-03-13 19:01:14] [INFO ] Input system was already deterministic with 422 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Graph (trivial) has 257 edges and 514 vertex of which 6 / 514 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1138 edges and 509 vertex of which 508 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 507 transition count 381
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 437 transition count 381
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 142 place count 437 transition count 280
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 361 place count 319 transition count 280
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 390 place count 290 transition count 251
Iterating global reduction 2 with 29 rules applied. Total rules applied 419 place count 290 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 419 place count 290 transition count 249
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 423 place count 288 transition count 249
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 233 rules applied. Total rules applied 656 place count 169 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 657 place count 168 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 658 place count 167 transition count 134
Applied a total of 658 rules in 43 ms. Remains 167 /514 variables (removed 347) and now considering 134/459 (removed 325) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 167/514 places, 134/459 transitions.
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:01:14] [INFO ] Input system was already deterministic with 134 transitions.
Incomplete random walk after 10000 steps, including 2126 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 607 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished probabilistic random walk after 206 steps, run visited all 1 properties in 9 ms. (steps per millisecond=22 )
Probabilistic random walk after 206 steps, saw 137 distinct states, run finished after 9 ms. (steps per millisecond=22 ) properties seen :1
FORMULA BusinessProcesses-PT-16-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 459/459 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 482 transition count 427
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 482 transition count 427
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 73 place count 473 transition count 418
Iterating global reduction 0 with 9 rules applied. Total rules applied 82 place count 473 transition count 418
Applied a total of 82 rules in 28 ms. Remains 473 /514 variables (removed 41) and now considering 418/459 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 473/514 places, 418/459 transitions.
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 8 ms
[2023-03-13 19:01:14] [INFO ] Flatten gal took : 9 ms
[2023-03-13 19:01:14] [INFO ] Input system was already deterministic with 418 transitions.
[2023-03-13 19:01:15] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:01:15] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:01:15] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 19:01:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 514 places, 459 transitions and 1451 arcs took 3 ms.
Total runtime 33406 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: 514 NrTr: 459 NrArc: 1451)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.015sec
net check time: 0m 0.000sec
init dd package: 0m 3.244sec
before gc: list nodes free: 1682757
after gc: idd nodes used:50726312, unused:13273688; list nodes free:56623761
RS generation: 29m 6.615sec
-> last computed set: #nodes 50725981 (5.1e+07) #states 2,458,879,723,665 (12)
CANNOT_COMPUTE
BK_STOP 1678735859103
--------------------
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.001sec
idd.cc:820: DD Exception: No free nodes
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="BusinessProcesses-PT-16"
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 BusinessProcesses-PT-16, 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 r042-tajo-167813695900570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 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 ;