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.r010-oct2-167813599000410.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is AutoFlight-PT-03b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599000410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.7K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 18:17 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.7K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 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 70K 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 AutoFlight-PT-03b-CTLFireability-00
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-01
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-02
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-03
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-04
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-05
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-06
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-07
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-08
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-09
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-10
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-11
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-12
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-13
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-14
FORMULA_NAME AutoFlight-PT-03b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678688192543

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=AutoFlight-PT-03b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:16:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 06:16:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:16:35] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-13 06:16:35] [INFO ] Transformed 298 places.
[2023-03-13 06:16:35] [INFO ] Transformed 296 transitions.
[2023-03-13 06:16:35] [INFO ] Found NUPN structural information;
[2023-03-13 06:16:35] [INFO ] Parsed PT model containing 298 places and 296 transitions and 692 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 111 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 296/296 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 281 transition count 279
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 281 transition count 279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 281 transition count 277
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 276 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 276 transition count 272
Applied a total of 46 rules in 40 ms. Remains 276 /298 variables (removed 22) and now considering 272/296 (removed 24) transitions.
// Phase 1: matrix 272 rows 276 cols
[2023-03-13 06:16:35] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-13 06:16:35] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-13 06:16:35] [INFO ] Invariant cache hit.
[2023-03-13 06:16:35] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2023-03-13 06:16:35] [INFO ] Invariant cache hit.
[2023-03-13 06:16:36] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 276/298 places, 272/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1169 ms. Remains : 276/298 places, 272/296 transitions.
Support contains 111 out of 276 places after structural reductions.
[2023-03-13 06:16:36] [INFO ] Flatten gal took : 53 ms
[2023-03-13 06:16:36] [INFO ] Flatten gal took : 17 ms
[2023-03-13 06:16:36] [INFO ] Input system was already deterministic with 272 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 76) seen :57
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-13 06:16:37] [INFO ] Invariant cache hit.
[2023-03-13 06:16:37] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-13 06:16:37] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-13 06:16:37] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-13 06:16:38] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :18
[2023-03-13 06:16:38] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 6 ms to minimize.
[2023-03-13 06:16:38] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 1 ms to minimize.
[2023-03-13 06:16:38] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 13 ms to minimize.
[2023-03-13 06:16:38] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 0 ms to minimize.
[2023-03-13 06:16:39] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 13 ms to minimize.
[2023-03-13 06:16:39] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2023-03-13 06:16:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 892 ms
[2023-03-13 06:16:39] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 0 ms to minimize.
[2023-03-13 06:16:39] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 0 ms to minimize.
[2023-03-13 06:16:39] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 1 ms to minimize.
[2023-03-13 06:16:39] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 1 ms to minimize.
[2023-03-13 06:16:39] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 1 ms to minimize.
[2023-03-13 06:16:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 666 ms
[2023-03-13 06:16:40] [INFO ] Deduced a trap composed of 60 places in 181 ms of which 28 ms to minimize.
[2023-03-13 06:16:40] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 1 ms to minimize.
[2023-03-13 06:16:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 431 ms
[2023-03-13 06:16:40] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 1 ms to minimize.
[2023-03-13 06:16:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-03-13 06:16:41] [INFO ] After 3286ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :18
Attempting to minimize the solution found.
Minimization took 427 ms.
[2023-03-13 06:16:41] [INFO ] After 3926ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :18
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 15 properties in 210 ms.
Support contains 6 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 272/272 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 276 transition count 177
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 110 rules applied. Total rules applied 205 place count 181 transition count 162
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 213 place count 175 transition count 160
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 215 place count 173 transition count 160
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 215 place count 173 transition count 125
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 285 place count 138 transition count 125
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 301 place count 122 transition count 109
Iterating global reduction 4 with 16 rules applied. Total rules applied 317 place count 122 transition count 109
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 317 place count 122 transition count 104
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 327 place count 117 transition count 104
Performed 34 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 395 place count 83 transition count 67
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 396 place count 83 transition count 66
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 408 place count 83 transition count 54
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 420 place count 71 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 421 place count 70 transition count 53
Reduce places removed 4 places and 0 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 5 with 5 rules applied. Total rules applied 426 place count 66 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 427 place count 65 transition count 52
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 427 place count 65 transition count 49
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 433 place count 62 transition count 49
Applied a total of 433 rules in 38 ms. Remains 62 /276 variables (removed 214) and now considering 49/272 (removed 223) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 62/276 places, 49/272 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 49 rows 62 cols
[2023-03-13 06:16:41] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-13 06:16:41] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 06:16:41] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 06:16:41] [INFO ] [Nat]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 06:16:41] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 06:16:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-13 06:16:41] [INFO ] After 7ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 06:16:42] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2023-03-13 06:16:42] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2023-03-13 06:16:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2023-03-13 06:16:42] [INFO ] After 132ms 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-13 06:16:42] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 49/49 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 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 60 transition count 47
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 57 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 56 transition count 43
Applied a total of 11 rules in 7 ms. Remains 56 /62 variables (removed 6) and now considering 43/49 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 56/62 places, 43/49 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Probably explored full state space saw : 792 states, properties seen :0
Probabilistic random walk after 2555 steps, saw 792 distinct states, run finished after 26 ms. (steps per millisecond=98 ) properties seen :0
Explored full state space saw : 792 states, properties seen :0
Exhaustive walk after 2555 steps, saw 792 distinct states, run finished after 4 ms. (steps per millisecond=638 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA AutoFlight-PT-03b-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:16:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 13 ms
FORMULA AutoFlight-PT-03b-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 13 ms
[2023-03-13 06:16:42] [INFO ] Input system was already deterministic with 272 transitions.
Computed a total of 82 stabilizing places and 82 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 272/272 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 252 transition count 248
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 252 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 252 transition count 244
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 243 transition count 235
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 243 transition count 235
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 240 transition count 232
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 240 transition count 232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 238 transition count 230
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 238 transition count 230
Applied a total of 80 rules in 31 ms. Remains 238 /276 variables (removed 38) and now considering 230/272 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 238/276 places, 230/272 transitions.
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 9 ms
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 9 ms
[2023-03-13 06:16:42] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 272/272 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 252 transition count 248
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 252 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 252 transition count 244
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 242 transition count 234
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 242 transition count 234
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 239 transition count 231
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 239 transition count 231
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 236 transition count 228
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 236 transition count 228
Applied a total of 84 rules in 40 ms. Remains 236 /276 variables (removed 40) and now considering 228/272 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 236/276 places, 228/272 transitions.
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 10 ms
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 9 ms
[2023-03-13 06:16:42] [INFO ] Input system was already deterministic with 228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 272/272 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 252 transition count 248
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 252 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 252 transition count 244
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 243 transition count 235
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 243 transition count 235
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 241 transition count 233
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 241 transition count 233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 239 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 239 transition count 231
Applied a total of 78 rules in 19 ms. Remains 239 /276 variables (removed 37) and now considering 231/272 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 239/276 places, 231/272 transitions.
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 8 ms
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 8 ms
[2023-03-13 06:16:42] [INFO ] Input system was already deterministic with 231 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 276/276 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 275 transition count 176
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 110 rules applied. Total rules applied 205 place count 180 transition count 161
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 211 place count 174 transition count 161
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 211 place count 174 transition count 125
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 283 place count 138 transition count 125
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 302 place count 119 transition count 106
Iterating global reduction 3 with 19 rules applied. Total rules applied 321 place count 119 transition count 106
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 321 place count 119 transition count 98
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 337 place count 111 transition count 98
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 399 place count 80 transition count 67
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 402 place count 80 transition count 64
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 408 place count 77 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 409 place count 76 transition count 60
Reduce places removed 4 places and 0 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 5 rules applied. Total rules applied 414 place count 72 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 415 place count 71 transition count 59
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 415 place count 71 transition count 56
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 421 place count 68 transition count 56
Applied a total of 421 rules in 27 ms. Remains 68 /276 variables (removed 208) and now considering 56/272 (removed 216) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 68/276 places, 56/272 transitions.
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:16:42] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 272/272 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 249 transition count 245
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 249 transition count 245
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 58 place count 249 transition count 241
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 68 place count 239 transition count 231
Iterating global reduction 1 with 10 rules applied. Total rules applied 78 place count 239 transition count 231
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 236 transition count 228
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 236 transition count 228
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 233 transition count 225
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 233 transition count 225
Applied a total of 90 rules in 26 ms. Remains 233 /276 variables (removed 43) and now considering 225/272 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 233/276 places, 225/272 transitions.
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 7 ms
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 8 ms
[2023-03-13 06:16:42] [INFO ] Input system was already deterministic with 225 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 276/276 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 275 transition count 173
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 113 rules applied. Total rules applied 211 place count 177 transition count 158
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 217 place count 171 transition count 158
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 217 place count 171 transition count 122
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 289 place count 135 transition count 122
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 309 place count 115 transition count 102
Iterating global reduction 3 with 20 rules applied. Total rules applied 329 place count 115 transition count 102
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 329 place count 115 transition count 94
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 345 place count 107 transition count 94
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 407 place count 76 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 410 place count 76 transition count 60
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 416 place count 73 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 72 transition count 56
Reduce places removed 4 places and 0 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 5 rules applied. Total rules applied 422 place count 68 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 423 place count 67 transition count 55
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 423 place count 67 transition count 52
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 429 place count 64 transition count 52
Applied a total of 429 rules in 26 ms. Remains 64 /276 variables (removed 212) and now considering 52/272 (removed 220) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 64/276 places, 52/272 transitions.
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:16:42] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 276/276 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 275 transition count 175
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 111 rules applied. Total rules applied 207 place count 179 transition count 160
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 213 place count 174 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 214 place count 173 transition count 159
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 214 place count 173 transition count 124
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 284 place count 138 transition count 124
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 303 place count 119 transition count 105
Iterating global reduction 4 with 19 rules applied. Total rules applied 322 place count 119 transition count 105
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 322 place count 119 transition count 99
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 334 place count 113 transition count 99
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 398 place count 81 transition count 67
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 401 place count 81 transition count 64
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 407 place count 78 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 408 place count 77 transition count 60
Reduce places removed 4 places and 0 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 5 with 5 rules applied. Total rules applied 413 place count 73 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 414 place count 72 transition count 59
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 414 place count 72 transition count 56
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 420 place count 69 transition count 56
Applied a total of 420 rules in 22 ms. Remains 69 /276 variables (removed 207) and now considering 56/272 (removed 216) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 69/276 places, 56/272 transitions.
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:16:42] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 272/272 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 250 transition count 246
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 250 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 250 transition count 242
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 65 place count 241 transition count 233
Iterating global reduction 1 with 9 rules applied. Total rules applied 74 place count 241 transition count 233
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 238 transition count 230
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 238 transition count 230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 83 place count 235 transition count 227
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 235 transition count 227
Applied a total of 86 rules in 22 ms. Remains 235 /276 variables (removed 41) and now considering 227/272 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 235/276 places, 227/272 transitions.
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 8 ms
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 8 ms
[2023-03-13 06:16:42] [INFO ] Input system was already deterministic with 227 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 276/276 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 275 transition count 172
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 115 rules applied. Total rules applied 214 place count 176 transition count 156
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 220 place count 170 transition count 156
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 220 place count 170 transition count 120
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 292 place count 134 transition count 120
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 312 place count 114 transition count 100
Iterating global reduction 3 with 20 rules applied. Total rules applied 332 place count 114 transition count 100
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 332 place count 114 transition count 92
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 348 place count 106 transition count 92
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 406 place count 77 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 409 place count 77 transition count 60
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 4 with 4 rules applied. Total rules applied 413 place count 75 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 414 place count 74 transition count 57
Reduce places removed 4 places and 0 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 5 rules applied. Total rules applied 419 place count 70 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 420 place count 69 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 420 place count 69 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 426 place count 66 transition count 53
Applied a total of 426 rules in 17 ms. Remains 66 /276 variables (removed 210) and now considering 53/272 (removed 219) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 66/276 places, 53/272 transitions.
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:16:42] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 276/276 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 275 transition count 173
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 114 rules applied. Total rules applied 212 place count 177 transition count 157
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 218 place count 171 transition count 157
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 218 place count 171 transition count 122
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 288 place count 136 transition count 122
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 308 place count 116 transition count 102
Iterating global reduction 3 with 20 rules applied. Total rules applied 328 place count 116 transition count 102
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 328 place count 116 transition count 94
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 344 place count 108 transition count 94
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 408 place count 76 transition count 62
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 411 place count 76 transition count 59
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 417 place count 73 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 418 place count 72 transition count 55
Reduce places removed 4 places and 0 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 5 rules applied. Total rules applied 423 place count 68 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 424 place count 67 transition count 54
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 424 place count 67 transition count 51
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 430 place count 64 transition count 51
Applied a total of 430 rules in 20 ms. Remains 64 /276 variables (removed 212) and now considering 51/272 (removed 221) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 64/276 places, 51/272 transitions.
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:16:42] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 272/272 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 256 transition count 252
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 256 transition count 252
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 256 transition count 248
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 249 transition count 241
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 249 transition count 241
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 247 transition count 239
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 247 transition count 239
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 245 transition count 237
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 245 transition count 237
Applied a total of 66 rules in 14 ms. Remains 245 /276 variables (removed 31) and now considering 237/272 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 245/276 places, 237/272 transitions.
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 8 ms
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 8 ms
[2023-03-13 06:16:42] [INFO ] Input system was already deterministic with 237 transitions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 272/272 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 250 transition count 246
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 250 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 250 transition count 243
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 65 place count 240 transition count 233
Iterating global reduction 1 with 10 rules applied. Total rules applied 75 place count 240 transition count 233
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 238 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 238 transition count 231
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 236 transition count 229
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 236 transition count 229
Applied a total of 83 rules in 13 ms. Remains 236 /276 variables (removed 40) and now considering 229/272 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 236/276 places, 229/272 transitions.
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 16 ms
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 8 ms
[2023-03-13 06:16:42] [INFO ] Input system was already deterministic with 229 transitions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 272/272 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 252 transition count 248
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 252 transition count 248
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 252 transition count 245
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 59 place count 244 transition count 237
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 244 transition count 237
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 70 place count 241 transition count 234
Iterating global reduction 1 with 3 rules applied. Total rules applied 73 place count 241 transition count 234
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 238 transition count 231
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 238 transition count 231
Applied a total of 79 rules in 15 ms. Remains 238 /276 variables (removed 38) and now considering 231/272 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 238/276 places, 231/272 transitions.
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 7 ms
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 6 ms
[2023-03-13 06:16:42] [INFO ] Input system was already deterministic with 231 transitions.
Starting structural reductions in LTL mode, iteration 0 : 276/276 places, 272/272 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 255 transition count 251
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 255 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 255 transition count 247
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 250 transition count 242
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 250 transition count 242
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 248 transition count 240
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 248 transition count 240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 246 transition count 238
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 246 transition count 238
Applied a total of 64 rules in 14 ms. Remains 246 /276 variables (removed 30) and now considering 238/272 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 246/276 places, 238/272 transitions.
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 7 ms
[2023-03-13 06:16:42] [INFO ] Flatten gal took : 7 ms
[2023-03-13 06:16:42] [INFO ] Input system was already deterministic with 238 transitions.
[2023-03-13 06:16:43] [INFO ] Flatten gal took : 9 ms
[2023-03-13 06:16:43] [INFO ] Flatten gal took : 9 ms
[2023-03-13 06:16:43] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 06:16:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 276 places, 272 transitions and 644 arcs took 2 ms.
Total runtime 8090 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: 276 NrTr: 272 NrArc: 644)

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

net check time: 0m 0.000sec

init dd package: 0m 2.951sec


RS generation: 0m18.269sec


-> reachability set: #nodes 322863 (3.2e+05) #states 1,782,385,048,878,702,647 (18)



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

checking: EF [EX [AF [EX [[p102<=1 & 1<=p102]]]]]
normalized: E [true U EX [~ [EG [~ [EX [[p102<=1 & 1<=p102]]]]]]]

abstracting: (1<=p102)
states: 237,940,595,575,131,504 (17)
abstracting: (p102<=1)
states: 1,782,385,048,878,702,647 (18)
..
before gc: list nodes free: 1941658

after gc: idd nodes used:1758108, unused:62241892; list nodes free:279341132
.............
before gc: list nodes free: 1046287

after gc: idd nodes used:2804458, unused:61195542; list nodes free:276704138
.
before gc: list nodes free: 1987313

after gc: idd nodes used:3094291, unused:60905709; list nodes free:275450322
.MC time: 4m16.557sec

checking: EF [EG [AG [[p65<=0 & 0<=p65]]]]
normalized: E [true U EG [~ [E [true U ~ [[p65<=0 & 0<=p65]]]]]]

abstracting: (0<=p65)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p65<=0)
states: 1,547,751,430,811,483,991 (18)

before gc: list nodes free: 2279351

after gc: idd nodes used:914947, unused:63085053; list nodes free:285379057
.
EG iterations: 1

before gc: list nodes free: 4640189

after gc: idd nodes used:1139507, unused:62860493; list nodes free:284380238
MC time: 4m 1.080sec

checking: EG [[p136<=0 & 0<=p136]]
normalized: EG [[p136<=0 & 0<=p136]]

abstracting: (0<=p136)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p136<=0)
states: 1,681,116,824,855,872,343 (18)
................
before gc: list nodes free: 2696621

after gc: idd nodes used:2387329, unused:61612671; list nodes free:278609472
.
before gc: list nodes free: 2314009

after gc: idd nodes used:2432798, unused:61567202; list nodes free:278507739
.MC time: 3m41.554sec

checking: EF [[EG [[p167<=1 & 1<=p167]] | EG [[p31<=0 & 0<=p31]]]]
normalized: E [true U [EG [[p31<=0 & 0<=p31]] | EG [[p167<=1 & 1<=p167]]]]

abstracting: (1<=p167)
states: 26,782,878,141,731 (13)
abstracting: (p167<=1)
states: 1,782,385,048,878,702,647 (18)
..............................................................................................................
EG iterations: 110
abstracting: (0<=p31)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p31<=0)
states: 1,674,971,815,832,768,183 (18)

before gc: list nodes free: 5826464

after gc: idd nodes used:1017646, unused:62982354; list nodes free:284856879
.
EG iterations: 1
-> the formula is TRUE

FORMULA AutoFlight-PT-03b-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m33.423sec

checking: AF [[AG [[EG [[p79<=0 & 0<=p79]] & [EG [[p108<=0 & 0<=p108]] & AF [[p208<=0 & 0<=p208]]]]] | [p53<=1 & 1<=p53]]]
normalized: ~ [EG [~ [[[p53<=1 & 1<=p53] | ~ [E [true U ~ [[[~ [EG [~ [[p208<=0 & 0<=p208]]]] & EG [[p108<=0 & 0<=p108]]] & EG [[p79<=0 & 0<=p79]]]]]]]]]]

abstracting: (0<=p79)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p79<=0)
states: 1,729,337,287,438,750,775 (18)
.
EG iterations: 1
abstracting: (0<=p108)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p108<=0)
states: 1,579,319,828,697,705,671 (18)
.
EG iterations: 1
abstracting: (0<=p208)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p208<=0)
states: 1,770,415,509,844,533,623 (18)
...................................................................................
before gc: list nodes free: 5823836

after gc: idd nodes used:954353, unused:63045647; list nodes free:285233951
............................
EG iterations: 111
MC time: 3m33.137sec

checking: EG [[E [~ [[p129<=1 & 1<=p129]] U ~ [[[p71<=1 & 1<=p71] | AG [[p88<=1 & 1<=p88]]]]] | [p110<=1 & 1<=p110]]]
normalized: EG [[[p110<=1 & 1<=p110] | E [~ [[p129<=1 & 1<=p129]] U ~ [[~ [E [true U ~ [[p88<=1 & 1<=p88]]]] | [p71<=1 & 1<=p71]]]]]]

abstracting: (1<=p71)
states: 101,901,514,395,320,640 (17)
abstracting: (p71<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p88)
states: 55,688,369,928,140,928 (16)
abstracting: (p88<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p129)
states: 195,951,301,839,472,432 (17)
abstracting: (p129<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p110)
states: 30,846,690,175,200,768 (16)
abstracting: (p110<=1)
states: 1,782,385,048,878,702,647 (18)
.
EG iterations: 1
-> the formula is TRUE

FORMULA AutoFlight-PT-03b-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m57.659sec

checking: EF [[[p257<=1 & 1<=p257] & [[p274<=1 & 1<=p274] & [EX [EF [[[p57<=1 & 1<=p57] & [p170<=1 & 1<=p170]]]] | [[p219<=1 & 1<=p219] & [p85<=1 & 1<=p85]]]]]]
normalized: E [true U [[[[[p85<=1 & 1<=p85] & [p219<=1 & 1<=p219]] | EX [E [true U [[p170<=1 & 1<=p170] & [p57<=1 & 1<=p57]]]]] & [p274<=1 & 1<=p274]] & [p257<=1 & 1<=p257]]]

abstracting: (1<=p257)
states: 41,323,364,154,851,328 (16)
abstracting: (p257<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p274)
states: 791,295,982,033,411,003 (17)
abstracting: (p274<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p57)
states: 102,232,002,863,650,176 (17)
abstracting: (p57<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p170)
states: 106,660,212,640,382,181 (17)
abstracting: (p170<=1)
states: 1,782,385,048,878,702,647 (18)

before gc: list nodes free: 5869777

after gc: idd nodes used:1314907, unused:62685093; list nodes free:283597385
.abstracting: (1<=p219)
states: 221,320,496,865,936,525 (17)
abstracting: (p219<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p85)
states: 127,430,617,985,459,712 (17)
abstracting: (p85<=1)
states: 1,782,385,048,878,702,647 (18)
-> the formula is TRUE

FORMULA AutoFlight-PT-03b-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m53.959sec

checking: AG [EF [[[[p145<=0 & 0<=p145] & [p97<=1 & 1<=p97]] & [[AX [[p161<=1 & 1<=p161]] | [p25<=0 & 0<=p25]] & [[p264<=0 & 0<=p264] | [[p272<=0 & 0<=p272] | [[p204<=1 & 1<=p204] & [p201<=1 & 1<=p201]]]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[[[[p201<=1 & 1<=p201] & [p204<=1 & 1<=p204]] | [p272<=0 & 0<=p272]] | [p264<=0 & 0<=p264]] & [[p25<=0 & 0<=p25] | ~ [EX [~ [[p161<=1 & 1<=p161]]]]]] & [[p97<=1 & 1<=p97] & [p145<=0 & 0<=p145]]]]]]]

abstracting: (0<=p145)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p145<=0)
states: 1,666,824,755,697,353,543 (18)
abstracting: (1<=p97)
states: 237,940,595,575,131,504 (17)
abstracting: (p97<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p161)
states: 668,654,193,712,830,792 (17)
abstracting: (p161<=1)
states: 1,782,385,048,878,702,647 (18)

before gc: list nodes free: 7418160

after gc: idd nodes used:2730652, unused:61269348; list nodes free:277264804
.abstracting: (0<=p25)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p25<=0)
states: 1,642,208,279,387,943,767 (18)
abstracting: (0<=p264)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p264<=0)
states: 1,482,422,125,696,464,765 (18)
abstracting: (0<=p272)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p272<=0)
states: 1,674,238,960,382,460,578 (18)
abstracting: (1<=p204)
states: 17,867,067,013,103,616 (16)
abstracting: (p204<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p201)
states: 221,320,496,865,936,525 (17)
abstracting: (p201<=1)
states: 1,782,385,048,878,702,647 (18)
MC time: 3m32.255sec

checking: [EF [EG [[[[p266<=1 & 1<=p266] & [p121<=0 & 0<=p121]] | [[[p80<=0 & 0<=p80] | [p255<=0 & 0<=p255]] & [[p143<=0 & 0<=p143] | [[p125<=0 & 0<=p125] | [p229<=0 & 0<=p229]]]]]]] & [~ [E [EX [AG [[p225<=1 & 1<=p225]]] U ~ [AX [[p191<=1 & 1<=p191]]]]] | AG [AF [EX [[p237<=0 & 0<=p237]]]]]]
normalized: [E [true U EG [[[[[p80<=0 & 0<=p80] | [p255<=0 & 0<=p255]] & [[[p229<=0 & 0<=p229] | [p125<=0 & 0<=p125]] | [p143<=0 & 0<=p143]]] | [[p121<=0 & 0<=p121] & [p266<=1 & 1<=p266]]]]] & [~ [E [true U EG [~ [EX [[p237<=0 & 0<=p237]]]]]] | ~ [E [EX [~ [E [true U ~ [[p225<=1 & 1<=p225]]]]] U EX [~ [[p191<=1 & 1<=p191]]]]]]]

abstracting: (1<=p191)
states: 106,660,212,640,382,181 (17)
abstracting: (p191<=1)
states: 1,782,385,048,878,702,647 (18)

before gc: list nodes free: 4155159

after gc: idd nodes used:2791276, unused:61208724; list nodes free:276969995
.abstracting: (1<=p225)
states: 40,703,817,942,095,616 (16)
abstracting: (p225<=1)
states: 1,782,385,048,878,702,647 (18)
.abstracting: (0<=p237)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p237<=0)
states: 1,677,580,304,371,813,481 (18)
...
EG iterations: 2
abstracting: (1<=p266)
states: 109,766,733,686,775,050 (17)
abstracting: (p266<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (0<=p121)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p121<=0)
states: 1,687,122,510,715,836,727 (18)
abstracting: (0<=p143)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p143<=0)
states: 1,589,709,618,241,879,271 (18)
abstracting: (0<=p125)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p125<=0)
states: 1,586,433,747,039,230,215 (18)
abstracting: (0<=p229)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p229<=0)
states: 1,722,950,491,481,832,695 (18)
abstracting: (0<=p255)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p255<=0)
states: 1,672,618,315,191,927,597 (18)
abstracting: (0<=p80)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p80<=0)
states: 1,580,107,603,256,073,479 (18)

before gc: list nodes free: 3211086

after gc: idd nodes used:3690347, unused:60309653; list nodes free:272974848
.
EG iterations: 1
MC time: 3m12.269sec

checking: [AG [~ [A [~ [[[p99<=1 & 1<=p99] & [p217<=1 & 1<=p217]]] U [p87<=1 & 1<=p87]]]] | [~ [E [EG [[[[p84<=1 & 1<=p84] & [[p64<=1 & 1<=p64] & [p216<=1 & 1<=p216]]] | E [[[p134<=1 & 1<=p134] & [p230<=1 & 1<=p230]] U [p128<=1 & 1<=p128]]]] U AF [~ [EX [[p210<=1 & 1<=p210]]]]]] & [AX [AX [EG [[p11<=0 & 0<=p11]]]] & EF [[p222<=0 & 0<=p222]]]]]
normalized: [[[E [true U [p222<=0 & 0<=p222]] & ~ [EX [EX [~ [EG [[p11<=0 & 0<=p11]]]]]]] & ~ [E [EG [[E [[[p230<=1 & 1<=p230] & [p134<=1 & 1<=p134]] U [p128<=1 & 1<=p128]] | [[[p216<=1 & 1<=p216] & [p64<=1 & 1<=p64]] & [p84<=1 & 1<=p84]]]] U ~ [EG [EX [[p210<=1 & 1<=p210]]]]]]] | ~ [E [true U [~ [EG [~ [[p87<=1 & 1<=p87]]]] & ~ [E [~ [[p87<=1 & 1<=p87]] U [[[p217<=1 & 1<=p217] & [p99<=1 & 1<=p99]] & ~ [[p87<=1 & 1<=p87]]]]]]]]]

abstracting: (1<=p87)
states: 233,484,977,540,434,224 (17)
abstracting: (p87<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p99)
states: 237,940,595,575,131,504 (17)
abstracting: (p99<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p217)
states: 53,276,112,616,648,122 (16)
abstracting: (p217<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p87)
states: 233,484,977,540,434,224 (17)
abstracting: (p87<=1)
states: 1,782,385,048,878,702,647 (18)
MC time: 2m55.018sec

checking: EX [AX [[[[[[p248<=0 & 0<=p248] | [[p272<=0 & 0<=p272] | [[p236<=1 & 1<=p236] & [[AG [[[p32<=1 & 1<=p32] & [p227<=1 & 1<=p227]]] | [p160<=1 & 1<=p160]] & [[p40<=1 & 1<=p40] | [p93<=1 & 1<=p93]]]]]] & [[p9<=0 & 0<=p9] | [[p241<=0 & 0<=p241] | [p274<=0 & 0<=p274]]]] & [p54<=0 & 0<=p54]] & [AF [[p66<=1 & 1<=p66]] & [p42<=0 & 0<=p42]]]]]
normalized: EX [~ [EX [~ [[[[p42<=0 & 0<=p42] & ~ [EG [~ [[p66<=1 & 1<=p66]]]]] & [[p54<=0 & 0<=p54] & [[[[p274<=0 & 0<=p274] | [p241<=0 & 0<=p241]] | [p9<=0 & 0<=p9]] & [[[[[[p93<=1 & 1<=p93] | [p40<=1 & 1<=p40]] & [[p160<=1 & 1<=p160] | ~ [E [true U ~ [[[p227<=1 & 1<=p227] & [p32<=1 & 1<=p32]]]]]]] & [p236<=1 & 1<=p236]] | [p272<=0 & 0<=p272]] | [p248<=0 & 0<=p248]]]]]]]]]

abstracting: (0<=p248)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p248<=0)
states: 1,448,942,499,048,543,174 (18)
abstracting: (0<=p272)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p272<=0)
states: 1,674,238,960,382,460,578 (18)
abstracting: (1<=p236)
states: 104,804,744,506,889,166 (17)
abstracting: (p236<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p32)
states: 268,633,020,705,023,040 (17)
abstracting: (p32<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p227)
states: 55,833,063,330,489,984 (16)
abstracting: (p227<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p160)
states: 162,035,004,443,485,464 (17)
abstracting: (p160<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p40)
states: 31,435,233,272,999,424 (16)
abstracting: (p40<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p93)
states: 233,484,977,540,434,224 (17)
abstracting: (p93<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (0<=p9)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p9<=0)
states: 1,782,385,046,745,662,903 (18)
abstracting: (0<=p241)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p241<=0)
states: 1,739,903,594,571,157,559 (18)
abstracting: (0<=p274)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p274<=0)
states: 991,089,066,845,291,644 (17)
abstracting: (0<=p54)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p54<=0)
states: 1,728,575,851,773,829,943 (18)
abstracting: (1<=p66)
states: 97,227,356,364,797,472 (16)
abstracting: (p66<=1)
states: 1,782,385,048,878,702,647 (18)

before gc: list nodes free: 2841819

after gc: idd nodes used:4786936, unused:59213064; list nodes free:268302691
.
EG iterations: 1
abstracting: (0<=p42)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p42<=0)
states: 1,750,949,815,605,703,223 (18)
..-> the formula is FALSE

FORMULA AutoFlight-PT-03b-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m24.901sec

checking: [A [[[[p0<=1 & 1<=p0] | [E [AF [[p45<=1 & 1<=p45]] U A [[p223<=1 & 1<=p223] U [p94<=1 & 1<=p94]]] & [~ [[[p21<=1 & 1<=p21] & [p187<=1 & 1<=p187]]] | AX [[[p231<=1 & 1<=p231] & [p272<=1 & 1<=p272]]]]]] | [EG [[[p169<=1 & 1<=p169] | [[p248<=1 & 1<=p248] & [p272<=1 & 1<=p272]]]] | EF [[[p40<=1 & 1<=p40] | [p68<=1 & 1<=p68]]]]] U [p43<=1 & 1<=p43]] & EF [[p45<=1 & 1<=p45]]]
normalized: [E [true U [p45<=1 & 1<=p45]] & [~ [EG [~ [[p43<=1 & 1<=p43]]]] & ~ [E [~ [[p43<=1 & 1<=p43]] U [~ [[[E [true U [[p68<=1 & 1<=p68] | [p40<=1 & 1<=p40]]] | EG [[[[p272<=1 & 1<=p272] & [p248<=1 & 1<=p248]] | [p169<=1 & 1<=p169]]]] | [[[~ [EX [~ [[[p272<=1 & 1<=p272] & [p231<=1 & 1<=p231]]]]] | ~ [[[p187<=1 & 1<=p187] & [p21<=1 & 1<=p21]]]] & E [~ [EG [~ [[p45<=1 & 1<=p45]]]] U [~ [EG [~ [[p94<=1 & 1<=p94]]]] & ~ [E [~ [[p94<=1 & 1<=p94]] U [~ [[p223<=1 & 1<=p223]] & ~ [[p94<=1 & 1<=p94]]]]]]]] | [p0<=1 & 1<=p0]]]] & ~ [[p43<=1 & 1<=p43]]]]]]]

abstracting: (1<=p43)
states: 8,559,356,829,585,408 (15)
abstracting: (p43<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p94)
states: 233,484,977,540,434,224 (17)
abstracting: (p94<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p223)
states: 265,969,988,557,789,824 (17)
abstracting: (p223<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p94)
states: 233,484,977,540,434,224 (17)
abstracting: (p94<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p94)
states: 233,484,977,540,434,224 (17)
abstracting: (p94<=1)
states: 1,782,385,048,878,702,647 (18)
............
before gc: list nodes free: 3835590

after gc: idd nodes used:5674856, unused:58325144; list nodes free:264309223
.MC time: 2m46.014sec

checking: [EG [[[AG [AF [[[p78<=0 & 0<=p78] | [p185<=0 & 0<=p185]]]] & AF [[p166<=1 & 1<=p166]]] & [[p58<=0 & 0<=p58] & [p36<=0 & 0<=p36]]]] | [AG [[[[~ [A [[p72<=1 & 1<=p72] U [p93<=1 & 1<=p93]]] | [p106<=1 & 1<=p106]] & AG [[p49<=0 & 0<=p49]]] | [AG [[p92<=1 & 1<=p92]] & [[p5<=0 & 0<=p5] & [[[p223<=1 & 1<=p223] & [[p40<=1 & 1<=p40] | [p178<=1 & 1<=p178]]] | [p267<=1 & 1<=p267]]]]]] & AF [[AX [[[[p241<=0 & 0<=p241] | [p274<=0 & 0<=p274]] & [p166<=0 & 0<=p166]]] & [[AF [[p116<=0 & 0<=p116]] & [[p235<=0 & 0<=p235] & [[p149<=0 & 0<=p149] | [p247<=0 & 0<=p247]]]] | AF [[[p152<=1 & 1<=p152] & [p57<=1 & 1<=p57]]]]]]]]
normalized: [[~ [E [true U ~ [[[[[[[[p40<=1 & 1<=p40] | [p178<=1 & 1<=p178]] & [p223<=1 & 1<=p223]] | [p267<=1 & 1<=p267]] & [p5<=0 & 0<=p5]] & ~ [E [true U ~ [[p92<=1 & 1<=p92]]]]] | [~ [E [true U ~ [[p49<=0 & 0<=p49]]]] & [[p106<=1 & 1<=p106] | ~ [[~ [EG [~ [[p93<=1 & 1<=p93]]]] & ~ [E [~ [[p93<=1 & 1<=p93]] U [~ [[p72<=1 & 1<=p72]] & ~ [[p93<=1 & 1<=p93]]]]]]]]]]]]] & ~ [EG [~ [[[~ [EG [~ [[[p152<=1 & 1<=p152] & [p57<=1 & 1<=p57]]]]] | [[[[p247<=0 & 0<=p247] | [p149<=0 & 0<=p149]] & [p235<=0 & 0<=p235]] & ~ [EG [~ [[p116<=0 & 0<=p116]]]]]] & ~ [EX [~ [[[p166<=0 & 0<=p166] & [[p274<=0 & 0<=p274] | [p241<=0 & 0<=p241]]]]]]]]]]] | EG [[[[p36<=0 & 0<=p36] & [p58<=0 & 0<=p58]] & [~ [EG [~ [[p166<=1 & 1<=p166]]]] & ~ [E [true U EG [~ [[[p185<=0 & 0<=p185] | [p78<=0 & 0<=p78]]]]]]]]]]

abstracting: (0<=p78)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p78<=0)
states: 1,580,107,603,256,073,479 (18)
abstracting: (0<=p185)
states: 1,782,385,048,878,702,647 (18)
abstracting: (p185<=0)
states: 1,767,635,880,290,328,119 (18)
............................
before gc: list nodes free: 3947768

after gc: idd nodes used:5416941, unused:58583059; list nodes free:265513103
........................................................................
EG iterations: 100
abstracting: (1<=p166)
states: 463,241,023,017 (11)
abstracting: (p166<=1)
states: 1,782,385,048,878,702,647 (18)
..................
before gc: list nodes free: 5196004

after gc: idd nodes used:5074609, unused:58925391; list nodes free:266998364
MC time: 2m31.447sec

checking: [EG [[[EX [EG [[p59<=1 & 1<=p59]]] | [[[A [[p193<=1 & 1<=p193] U [[p55<=1 & 1<=p55] & [p188<=1 & 1<=p188]]] & [AF [[p178<=1 & 1<=p178]] | A [[p269<=1 & 1<=p269] U [p159<=1 & 1<=p159]]]] & [AX [[p27<=1 & 1<=p27]] & [[p117<=1 & 1<=p117] & [[p134<=0 & 0<=p134] | [[p230<=0 & 0<=p230] | [p253<=0 & 0<=p253]]]]]] | AX [[[p113<=0 & 0<=p113] & [p236<=0 & 0<=p236]]]]] | [[AX [[p139<=1 & 1<=p139]] | [[p98<=0 & 0<=p98] & [[p220<=1 & 1<=p220] & [p81<=1 & 1<=p81]]]] | [[[p145<=0 & 0<=p145] & [[p38<=0 & 0<=p38] | [p212<=0 & 0<=p212]]] | [p121<=1 & 1<=p121]]]]] | EF [AX [[A [[p111<=1 & 1<=p111] U [p59<=1 & 1<=p59]] & EF [EX [[p34<=1 & 1<=p34]]]]]]]
normalized: [EG [[[[~ [EX [~ [[p139<=1 & 1<=p139]]]] | [[[p81<=1 & 1<=p81] & [p220<=1 & 1<=p220]] & [p98<=0 & 0<=p98]]] | [[p121<=1 & 1<=p121] | [[[p212<=0 & 0<=p212] | [p38<=0 & 0<=p38]] & [p145<=0 & 0<=p145]]]] | [[~ [EX [~ [[[p236<=0 & 0<=p236] & [p113<=0 & 0<=p113]]]]] | [[[[[[p253<=0 & 0<=p253] | [p230<=0 & 0<=p230]] | [p134<=0 & 0<=p134]] & [p117<=1 & 1<=p117]] & ~ [EX [~ [[p27<=1 & 1<=p27]]]]] & [[[~ [EG [~ [[p159<=1 & 1<=p159]]]] & ~ [E [~ [[p159<=1 & 1<=p159]] U [~ [[p269<=1 & 1<=p269]] & ~ [[p159<=1 & 1<=p159]]]]]] | ~ [EG [~ [[p178<=1 & 1<=p178]]]]] & [~ [EG [~ [[[p188<=1 & 1<=p188] & [p55<=1 & 1<=p55]]]]] & ~ [E [~ [[[p188<=1 & 1<=p188] & [p55<=1 & 1<=p55]]] U [~ [[p193<=1 & 1<=p193]] & ~ [[[p188<=1 & 1<=p188] & [p55<=1 & 1<=p55]]]]]]]]]] | EX [EG [[p59<=1 & 1<=p59]]]]]] | E [true U ~ [EX [~ [[[~ [EG [~ [[p59<=1 & 1<=p59]]]] & ~ [E [~ [[p59<=1 & 1<=p59]] U [~ [[p59<=1 & 1<=p59]] & ~ [[p111<=1 & 1<=p111]]]]]] & E [true U EX [[p34<=1 & 1<=p34]]]]]]]]]

abstracting: (1<=p34)
states: 111,755,572,975,297,152 (17)
abstracting: (p34<=1)
states: 1,782,385,048,878,702,647 (18)
.abstracting: (1<=p111)
states: 30,846,690,175,200,768 (16)
abstracting: (p111<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p59)
states: 232,422,994,528,520,576 (17)
abstracting: (p59<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p59)
states: 232,422,994,528,520,576 (17)
abstracting: (p59<=1)
states: 1,782,385,048,878,702,647 (18)
abstracting: (1<=p59)
states: 232,422,994,528,520,576 (17)
abstracting: (p59<=1)
states: 1,782,385,048,878,702,647 (18)
.............
before gc: list nodes free: 3529454

after gc: idd nodes used:6422463, unused:57577537; list nodes free:260668577
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 6052300 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16100000 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.000sec


iterations count:27960 (102), effective:2418 (8)

initing FirstDep: 0m 0.000sec


net_ddint.h:600: Timeout: after 255 sec


iterations count:3942 (14), effective:281 (1)

sat_reach.icc:155: Timeout: after 237 sec


net_ddint.h:600: Timeout: after 220 sec


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

sat_reach.icc:155: Timeout: after 212 sec


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

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

iterations count:5538 (20), effective:355 (1)

iterations count:6275 (23), effective:366 (1)

sat_reach.icc:155: Timeout: after 211 sec


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

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

iterations count:4970 (18), effective:393 (1)

sat_reach.icc:155: Timeout: after 191 sec


sat_reach.icc:155: Timeout: after 174 sec


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

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

net_ddint.h:600: Timeout: after 165 sec


net_ddint.h:600: Timeout: after 149 sec


iterations count:588 (2), effective:17 (0)

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

net_ddint.h:600: Timeout: after 134 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="AutoFlight-PT-03b"
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 AutoFlight-PT-03b, 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 r010-oct2-167813599000410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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