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.r234-tall-167856419800089.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 IBM703-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856419800089
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 11K Feb 26 04:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 04:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 04:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 04:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 04:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 04:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 04:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 04:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 203K 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 IBM703-PT-none-CTLCardinality-00
FORMULA_NAME IBM703-PT-none-CTLCardinality-01
FORMULA_NAME IBM703-PT-none-CTLCardinality-02
FORMULA_NAME IBM703-PT-none-CTLCardinality-03
FORMULA_NAME IBM703-PT-none-CTLCardinality-04
FORMULA_NAME IBM703-PT-none-CTLCardinality-05
FORMULA_NAME IBM703-PT-none-CTLCardinality-06
FORMULA_NAME IBM703-PT-none-CTLCardinality-07
FORMULA_NAME IBM703-PT-none-CTLCardinality-08
FORMULA_NAME IBM703-PT-none-CTLCardinality-09
FORMULA_NAME IBM703-PT-none-CTLCardinality-10
FORMULA_NAME IBM703-PT-none-CTLCardinality-11
FORMULA_NAME IBM703-PT-none-CTLCardinality-12
FORMULA_NAME IBM703-PT-none-CTLCardinality-13
FORMULA_NAME IBM703-PT-none-CTLCardinality-14
FORMULA_NAME IBM703-PT-none-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679447871918

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM703-PT-none
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 01:17:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 01:17:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:17:53] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-22 01:17:53] [INFO ] Transformed 262 places.
[2023-03-22 01:17:53] [INFO ] Transformed 284 transitions.
[2023-03-22 01:17:53] [INFO ] Found NUPN structural information;
[2023-03-22 01:17:53] [INFO ] Completing missing partition info from NUPN : creating a component with [merge_s00000450_activated, merge_s00000462_activated, merge_s00000319_activated, merge_s00000446_activated, merge_s00000449_activated, task_s00000720_input_s00000263, task_s00000721_input_s00000263, task_s00000704_input_s00000263, task_s00000714_input_s00000263, task_s00000724_input_s00000263, fork_s00000464_input_s00000263, task_s00000716_input_s00000263, task_s00000762_input_s00000263, task_s00000726_input_s00000263, task_s00000754_input_s00000263, task_s00000727_input_s00000263, task_s00000746_input_s00000263, task_s00000756_input_s00000263, task_s00000757_input_s00000263, merge_s00000320_input_s00000263, merge_s00000453_input_s00000290, merge_s00000319_input_s00000290, merge_s00000455_input_s00000290, merge_s00000446_input_s00000290, merge_s00000456_input_s00000263, merge_s00000458_input_s00000263, merge_s00000457_input_s00000285, task_s00000710_output_s00000264, task_s00000730_output_s00000264, task_s00000740_output_s00000264, task_s00000704_output_s00000264, task_s00000732_output_s00000264, task_s00000714_output_s00000264, task_s00000733_output_s00000264, task_s00000724_output_s00000264, task_s00000752_output_s00000264, task_s00000716_output_s00000264, task_s00000707_output_s00000264, task_s00000744_output_s00000264, task_s00000708_output_s00000264, task_s00000736_output_s00000264, task_s00000727_output_s00000264, task_s00000755_output_s00000264, task_s00000728_output_s00000264, task_s00000738_output_s00000264, task_s00000739_output_s00000264, task_s00000749_output_s00000264, decision_s00000801_activated, decision_s00000804_activated, decision_s00000772_activated, decision_s00000792_activated, decision_s00000793_activated, decision_s00000776_activated, decision_s00000796_activated, decision_s00000788_activated, fork_s00000463_activated_s00000272, fork_s00000464_activated_s00000272, fork_s00000466_activated_s00000272, fork_s00000466_activated_s00000274, decision_s00000773_input_s00000263, decision_s00000793_input_s00000263, decision_s00000775_input_s00000263, decision_s00000787_input_s00000263, process_s00000030__s00000703_input_s00000263, callToProcess_s00000807_output_s00000264, callToProcess_s00000808_output_s00000264, task_s00000710_inputCriterion_s00000257_used, task_s00000711_inputCriterion_s00000257_used, task_s00000721_inputCriterion_s00000257_used, task_s00000740_inputCriterion_s00000257_used, task_s00000722_inputCriterion_s00000257_used, task_s00000741_inputCriterion_s00000257_used, task_s00000732_inputCriterion_s00000257_used, task_s00000714_inputCriterion_s00000257_used, task_s00000760_inputCriterion_s00000257_used, task_s00000733_inputCriterion_s00000257_used, task_s00000724_inputCriterion_s00000257_used, task_s00000706_inputCriterion_s00000257_used, task_s00000752_inputCriterion_s00000257_used, task_s00000725_inputCriterion_s00000257_used, task_s00000707_inputCriterion_s00000257_used, task_s00000753_inputCriterion_s00000257_used, task_s00000735_inputCriterion_s00000257_used, task_s00000726_inputCriterion_s00000257_used, task_s00000708_inputCriterion_s00000257_used, task_s00000745_inputCriterion_s00000257_used, task_s00000736_inputCriterion_s00000257_used, task_s00000718_inputCriterion_s00000257_used, task_s00000755_inputCriterion_s00000257_used, task_s00000737_inputCriterion_s00000257_used, task_s00000719_inputCriterion_s00000257_used, task_s00000738_inputCriterion_s00000257_used, task_s00000757_inputCriterion_s00000257_used, task_s00000748_inputCriterion_s00000257_used, task_s00000758_inputCriterion_s00000257_used, callToProcess_s00000807_inputCriterion_s00000257_used, callToProcess_s00000808_inputCriterion_s00000257_used]
[2023-03-22 01:17:53] [INFO ] Parsed PT model containing 262 places and 284 transitions and 572 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 9 ms.
Initial state reduction rules removed 1 formulas.
FORMULA IBM703-PT-none-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 284/284 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 259 transition count 284
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 246 transition count 271
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 246 transition count 271
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 240 transition count 265
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 240 transition count 265
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 237 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 237 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 237 transition count 261
Applied a total of 48 rules in 60 ms. Remains 237 /262 variables (removed 25) and now considering 261/284 (removed 23) transitions.
// Phase 1: matrix 261 rows 237 cols
[2023-03-22 01:17:53] [INFO ] Computed 0 place invariants in 17 ms
[2023-03-22 01:17:53] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-22 01:17:53] [INFO ] Invariant cache hit.
[2023-03-22 01:17:54] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2023-03-22 01:17:54] [INFO ] Invariant cache hit.
[2023-03-22 01:17:54] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/262 places, 261/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 718 ms. Remains : 237/262 places, 261/284 transitions.
Support contains 84 out of 237 places after structural reductions.
[2023-03-22 01:17:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 01:17:54] [INFO ] Flatten gal took : 45 ms
[2023-03-22 01:17:54] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA IBM703-PT-none-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 01:17:54] [INFO ] Flatten gal took : 16 ms
[2023-03-22 01:17:54] [INFO ] Input system was already deterministic with 261 transitions.
Support contains 73 out of 237 places (down from 84) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 166 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 51) seen :46
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 115 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 114 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 01:17:55] [INFO ] Invariant cache hit.
[2023-03-22 01:17:55] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 01:17:55] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 23 ms
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 11 ms
[2023-03-22 01:17:55] [INFO ] Input system was already deterministic with 261 transitions.
Computed a total of 237 stabilizing places and 261 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 237 transition count 261
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA IBM703-PT-none-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 261/261 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 234 transition count 261
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 215 transition count 242
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 215 transition count 242
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 205 transition count 232
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 205 transition count 232
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 197 transition count 224
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 197 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 79 place count 197 transition count 222
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 194 transition count 219
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 194 transition count 219
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 192 transition count 217
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 192 transition count 217
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 190 transition count 215
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 190 transition count 215
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 188 transition count 213
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 188 transition count 213
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 186 transition count 211
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 186 transition count 211
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 184 transition count 209
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 184 transition count 209
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 183 transition count 208
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 183 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 183 transition count 207
Applied a total of 108 rules in 41 ms. Remains 183 /237 variables (removed 54) and now considering 207/261 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 183/237 places, 207/261 transitions.
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 7 ms
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 7 ms
[2023-03-22 01:17:55] [INFO ] Input system was already deterministic with 207 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 261/261 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 234 transition count 261
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 214 transition count 241
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 214 transition count 241
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 203 transition count 230
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 203 transition count 230
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 75 place count 193 transition count 220
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 193 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 87 place count 193 transition count 218
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 188 transition count 213
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 188 transition count 213
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 184 transition count 209
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 184 transition count 209
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 180 transition count 205
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 180 transition count 205
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 117 place count 176 transition count 201
Iterating global reduction 2 with 4 rules applied. Total rules applied 121 place count 176 transition count 201
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 125 place count 172 transition count 197
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 172 transition count 197
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 132 place count 169 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 135 place count 169 transition count 194
Applied a total of 135 rules in 32 ms. Remains 169 /237 variables (removed 68) and now considering 194/261 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 169/237 places, 194/261 transitions.
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:17:55] [INFO ] Input system was already deterministic with 194 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 261/261 transitions.
Graph (complete) has 263 edges and 237 vertex of which 207 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.2 ms
Discarding 30 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 158 place count 206 transition count 76
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 1 with 183 rules applied. Total rules applied 341 place count 49 transition count 50
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic 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 2 with 19 rules applied. Total rules applied 360 place count 32 transition count 48
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 362 place count 31 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 363 place count 30 transition count 47
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 363 place count 30 transition count 42
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 373 place count 25 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 374 place count 24 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 375 place count 24 transition count 41
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 376 place count 23 transition count 39
Iterating global reduction 5 with 1 rules applied. Total rules applied 377 place count 23 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 3 rules applied. Total rules applied 380 place count 23 transition count 36
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic 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 6 with 4 rules applied. Total rules applied 384 place count 21 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 385 place count 20 transition count 34
Performed 7 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 399 place count 13 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 7 rules applied. Total rules applied 406 place count 13 transition count 19
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 9 with 7 rules applied. Total rules applied 413 place count 10 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic 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 10 with 3 rules applied. Total rules applied 416 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 418 place count 8 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 418 place count 8 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 420 place count 7 transition count 11
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 421 place count 6 transition count 10
Iterating global reduction 12 with 1 rules applied. Total rules applied 422 place count 6 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic 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 12 with 2 rules applied. Total rules applied 424 place count 6 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 425 place count 5 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 426 place count 5 transition count 7
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 427 place count 5 transition count 7
Applied a total of 427 rules in 21 ms. Remains 5 /237 variables (removed 232) and now considering 7/261 (removed 254) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 5/237 places, 7/261 transitions.
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 0 ms
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 0 ms
[2023-03-22 01:17:55] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 261/261 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 236 transition count 261
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 220 transition count 245
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 220 transition count 245
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 211 transition count 236
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 211 transition count 236
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 205 transition count 230
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 205 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 205 transition count 229
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 203 transition count 227
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 203 transition count 227
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 202 transition count 226
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 202 transition count 226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 201 transition count 225
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 201 transition count 225
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 200 transition count 224
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 200 transition count 224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 199 transition count 223
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 199 transition count 223
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 198 transition count 222
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 198 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 197 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 197 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 197 transition count 220
Applied a total of 81 rules in 36 ms. Remains 197 /237 variables (removed 40) and now considering 220/261 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 197/237 places, 220/261 transitions.
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 7 ms
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 7 ms
[2023-03-22 01:17:55] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 261/261 transitions.
Graph (complete) has 263 edges and 237 vertex of which 122 are kept as prefixes of interest. Removing 115 places using SCC suffix rule.1 ms
Discarding 115 places :
Also discarding 121 output transitions
Drop transitions removed 121 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 121 transition count 55
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 92 rules applied. Total rules applied 177 place count 37 transition count 47
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 184 place count 32 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 186 place count 30 transition count 45
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 186 place count 30 transition count 41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 194 place count 26 transition count 41
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 195 place count 25 transition count 39
Iterating global reduction 4 with 1 rules applied. Total rules applied 196 place count 25 transition count 39
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 4 with 2 rules applied. Total rules applied 198 place count 24 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic 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 4 with 2 rules applied. Total rules applied 200 place count 24 transition count 36
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 202 place count 23 transition count 35
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 205 place count 23 transition count 32
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 3 rules applied. Total rules applied 208 place count 23 transition count 29
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 211 place count 20 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 212 place count 20 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 213 place count 20 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 214 place count 20 transition count 27
Applied a total of 214 rules in 10 ms. Remains 20 /237 variables (removed 217) and now considering 27/261 (removed 234) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 20/237 places, 27/261 transitions.
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 1 ms
[2023-03-22 01:17:55] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 261/261 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 234 transition count 261
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 214 transition count 241
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 214 transition count 241
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 204 transition count 231
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 204 transition count 231
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 71 place count 196 transition count 223
Iterating global reduction 1 with 8 rules applied. Total rules applied 79 place count 196 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 196 transition count 222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 84 place count 192 transition count 218
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 192 transition count 218
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 92 place count 188 transition count 214
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 188 transition count 214
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 100 place count 184 transition count 210
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 184 transition count 210
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 108 place count 180 transition count 206
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 180 transition count 206
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 177 transition count 203
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 177 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 175 transition count 201
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 175 transition count 201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 174 transition count 200
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 174 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 125 place count 174 transition count 199
Applied a total of 125 rules in 30 ms. Remains 174 /237 variables (removed 63) and now considering 199/261 (removed 62) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 174/237 places, 199/261 transitions.
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:17:55] [INFO ] Input system was already deterministic with 199 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 261/261 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 234 transition count 261
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 217 transition count 244
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 217 transition count 244
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 46 place count 208 transition count 235
Iterating global reduction 1 with 9 rules applied. Total rules applied 55 place count 208 transition count 235
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 201 transition count 228
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 201 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 201 transition count 226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 200 transition count 225
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 200 transition count 225
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 199 transition count 224
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 199 transition count 224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 198 transition count 223
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 198 transition count 223
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 197 transition count 222
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 197 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 196 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 196 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 195 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 195 transition count 220
Applied a total of 83 rules in 36 ms. Remains 195 /237 variables (removed 42) and now considering 220/261 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 195/237 places, 220/261 transitions.
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:17:55] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 261/261 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 234 transition count 261
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 214 transition count 241
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 214 transition count 241
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 203 transition count 230
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 203 transition count 230
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 74 place count 194 transition count 221
Iterating global reduction 1 with 9 rules applied. Total rules applied 83 place count 194 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 194 transition count 220
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 189 transition count 215
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 189 transition count 215
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 185 transition count 211
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 185 transition count 211
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 181 transition count 207
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 181 transition count 207
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 177 transition count 203
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 177 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 121 place count 174 transition count 200
Iterating global reduction 2 with 3 rules applied. Total rules applied 124 place count 174 transition count 200
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 172 transition count 198
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 172 transition count 198
Applied a total of 128 rules in 28 ms. Remains 172 /237 variables (removed 65) and now considering 198/261 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 172/237 places, 198/261 transitions.
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 5 ms
[2023-03-22 01:17:55] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 261/261 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 235 transition count 261
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 217 transition count 243
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 217 transition count 243
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 49 place count 206 transition count 232
Iterating global reduction 1 with 11 rules applied. Total rules applied 60 place count 206 transition count 232
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 69 place count 197 transition count 223
Iterating global reduction 1 with 9 rules applied. Total rules applied 78 place count 197 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 80 place count 197 transition count 221
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 192 transition count 216
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 192 transition count 216
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 94 place count 188 transition count 212
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 188 transition count 212
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 102 place count 184 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 184 transition count 208
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 110 place count 180 transition count 204
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 180 transition count 204
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 118 place count 176 transition count 200
Iterating global reduction 2 with 4 rules applied. Total rules applied 122 place count 176 transition count 200
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 125 place count 173 transition count 197
Iterating global reduction 2 with 3 rules applied. Total rules applied 128 place count 173 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 172 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 172 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 131 place count 172 transition count 195
Applied a total of 131 rules in 34 ms. Remains 172 /237 variables (removed 65) and now considering 195/261 (removed 66) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 172/237 places, 195/261 transitions.
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:17:55] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:17:55] [INFO ] Input system was already deterministic with 195 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 261/261 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 234 transition count 261
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 214 transition count 241
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 214 transition count 241
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 203 transition count 230
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 203 transition count 230
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 74 place count 194 transition count 221
Iterating global reduction 1 with 9 rules applied. Total rules applied 83 place count 194 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 194 transition count 219
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 90 place count 189 transition count 214
Iterating global reduction 2 with 5 rules applied. Total rules applied 95 place count 189 transition count 214
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 99 place count 185 transition count 210
Iterating global reduction 2 with 4 rules applied. Total rules applied 103 place count 185 transition count 210
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 107 place count 181 transition count 206
Iterating global reduction 2 with 4 rules applied. Total rules applied 111 place count 181 transition count 206
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 178 transition count 203
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 178 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 120 place count 175 transition count 200
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 175 transition count 200
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 126 place count 172 transition count 197
Iterating global reduction 2 with 3 rules applied. Total rules applied 129 place count 172 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 171 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 171 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 171 transition count 195
Applied a total of 132 rules in 30 ms. Remains 171 /237 variables (removed 66) and now considering 195/261 (removed 66) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 171/237 places, 195/261 transitions.
[2023-03-22 01:17:56] [INFO ] Flatten gal took : 5 ms
[2023-03-22 01:17:56] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:17:56] [INFO ] Input system was already deterministic with 195 transitions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 261/261 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 234 transition count 261
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 214 transition count 241
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 214 transition count 241
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 204 transition count 231
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 204 transition count 231
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 71 place count 196 transition count 223
Iterating global reduction 1 with 8 rules applied. Total rules applied 79 place count 196 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 196 transition count 222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 84 place count 192 transition count 218
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 192 transition count 218
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 92 place count 188 transition count 214
Iterating global reduction 2 with 4 rules applied. Total rules applied 96 place count 188 transition count 214
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 100 place count 184 transition count 210
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 184 transition count 210
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 108 place count 180 transition count 206
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 180 transition count 206
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 177 transition count 203
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 177 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 175 transition count 201
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 175 transition count 201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 174 transition count 200
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 174 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 125 place count 174 transition count 199
Applied a total of 125 rules in 33 ms. Remains 174 /237 variables (removed 63) and now considering 199/261 (removed 62) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 174/237 places, 199/261 transitions.
[2023-03-22 01:17:56] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:17:56] [INFO ] Flatten gal took : 6 ms
[2023-03-22 01:17:56] [INFO ] Input system was already deterministic with 199 transitions.
[2023-03-22 01:17:56] [INFO ] Flatten gal took : 7 ms
[2023-03-22 01:17:56] [INFO ] Flatten gal took : 7 ms
[2023-03-22 01:17:56] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 01:17:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 261 transitions and 524 arcs took 1 ms.
Total runtime 2802 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 237 NrTr: 261 NrArc: 524)

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

net check time: 0m 0.000sec

init dd package: 0m 2.760sec


RS generation: 0m 0.040sec


-> reachability set: #nodes 698 (7.0e+02) #states 6,886 (3)



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

checking: EX [[AX [AF [AG [[p220<=0 & 0<=p220]]]] | [p129<=1 & 1<=p129]]]
normalized: EX [[~ [EX [EG [E [true U ~ [[p220<=0 & 0<=p220]]]]]] | [p129<=1 & 1<=p129]]]

abstracting: (1<=p129)
states: 105
abstracting: (p129<=1)
states: 6,886 (3)
abstracting: (0<=p220)
states: 6,886 (3)
abstracting: (p220<=0)
states: 6,761 (3)
............................................................................................................
EG iterations: 108
..-> the formula is TRUE

FORMULA IBM703-PT-none-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.069sec

checking: AF [[~ [[p53<=0 & 0<=p53]] & ~ [[p34<=1 & 1<=p34]]]]
normalized: ~ [EG [~ [[~ [[p34<=1 & 1<=p34]] & ~ [[p53<=0 & 0<=p53]]]]]]

abstracting: (0<=p53)
states: 6,886 (3)
abstracting: (p53<=0)
states: 6,761 (3)
abstracting: (1<=p34)
states: 5
abstracting: (p34<=1)
states: 6,886 (3)
.....................................................................................................
EG iterations: 101
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.781sec

checking: EF [~ [E [A [~ [[p73<=1 & 1<=p73]] U EG [[p29<=1 & 1<=p29]]] U EF [[EG [[p196<=1 & 1<=p196]] & EX [[p185<=0 & 0<=p185]]]]]]]
normalized: E [true U ~ [E [[~ [EG [~ [EG [[p29<=1 & 1<=p29]]]]] & ~ [E [~ [EG [[p29<=1 & 1<=p29]]] U [~ [EG [[p29<=1 & 1<=p29]]] & [p73<=1 & 1<=p73]]]]] U E [true U [EG [[p196<=1 & 1<=p196]] & EX [[p185<=0 & 0<=p185]]]]]]]

abstracting: (0<=p185)
states: 6,886 (3)
abstracting: (p185<=0)
states: 6,761 (3)
.abstracting: (1<=p196)
states: 5
abstracting: (p196<=1)
states: 6,886 (3)
.....
EG iterations: 5
abstracting: (1<=p73)
states: 60
abstracting: (p73<=1)
states: 6,886 (3)
abstracting: (1<=p29)
states: 5
abstracting: (p29<=1)
states: 6,886 (3)
.....
EG iterations: 5
abstracting: (1<=p29)
states: 5
abstracting: (p29<=1)
states: 6,886 (3)
.....
EG iterations: 5
abstracting: (1<=p29)
states: 5
abstracting: (p29<=1)
states: 6,886 (3)
.....
EG iterations: 5

EG iterations: 0
-> the formula is TRUE

FORMULA IBM703-PT-none-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.084sec

checking: EX [AF [[AG [[[p222<=0 & 0<=p222] | [p13<=1 & 1<=p13]]] & [[p94<=1 & 1<=p94] | [p178<=1 & 1<=p178]]]]]
normalized: EX [~ [EG [~ [[[[p178<=1 & 1<=p178] | [p94<=1 & 1<=p94]] & ~ [E [true U ~ [[[p13<=1 & 1<=p13] | [p222<=0 & 0<=p222]]]]]]]]]]

abstracting: (0<=p222)
states: 6,886 (3)
abstracting: (p222<=0)
states: 6,881 (3)
abstracting: (1<=p13)
states: 5
abstracting: (p13<=1)
states: 6,886 (3)
abstracting: (1<=p94)
states: 105
abstracting: (p94<=1)
states: 6,886 (3)
abstracting: (1<=p178)
states: 5
abstracting: (p178<=1)
states: 6,886 (3)
.................................
EG iterations: 33
.-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.474sec

checking: AX [AG [[AF [EX [[p13<=0 & 0<=p13]]] & A [~ [AF [[p101<=1 & 1<=p101]]] U ~ [[[[p181<=0 & 0<=p181] | [p57<=1 & 1<=p57]] & [p86<=1 & 1<=p86]]]]]]]
normalized: ~ [EX [E [true U ~ [[~ [EG [~ [EX [[p13<=0 & 0<=p13]]]]] & [~ [EG [[[p86<=1 & 1<=p86] & [[p57<=1 & 1<=p57] | [p181<=0 & 0<=p181]]]]] & ~ [E [[[p86<=1 & 1<=p86] & [[p57<=1 & 1<=p57] | [p181<=0 & 0<=p181]]] U [~ [EG [~ [[p101<=1 & 1<=p101]]]] & [[p86<=1 & 1<=p86] & [[p57<=1 & 1<=p57] | [p181<=0 & 0<=p181]]]]]]]]]]]]

abstracting: (0<=p181)
states: 6,886 (3)
abstracting: (p181<=0)
states: 6,885 (3)
abstracting: (1<=p57)
states: 125
abstracting: (p57<=1)
states: 6,886 (3)
abstracting: (1<=p86)
states: 5
abstracting: (p86<=1)
states: 6,886 (3)
abstracting: (1<=p101)
states: 25
abstracting: (p101<=1)
states: 6,886 (3)
.........
EG iterations: 9
abstracting: (0<=p181)
states: 6,886 (3)
abstracting: (p181<=0)
states: 6,885 (3)
abstracting: (1<=p57)
states: 125
abstracting: (p57<=1)
states: 6,886 (3)
abstracting: (1<=p86)
states: 5
abstracting: (p86<=1)
states: 6,886 (3)
abstracting: (0<=p181)
states: 6,886 (3)
abstracting: (p181<=0)
states: 6,885 (3)
abstracting: (1<=p57)
states: 125
abstracting: (p57<=1)
states: 6,886 (3)
abstracting: (1<=p86)
states: 5
abstracting: (p86<=1)
states: 6,886 (3)
.....
EG iterations: 5
abstracting: (0<=p13)
states: 6,886 (3)
abstracting: (p13<=0)
states: 6,881 (3)
...
EG iterations: 2
.-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.146sec

checking: [EX [AF [[AF [[p7<=1 & 1<=p7]] | EG [[[p52<=0 & 0<=p52] & [p144<=1 & 1<=p144]]]]]] & AF [[[p118<=0 & 0<=p118] & [p209<=1 & 1<=p209]]]]
normalized: [~ [EG [~ [[[p209<=1 & 1<=p209] & [p118<=0 & 0<=p118]]]]] & EX [~ [EG [~ [[EG [[[p144<=1 & 1<=p144] & [p52<=0 & 0<=p52]]] | ~ [EG [~ [[p7<=1 & 1<=p7]]]]]]]]]]

abstracting: (1<=p7)
states: 5
abstracting: (p7<=1)
states: 6,886 (3)
...........
EG iterations: 11
abstracting: (0<=p52)
states: 6,886 (3)
abstracting: (p52<=0)
states: 6,861 (3)
abstracting: (1<=p144)
states: 5
abstracting: (p144<=1)
states: 6,886 (3)
.....
EG iterations: 5
.
EG iterations: 1
.abstracting: (0<=p118)
states: 6,886 (3)
abstracting: (p118<=0)
states: 6,861 (3)
abstracting: (1<=p209)
states: 25
abstracting: (p209<=1)
states: 6,886 (3)
........
EG iterations: 8
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.160sec

checking: E [EF [[[p104<=1 & 1<=p104] & EX [[[p97<=0 & 0<=p97] | [p137<=1 & 1<=p137]]]]] U AG [A [~ [[p31<=1 & 1<=p31]] U [[p140<=0 & 0<=p140] | [p204<=1 & 1<=p204]]]]]
normalized: E [E [true U [EX [[[p137<=1 & 1<=p137] | [p97<=0 & 0<=p97]]] & [p104<=1 & 1<=p104]]] U ~ [E [true U ~ [[~ [EG [~ [[[p204<=1 & 1<=p204] | [p140<=0 & 0<=p140]]]]] & ~ [E [~ [[[p204<=1 & 1<=p204] | [p140<=0 & 0<=p140]]] U [~ [[[p204<=1 & 1<=p204] | [p140<=0 & 0<=p140]]] & [p31<=1 & 1<=p31]]]]]]]]]

abstracting: (1<=p31)
states: 255
abstracting: (p31<=1)
states: 6,886 (3)
abstracting: (0<=p140)
states: 6,886 (3)
abstracting: (p140<=0)
states: 6,881 (3)
abstracting: (1<=p204)
states: 1
abstracting: (p204<=1)
states: 6,886 (3)
abstracting: (0<=p140)
states: 6,886 (3)
abstracting: (p140<=0)
states: 6,881 (3)
abstracting: (1<=p204)
states: 1
abstracting: (p204<=1)
states: 6,886 (3)
abstracting: (0<=p140)
states: 6,886 (3)
abstracting: (p140<=0)
states: 6,881 (3)
abstracting: (1<=p204)
states: 1
abstracting: (p204<=1)
states: 6,886 (3)
.....
EG iterations: 5
abstracting: (1<=p104)
states: 1
abstracting: (p104<=1)
states: 6,886 (3)
abstracting: (0<=p97)
states: 6,886 (3)
abstracting: (p97<=0)
states: 6,885 (3)
abstracting: (1<=p137)
states: 5
abstracting: (p137<=1)
states: 6,886 (3)
.-> the formula is TRUE

FORMULA IBM703-PT-none-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.050sec

checking: A [AF [~ [E [[[[p212<=0 & 0<=p212] | [p31<=1 & 1<=p31]] & AF [[p186<=1 & 1<=p186]]] U [AG [[[p22<=0 & 0<=p22] | [p128<=1 & 1<=p128]]] & ~ [[p181<=1 & 1<=p181]]]]]] U ~ [[p130<=0 & 0<=p130]]]
normalized: [~ [EG [[p130<=0 & 0<=p130]]] & ~ [E [[p130<=0 & 0<=p130] U [EG [E [[~ [EG [~ [[p186<=1 & 1<=p186]]]] & [[p31<=1 & 1<=p31] | [p212<=0 & 0<=p212]]] U [~ [[p181<=1 & 1<=p181]] & ~ [E [true U ~ [[[p128<=1 & 1<=p128] | [p22<=0 & 0<=p22]]]]]]]] & [p130<=0 & 0<=p130]]]]]

abstracting: (0<=p130)
states: 6,886 (3)
abstracting: (p130<=0)
states: 6,631 (3)
abstracting: (0<=p22)
states: 6,886 (3)
abstracting: (p22<=0)
states: 6,881 (3)
abstracting: (1<=p128)
states: 255
abstracting: (p128<=1)
states: 6,886 (3)
abstracting: (1<=p181)
states: 1
abstracting: (p181<=1)
states: 6,886 (3)
abstracting: (0<=p212)
states: 6,886 (3)
abstracting: (p212<=0)
states: 6,631 (3)
abstracting: (1<=p31)
states: 255
abstracting: (p31<=1)
states: 6,886 (3)
abstracting: (1<=p186)
states: 5
abstracting: (p186<=1)
states: 6,886 (3)
.......
EG iterations: 7
.
EG iterations: 1
abstracting: (0<=p130)
states: 6,886 (3)
abstracting: (p130<=0)
states: 6,631 (3)
abstracting: (0<=p130)
states: 6,886 (3)
abstracting: (p130<=0)
states: 6,631 (3)
...........................................................
EG iterations: 59
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.672sec

checking: EG [[[EF [[[p168<=0 & 0<=p168] | [p116<=1 & 1<=p116]]] & [AF [EG [[p202<=0 & 0<=p202]]] & AF [[p151<=0 & 0<=p151]]]] | [EX [[p120<=1 & 1<=p120]] & [[p42<=0 & 0<=p42] & [p125<=1 & 1<=p125]]]]]
normalized: EG [[[[~ [EG [~ [EG [[p202<=0 & 0<=p202]]]]] & ~ [EG [~ [[p151<=0 & 0<=p151]]]]] & E [true U [[p116<=1 & 1<=p116] | [p168<=0 & 0<=p168]]]] | [EX [[p120<=1 & 1<=p120]] & [[p42<=0 & 0<=p42] & [p125<=1 & 1<=p125]]]]]

abstracting: (1<=p125)
states: 5
abstracting: (p125<=1)
states: 6,886 (3)
abstracting: (0<=p42)
states: 6,886 (3)
abstracting: (p42<=0)
states: 6,881 (3)
abstracting: (1<=p120)
states: 105
abstracting: (p120<=1)
states: 6,886 (3)
.abstracting: (0<=p168)
states: 6,886 (3)
abstracting: (p168<=0)
states: 6,881 (3)
abstracting: (1<=p116)
states: 210
abstracting: (p116<=1)
states: 6,886 (3)
abstracting: (0<=p151)
states: 6,886 (3)
abstracting: (p151<=0)
states: 6,881 (3)
.....
EG iterations: 5
abstracting: (0<=p202)
states: 6,886 (3)
abstracting: (p202<=0)
states: 6,881 (3)
...........................
EG iterations: 27
............................
EG iterations: 28

EG iterations: 0
-> the formula is TRUE

FORMULA IBM703-PT-none-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.628sec

checking: AX [[A [~ [[EG [[p56<=1 & 1<=p56]] & [EX [[p234<=1 & 1<=p234]] | EX [[[p51<=0 & 0<=p51] | [p170<=1 & 1<=p170]]]]]] U ~ [[[AX [[p37<=1 & 1<=p37]] | AF [[[p131<=0 & 0<=p131] | [p159<=1 & 1<=p159]]]] & EG [[[p174<=0 & 0<=p174] | [p99<=1 & 1<=p99]]]]]] & [AG [[p11<=0 & 0<=p11]] | EX [E [AF [[p92<=1 & 1<=p92]] U [[[p91<=0 & 0<=p91] | [p119<=1 & 1<=p119]] & [p74<=1 & 1<=p74]]]]]]]
normalized: ~ [EX [~ [[[~ [EG [[EG [[[p174<=0 & 0<=p174] | [p99<=1 & 1<=p99]]] & [~ [EG [~ [[[p159<=1 & 1<=p159] | [p131<=0 & 0<=p131]]]]] | ~ [EX [~ [[p37<=1 & 1<=p37]]]]]]]] & ~ [E [[EG [[[p174<=0 & 0<=p174] | [p99<=1 & 1<=p99]]] & [~ [EG [~ [[[p159<=1 & 1<=p159] | [p131<=0 & 0<=p131]]]]] | ~ [EX [~ [[p37<=1 & 1<=p37]]]]]] U [[EG [[[p174<=0 & 0<=p174] | [p99<=1 & 1<=p99]]] & [~ [EG [~ [[[p159<=1 & 1<=p159] | [p131<=0 & 0<=p131]]]]] | ~ [EX [~ [[p37<=1 & 1<=p37]]]]]] & [[EX [[[p170<=1 & 1<=p170] | [p51<=0 & 0<=p51]]] | EX [[p234<=1 & 1<=p234]]] & EG [[p56<=1 & 1<=p56]]]]]]] & [EX [E [~ [EG [~ [[p92<=1 & 1<=p92]]]] U [[[p119<=1 & 1<=p119] | [p91<=0 & 0<=p91]] & [p74<=1 & 1<=p74]]]] | ~ [E [true U ~ [[p11<=0 & 0<=p11]]]]]]]]]

abstracting: (0<=p11)
states: 6,886 (3)
abstracting: (p11<=0)
states: 6,761 (3)
abstracting: (1<=p74)
states: 20
abstracting: (p74<=1)
states: 6,886 (3)
abstracting: (0<=p91)
states: 6,886 (3)
abstracting: (p91<=0)
states: 5,514 (3)
abstracting: (1<=p119)
states: 125
abstracting: (p119<=1)
states: 6,886 (3)
abstracting: (1<=p92)
states: 5
abstracting: (p92<=1)
states: 6,886 (3)
..............
EG iterations: 14
.abstracting: (1<=p56)
states: 5
abstracting: (p56<=1)
states: 6,886 (3)
.....
EG iterations: 5
abstracting: (1<=p234)
states: 105
abstracting: (p234<=1)
states: 6,886 (3)
.abstracting: (0<=p51)
states: 6,886 (3)
abstracting: (p51<=0)
states: 6,861 (3)
abstracting: (1<=p170)
states: 5
abstracting: (p170<=1)
states: 6,886 (3)
.abstracting: (1<=p37)
states: 1
abstracting: (p37<=1)
states: 6,886 (3)
.abstracting: (0<=p131)
states: 6,886 (3)
abstracting: (p131<=0)
states: 6,881 (3)
abstracting: (1<=p159)
states: 4
abstracting: (p159<=1)
states: 6,886 (3)
.....
EG iterations: 5
abstracting: (1<=p99)
states: 125
abstracting: (p99<=1)
states: 6,886 (3)
abstracting: (0<=p174)
states: 6,886 (3)
abstracting: (p174<=0)
states: 6,885 (3)
..
EG iterations: 2
abstracting: (1<=p37)
states: 1
abstracting: (p37<=1)
states: 6,886 (3)
.abstracting: (0<=p131)
states: 6,886 (3)
abstracting: (p131<=0)
states: 6,881 (3)
abstracting: (1<=p159)
states: 4
abstracting: (p159<=1)
states: 6,886 (3)
.....
EG iterations: 5
abstracting: (1<=p99)
states: 125
abstracting: (p99<=1)
states: 6,886 (3)
abstracting: (0<=p174)
states: 6,886 (3)
abstracting: (p174<=0)
states: 6,885 (3)
..
EG iterations: 2
abstracting: (1<=p37)
states: 1
abstracting: (p37<=1)
states: 6,886 (3)
.abstracting: (0<=p131)
states: 6,886 (3)
abstracting: (p131<=0)
states: 6,881 (3)
abstracting: (1<=p159)
states: 4
abstracting: (p159<=1)
states: 6,886 (3)
.....
EG iterations: 5
abstracting: (1<=p99)
states: 125
abstracting: (p99<=1)
states: 6,886 (3)
abstracting: (0<=p174)
states: 6,886 (3)
abstracting: (p174<=0)
states: 6,885 (3)
..
EG iterations: 2
.
EG iterations: 1
.-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.378sec

checking: [EX [[EG [A [EG [[[p186<=0 & 0<=p186] | [p117<=1 & 1<=p117]]] U A [[[p100<=0 & 0<=p100] | [p53<=1 & 1<=p53]] U [p225<=1 & 1<=p225]]]] | AX [1<=0]]] | EF [[A [AF [[p108<=0 & 0<=p108]] U A [[p80<=1 & 1<=p80] U [p81<=1 & 1<=p81]]] & [A [~ [EF [[[p171<=0 & 0<=p171] | [p155<=1 & 1<=p155]]]] U ~ [E [[p42<=1 & 1<=p42] U [p123<=1 & 1<=p123]]]] & AX [AX [[[p11<=0 & 0<=p11] & [p154<=1 & 1<=p154]]]]]]]]
normalized: [E [true U [[~ [EX [EX [~ [[[p154<=1 & 1<=p154] & [p11<=0 & 0<=p11]]]]]] & [~ [EG [E [[p42<=1 & 1<=p42] U [p123<=1 & 1<=p123]]]] & ~ [E [E [[p42<=1 & 1<=p42] U [p123<=1 & 1<=p123]] U [E [true U [[p155<=1 & 1<=p155] | [p171<=0 & 0<=p171]]] & E [[p42<=1 & 1<=p42] U [p123<=1 & 1<=p123]]]]]]] & [~ [EG [~ [[~ [EG [~ [[p81<=1 & 1<=p81]]]] & ~ [E [~ [[p81<=1 & 1<=p81]] U [~ [[p80<=1 & 1<=p80]] & ~ [[p81<=1 & 1<=p81]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p81<=1 & 1<=p81]]]] & ~ [E [~ [[p81<=1 & 1<=p81]] U [~ [[p80<=1 & 1<=p80]] & ~ [[p81<=1 & 1<=p81]]]]]]] U [EG [~ [[p108<=0 & 0<=p108]]] & ~ [[~ [EG [~ [[p81<=1 & 1<=p81]]]] & ~ [E [~ [[p81<=1 & 1<=p81]] U [~ [[p80<=1 & 1<=p80]] & ~ [[p81<=1 & 1<=p81]]]]]]]]]]]]] | EX [[~ [EX [~ [1<=0]]] | EG [[~ [EG [~ [[~ [EG [~ [[p225<=1 & 1<=p225]]]] & ~ [E [~ [[p225<=1 & 1<=p225]] U [~ [[[p53<=1 & 1<=p53] | [p100<=0 & 0<=p100]]] & ~ [[p225<=1 & 1<=p225]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p225<=1 & 1<=p225]]]] & ~ [E [~ [[p225<=1 & 1<=p225]] U [~ [[[p53<=1 & 1<=p53] | [p100<=0 & 0<=p100]]] & ~ [[p225<=1 & 1<=p225]]]]]]] U [~ [EG [[[p117<=1 & 1<=p117] | [p186<=0 & 0<=p186]]]] & ~ [[~ [EG [~ [[p225<=1 & 1<=p225]]]] & ~ [E [~ [[p225<=1 & 1<=p225]] U [~ [[[p53<=1 & 1<=p53] | [p100<=0 & 0<=p100]]] & ~ [[p225<=1 & 1<=p225]]]]]]]]]]]]]]]

abstracting: (1<=p225)
states: 255
abstracting: (p225<=1)
states: 6,886 (3)
abstracting: (0<=p100)
states: 6,886 (3)
abstracting: (p100<=0)
states: 6,631 (3)
abstracting: (1<=p53)
states: 125
abstracting: (p53<=1)
states: 6,886 (3)
abstracting: (1<=p225)
states: 255
abstracting: (p225<=1)
states: 6,886 (3)
abstracting: (1<=p225)
states: 255
abstracting: (p225<=1)
states: 6,886 (3)
......................................................
EG iterations: 54
abstracting: (0<=p186)
states: 6,886 (3)
abstracting: (p186<=0)
states: 6,881 (3)
abstracting: (1<=p117)
states: 25
abstracting: (p117<=1)
states: 6,886 (3)
.......
EG iterations: 7
abstracting: (1<=p225)
states: 255
abstracting: (p225<=1)
states: 6,886 (3)
abstracting: (0<=p100)
states: 6,886 (3)
abstracting: (p100<=0)
states: 6,631 (3)
abstracting: (1<=p53)
states: 125
abstracting: (p53<=1)
states: 6,886 (3)
abstracting: (1<=p225)
states: 255
abstracting: (p225<=1)
states: 6,886 (3)
abstracting: (1<=p225)
states: 255
abstracting: (p225<=1)
states: 6,886 (3)
......................................................
EG iterations: 54
abstracting: (1<=p225)
states: 255
abstracting: (p225<=1)
states: 6,886 (3)
abstracting: (0<=p100)
states: 6,886 (3)
abstracting: (p100<=0)
states: 6,631 (3)
abstracting: (1<=p53)
states: 125
abstracting: (p53<=1)
states: 6,886 (3)
abstracting: (1<=p225)
states: 255
abstracting: (p225<=1)
states: 6,886 (3)
abstracting: (1<=p225)
states: 255
abstracting: (p225<=1)
states: 6,886 (3)
......................................................
EG iterations: 54
.
EG iterations: 1
.......................................................
EG iterations: 55
abstracting: (1<=0)
states: 0
..abstracting: (1<=p81)
states: 105
abstracting: (p81<=1)
states: 6,886 (3)
abstracting: (1<=p80)
states: 5
abstracting: (p80<=1)
states: 6,886 (3)
abstracting: (1<=p81)
states: 105
abstracting: (p81<=1)
states: 6,886 (3)
abstracting: (1<=p81)
states: 105
abstracting: (p81<=1)
states: 6,886 (3)
.
EG iterations: 1
abstracting: (0<=p108)
states: 6,886 (3)
abstracting: (p108<=0)
states: 6,881 (3)
.....
EG iterations: 5
abstracting: (1<=p81)
states: 105
abstracting: (p81<=1)
states: 6,886 (3)
abstracting: (1<=p80)
states: 5
abstracting: (p80<=1)
states: 6,886 (3)
abstracting: (1<=p81)
states: 105
abstracting: (p81<=1)
states: 6,886 (3)
abstracting: (1<=p81)
states: 105
abstracting: (p81<=1)
states: 6,886 (3)
.
EG iterations: 1
abstracting: (1<=p81)
states: 105
abstracting: (p81<=1)
states: 6,886 (3)
abstracting: (1<=p80)
states: 5
abstracting: (p80<=1)
states: 6,886 (3)
abstracting: (1<=p81)
states: 105
abstracting: (p81<=1)
states: 6,886 (3)
abstracting: (1<=p81)
states: 105
abstracting: (p81<=1)
states: 6,886 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p123)
states: 125
abstracting: (p123<=1)
states: 6,886 (3)
abstracting: (1<=p42)
states: 5
abstracting: (p42<=1)
states: 6,886 (3)
abstracting: (0<=p171)
states: 6,886 (3)
abstracting: (p171<=0)
states: 6,885 (3)
abstracting: (1<=p155)
states: 105
abstracting: (p155<=1)
states: 6,886 (3)
abstracting: (1<=p123)
states: 125
abstracting: (p123<=1)
states: 6,886 (3)
abstracting: (1<=p42)
states: 5
abstracting: (p42<=1)
states: 6,886 (3)
abstracting: (1<=p123)
states: 125
abstracting: (p123<=1)
states: 6,886 (3)
abstracting: (1<=p42)
states: 5
abstracting: (p42<=1)
states: 6,886 (3)
................
EG iterations: 16
abstracting: (0<=p11)
states: 6,886 (3)
abstracting: (p11<=0)
states: 6,761 (3)
abstracting: (1<=p154)
states: 5
abstracting: (p154<=1)
states: 6,886 (3)
..-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.754sec

totally nodes used: 5896796 (5.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6070032 14705973 20776005
used/not used/entry size/cache size: 18181979 48926885 16 1024MB
basic ops cache: hits/miss/sum: 122330 578545 700875
used/not used/entry size/cache size: 1141492 15635724 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 3850 10136 13986
used/not used/entry size/cache size: 10134 8378474 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 61577211
1 5194565
2 311778
3 22979
4 2021
5 213
6 90
7 7
8 0
9 0
>= 10 0

Total processing time: 0m10.024sec


BK_STOP 1679447887125

--------------------
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 CTLCardinality -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:1589 (6), effective:245 (0)

initing FirstDep: 0m 0.000sec


iterations count:1527 (5), effective:207 (0)

iterations count:516 (1), effective:63 (0)

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

iterations count:548 (2), effective:59 (0)

iterations count:1609 (6), effective:234 (0)

iterations count:292 (1), effective:9 (0)

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

iterations count:591 (2), effective:75 (0)

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

iterations count:587 (2), effective:76 (0)

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

iterations count:1310 (5), effective:179 (0)

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

iterations count:531 (2), effective:68 (0)

iterations count:531 (2), effective:68 (0)

iterations count:659 (2), effective:66 (0)

iterations count:531 (2), effective:68 (0)

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

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

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

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

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

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

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

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

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="IBM703-PT-none"
export BK_EXAMINATION="CTLCardinality"
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 IBM703-PT-none, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856419800089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBM703-PT-none.tgz
mv IBM703-PT-none execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;