Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r106-tall-167814482600370.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DES-PT-01b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482600370
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.9K Feb 26 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 68K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678378304566

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=DES-PT-01b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 16:11:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 16:11:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 16:11:46] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-09 16:11:46] [INFO ] Transformed 284 places.
[2023-03-09 16:11:46] [INFO ] Transformed 235 transitions.
[2023-03-09 16:11:46] [INFO ] Found NUPN structural information;
[2023-03-09 16:11:46] [INFO ] Parsed PT model containing 284 places and 235 transitions and 683 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 124 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 281 transition count 235
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 269 transition count 223
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 269 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 266 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 266 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 266 transition count 218
Applied a total of 35 rules in 50 ms. Remains 266 /284 variables (removed 18) and now considering 218/235 (removed 17) transitions.
// Phase 1: matrix 218 rows 266 cols
[2023-03-09 16:11:46] [INFO ] Computed 62 place invariants in 20 ms
[2023-03-09 16:11:46] [INFO ] Implicit Places using invariants in 265 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 288 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 265/284 places, 218/235 transitions.
Applied a total of 0 rules in 5 ms. Remains 265 /265 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 343 ms. Remains : 265/284 places, 218/235 transitions.
Support contains 124 out of 265 places after structural reductions.
[2023-03-09 16:11:46] [INFO ] Flatten gal took : 42 ms
[2023-03-09 16:11:46] [INFO ] Flatten gal took : 16 ms
[2023-03-09 16:11:47] [INFO ] Input system was already deterministic with 218 transitions.
Incomplete random walk after 10000 steps, including 100 resets, run finished after 584 ms. (steps per millisecond=17 ) properties (out of 78) seen :63
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 218 rows 265 cols
[2023-03-09 16:11:47] [INFO ] Computed 61 place invariants in 7 ms
[2023-03-09 16:11:48] [INFO ] [Real]Absence check using 32 positive place invariants in 19 ms returned sat
[2023-03-09 16:11:48] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-09 16:11:48] [INFO ] After 268ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2 real:10
[2023-03-09 16:11:48] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 6 ms to minimize.
[2023-03-09 16:11:48] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2023-03-09 16:11:48] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2023-03-09 16:11:48] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2023-03-09 16:11:48] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2023-03-09 16:11:48] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-03-09 16:11:48] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2023-03-09 16:11:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 462 ms
[2023-03-09 16:11:48] [INFO ] After 773ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:12
[2023-03-09 16:11:48] [INFO ] After 1144ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:12
[2023-03-09 16:11:49] [INFO ] [Nat]Absence check using 32 positive place invariants in 11 ms returned sat
[2023-03-09 16:11:49] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 9 ms returned sat
[2023-03-09 16:11:49] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2023-03-09 16:11:49] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2023-03-09 16:11:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-09 16:11:49] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2023-03-09 16:11:50] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2023-03-09 16:11:50] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2023-03-09 16:11:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 250 ms
[2023-03-09 16:11:50] [INFO ] After 895ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :11
Attempting to minimize the solution found.
Minimization took 144 ms.
[2023-03-09 16:11:50] [INFO ] After 1461ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :11
Fused 14 Parikh solutions to 11 different solutions.
Parikh walk visited 5 properties in 61 ms.
Support contains 22 out of 265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 218/218 transitions.
Graph (complete) has 479 edges and 265 vertex of which 262 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 262 transition count 196
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 38 place count 245 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 244 transition count 195
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 39 place count 244 transition count 185
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 59 place count 234 transition count 185
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 72 place count 221 transition count 172
Iterating global reduction 3 with 13 rules applied. Total rules applied 85 place count 221 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 89 place count 221 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 89 place count 221 transition count 167
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 91 place count 220 transition count 167
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 99 place count 212 transition count 159
Iterating global reduction 4 with 8 rules applied. Total rules applied 107 place count 212 transition count 159
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 9 rules applied. Total rules applied 116 place count 212 transition count 150
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 119 place count 210 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 119 place count 210 transition count 147
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 123 place count 208 transition count 147
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 6 with 136 rules applied. Total rules applied 259 place count 140 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 263 place count 138 transition count 81
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 265 place count 138 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 267 place count 136 transition count 79
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 268 place count 136 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 269 place count 135 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 270 place count 134 transition count 77
Applied a total of 270 rules in 67 ms. Remains 134 /265 variables (removed 131) and now considering 77/218 (removed 141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 134/265 places, 77/218 transitions.
Incomplete random walk after 10000 steps, including 434 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 77 rows 134 cols
[2023-03-09 16:11:50] [INFO ] Computed 63 place invariants in 2 ms
[2023-03-09 16:11:50] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 16:11:50] [INFO ] [Real]Absence check using 36 positive and 27 generalized place invariants in 7 ms returned sat
[2023-03-09 16:11:50] [INFO ] After 34ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 16:11:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 16:11:50] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 16:11:50] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 16:11:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-09 16:11:50] [INFO ] [Nat]Absence check using 36 positive and 27 generalized place invariants in 5 ms returned sat
[2023-03-09 16:11:50] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 16:11:50] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 16:11:50] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2023-03-09 16:11:51] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-09 16:11:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2023-03-09 16:11:51] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 16:11:51] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 77/77 transitions.
Graph (complete) has 372 edges and 134 vertex of which 130 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 130 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 129 transition count 75
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 129 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 8 place count 126 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 126 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 125 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 123 transition count 70
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 123 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 122 transition count 69
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 122 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 121 transition count 68
Applied a total of 18 rules in 24 ms. Remains 121 /134 variables (removed 13) and now considering 68/77 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 121/134 places, 68/77 transitions.
Incomplete random walk after 10000 steps, including 514 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2237547 steps, run timeout after 3001 ms. (steps per millisecond=745 ) properties seen :{}
Probabilistic random walk after 2237547 steps, saw 304724 distinct states, run finished after 3003 ms. (steps per millisecond=745 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 68 rows 121 cols
[2023-03-09 16:11:54] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-09 16:11:54] [INFO ] [Real]Absence check using 37 positive place invariants in 4 ms returned sat
[2023-03-09 16:11:54] [INFO ] [Real]Absence check using 37 positive and 22 generalized place invariants in 20 ms returned sat
[2023-03-09 16:11:54] [INFO ] After 30ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 16:11:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 16:11:54] [INFO ] After 21ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 16:11:54] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 16:11:54] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-09 16:11:54] [INFO ] [Nat]Absence check using 37 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-09 16:11:54] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 16:11:54] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 16:11:54] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-09 16:11:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-09 16:11:54] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 16:11:54] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 121/121 places, 68/68 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-09 16:11:54] [INFO ] Invariant cache hit.
[2023-03-09 16:11:54] [INFO ] Implicit Places using invariants in 82 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 120/121 places, 68/68 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 90 ms. Remains : 120/121 places, 68/68 transitions.
Incomplete random walk after 10000 steps, including 507 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2501209 steps, run timeout after 3001 ms. (steps per millisecond=833 ) properties seen :{}
Probabilistic random walk after 2501209 steps, saw 338846 distinct states, run finished after 3001 ms. (steps per millisecond=833 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 68 rows 120 cols
[2023-03-09 16:11:57] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-09 16:11:57] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 16:11:57] [INFO ] [Real]Absence check using 36 positive and 22 generalized place invariants in 5 ms returned sat
[2023-03-09 16:11:57] [INFO ] After 28ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 16:11:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 16:11:57] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 16:11:57] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-09 16:11:57] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-09 16:11:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2023-03-09 16:11:57] [INFO ] After 104ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 16:11:57] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 16:11:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 16:11:57] [INFO ] [Nat]Absence check using 36 positive and 22 generalized place invariants in 5 ms returned sat
[2023-03-09 16:11:57] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 16:11:57] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 16:11:57] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-09 16:11:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-09 16:11:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2023-03-09 16:11:57] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 16:11:57] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 68/68 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 120/120 places, 68/68 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 68/68 transitions.
Applied a total of 0 rules in 2 ms. Remains 120 /120 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-09 16:11:57] [INFO ] Invariant cache hit.
[2023-03-09 16:11:57] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-09 16:11:57] [INFO ] Invariant cache hit.
[2023-03-09 16:11:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 16:11:58] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [30, 34, 38, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 96, 115]
Discarding 16 places :
Implicit Place search using SMT with State Equation took 232 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/120 places, 68/68 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 104 transition count 59
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 21 place count 92 transition count 59
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 29 place count 88 transition count 55
Applied a total of 29 rules in 5 ms. Remains 88 /104 variables (removed 16) and now considering 55/68 (removed 13) transitions.
// Phase 1: matrix 55 rows 88 cols
[2023-03-09 16:11:58] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-09 16:11:58] [INFO ] Implicit Places using invariants in 49 ms returned [41, 68, 74, 77]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 50 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/120 places, 55/68 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 83 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 83 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 82 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 82 transition count 52
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 6 place count 81 transition count 51
Applied a total of 6 rules in 6 ms. Remains 81 /84 variables (removed 3) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 81 cols
[2023-03-09 16:11:58] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-09 16:11:58] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-09 16:11:58] [INFO ] Invariant cache hit.
[2023-03-09 16:11:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 16:11:58] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 81/120 places, 51/68 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 418 ms. Remains : 81/120 places, 51/68 transitions.
Incomplete random walk after 10000 steps, including 578 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2923926 steps, run timeout after 3001 ms. (steps per millisecond=974 ) properties seen :{}
Probabilistic random walk after 2923926 steps, saw 436625 distinct states, run finished after 3001 ms. (steps per millisecond=974 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 16:12:01] [INFO ] Invariant cache hit.
[2023-03-09 16:12:01] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-09 16:12:01] [INFO ] [Real]Absence check using 22 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-09 16:12:01] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 16:12:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 16:12:01] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-09 16:12:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-09 16:12:01] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-09 16:12:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
[2023-03-09 16:12:01] [INFO ] After 79ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 16:12:01] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 16:12:01] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-09 16:12:01] [INFO ] [Nat]Absence check using 22 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-09 16:12:01] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 16:12:01] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 16:12:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-09 16:12:01] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-09 16:12:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2023-03-09 16:12:01] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 16:12:01] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 81/81 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-09 16:12:01] [INFO ] Invariant cache hit.
[2023-03-09 16:12:01] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-09 16:12:01] [INFO ] Invariant cache hit.
[2023-03-09 16:12:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-09 16:12:01] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-09 16:12:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 16:12:01] [INFO ] Invariant cache hit.
[2023-03-09 16:12:01] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 81/81 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 16:12:01] [INFO ] Invariant cache hit.
[2023-03-09 16:12:01] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-09 16:12:01] [INFO ] [Real]Absence check using 22 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-09 16:12:01] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 16:12:01] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2023-03-09 16:12:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-09 16:12:01] [INFO ] After 58ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 16:12:01] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 16:12:01] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-09 16:12:01] [INFO ] [Nat]Absence check using 22 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-09 16:12:01] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 16:12:02] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2023-03-09 16:12:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-09 16:12:02] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-09 16:12:02] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 17 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 12 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 218 transitions.
Computed a total of 54 stabilizing places and 49 stable transitions
Graph (complete) has 479 edges and 265 vertex of which 258 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 246 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 246 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 246 transition count 195
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 238 transition count 187
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 238 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 238 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 237 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 237 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 237 transition count 178
Applied a total of 68 rules in 14 ms. Remains 237 /265 variables (removed 28) and now considering 178/218 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 237/265 places, 178/218 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 8 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 8 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Graph (complete) has 479 edges and 265 vertex of which 258 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 257 transition count 193
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 237 transition count 193
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 237 transition count 183
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 227 transition count 183
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 75 place count 213 transition count 169
Iterating global reduction 2 with 14 rules applied. Total rules applied 89 place count 213 transition count 169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 93 place count 213 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 93 place count 213 transition count 164
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 212 transition count 164
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 103 place count 204 transition count 156
Iterating global reduction 3 with 8 rules applied. Total rules applied 111 place count 204 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 9 rules applied. Total rules applied 120 place count 204 transition count 147
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 123 place count 202 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 123 place count 202 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 125 place count 201 transition count 145
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 130 rules applied. Total rules applied 255 place count 136 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 257 place count 134 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 259 place count 132 transition count 78
Applied a total of 259 rules in 39 ms. Remains 132 /265 variables (removed 133) and now considering 78/218 (removed 140) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 132/265 places, 78/218 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 5 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 5 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 249 transition count 202
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 249 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 249 transition count 199
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 243 transition count 193
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 243 transition count 193
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 52 place count 243 transition count 188
Applied a total of 52 rules in 9 ms. Remains 243 /265 variables (removed 22) and now considering 188/218 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 243/265 places, 188/218 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 9 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 9 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 188 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Graph (complete) has 479 edges and 265 vertex of which 258 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 257 transition count 197
Reduce places removed 16 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 241 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 239 transition count 195
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 37 place count 239 transition count 186
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 55 place count 230 transition count 186
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 69 place count 216 transition count 172
Iterating global reduction 3 with 14 rules applied. Total rules applied 83 place count 216 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 87 place count 216 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 87 place count 216 transition count 167
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 215 transition count 167
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 97 place count 207 transition count 159
Iterating global reduction 4 with 8 rules applied. Total rules applied 105 place count 207 transition count 159
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 9 rules applied. Total rules applied 114 place count 207 transition count 150
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 117 place count 205 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 117 place count 205 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 119 place count 204 transition count 148
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 6 with 126 rules applied. Total rules applied 245 place count 141 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 247 place count 139 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 249 place count 137 transition count 83
Applied a total of 249 rules in 37 ms. Remains 137 /265 variables (removed 128) and now considering 83/218 (removed 135) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 137/265 places, 83/218 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 5 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 5 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 246 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 246 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 246 transition count 195
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 238 transition count 187
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 238 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 238 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 237 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 237 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 237 transition count 178
Applied a total of 68 rules in 13 ms. Remains 237 /265 variables (removed 28) and now considering 178/218 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 237/265 places, 178/218 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 7 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 7 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 248 transition count 201
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 248 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 248 transition count 198
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 240 transition count 190
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 240 transition count 190
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 60 place count 240 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 239 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 239 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 239 transition count 181
Applied a total of 63 rules in 12 ms. Remains 239 /265 variables (removed 26) and now considering 181/218 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 239/265 places, 181/218 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 7 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 7 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 249 transition count 202
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 249 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 249 transition count 199
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 242 transition count 192
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 242 transition count 192
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 55 place count 242 transition count 186
Applied a total of 55 rules in 10 ms. Remains 242 /265 variables (removed 23) and now considering 186/218 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 242/265 places, 186/218 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 7 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 7 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 186 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Graph (complete) has 479 edges and 265 vertex of which 258 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 257 transition count 195
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 239 transition count 195
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 239 transition count 183
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 61 place count 227 transition count 183
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 75 place count 213 transition count 169
Iterating global reduction 2 with 14 rules applied. Total rules applied 89 place count 213 transition count 169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 93 place count 213 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 93 place count 213 transition count 164
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 212 transition count 164
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 103 place count 204 transition count 156
Iterating global reduction 3 with 8 rules applied. Total rules applied 111 place count 204 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 9 rules applied. Total rules applied 120 place count 204 transition count 147
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 123 place count 202 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 123 place count 202 transition count 144
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 127 place count 200 transition count 144
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 130 rules applied. Total rules applied 257 place count 135 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 259 place count 133 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 261 place count 131 transition count 77
Applied a total of 261 rules in 27 ms. Remains 131 /265 variables (removed 134) and now considering 77/218 (removed 141) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 131/265 places, 77/218 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 4 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 4 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 247 transition count 200
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 247 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 247 transition count 197
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 240 transition count 190
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 240 transition count 190
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 240 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 239 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 239 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 239 transition count 182
Applied a total of 62 rules in 13 ms. Remains 239 /265 variables (removed 26) and now considering 182/218 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 239/265 places, 182/218 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 7 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 6 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Graph (complete) has 479 edges and 265 vertex of which 258 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 257 transition count 199
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 243 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 242 transition count 198
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 31 place count 242 transition count 188
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 51 place count 232 transition count 188
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 62 place count 221 transition count 177
Iterating global reduction 3 with 11 rules applied. Total rules applied 73 place count 221 transition count 177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 76 place count 221 transition count 174
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 83 place count 214 transition count 167
Iterating global reduction 4 with 7 rules applied. Total rules applied 90 place count 214 transition count 167
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 7 rules applied. Total rules applied 97 place count 214 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 98 place count 213 transition count 160
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 98 place count 213 transition count 159
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 100 place count 212 transition count 159
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 222 place count 151 transition count 98
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 223 place count 151 transition count 97
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 224 place count 151 transition count 97
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 226 place count 149 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 228 place count 147 transition count 95
Applied a total of 228 rules in 28 ms. Remains 147 /265 variables (removed 118) and now considering 95/218 (removed 123) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 147/265 places, 95/218 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 4 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 5 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 251 transition count 204
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 251 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 251 transition count 201
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 246 transition count 196
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 246 transition count 196
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 46 place count 246 transition count 191
Applied a total of 46 rules in 9 ms. Remains 246 /265 variables (removed 19) and now considering 191/218 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 246/265 places, 191/218 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 7 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 7 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 191 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 246 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 246 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 246 transition count 195
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 238 transition count 187
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 238 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 238 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 237 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 237 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 237 transition count 178
Applied a total of 68 rules in 14 ms. Remains 237 /265 variables (removed 28) and now considering 178/218 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 237/265 places, 178/218 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 6 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 6 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 247 transition count 200
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 247 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 247 transition count 197
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 239 transition count 189
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 239 transition count 189
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 62 place count 239 transition count 182
Applied a total of 62 rules in 9 ms. Remains 239 /265 variables (removed 26) and now considering 182/218 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 239/265 places, 182/218 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 6 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 7 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 246 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 246 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 246 transition count 195
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 238 transition count 187
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 238 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 238 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 237 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 237 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 237 transition count 178
Applied a total of 68 rules in 12 ms. Remains 237 /265 variables (removed 28) and now considering 178/218 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 237/265 places, 178/218 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 6 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 6 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 246 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 246 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 246 transition count 195
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 238 transition count 187
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 238 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 238 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 237 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 237 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 237 transition count 178
Applied a total of 68 rules in 13 ms. Remains 237 /265 variables (removed 28) and now considering 178/218 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 237/265 places, 178/218 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 6 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 6 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Graph (complete) has 479 edges and 265 vertex of which 258 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 257 transition count 195
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 239 transition count 195
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 239 transition count 184
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 228 transition count 184
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 71 place count 216 transition count 172
Iterating global reduction 2 with 12 rules applied. Total rules applied 83 place count 216 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 87 place count 216 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 87 place count 216 transition count 167
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 215 transition count 167
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 96 place count 208 transition count 160
Iterating global reduction 3 with 7 rules applied. Total rules applied 103 place count 208 transition count 160
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 109 place count 208 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 207 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 110 place count 207 transition count 153
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 112 place count 206 transition count 153
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 240 place count 142 transition count 89
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 241 place count 142 transition count 88
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 244 place count 142 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 246 place count 140 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 248 place count 138 transition count 86
Applied a total of 248 rules in 28 ms. Remains 138 /265 variables (removed 127) and now considering 86/218 (removed 132) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 138/265 places, 86/218 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 4 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 4 ms
[2023-03-09 16:12:02] [INFO ] Input system was already deterministic with 86 transitions.
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 7 ms
[2023-03-09 16:12:02] [INFO ] Flatten gal took : 8 ms
[2023-03-09 16:12:02] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-09 16:12:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 265 places, 218 transitions and 641 arcs took 1 ms.
Total runtime 16646 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: 265 NrTr: 218 NrArc: 641)

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

net check time: 0m 0.000sec

init dd package: 0m 2.768sec


RS generation: 6m18.521sec


-> reachability set: #nodes 2031570 (2.0e+06) #states 90,891,705,461,620,806 (16)



starting MCC model checker
--------------------------

checking: EF [AX [[[p147<=1 & 1<=p147] & [p173<=1 & 1<=p173]]]]
normalized: E [true U ~ [EX [~ [[[p173<=1 & 1<=p173] & [p147<=1 & 1<=p147]]]]]]

abstracting: (1<=p147)
states: 24,942,001,839,600,320 (16)
abstracting: (p147<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p173)
states: 13,961,527,506,823,680 (16)
abstracting: (p173<=1)
states: 90,891,705,461,620,806 (16)

before gc: list nodes free: 654335

after gc: idd nodes used:4637198, unused:59362802; list nodes free:261931985
.MC time: 3m22.075sec

checking: E [EF [[EF [EG [[p162<=1 & 1<=p162]]] | [p3<=1 & 1<=p3]]] U [p52<=1 & 1<=p52]]
normalized: E [E [true U [[p3<=1 & 1<=p3] | E [true U EG [[p162<=1 & 1<=p162]]]]] U [p52<=1 & 1<=p52]]

abstracting: (1<=p52)
states: 19,633,881,529,616,322 (16)
abstracting: (p52<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p162)
states: 11,788,123,866,560 (13)
abstracting: (p162<=1)
states: 90,891,705,461,620,806 (16)
.
before gc: list nodes free: 580170

after gc: idd nodes used:6044969, unused:57955031; list nodes free:256100253

before gc: list nodes free: 595072

after gc: idd nodes used:8648129, unused:55351871; list nodes free:244580302
.................................................MC time: 3m 9.001sec

checking: AF [~ [E [~ [[p117<=1 & 1<=p117]] U [[p199<=1 & 1<=p199] & [p223<=1 & 1<=p223]]]]]
normalized: ~ [EG [E [~ [[p117<=1 & 1<=p117]] U [[p223<=1 & 1<=p223] & [p199<=1 & 1<=p199]]]]]

abstracting: (1<=p199)
states: 3,856,648,224,651,264 (15)
abstracting: (p199<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p223)
states: 45,167,524,399,670,328 (16)
abstracting: (p223<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p117)
states: 1,171,438,967,439,360 (15)
abstracting: (p117<=1)
states: 90,891,705,461,620,806 (16)

before gc: list nodes free: 1142807

after gc: idd nodes used:8114086, unused:55885914; list nodes free:246971736
MC time: 2m57.654sec

checking: AF [[EX [[p232<=1 & 1<=p232]] | [A [[p104<=1 & 1<=p104] U [p2<=1 & 1<=p2]] | EG [[p165<=0 & 0<=p165]]]]]
normalized: ~ [EG [~ [[[EG [[p165<=0 & 0<=p165]] | [~ [EG [~ [[p2<=1 & 1<=p2]]]] & ~ [E [~ [[p2<=1 & 1<=p2]] U [~ [[p104<=1 & 1<=p104]] & ~ [[p2<=1 & 1<=p2]]]]]]] | EX [[p232<=1 & 1<=p232]]]]]]

abstracting: (1<=p232)
states: 255,892,330,116 (11)
abstracting: (p232<=1)
states: 90,891,705,461,620,806 (16)
.abstracting: (1<=p2)
states: 11,446,894,257 (10)
abstracting: (p2<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p104)
states: 3,084,320,409,914,016 (15)
abstracting: (p104<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p2)
states: 11,446,894,257 (10)
abstracting: (p2<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p2)
states: 11,446,894,257 (10)
abstracting: (p2<=1)
states: 90,891,705,461,620,806 (16)

before gc: list nodes free: 1648415

after gc: idd nodes used:8331608, unused:55668392; list nodes free:246056689
MC time: 2m46.824sec

checking: EF [[EX [[[p48<=0 & 0<=p48] | [p225<=0 & 0<=p225]]] & EX [EG [[[p2<=0 & 0<=p2] | [p38<=0 & 0<=p38]]]]]]
normalized: E [true U [EX [EG [[[p2<=0 & 0<=p2] | [p38<=0 & 0<=p38]]]] & EX [[[p225<=0 & 0<=p225] | [p48<=0 & 0<=p48]]]]]

abstracting: (0<=p48)
states: 90,891,705,461,620,806 (16)
abstracting: (p48<=0)
states: 71,257,823,932,004,484 (16)
abstracting: (0<=p225)
states: 90,891,705,461,620,806 (16)
abstracting: (p225<=0)
states: 88,150,303,767,691,832 (16)

before gc: list nodes free: 2073482

after gc: idd nodes used:12323180, unused:51676820; list nodes free:228556489
.abstracting: (0<=p38)
states: 90,891,705,461,620,806 (16)
abstracting: (p38<=0)
states: 82,702,162,872,021,174 (16)
abstracting: (0<=p2)
states: 90,891,705,461,620,806 (16)
abstracting: (p2<=0)
states: 90,891,694,014,726,549 (16)
MC time: 2m37.309sec

checking: E [~ [[EF [[EG [[1<=p66 & p66<=1]] & ~ [AX [[p144<=1 & 1<=p144]]]]] & [[p93<=1 & 1<=p93] & [p95<=1 & 1<=p95]]]] U [[p233<=1 & 1<=p233] & [p261<=1 & 1<=p261]]]
normalized: E [~ [[[[p95<=1 & 1<=p95] & [p93<=1 & 1<=p93]] & E [true U [EX [~ [[p144<=1 & 1<=p144]]] & EG [[1<=p66 & p66<=1]]]]]] U [[p261<=1 & 1<=p261] & [p233<=1 & 1<=p233]]]

abstracting: (1<=p233)
states: 12,742,931,708,448,696 (16)
abstracting: (p233<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p261)
states: 863,628,269,547 (11)
abstracting: (p261<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (p66<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p66)
states: 1,901,624,496 (9)
..........................................................................
EG iterations: 74
abstracting: (1<=p144)
states: 18,228,645,160,581,824 (16)
abstracting: (p144<=1)
states: 90,891,705,461,620,806 (16)

before gc: list nodes free: 1730842

after gc: idd nodes used:13130199, unused:50869801; list nodes free:226332714

before gc: list nodes free: 4239533

after gc: idd nodes used:13133443, unused:50866557; list nodes free:226315618
.abstracting: (1<=p93)
states: 6,314,628,655,560,960 (15)
abstracting: (p93<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p95)
states: 10,951,495,374,444,768 (16)
abstracting: (p95<=1)
states: 90,891,705,461,620,806 (16)
MC time: 2m27.842sec

checking: EG [[[p3<=0 & 0<=p3] | [~ [E [[p255<=1 & 1<=p255] U [p44<=1 & 1<=p44]]] & [[p144<=0 & 0<=p144] & [~ [E [[p104<=1 & 1<=p104] U [p24<=1 & 1<=p24]]] | [p16<=0 & 0<=p16]]]]]]
normalized: EG [[[[[[p16<=0 & 0<=p16] | ~ [E [[p104<=1 & 1<=p104] U [p24<=1 & 1<=p24]]]] & [p144<=0 & 0<=p144]] & ~ [E [[p255<=1 & 1<=p255] U [p44<=1 & 1<=p44]]]] | [p3<=0 & 0<=p3]]]

abstracting: (0<=p3)
states: 90,891,705,461,620,806 (16)
abstracting: (p3<=0)
states: 90,891,181,402,779,653 (16)
abstracting: (1<=p44)
states: 8,189,542,589,599,632 (15)
abstracting: (p44<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p255)
states: 6,458,064,443,073,216 (15)
abstracting: (p255<=1)
states: 90,891,705,461,620,806 (16)
MC time: 2m17.019sec

checking: [AG [EX [[[EX [[[p48<=0 & 0<=p48] | [p225<=0 & 0<=p225]]] & ~ [E [[p27<=1 & 1<=p27] U [[p262<=1 & 1<=p262] & [p264<=1 & 1<=p264]]]]] | [[p141<=1 & 1<=p141] & [p38<=1 & 1<=p38]]]]] | EF [[p229<=1 & 1<=p229]]]
normalized: [E [true U [p229<=1 & 1<=p229]] | ~ [E [true U ~ [EX [[[[p38<=1 & 1<=p38] & [p141<=1 & 1<=p141]] | [~ [E [[p27<=1 & 1<=p27] U [[p264<=1 & 1<=p264] & [p262<=1 & 1<=p262]]]] & EX [[[p225<=0 & 0<=p225] | [p48<=0 & 0<=p48]]]]]]]]]]

abstracting: (0<=p48)
states: 90,891,705,461,620,806 (16)
abstracting: (p48<=0)
states: 71,257,823,932,004,484 (16)
abstracting: (0<=p225)
states: 90,891,705,461,620,806 (16)
abstracting: (p225<=0)
states: 88,150,303,767,691,832 (16)

before gc: list nodes free: 1410430

after gc: idd nodes used:15818672, unused:48181328; list nodes free:215055168

before gc: list nodes free: 3830744

after gc: idd nodes used:15822748, unused:48177252; list nodes free:215034748
MC time: 2m 8.919sec

checking: EF [[[EX [[[p180<=1 & 1<=p180] & [p210<=1 & 1<=p210]]] | [[p119<=1 & 1<=p119] & [p227<=1 & 1<=p227]]] | [[[p48<=1 & 1<=p48] & [p225<=1 & 1<=p225]] | [[p92<=1 & 1<=p92] & [p98<=1 & 1<=p98]]]]]
normalized: E [true U [[[[p98<=1 & 1<=p98] & [p92<=1 & 1<=p92]] | [[p225<=1 & 1<=p225] & [p48<=1 & 1<=p48]]] | [[[p227<=1 & 1<=p227] & [p119<=1 & 1<=p119]] | EX [[[p210<=1 & 1<=p210] & [p180<=1 & 1<=p180]]]]]]

abstracting: (1<=p180)
states: 36,939,358,102,125,056 (16)
abstracting: (p180<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p210)
states: 33,553,859,104,986,624 (16)
abstracting: (p210<=1)
states: 90,891,705,461,620,806 (16)
.abstracting: (1<=p119)
states: 70,756,317,883,634,517 (16)
abstracting: (p119<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p227)
states: 182,042,859,552,768 (14)
abstracting: (p227<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p48)
states: 19,633,881,529,616,322 (16)
abstracting: (p48<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p225)
states: 2,741,401,693,928,974 (15)
abstracting: (p225<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p92)
states: 20,248,126,016,048,880 (16)
abstracting: (p92<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p98)
states: 3,084,320,409,914,016 (15)
abstracting: (p98<=1)
states: 90,891,705,461,620,806 (16)
MC time: 2m 0.300sec

checking: [AX [AG [~ [A [E [[p139<=1 & 1<=p139] U [[p147<=1 & 1<=p147] & [p173<=1 & 1<=p173]]] U EF [[[p147<=1 & 1<=p147] & [p173<=1 & 1<=p173]]]]]]] | AF [EX [[EX [[[p63<=1 & 1<=p63] & [p90<=1 & 1<=p90]]] & [p52<=1 & 1<=p52]]]]]
normalized: [~ [EG [~ [EX [[[p52<=1 & 1<=p52] & EX [[[p90<=1 & 1<=p90] & [p63<=1 & 1<=p63]]]]]]]] | ~ [EX [E [true U [~ [EG [~ [E [true U [[p173<=1 & 1<=p173] & [p147<=1 & 1<=p147]]]]]] & ~ [E [~ [E [true U [[p173<=1 & 1<=p173] & [p147<=1 & 1<=p147]]]] U [~ [E [[p139<=1 & 1<=p139] U [[p173<=1 & 1<=p173] & [p147<=1 & 1<=p147]]]] & ~ [E [true U [[p173<=1 & 1<=p173] & [p147<=1 & 1<=p147]]]]]]]]]]]]

abstracting: (1<=p147)
states: 24,942,001,839,600,320 (16)
abstracting: (p147<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p173)
states: 13,961,527,506,823,680 (16)
abstracting: (p173<=1)
states: 90,891,705,461,620,806 (16)

before gc: list nodes free: 2583510

after gc: idd nodes used:17702186, unused:46297814; list nodes free:206705615
MC time: 1m52.757sec

checking: EF [[[AF [[[p70<=1 & 1<=p70] & [p88<=1 & 1<=p88]]] & [~ [[p19<=1 & 1<=p19]] | [[p41<=1 & 1<=p41] & [p109<=1 & 1<=p109]]]] | [[p200<=1 & 1<=p200] & [[p175<=0 & 0<=p175] & [p99<=0 & 0<=p99]]]]]
normalized: E [true U [[[[p99<=0 & 0<=p99] & [p175<=0 & 0<=p175]] & [p200<=1 & 1<=p200]] | [[[[p109<=1 & 1<=p109] & [p41<=1 & 1<=p41]] | ~ [[p19<=1 & 1<=p19]]] & ~ [EG [~ [[[p88<=1 & 1<=p88] & [p70<=1 & 1<=p70]]]]]]]]

abstracting: (1<=p70)
states: 7,338,965,974,509,312 (15)
abstracting: (p70<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p88)
states: 8,969,010,840,344,448 (15)
abstracting: (p88<=1)
states: 90,891,705,461,620,806 (16)

before gc: list nodes free: 3872517

after gc: idd nodes used:19486266, unused:44513734; list nodes free:199068911
MC time: 1m45.549sec

checking: E [[EG [EF [[[p239<=1 & 1<=p239] & [p248<=1 & 1<=p248]]]] & EX [[p72<=1 & 1<=p72]]] U EX [EF [[AX [[[p119<=1 & 1<=p119] & [p227<=1 & 1<=p227]]] | [[[p117<=1 & 1<=p117] & [[p147<=1 & 1<=p147] & [p173<=1 & 1<=p173]]] | [[[p262<=1 & 1<=p262] & [p264<=1 & 1<=p264]] & [[p92<=1 & 1<=p92] & [p102<=1 & 1<=p102]]]]]]]]
normalized: E [[EX [[p72<=1 & 1<=p72]] & EG [E [true U [[p248<=1 & 1<=p248] & [p239<=1 & 1<=p239]]]]] U EX [E [true U [[[[[p102<=1 & 1<=p102] & [p92<=1 & 1<=p92]] & [[p262<=1 & 1<=p262] & [p264<=1 & 1<=p264]]] | [[p117<=1 & 1<=p117] & [[p173<=1 & 1<=p173] & [p147<=1 & 1<=p147]]]] | ~ [EX [~ [[[p227<=1 & 1<=p227] & [p119<=1 & 1<=p119]]]]]]]]]

abstracting: (1<=p119)
states: 70,756,317,883,634,517 (16)
abstracting: (p119<=1)
states: 90,891,705,461,620,806 (16)
abstracting: (1<=p227)
states: 182,042,859,552,768 (14)
abstracting: (p227<=1)
states: 90,891,705,461,620,806 (16)

before gc: list nodes free: 3940113

after gc: idd nodes used:19525321, unused:44474679; list nodes free:198880893
MC time: 1m39.475sec

checking: AF [[AG [[[p235<=0 & 0<=p235] | [[[A [[p142<=1 & 1<=p142] U [p62<=1 & 1<=p62]] & [p203<=1 & 1<=p203]] & [[p205<=1 & 1<=p205] & [[p207<=1 & 1<=p207] & [p209<=1 & 1<=p209]]]] & [[[p211<=1 & 1<=p211] & [[p213<=1 & 1<=p213] & [p215<=1 & 1<=p215]]] & [[p217<=1 & 1<=p217] & [[p142<=1 & 1<=p142] & [p14<=1 & 1<=p14]]]]]]] | EF [AG [EX [[p78<=1 & 1<=p78]]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[[[[[~ [EG [~ [[p62<=1 & 1<=p62]]]] & ~ [E [~ [[p62<=1 & 1<=p62]] U [~ [[p142<=1 & 1<=p142]] & ~ [[p62<=1 & 1<=p62]]]]]] & [p203<=1 & 1<=p203]] & [[[p209<=1 & 1<=p209] & [p207<=1 & 1<=p207]] & [p205<=1 & 1<=p205]]] & [[[[p14<=1 & 1<=p14] & [p142<=1 & 1<=p142]] & [p217<=1 & 1<=p217]] & [[[p215<=1 & 1<=p215] & [p213<=1 & 1<=p213]] & [p211<=1 & 1<=p211]]]] | [p235<=0 & 0<=p235]]]]] | E [true U ~ [E [true U ~ [EX [[p78<=1 & 1<=p78]]]]]]]]]]

abstracting: (1<=p78)
states: 7,338,965,974,509,312 (15)
abstracting: (p78<=1)
states: 90,891,705,461,620,806 (16)

before gc: list nodes free: 3914899

after gc: idd nodes used:18520315, unused:45479685; list nodes free:203298472
.MC time: 1m34.169sec

checking: EF [[AG [[p104<=0 & 0<=p104]] | [AF [E [[[p5<=1 & 1<=p5] & [[p257<=1 & 1<=p257] & [p69<=1 & 1<=p69]]] U [[p135<=1 & 1<=p135] & [[p55<=1 & 1<=p55] & [p245<=1 & 1<=p245]]]]] & [[p192<=1 & 1<=p192] | [[[p81<=0 & 0<=p81] & [[p145<=0 & 0<=p145] | [p170<=0 & 0<=p170]]] & [[[p155<=0 & 0<=p155] | [p185<=0 & 0<=p185]] & [[p33<=1 & 1<=p33] | [[p243<=1 & 1<=p243] & [p251<=1 & 1<=p251]]]]]]]]]
normalized: E [true U [[[[[[[p185<=0 & 0<=p185] | [p155<=0 & 0<=p155]] & [[[p251<=1 & 1<=p251] & [p243<=1 & 1<=p243]] | [p33<=1 & 1<=p33]]] & [[[p170<=0 & 0<=p170] | [p145<=0 & 0<=p145]] & [p81<=0 & 0<=p81]]] | [p192<=1 & 1<=p192]] & ~ [EG [~ [E [[[[p69<=1 & 1<=p69] & [p257<=1 & 1<=p257]] & [p5<=1 & 1<=p5]] U [[[p245<=1 & 1<=p245] & [p55<=1 & 1<=p55]] & [p135<=1 & 1<=p135]]]]]]] | ~ [E [true U ~ [[p104<=0 & 0<=p104]]]]]]

abstracting: (0<=p104)
states: 90,891,705,461,620,806 (16)
abstracting: (p104<=0)
states: 87,807,385,051,706,790 (16)

before gc: list nodes free: 3086871

after gc: idd nodes used:18961393, unused:45038607; list nodes free:201366170
MC time: 1m27.681sec

checking: EF [[[EX [[[AF [[p192<=1 & 1<=p192]] | [p57<=1 & 1<=p57]] & AF [[p3<=1 & 1<=p3]]]] & [[p133<=1 & 1<=p133] | [[EF [[p39<=1 & 1<=p39]] & AG [[p73<=1 & 1<=p73]]] & [[p131<=1 & 1<=p131] & [p252<=1 & 1<=p252]]]]] & [[~ [A [[p72<=1 & 1<=p72] U ~ [[p49<=1 & 1<=p49]]]] | AF [[p139<=0 & 0<=p139]]] & [[[p52<=0 & 0<=p52] | ~ [E [[[[[p146<=1 & 1<=p146] & [p148<=1 & 1<=p148]] & [[p150<=1 & 1<=p150] & [p152<=1 & 1<=p152]]] & [[[p154<=1 & 1<=p154] & [p156<=1 & 1<=p156]] & [[p158<=1 & 1<=p158] & [p160<=1 & 1<=p160]]]] U [p249<=1 & 1<=p249]]]] & [[p57<=1 & 1<=p57] | [AG [[[p180<=1 & 1<=p180] & [p210<=1 & 1<=p210]]] | E [[p164<=1 & 1<=p164] U [[p37<=1 & 1<=p37] & [p109<=1 & 1<=p109]]]]]]]]]
normalized: E [true U [[[~ [[~ [EG [[p49<=1 & 1<=p49]]] & ~ [E [[p49<=1 & 1<=p49] U [~ [[p72<=1 & 1<=p72]] & [p49<=1 & 1<=p49]]]]]] | ~ [EG [~ [[p139<=0 & 0<=p139]]]]] & [[[E [[p164<=1 & 1<=p164] U [[p37<=1 & 1<=p37] & [p109<=1 & 1<=p109]]] | ~ [E [true U ~ [[[p210<=1 & 1<=p210] & [p180<=1 & 1<=p180]]]]]] | [p57<=1 & 1<=p57]] & [~ [E [[[[[p160<=1 & 1<=p160] & [p158<=1 & 1<=p158]] & [[p156<=1 & 1<=p156] & [p154<=1 & 1<=p154]]] & [[[p152<=1 & 1<=p152] & [p150<=1 & 1<=p150]] & [[p148<=1 & 1<=p148] & [p146<=1 & 1<=p146]]]] U [p249<=1 & 1<=p249]]] | [p52<=0 & 0<=p52]]]] & [[[[[p252<=1 & 1<=p252] & [p131<=1 & 1<=p131]] & [~ [E [true U ~ [[p73<=1 & 1<=p73]]]] & E [true U [p39<=1 & 1<=p39]]]] | [p133<=1 & 1<=p133]] & EX [[~ [EG [~ [[p3<=1 & 1<=p3]]]] & [[p57<=1 & 1<=p57] | ~ [EG [~ [[p192<=1 & 1<=p192]]]]]]]]]]

abstracting: (1<=p192)
states: 2,125,835,114,722,660 (15)
abstracting: (p192<=1)
states: 90,891,705,461,620,806 (16)

before gc: list nodes free: 3855260

after gc: idd nodes used:19800125, unused:44199875; list nodes free:197495812
MC time: 1m22.459sec

checking: A [[[p186<=1 & 1<=p186] & [p214<=1 & 1<=p214]] U [A [~ [AF [[[p34<=1 & 1<=p34] & [[p109<=1 & 1<=p109] & [p144<=1 & 1<=p144]]]]] U [[AX [[p38<=1 & 1<=p38]] & EG [[[p51<=1 & 1<=p51] & [p225<=1 & 1<=p225]]]] & [AF [[[[p147<=1 & 1<=p147] & [p173<=1 & 1<=p173]] | [p142<=1 & 1<=p142]]] & [[p34<=1 & 1<=p34] & [p109<=1 & 1<=p109]]]]] | [A [[AG [[[p30<=1 & 1<=p30] & [p94<=1 & 1<=p94]]] | EG [[[p65<=1 & 1<=p65] & [p218<=1 & 1<=p218]]]] U [[[p117<=1 & 1<=p117] | AX [[p106<=1 & 1<=p106]]] & [p142<=1 & 1<=p142]]] & [[E [[[p157<=1 & 1<=p157] & [p188<=1 & 1<=p188]] U [[p155<=1 & 1<=p155] & [p185<=1 & 1<=p185]]] | ~ [[p80<=1 & 1<=p80]]] | [[p27<=1 & 1<=p27] | ~ [[[p178<=1 & 1<=p178] | [p104<=1 & 1<=p104]]]]]]]]
normalized: [~ [EG [~ [[[[[~ [[[p104<=1 & 1<=p104] | [p178<=1 & 1<=p178]]] | [p27<=1 & 1<=p27]] | [~ [[p80<=1 & 1<=p80]] | E [[[p188<=1 & 1<=p188] & [p157<=1 & 1<=p157]] U [[p185<=1 & 1<=p185] & [p155<=1 & 1<=p155]]]]] & [~ [EG [~ [[[p142<=1 & 1<=p142] & [~ [EX [~ [[p106<=1 & 1<=p106]]]] | [p117<=1 & 1<=p117]]]]]] & ~ [E [~ [[[p142<=1 & 1<=p142] & [~ [EX [~ [[p106<=1 & 1<=p106]]]] | [p117<=1 & 1<=p117]]]] U [~ [[EG [[[p218<=1 & 1<=p218] & [p65<=1 & 1<=p65]]] | ~ [E [true U ~ [[[p94<=1 & 1<=p94] & [p30<=1 & 1<=p30]]]]]]] & ~ [[[p142<=1 & 1<=p142] & [~ [EX [~ [[p106<=1 & 1<=p106]]]] | [p117<=1 & 1<=p117]]]]]]]]] | [~ [EG [~ [[[[[p109<=1 & 1<=p109] & [p34<=1 & 1<=p34]] & ~ [EG [~ [[[p142<=1 & 1<=p142] | [[p173<=1 & 1<=p173] & [p147<=1 & 1<=p147]]]]]]] & [EG [[[p225<=1 & 1<=p225] & [p51<=1 & 1<=p51]]] & ~ [EX [~ [[p38<=1 & 1<=p38]]]]]]]]] & ~ [E [~ [[[[[p109<=1 & 1<=p109] & [p34<=1 & 1<=p34]] & ~ [EG [~ [[[p142<=1 & 1<=p142] | [[p173<=1 & 1<=p173] & [p147<=1 & 1<=p147]]]]]]] & [EG [[[p225<=1 & 1<=p225] & [p51<=1 & 1<=p51]]] & ~ [EX [~ [[p38<=1 & 1<=p38]]]]]]] U [~ [EG [~ [[[[p144<=1 & 1<=p144] & [p109<=1 & 1<=p109]] & [p34<=1 & 1<=p34]]]]] & ~ [[[[[p109<=1 & 1<=p109] & [p34<=1 & 1<=p34]] & ~ [EG [~ [[[p142<=1 & 1<=p142] | [[p173<=1 & 1<=p173] & [p147<=1 & 1<=p147]]]]]]] & [EG [[[p225<=1 & 1<=p225] & [p51<=1 & 1<=p51]]] & ~ [EX [~ [[p38<=1 & 1<=p38]]]]]]]]]]]]]]] & ~ [E [~ [[[[[~ [[[p104<=1 & 1<=p104] | [p178<=1 & 1<=p178]]] | [p27<=1 & 1<=p27]] | [~ [[p80<=1 & 1<=p80]] | E [[[p188<=1 & 1<=p188] & [p157<=1 & 1<=p157]] U [[p185<=1 & 1<=p185] & [p155<=1 & 1<=p155]]]]] & [~ [EG [~ [[[p142<=1 & 1<=p142] & [~ [EX [~ [[p106<=1 & 1<=p106]]]] | [p117<=1 & 1<=p117]]]]]] & ~ [E [~ [[[p142<=1 & 1<=p142] & [~ [EX [~ [[p106<=1 & 1<=p106]]]] | [p117<=1 & 1<=p117]]]] U [~ [[EG [[[p218<=1 & 1<=p218] & [p65<=1 & 1<=p65]]] | ~ [E [true U ~ [[[p94<=1 & 1<=p94] & [p30<=1 & 1<=p30]]]]]]] & ~ [[[p142<=1 & 1<=p142] & [~ [EX [~ [[p106<=1 & 1<=p106]]]] | [p117<=1 & 1<=p117]]]]]]]]] | [~ [EG [~ [[[[[p109<=1 & 1<=p109] & [p34<=1 & 1<=p34]] & ~ [EG [~ [[[p142<=1 & 1<=p142] | [[p173<=1 & 1<=p173] & [p147<=1 & 1<=p147]]]]]]] & [EG [[[p225<=1 & 1<=p225] & [p51<=1 & 1<=p51]]] & ~ [EX [~ [[p38<=1 & 1<=p38]]]]]]]]] & ~ [E [~ [[[[[p109<=1 & 1<=p109] & [p34<=1 & 1<=p34]] & ~ [EG [~ [[[p142<=1 & 1<=p142] | [[p173<=1 & 1<=p173] & [p147<=1 & 1<=p147]]]]]]] & [EG [[[p225<=1 & 1<=p225] & [p51<=1 & 1<=p51]]] & ~ [EX [~ [[p38<=1 & 1<=p38]]]]]]] U [~ [EG [~ [[[[p144<=1 & 1<=p144] & [p109<=1 & 1<=p109]] & [p34<=1 & 1<=p34]]]]] & ~ [[[[[p109<=1 & 1<=p109] & [p34<=1 & 1<=p34]] & ~ [EG [~ [[[p142<=1 & 1<=p142] | [[p173<=1 & 1<=p173] & [p147<=1 & 1<=p147]]]]]]] & [EG [[[p225<=1 & 1<=p225] & [p51<=1 & 1<=p51]]] & ~ [EX [~ [[p38<=1 & 1<=p38]]]]]]]]]]]]] U [~ [[[p214<=1 & 1<=p214] & [p186<=1 & 1<=p186]]] & ~ [[[[[~ [[[p104<=1 & 1<=p104] | [p178<=1 & 1<=p178]]] | [p27<=1 & 1<=p27]] | [~ [[p80<=1 & 1<=p80]] | E [[[p188<=1 & 1<=p188] & [p157<=1 & 1<=p157]] U [[p185<=1 & 1<=p185] & [p155<=1 & 1<=p155]]]]] & [~ [EG [~ [[[p142<=1 & 1<=p142] & [~ [EX [~ [[p106<=1 & 1<=p106]]]] | [p117<=1 & 1<=p117]]]]]] & ~ [E [~ [[[p142<=1 & 1<=p142] & [~ [EX [~ [[p106<=1 & 1<=p106]]]] | [p117<=1 & 1<=p117]]]] U [~ [[EG [[[p218<=1 & 1<=p218] & [p65<=1 & 1<=p65]]] | ~ [E [true U ~ [[[p94<=1 & 1<=p94] & [p30<=1 & 1<=p30]]]]]]] & ~ [[[p142<=1 & 1<=p142] & [~ [EX [~ [[p106<=1 & 1<=p106]]]] | [p117<=1 & 1<=p117]]]]]]]]] | [~ [EG [~ [[[[[p109<=1 & 1<=p109] & [p34<=1 & 1<=p34]] & ~ [EG [~ [[[p142<=1 & 1<=p142] | [[p173<=1 & 1<=p173] & [p147<=1 & 1<=p147]]]]]]] & [EG [[[p225<=1 & 1<=p225] & [p51<=1 & 1<=p51]]] & ~ [EX [~ [[p38<=1 & 1<=p38]]]]]]]]] & ~ [E [~ [[[[[p109<=1 & 1<=p109] & [p34<=1 & 1<=p34]] & ~ [EG [~ [[[p142<=1 & 1<=p142] | [[p173<=1 & 1<=p173] & [p147<=1 & 1<=p147]]]]]]] & [EG [[[p225<=1 & 1<=p225] & [p51<=1 & 1<=p51]]] & ~ [EX [~ [[p38<=1 & 1<=p38]]]]]]] U [~ [EG [~ [[[[p144<=1 & 1<=p144] & [p109<=1 & 1<=p109]] & [p34<=1 & 1<=p34]]]]] & ~ [[[[[p109<=1 & 1<=p109] & [p34<=1 & 1<=p34]] & ~ [EG [~ [[[p142<=1 & 1<=p142] | [[p173<=1 & 1<=p173] & [p147<=1 & 1<=p147]]]]]]] & [EG [[[p225<=1 & 1<=p225] & [p51<=1 & 1<=p51]]] & ~ [EX [~ [[p38<=1 & 1<=p38]]]]]]]]]]]]]]]]]

abstracting: (1<=p38)
states: 8,189,542,589,599,632 (15)
abstracting: (p38<=1)
states: 90,891,705,461,620,806 (16)

before gc: list nodes free: 3820932

after gc: idd nodes used:19634183, unused:44365817; list nodes free:198367151
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6031288 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099052 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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.000sec


iterations count:44945 (206), effective:2893 (13)

initing FirstDep: 0m 0.001sec


sat_reach.icc:155: Timeout: after 201 sec


net_ddint.h:600: Timeout: after 188 sec


sat_reach.icc:155: Timeout: after 176 sec


iterations count:222 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 165 sec


net_ddint.h:600: Timeout: after 155 sec


sat_reach.icc:155: Timeout: after 145 sec


sat_reach.icc:155: Timeout: after 136 sec


net_ddint.h:600: Timeout: after 127 sec


sat_reach.icc:155: Timeout: after 119 sec


sat_reach.icc:155: Timeout: after 111 sec


net_ddint.h:600: Timeout: after 104 sec


net_ddint.h:600: Timeout: after 98 sec


sat_reach.icc:155: Timeout: after 92 sec


sat_reach.icc:155: Timeout: after 86 sec


net_ddint.h:600: Timeout: after 80 sec


net_ddint.h:600: Timeout: after 75 sec

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="DES-PT-01b"
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 DES-PT-01b, 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 r106-tall-167814482600370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-01b.tgz
mv DES-PT-01b 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 ;