fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r426-tajo-167905978500114
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldRVs-PT-030A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9818.800 3600000.00 3660495.00 740.80 ?????F??T??????? 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.r426-tajo-167905978500114.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 ShieldRVs-PT-030A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978500114
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 18:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 18:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 19:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 19:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 19:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 19:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 191K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679341995404

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=ShieldRVs-PT-030A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 19:53:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 19:53:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:53:17] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2023-03-20 19:53:17] [INFO ] Transformed 423 places.
[2023-03-20 19:53:17] [INFO ] Transformed 573 transitions.
[2023-03-20 19:53:17] [INFO ] Found NUPN structural information;
[2023-03-20 19:53:17] [INFO ] Parsed PT model containing 423 places and 573 transitions and 2760 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 223 out of 423 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Applied a total of 0 rules in 28 ms. Remains 423 /423 variables (removed 0) and now considering 573/573 (removed 0) transitions.
// Phase 1: matrix 573 rows 423 cols
[2023-03-20 19:53:17] [INFO ] Computed 121 place invariants in 16 ms
[2023-03-20 19:53:17] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-20 19:53:17] [INFO ] Invariant cache hit.
[2023-03-20 19:53:17] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2023-03-20 19:53:17] [INFO ] Invariant cache hit.
[2023-03-20 19:53:18] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1054 ms. Remains : 423/423 places, 573/573 transitions.
Support contains 223 out of 423 places after structural reductions.
[2023-03-20 19:53:18] [INFO ] Flatten gal took : 91 ms
[2023-03-20 19:53:18] [INFO ] Flatten gal took : 41 ms
[2023-03-20 19:53:18] [INFO ] Input system was already deterministic with 573 transitions.
Incomplete random walk after 10000 steps, including 24 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 97) seen :85
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-20 19:53:19] [INFO ] Invariant cache hit.
[2023-03-20 19:53:19] [INFO ] [Real]Absence check using 121 positive place invariants in 25 ms returned sat
[2023-03-20 19:53:20] [INFO ] After 412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 19:53:20] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-20 19:53:20] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 19:53:20] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 6 ms to minimize.
[2023-03-20 19:53:20] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2023-03-20 19:53:20] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 0 ms to minimize.
[2023-03-20 19:53:21] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2023-03-20 19:53:21] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2023-03-20 19:53:21] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2023-03-20 19:53:21] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2023-03-20 19:53:21] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2023-03-20 19:53:21] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2023-03-20 19:53:21] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2023-03-20 19:53:21] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2023-03-20 19:53:21] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2023-03-20 19:53:21] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 0 ms to minimize.
[2023-03-20 19:53:22] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2023-03-20 19:53:22] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2023-03-20 19:53:22] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2023-03-20 19:53:22] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2023-03-20 19:53:22] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2023-03-20 19:53:22] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2023-03-20 19:53:22] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 0 ms to minimize.
[2023-03-20 19:53:22] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 0 ms to minimize.
[2023-03-20 19:53:22] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2023-03-20 19:53:23] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2023-03-20 19:53:23] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2023-03-20 19:53:23] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2023-03-20 19:53:23] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2023-03-20 19:53:23] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2023-03-20 19:53:23] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2023-03-20 19:53:23] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2023-03-20 19:53:23] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2023-03-20 19:53:23] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2023-03-20 19:53:23] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2023-03-20 19:53:23] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-20 19:53:24] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2023-03-20 19:53:24] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 6 ms to minimize.
[2023-03-20 19:53:24] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 3624 ms
[2023-03-20 19:53:24] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2023-03-20 19:53:24] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2023-03-20 19:53:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2023-03-20 19:53:24] [INFO ] After 4191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-20 19:53:24] [INFO ] After 4425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 55 ms.
Support contains 13 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 573/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 572
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 0 with 60 rules applied. Total rules applied 62 place count 422 transition count 572
Applied a total of 62 rules in 115 ms. Remains 422 /423 variables (removed 1) and now considering 572/573 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 422/423 places, 572/573 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 572 rows 422 cols
[2023-03-20 19:53:24] [INFO ] Computed 121 place invariants in 9 ms
[2023-03-20 19:53:25] [INFO ] [Real]Absence check using 121 positive place invariants in 19 ms returned sat
[2023-03-20 19:53:25] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 19:53:25] [INFO ] [Nat]Absence check using 121 positive place invariants in 19 ms returned sat
[2023-03-20 19:53:25] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:53:25] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2023-03-20 19:53:26] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2023-03-20 19:53:26] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 0 ms to minimize.
[2023-03-20 19:53:26] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2023-03-20 19:53:26] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2023-03-20 19:53:26] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2023-03-20 19:53:26] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-20 19:53:26] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 0 ms to minimize.
[2023-03-20 19:53:26] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2023-03-20 19:53:27] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2023-03-20 19:53:27] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 1 ms to minimize.
[2023-03-20 19:53:27] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 0 ms to minimize.
[2023-03-20 19:53:27] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
[2023-03-20 19:53:27] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2023-03-20 19:53:27] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2023-03-20 19:53:27] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2023-03-20 19:53:28] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 0 ms to minimize.
[2023-03-20 19:53:28] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2023-03-20 19:53:28] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2023-03-20 19:53:28] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 0 ms to minimize.
[2023-03-20 19:53:28] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2023-03-20 19:53:28] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 0 ms to minimize.
[2023-03-20 19:53:28] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2023-03-20 19:53:29] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2023-03-20 19:53:29] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2023-03-20 19:53:29] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2023-03-20 19:53:29] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2023-03-20 19:53:29] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2023-03-20 19:53:29] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2023-03-20 19:53:29] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2023-03-20 19:53:30] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
[2023-03-20 19:53:30] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2023-03-20 19:53:30] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2023-03-20 19:53:30] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-03-20 19:53:30] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2023-03-20 19:53:30] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2023-03-20 19:53:30] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2023-03-20 19:53:30] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2023-03-20 19:53:30] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2023-03-20 19:53:31] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2023-03-20 19:53:31] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2023-03-20 19:53:31] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2023-03-20 19:53:31] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-03-20 19:53:31] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-20 19:53:31] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 5793 ms
[2023-03-20 19:53:31] [INFO ] After 6209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-20 19:53:31] [INFO ] After 6441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 7 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 572/572 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 572
Applied a total of 1 rules in 112 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 422/422 places, 572/572 transitions.
Incomplete random walk after 10000 steps, including 27 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 473060 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :{}
Probabilistic random walk after 473060 steps, saw 103758 distinct states, run finished after 3002 ms. (steps per millisecond=157 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 572 rows 422 cols
[2023-03-20 19:53:34] [INFO ] Computed 121 place invariants in 11 ms
[2023-03-20 19:53:35] [INFO ] [Real]Absence check using 121 positive place invariants in 28 ms returned sat
[2023-03-20 19:53:35] [INFO ] After 291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 19:53:35] [INFO ] [Nat]Absence check using 121 positive place invariants in 29 ms returned sat
[2023-03-20 19:53:35] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:53:35] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2023-03-20 19:53:36] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2023-03-20 19:53:36] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2023-03-20 19:53:36] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 0 ms to minimize.
[2023-03-20 19:53:36] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2023-03-20 19:53:36] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2023-03-20 19:53:36] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2023-03-20 19:53:36] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2023-03-20 19:53:36] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-20 19:53:37] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2023-03-20 19:53:37] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2023-03-20 19:53:37] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2023-03-20 19:53:37] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 0 ms to minimize.
[2023-03-20 19:53:37] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 0 ms to minimize.
[2023-03-20 19:53:37] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2023-03-20 19:53:37] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2023-03-20 19:53:38] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2023-03-20 19:53:38] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2023-03-20 19:53:38] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2023-03-20 19:53:38] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2023-03-20 19:53:38] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2023-03-20 19:53:38] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2023-03-20 19:53:38] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2023-03-20 19:53:39] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2023-03-20 19:53:39] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2023-03-20 19:53:39] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2023-03-20 19:53:39] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2023-03-20 19:53:39] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 0 ms to minimize.
[2023-03-20 19:53:39] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 1 ms to minimize.
[2023-03-20 19:53:39] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 1 ms to minimize.
[2023-03-20 19:53:40] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 0 ms to minimize.
[2023-03-20 19:53:40] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 1 ms to minimize.
[2023-03-20 19:53:40] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 1 ms to minimize.
[2023-03-20 19:53:40] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 0 ms to minimize.
[2023-03-20 19:53:40] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 0 ms to minimize.
[2023-03-20 19:53:40] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 0 ms to minimize.
[2023-03-20 19:53:41] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2023-03-20 19:53:41] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2023-03-20 19:53:41] [INFO ] Deduced a trap composed of 16 places in 128 ms of which 0 ms to minimize.
[2023-03-20 19:53:41] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2023-03-20 19:53:41] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
[2023-03-20 19:53:41] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 0 ms to minimize.
[2023-03-20 19:53:41] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2023-03-20 19:53:42] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2023-03-20 19:53:42] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 6298 ms
[2023-03-20 19:53:42] [INFO ] After 6622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-20 19:53:42] [INFO ] After 6833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 7 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 572/572 transitions.
Applied a total of 0 rules in 43 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 422/422 places, 572/572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 572/572 transitions.
Applied a total of 0 rules in 30 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
[2023-03-20 19:53:42] [INFO ] Invariant cache hit.
[2023-03-20 19:53:42] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-20 19:53:42] [INFO ] Invariant cache hit.
[2023-03-20 19:53:43] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
[2023-03-20 19:53:43] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-20 19:53:43] [INFO ] Invariant cache hit.
[2023-03-20 19:53:43] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1277 ms. Remains : 422/422 places, 572/572 transitions.
Applied a total of 0 rules in 18 ms. Remains 422 /422 variables (removed 0) and now considering 572/572 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 19:53:43] [INFO ] Invariant cache hit.
[2023-03-20 19:53:43] [INFO ] [Real]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-20 19:53:43] [INFO ] After 309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 19:53:43] [INFO ] [Nat]Absence check using 121 positive place invariants in 15 ms returned sat
[2023-03-20 19:53:44] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:53:44] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-20 19:53:44] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2023-03-20 19:53:44] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2023-03-20 19:53:44] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2023-03-20 19:53:44] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2023-03-20 19:53:44] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 0 ms to minimize.
[2023-03-20 19:53:45] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2023-03-20 19:53:45] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 1 ms to minimize.
[2023-03-20 19:53:45] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2023-03-20 19:53:45] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 0 ms to minimize.
[2023-03-20 19:53:45] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2023-03-20 19:53:45] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 0 ms to minimize.
[2023-03-20 19:53:46] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2023-03-20 19:53:46] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2023-03-20 19:53:46] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2023-03-20 19:53:46] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 0 ms to minimize.
[2023-03-20 19:53:46] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2023-03-20 19:53:46] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 0 ms to minimize.
[2023-03-20 19:53:46] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2023-03-20 19:53:46] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2023-03-20 19:53:47] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2023-03-20 19:53:47] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2023-03-20 19:53:47] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2023-03-20 19:53:47] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2023-03-20 19:53:47] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2023-03-20 19:53:47] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2023-03-20 19:53:48] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2023-03-20 19:53:48] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 0 ms to minimize.
[2023-03-20 19:53:48] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2023-03-20 19:53:48] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2023-03-20 19:53:48] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2023-03-20 19:53:48] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 0 ms to minimize.
[2023-03-20 19:53:48] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-20 19:53:49] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2023-03-20 19:53:49] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2023-03-20 19:53:49] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-20 19:53:49] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2023-03-20 19:53:49] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 0 ms to minimize.
[2023-03-20 19:53:49] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2023-03-20 19:53:49] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2023-03-20 19:53:49] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2023-03-20 19:53:50] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 0 ms to minimize.
[2023-03-20 19:53:50] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2023-03-20 19:53:50] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2023-03-20 19:53:50] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-03-20 19:53:50] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2023-03-20 19:53:50] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2023-03-20 19:53:50] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2023-03-20 19:53:50] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2023-03-20 19:53:51] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2023-03-20 19:53:51] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2023-03-20 19:53:51] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2023-03-20 19:53:51] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2023-03-20 19:53:51] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2023-03-20 19:53:51] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2023-03-20 19:53:51] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-20 19:53:51] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-03-20 19:53:51] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2023-03-20 19:53:51] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2023-03-20 19:53:52] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2023-03-20 19:53:52] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2023-03-20 19:53:52] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2023-03-20 19:53:52] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 0 ms to minimize.
[2023-03-20 19:53:52] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2023-03-20 19:53:52] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2023-03-20 19:53:52] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2023-03-20 19:53:52] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2023-03-20 19:53:52] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2023-03-20 19:53:52] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2023-03-20 19:53:53] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2023-03-20 19:53:53] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2023-03-20 19:53:53] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-20 19:53:53] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2023-03-20 19:53:53] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2023-03-20 19:53:53] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2023-03-20 19:53:53] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2023-03-20 19:53:53] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2023-03-20 19:53:53] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2023-03-20 19:53:53] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-03-20 19:53:54] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 0 ms to minimize.
[2023-03-20 19:53:54] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2023-03-20 19:53:54] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2023-03-20 19:53:54] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2023-03-20 19:53:54] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2023-03-20 19:53:54] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2023-03-20 19:53:54] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2023-03-20 19:53:54] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2023-03-20 19:53:54] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-03-20 19:53:54] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-03-20 19:53:54] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2023-03-20 19:53:54] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2023-03-20 19:53:55] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2023-03-20 19:53:55] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2023-03-20 19:53:55] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2023-03-20 19:53:55] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2023-03-20 19:53:55] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2023-03-20 19:53:55] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2023-03-20 19:53:55] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2023-03-20 19:53:55] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2023-03-20 19:53:55] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2023-03-20 19:53:55] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2023-03-20 19:53:56] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2023-03-20 19:53:56] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2023-03-20 19:53:56] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2023-03-20 19:53:56] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2023-03-20 19:53:56] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2023-03-20 19:53:56] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2023-03-20 19:53:56] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2023-03-20 19:53:56] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2023-03-20 19:53:56] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2023-03-20 19:53:56] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2023-03-20 19:53:57] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2023-03-20 19:53:57] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2023-03-20 19:53:57] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 18 ms to minimize.
[2023-03-20 19:53:57] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2023-03-20 19:53:57] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2023-03-20 19:53:57] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2023-03-20 19:53:57] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2023-03-20 19:53:57] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2023-03-20 19:53:57] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2023-03-20 19:53:58] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 3 ms to minimize.
[2023-03-20 19:53:58] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2023-03-20 19:53:58] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2023-03-20 19:53:58] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2023-03-20 19:53:58] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 0 ms to minimize.
[2023-03-20 19:53:58] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2023-03-20 19:53:58] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2023-03-20 19:53:59] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 3 ms to minimize.
[2023-03-20 19:53:59] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 0 ms to minimize.
[2023-03-20 19:53:59] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2023-03-20 19:53:59] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2023-03-20 19:53:59] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2023-03-20 19:53:59] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-20 19:53:59] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-20 19:53:59] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2023-03-20 19:54:00] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2023-03-20 19:54:00] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 0 ms to minimize.
[2023-03-20 19:54:00] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2023-03-20 19:54:00] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2023-03-20 19:54:00] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2023-03-20 19:54:00] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2023-03-20 19:54:00] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2023-03-20 19:54:01] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 0 ms to minimize.
[2023-03-20 19:54:01] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2023-03-20 19:54:01] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2023-03-20 19:54:01] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2023-03-20 19:54:01] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2023-03-20 19:54:01] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2023-03-20 19:54:01] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2023-03-20 19:54:01] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2023-03-20 19:54:01] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2023-03-20 19:54:02] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2023-03-20 19:54:02] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2023-03-20 19:54:02] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2023-03-20 19:54:02] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2023-03-20 19:54:02] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2023-03-20 19:54:02] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-20 19:54:02] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-20 19:54:02] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-20 19:54:03] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-20 19:54:03] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2023-03-20 19:54:03] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2023-03-20 19:54:03] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2023-03-20 19:54:03] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2023-03-20 19:54:03] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2023-03-20 19:54:03] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2023-03-20 19:54:04] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2023-03-20 19:54:04] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2023-03-20 19:54:04] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2023-03-20 19:54:04] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 0 ms to minimize.
[2023-03-20 19:54:04] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2023-03-20 19:54:04] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2023-03-20 19:54:04] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2023-03-20 19:54:05] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2023-03-20 19:54:05] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2023-03-20 19:54:05] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2023-03-20 19:54:05] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 0 ms to minimize.
[2023-03-20 19:54:05] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2023-03-20 19:54:05] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2023-03-20 19:54:05] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2023-03-20 19:54:05] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2023-03-20 19:54:06] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2023-03-20 19:54:06] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2023-03-20 19:54:06] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2023-03-20 19:54:06] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2023-03-20 19:54:06] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2023-03-20 19:54:06] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2023-03-20 19:54:06] [INFO ] Trap strengthening (SAT) tested/added 188/187 trap constraints in 22529 ms
[2023-03-20 19:54:06] [INFO ] After 22801ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-20 19:54:06] [INFO ] After 22965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 19:54:06] [INFO ] Flatten gal took : 46 ms
[2023-03-20 19:54:06] [INFO ] Flatten gal took : 45 ms
[2023-03-20 19:54:06] [INFO ] Input system was already deterministic with 573 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Applied a total of 0 rules in 8 ms. Remains 423 /423 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 423/423 places, 573/573 transitions.
[2023-03-20 19:54:07] [INFO ] Flatten gal took : 46 ms
[2023-03-20 19:54:07] [INFO ] Flatten gal took : 64 ms
[2023-03-20 19:54:07] [INFO ] Input system was already deterministic with 573 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Applied a total of 0 rules in 12 ms. Remains 423 /423 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 423/423 places, 573/573 transitions.
[2023-03-20 19:54:07] [INFO ] Flatten gal took : 34 ms
[2023-03-20 19:54:07] [INFO ] Flatten gal took : 30 ms
[2023-03-20 19:54:07] [INFO ] Input system was already deterministic with 573 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 572
Applied a total of 2 rules in 41 ms. Remains 422 /423 variables (removed 1) and now considering 572/573 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 422/423 places, 572/573 transitions.
[2023-03-20 19:54:07] [INFO ] Flatten gal took : 29 ms
[2023-03-20 19:54:07] [INFO ] Flatten gal took : 43 ms
[2023-03-20 19:54:07] [INFO ] Input system was already deterministic with 572 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Applied a total of 0 rules in 5 ms. Remains 423 /423 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 423/423 places, 573/573 transitions.
[2023-03-20 19:54:07] [INFO ] Flatten gal took : 34 ms
[2023-03-20 19:54:07] [INFO ] Flatten gal took : 33 ms
[2023-03-20 19:54:07] [INFO ] Input system was already deterministic with 573 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 572
Applied a total of 2 rules in 41 ms. Remains 422 /423 variables (removed 1) and now considering 572/573 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 422/423 places, 572/573 transitions.
[2023-03-20 19:54:07] [INFO ] Flatten gal took : 23 ms
[2023-03-20 19:54:07] [INFO ] Flatten gal took : 21 ms
[2023-03-20 19:54:07] [INFO ] Input system was already deterministic with 572 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 572
Applied a total of 2 rules in 18 ms. Remains 422 /423 variables (removed 1) and now considering 572/573 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 422/423 places, 572/573 transitions.
[2023-03-20 19:54:07] [INFO ] Flatten gal took : 18 ms
[2023-03-20 19:54:07] [INFO ] Flatten gal took : 20 ms
[2023-03-20 19:54:08] [INFO ] Input system was already deterministic with 572 transitions.
Finished random walk after 244 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=122 )
FORMULA ShieldRVs-PT-030A-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 572
Applied a total of 2 rules in 29 ms. Remains 422 /423 variables (removed 1) and now considering 572/573 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 422/423 places, 572/573 transitions.
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 29 ms
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 28 ms
[2023-03-20 19:54:08] [INFO ] Input system was already deterministic with 572 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Applied a total of 0 rules in 4 ms. Remains 423 /423 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 423/423 places, 573/573 transitions.
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 19 ms
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 18 ms
[2023-03-20 19:54:08] [INFO ] Input system was already deterministic with 573 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 421 transition count 571
Applied a total of 2 rules in 18 ms. Remains 421 /423 variables (removed 2) and now considering 571/573 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 421/423 places, 571/573 transitions.
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 16 ms
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 19 ms
[2023-03-20 19:54:08] [INFO ] Input system was already deterministic with 571 transitions.
Finished random walk after 277 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=138 )
FORMULA ShieldRVs-PT-030A-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Applied a total of 0 rules in 4 ms. Remains 423 /423 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 423/423 places, 573/573 transitions.
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 32 ms
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 30 ms
[2023-03-20 19:54:08] [INFO ] Input system was already deterministic with 573 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Applied a total of 0 rules in 12 ms. Remains 423 /423 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 423/423 places, 573/573 transitions.
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 15 ms
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 17 ms
[2023-03-20 19:54:08] [INFO ] Input system was already deterministic with 573 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Applied a total of 0 rules in 5 ms. Remains 423 /423 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 423/423 places, 573/573 transitions.
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 20 ms
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 21 ms
[2023-03-20 19:54:08] [INFO ] Input system was already deterministic with 573 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Applied a total of 0 rules in 3 ms. Remains 423 /423 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 423/423 places, 573/573 transitions.
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 17 ms
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 19 ms
[2023-03-20 19:54:08] [INFO ] Input system was already deterministic with 573 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Applied a total of 0 rules in 4 ms. Remains 423 /423 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 423/423 places, 573/573 transitions.
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 17 ms
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 18 ms
[2023-03-20 19:54:08] [INFO ] Input system was already deterministic with 573 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Applied a total of 0 rules in 3 ms. Remains 423 /423 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 423/423 places, 573/573 transitions.
[2023-03-20 19:54:08] [INFO ] Flatten gal took : 15 ms
[2023-03-20 19:54:09] [INFO ] Flatten gal took : 17 ms
[2023-03-20 19:54:09] [INFO ] Input system was already deterministic with 573 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 573/573 transitions.
Applied a total of 0 rules in 5 ms. Remains 423 /423 variables (removed 0) and now considering 573/573 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 423/423 places, 573/573 transitions.
[2023-03-20 19:54:09] [INFO ] Flatten gal took : 24 ms
[2023-03-20 19:54:09] [INFO ] Flatten gal took : 23 ms
[2023-03-20 19:54:09] [INFO ] Input system was already deterministic with 573 transitions.
[2023-03-20 19:54:09] [INFO ] Flatten gal took : 20 ms
[2023-03-20 19:54:09] [INFO ] Flatten gal took : 19 ms
[2023-03-20 19:54:09] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-20 19:54:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 423 places, 573 transitions and 2760 arcs took 3 ms.
Total runtime 52255 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: 423 NrTr: 573 NrArc: 2760)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.016sec

net check time: 0m 0.000sec

init dd package: 0m 3.060sec


before gc: list nodes free: 1144347

after gc: idd nodes used:3311, unused:63996689; list nodes free:276806480

before gc: list nodes free: 823120

after gc: idd nodes used:3543, unused:63996457; list nodes free:276805146

before gc: list nodes free: 205952

after gc: idd nodes used:3957, unused:63996043; list nodes free:276803144

before gc: list nodes free: 16167

after gc: idd nodes used:3840, unused:63996160; list nodes free:276803772

before gc: list nodes free: 763053

after gc: idd nodes used:3966, unused:63996034; list nodes free:276803043

before gc: list nodes free: 324711

after gc: idd nodes used:4088, unused:63995912; list nodes free:276802282

before gc: list nodes free: 1153914

after gc: idd nodes used:4330, unused:63995670; list nodes free:278898186

before gc: list nodes free: 1421819

after gc: idd nodes used:4313, unused:63995687; list nodes free:278898333

before gc: list nodes free: 2200623

after gc: idd nodes used:4346, unused:63995654; list nodes free:278898261

before gc: list nodes free: 1279174

after gc: idd nodes used:5014, unused:63994986; list nodes free:278894749

before gc: list nodes free: 1242882

after gc: idd nodes used:4569, unused:63995431; list nodes free:278897246

before gc: list nodes free: 2010765

after gc: idd nodes used:4573, unused:63995427; list nodes free:278897209

before gc: list nodes free: 1806044

after gc: idd nodes used:4666, unused:63995334; list nodes free:278896794

before gc: list nodes free: 1030301

after gc: idd nodes used:4420, unused:63995580; list nodes free:278898001

before gc: list nodes free: 1973585

after gc: idd nodes used:4401, unused:63995599; list nodes free:278898177

before gc: list nodes free: 1103872

after gc: idd nodes used:4523, unused:63995477; list nodes free:278897523

before gc: list nodes free: 1904182

after gc: idd nodes used:4458, unused:63995542; list nodes free:278897975

before gc: list nodes free: 2071642

after gc: idd nodes used:4434, unused:63995566; list nodes free:278897934

before gc: list nodes free: 2037795

after gc: idd nodes used:4475, unused:63995525; list nodes free:278897779

before gc: list nodes free: 2058196

after gc: idd nodes used:4768, unused:63995232; list nodes free:280993211

before gc: list nodes free: 3196110

after gc: idd nodes used:4574, unused:63995426; list nodes free:280994316

before gc: list nodes free: 4467287

after gc: idd nodes used:4504, unused:63995496; list nodes free:280994635

before gc: list nodes free: 4589532

after gc: idd nodes used:4377, unused:63995623; list nodes free:280995294

before gc: list nodes free: 4009627

after gc: idd nodes used:4607, unused:63995393; list nodes free:280994057

before gc: list nodes free: 3991408

after gc: idd nodes used:4660, unused:63995340; list nodes free:280993923

before gc: list nodes free: 3609352

after gc: idd nodes used:4877, unused:63995123; list nodes free:280992887

before gc: list nodes free: 3149650

after gc: idd nodes used:4949, unused:63995051; list nodes free:280992428

before gc: list nodes free: 2544620

after gc: idd nodes used:4993, unused:63995007; list nodes free:280992224

before gc: list nodes free: 3039234

after gc: idd nodes used:5044, unused:63994956; list nodes free:280991976

before gc: list nodes free: 3370756

after gc: idd nodes used:5202, unused:63994798; list nodes free:280991145
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 6326828 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16099668 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

2524 2792 2777 3243 3007 2948 3120 3247 3457 3103 3270 3358 3306 3632 3483 3516 3628 3675 3699 3603 3667 3572 3564 3521 3490 3831 3711 3653 3572 3726 3718 3820 3865 4053 3939 3748 3864 3946 3791 3930 3956 4171 4119 4050 4066 4049 4019 4031 3817 3788 3781 4023 3888 3825 3792 3879 3903 3916 4077 3928 3915 3951 3965 3904 3792 3937 3921 3950 3922 4007 4106 3964 3987 4249 4295 4108 4200 4150 3962 4168 4073 4362 4218 4304 4342 4288 4303 4276 4419 4302 4274 4304 4447 4492 4288 4312 4393 4369 4372 4414 4381 4365 4488 4547 4506 4342 4382 4502 4412 4369 4421 4679 5107 4646 4705 4705 4727 4689 4696 4724 5007 4518 4626 4521 4547 4558 4504 4542 4425 4486 4497 4521 4597 4422 4544 4456 4527 4550 4448 4489 4637 4749 4475 4502 4562 4565 4558 4592 4846 4659 4699 4768 4691 4717 4705 4671 4580 4598 4691 4638 4639 4644 4610 4712 4820 4643 4657 4607 4380 4469 4509 4486 4433 4488 4489 4623 4403 4593 4427 4529 4409 4547 4498 4448 4420 4520 4433 4652 4569 4526 4523 4518 4538 4578 4383 4422 4559 4427 4444 4588 4379 4462 4560 4449 4581 4400 4527 4386 4477 4369 4286 4288 4397 4425 4480 4352 4350 4428 4482 4433 4447 4356 4394 4425 4467 4463 4400 4568 4431 4519 4545 4634 4586 4547 4541 4580 4444 4566 4663 4689 4596 4712 4623 4617 4700 4670 4713 4662 4561 4657 4801 4598 4618 4622 4555 4663 4573 4644 4704 4501 4468 4499 4697 4572 4433 4505 4638 4687 4503 4577 4495 4561 4720 4577 4581 4449 4544 4558 4681 4720 4528 4570 4583 4586 4653 4518 4460 4561 4571 4639 4642 4593 4651 4692 4589 4569 4599 4553 4654 4490 4629 4652 4618 4639 4815 4641 4689 4759 4699 4706 4843 4764 4811 4851 4773 4856 4867 4861 4923 4869 4840 4843 4926 4991 4834 4774 5003 4782 4781 4879 5100 5027 4985 5147 5115 5010 5026 5129 4891 4984 4936 5126 5077 5100 4893 5049 4979 5073 4979 4965 4973 4966 5139 5082 5159 4955 5037 5006 5018 4986 5050 5353 5376

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVs-PT-030A"
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 ShieldRVs-PT-030A, 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 r426-tajo-167905978500114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-030A.tgz
mv ShieldRVs-PT-030A 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;