About the Execution of Marcie+red for ParamProductionCell-PT-3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9855.315 | 134543.00 | 148140.00 | 693.80 | FTTTTTFTFFFFTTTF | normal |
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.r266-smll-167863540900385.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 ParamProductionCell-PT-3, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540900385
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.0K Feb 26 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:15 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 4.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ParamProductionCell-PT-3-CTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-3-CTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-3-CTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-3-CTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-3-CTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-3-CTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-3-CTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-3-CTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-3-CTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-3-CTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-3-CTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-3-CTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-3-CTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-3-CTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-3-CTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-3-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679040545894
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=ParamProductionCell-PT-3
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 08:09:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 08:09:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 08:09:09] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2023-03-17 08:09:09] [INFO ] Transformed 231 places.
[2023-03-17 08:09:09] [INFO ] Transformed 202 transitions.
[2023-03-17 08:09:09] [INFO ] Found NUPN structural information;
[2023-03-17 08:09:09] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
FORMULA ParamProductionCell-PT-3-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 83 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 229 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 229 transition count 200
Applied a total of 4 rules in 66 ms. Remains 229 /231 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 229 cols
[2023-03-17 08:09:09] [INFO ] Computed 59 place invariants in 26 ms
[2023-03-17 08:09:10] [INFO ] Implicit Places using invariants in 710 ms returned [15, 16, 18, 19, 24, 31, 35, 36, 42, 46, 59, 65, 73, 78, 99, 114, 115, 119, 120, 162, 163, 165, 167, 168, 194, 195, 199, 204, 209, 220]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 776 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/231 places, 200/202 transitions.
Applied a total of 0 rules in 13 ms. Remains 199 /199 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 856 ms. Remains : 199/231 places, 200/202 transitions.
Support contains 83 out of 199 places after structural reductions.
[2023-03-17 08:09:10] [INFO ] Flatten gal took : 83 ms
[2023-03-17 08:09:10] [INFO ] Flatten gal took : 43 ms
[2023-03-17 08:09:10] [INFO ] Input system was already deterministic with 200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 910 ms. (steps per millisecond=10 ) properties (out of 56) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 200 rows 199 cols
[2023-03-17 08:09:12] [INFO ] Computed 29 place invariants in 4 ms
[2023-03-17 08:09:12] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 08:09:12] [INFO ] [Nat]Absence check using 22 positive place invariants in 13 ms returned sat
[2023-03-17 08:09:12] [INFO ] [Nat]Absence check using 22 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-17 08:09:12] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-17 08:09:12] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-17 08:09:12] [INFO ] After 40ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-17 08:09:13] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 8 ms to minimize.
[2023-03-17 08:09:13] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2023-03-17 08:09:13] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2023-03-17 08:09:13] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 3 ms to minimize.
[2023-03-17 08:09:13] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 0 ms to minimize.
[2023-03-17 08:09:13] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2023-03-17 08:09:13] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2023-03-17 08:09:13] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2023-03-17 08:09:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 886 ms
[2023-03-17 08:09:13] [INFO ] After 937ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :0
[2023-03-17 08:09:13] [INFO ] After 1223ms 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 2 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA ParamProductionCell-PT-3-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 08:09:13] [INFO ] Flatten gal took : 26 ms
[2023-03-17 08:09:13] [INFO ] Flatten gal took : 26 ms
[2023-03-17 08:09:13] [INFO ] Input system was already deterministic with 200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 195 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 195 transition count 196
Applied a total of 8 rules in 37 ms. Remains 195 /199 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 195/199 places, 196/200 transitions.
[2023-03-17 08:09:13] [INFO ] Flatten gal took : 21 ms
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 22 ms
[2023-03-17 08:09:14] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 200/200 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 199 transition count 175
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 52 place count 174 transition count 173
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 172 transition count 173
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 54 place count 172 transition count 162
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 76 place count 161 transition count 162
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 80 place count 157 transition count 158
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 157 transition count 158
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 157 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 156 transition count 157
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 162 place count 118 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 164 place count 117 transition count 118
Applied a total of 164 rules in 73 ms. Remains 117 /199 variables (removed 82) and now considering 118/200 (removed 82) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 117/199 places, 118/200 transitions.
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 14 ms
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 14 ms
[2023-03-17 08:09:14] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 200/200 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 199 transition count 173
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 172 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 171 transition count 172
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 56 place count 171 transition count 162
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 76 place count 161 transition count 162
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 80 place count 157 transition count 158
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 157 transition count 158
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 157 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 156 transition count 157
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 166 place count 116 transition count 117
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 5 with 2 rules applied. Total rules applied 168 place count 115 transition count 116
Applied a total of 168 rules in 50 ms. Remains 115 /199 variables (removed 84) and now considering 116/200 (removed 84) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 115/199 places, 116/200 transitions.
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 13 ms
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 13 ms
[2023-03-17 08:09:14] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 195 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 195 transition count 196
Applied a total of 8 rules in 13 ms. Remains 195 /199 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 195/199 places, 196/200 transitions.
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 17 ms
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 18 ms
[2023-03-17 08:09:14] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 195 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 195 transition count 196
Applied a total of 8 rules in 13 ms. Remains 195 /199 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 195/199 places, 196/200 transitions.
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 16 ms
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 18 ms
[2023-03-17 08:09:14] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 195 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 195 transition count 196
Applied a total of 8 rules in 13 ms. Remains 195 /199 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 195/199 places, 196/200 transitions.
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 16 ms
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 24 ms
[2023-03-17 08:09:14] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 200/200 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 199 transition count 176
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 175 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 173 transition count 174
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 52 place count 173 transition count 162
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 76 place count 161 transition count 162
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 80 place count 157 transition count 158
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 157 transition count 158
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 157 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 156 transition count 157
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 148 place count 125 transition count 126
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 5 with 2 rules applied. Total rules applied 150 place count 124 transition count 125
Applied a total of 150 rules in 40 ms. Remains 124 /199 variables (removed 75) and now considering 125/200 (removed 75) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 124/199 places, 125/200 transitions.
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:09:14] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 200/200 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 199 transition count 174
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 173 transition count 174
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 52 place count 173 transition count 162
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 76 place count 161 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 158 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 158 transition count 159
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 1 rules applied. Total rules applied 83 place count 158 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 157 transition count 158
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 160 place count 119 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 118 transition count 119
Applied a total of 162 rules in 32 ms. Remains 118 /199 variables (removed 81) and now considering 119/200 (removed 81) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 118/199 places, 119/200 transitions.
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:09:14] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 200/200 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 199 transition count 176
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 175 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 173 transition count 174
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 52 place count 173 transition count 162
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 76 place count 161 transition count 162
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 80 place count 157 transition count 158
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 157 transition count 158
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 157 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 156 transition count 157
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 160 place count 119 transition count 120
Applied a total of 160 rules in 24 ms. Remains 119 /199 variables (removed 80) and now considering 120/200 (removed 80) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 119/199 places, 120/200 transitions.
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:09:14] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 195 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 195 transition count 196
Applied a total of 8 rules in 8 ms. Remains 195 /199 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 195/199 places, 196/200 transitions.
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:09:14] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 195 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 195 transition count 196
Applied a total of 8 rules in 12 ms. Remains 195 /199 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 195/199 places, 196/200 transitions.
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:09:14] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 200/200 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 196 transition count 197
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 196 transition count 197
Applied a total of 6 rules in 7 ms. Remains 196 /199 variables (removed 3) and now considering 197/200 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 196/199 places, 197/200 transitions.
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:09:14] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 195 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 195 transition count 196
Applied a total of 8 rules in 7 ms. Remains 195 /199 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 195/199 places, 196/200 transitions.
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:09:14] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 195 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 195 transition count 196
Applied a total of 8 rules in 8 ms. Remains 195 /199 variables (removed 4) and now considering 196/200 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 195/199 places, 196/200 transitions.
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:09:14] [INFO ] Input system was already deterministic with 196 transitions.
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:09:14] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:09:15] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-17 08:09:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 199 places, 200 transitions and 686 arcs took 2 ms.
Total runtime 6035 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: 199 NrTr: 200 NrArc: 686)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.007sec
net check time: 0m 0.000sec
init dd package: 0m 3.343sec
RS generation: 0m 0.704sec
-> reachability set: #nodes 12045 (1.2e+04) #states 1,463,790 (6)
starting MCC model checker
--------------------------
checking: AG [EX [0<=0]]
normalized: ~ [E [true U ~ [EX [0<=0]]]]
abstracting: (0<=0)
states: 1,463,790 (6)
.-> the formula is TRUE
FORMULA ParamProductionCell-PT-3-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.400sec
checking: AF [AX [AX [EF [[[p17<=0 & 0<=p17] & [p69<=1 & 1<=p69]]]]]]
normalized: ~ [EG [EX [EX [~ [E [true U [[p17<=0 & 0<=p17] & [p69<=1 & 1<=p69]]]]]]]]
abstracting: (1<=p69)
states: 8,740 (3)
abstracting: (p69<=1)
states: 1,463,790 (6)
abstracting: (0<=p17)
states: 1,463,790 (6)
abstracting: (p17<=0)
states: 851,780 (5)
...
EG iterations: 1
-> the formula is TRUE
FORMULA ParamProductionCell-PT-3-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.039sec
checking: [AF [[p185<=1 & 1<=p185]] & AF [[[p90<=0 & 0<=p90] | [p15<=1 & 1<=p15]]]]
normalized: [~ [EG [~ [[[p15<=1 & 1<=p15] | [p90<=0 & 0<=p90]]]]] & ~ [EG [~ [[p185<=1 & 1<=p185]]]]]
abstracting: (1<=p185)
states: 36,492 (4)
abstracting: (p185<=1)
states: 1,463,790 (6)
.........................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 361
abstracting: (0<=p90)
states: 1,463,790 (6)
abstracting: (p90<=0)
states: 1,201,399 (6)
abstracting: (1<=p15)
states: 43,163 (4)
abstracting: (p15<=1)
states: 1,463,790 (6)
....................................................................................................................................
EG iterations: 132
-> the formula is TRUE
FORMULA ParamProductionCell-PT-3-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m22.870sec
checking: [EG [E [[[p136<=0 & 0<=p136] | [p114<=1 & 1<=p114]] U [p192<=0 & 0<=p192]]] | AX [[p64<=0 & 0<=p64]]]
normalized: [~ [EX [~ [[p64<=0 & 0<=p64]]]] | EG [E [[[p114<=1 & 1<=p114] | [p136<=0 & 0<=p136]] U [p192<=0 & 0<=p192]]]]
abstracting: (0<=p192)
states: 1,463,790 (6)
abstracting: (p192<=0)
states: 1,418,220 (6)
abstracting: (0<=p136)
states: 1,463,790 (6)
abstracting: (p136<=0)
states: 1,459,896 (6)
abstracting: (1<=p114)
states: 5,697 (3)
abstracting: (p114<=1)
states: 1,463,790 (6)
.
EG iterations: 1
abstracting: (0<=p64)
states: 1,463,790 (6)
abstracting: (p64<=0)
states: 34,960 (4)
.-> the formula is TRUE
FORMULA ParamProductionCell-PT-3-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.086sec
checking: AG [~ [A [[~ [[[p188<=0 & 0<=p188] | [p12<=1 & 1<=p12]]] & EF [~ [[p141<=1 & 1<=p141]]]] U EF [AG [[[p147<=0 & 0<=p147] | [p195<=1 & 1<=p195]]]]]]]
normalized: ~ [E [true U [~ [EG [~ [E [true U ~ [E [true U ~ [[[p195<=1 & 1<=p195] | [p147<=0 & 0<=p147]]]]]]]]] & ~ [E [~ [E [true U ~ [E [true U ~ [[[p195<=1 & 1<=p195] | [p147<=0 & 0<=p147]]]]]]] U [~ [[E [true U ~ [[p141<=1 & 1<=p141]]] & ~ [[[p12<=1 & 1<=p12] | [p188<=0 & 0<=p188]]]]] & ~ [E [true U ~ [E [true U ~ [[[p195<=1 & 1<=p195] | [p147<=0 & 0<=p147]]]]]]]]]]]]]
abstracting: (0<=p147)
states: 1,463,790 (6)
abstracting: (p147<=0)
states: 1,458,668 (6)
abstracting: (1<=p195)
states: 45,570 (4)
abstracting: (p195<=1)
states: 1,463,790 (6)
abstracting: (0<=p188)
states: 1,463,790 (6)
abstracting: (p188<=0)
states: 1,418,220 (6)
abstracting: (1<=p12)
states: 91,641 (4)
abstracting: (p12<=1)
states: 1,463,790 (6)
abstracting: (1<=p141)
states: 25,610 (4)
abstracting: (p141<=1)
states: 1,463,790 (6)
abstracting: (0<=p147)
states: 1,463,790 (6)
abstracting: (p147<=0)
states: 1,458,668 (6)
abstracting: (1<=p195)
states: 45,570 (4)
abstracting: (p195<=1)
states: 1,463,790 (6)
abstracting: (0<=p147)
states: 1,463,790 (6)
abstracting: (p147<=0)
states: 1,458,668 (6)
abstracting: (1<=p195)
states: 45,570 (4)
abstracting: (p195<=1)
states: 1,463,790 (6)
EG iterations: 0
-> the formula is TRUE
FORMULA ParamProductionCell-PT-3-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.540sec
checking: AX [EF [EG [[[~ [[p168<=0 & 0<=p168]] & ~ [[p6<=1 & 1<=p6]]] & [~ [[p120<=1 & 1<=p120]] & [~ [[p99<=0 & 0<=p99]] & ~ [[p85<=1 & 1<=p85]]]]]]]]
normalized: ~ [EX [~ [E [true U EG [[[~ [[p6<=1 & 1<=p6]] & ~ [[p168<=0 & 0<=p168]]] & [[~ [[p99<=0 & 0<=p99]] & ~ [[p85<=1 & 1<=p85]]] & ~ [[p120<=1 & 1<=p120]]]]]]]]]
abstracting: (1<=p120)
states: 7,057 (3)
abstracting: (p120<=1)
states: 1,463,790 (6)
abstracting: (1<=p85)
states: 4,714 (3)
abstracting: (p85<=1)
states: 1,463,790 (6)
abstracting: (0<=p99)
states: 1,463,790 (6)
abstracting: (p99<=0)
states: 1,444,169 (6)
abstracting: (0<=p168)
states: 1,463,790 (6)
abstracting: (p168<=0)
states: 1,240,242 (6)
abstracting: (1<=p6)
states: 27,248 (4)
abstracting: (p6<=1)
states: 1,463,790 (6)
...........................................
EG iterations: 43
.-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.673sec
checking: EF [AG [[[EG [[p37<=1 & 1<=p37]] & [p101<=1 & 1<=p101]] & [AG [[[p157<=0 & 0<=p157] | [p60<=1 & 1<=p60]]] & EG [[p34<=1 & 1<=p34]]]]]]
normalized: E [true U ~ [E [true U ~ [[[EG [[p34<=1 & 1<=p34]] & ~ [E [true U ~ [[[p60<=1 & 1<=p60] | [p157<=0 & 0<=p157]]]]]] & [[p101<=1 & 1<=p101] & EG [[p37<=1 & 1<=p37]]]]]]]]
abstracting: (1<=p37)
states: 1,113,672 (6)
abstracting: (p37<=1)
states: 1,463,790 (6)
...............................................................................................................................................................................................................................................................................................................
EG iterations: 303
abstracting: (1<=p101)
states: 19,621 (4)
abstracting: (p101<=1)
states: 1,463,790 (6)
abstracting: (0<=p157)
states: 1,463,790 (6)
abstracting: (p157<=0)
states: 1,461,871 (6)
abstracting: (1<=p60)
states: 78,920 (4)
abstracting: (p60<=1)
states: 1,463,790 (6)
abstracting: (1<=p34)
states: 89,458 (4)
abstracting: (p34<=1)
states: 1,463,790 (6)
...................................................................................................................................................................................................................................
EG iterations: 227
-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m20.007sec
checking: [EF [AX [EG [[p177<=0 & 0<=p177]]]] | AG [[AF [[[p136<=0 & 0<=p136] | AG [[p117<=0 & 0<=p117]]]] & EX [EX [[[p142<=1 & 1<=p142] & [[p16<=0 & 0<=p16] | [p47<=1 & 1<=p47]]]]]]]]
normalized: [E [true U ~ [EX [~ [EG [[p177<=0 & 0<=p177]]]]]] | ~ [E [true U ~ [[EX [EX [[[p142<=1 & 1<=p142] & [[p47<=1 & 1<=p47] | [p16<=0 & 0<=p16]]]]] & ~ [EG [~ [[~ [E [true U ~ [[p117<=0 & 0<=p117]]]] | [p136<=0 & 0<=p136]]]]]]]]]]
abstracting: (0<=p136)
states: 1,463,790 (6)
abstracting: (p136<=0)
states: 1,459,896 (6)
abstracting: (0<=p117)
states: 1,463,790 (6)
abstracting: (p117<=0)
states: 1,449,676 (6)
...................................................................
EG iterations: 67
abstracting: (0<=p16)
states: 1,463,790 (6)
abstracting: (p16<=0)
states: 1,291,138 (6)
abstracting: (1<=p47)
states: 27,248 (4)
abstracting: (p47<=1)
states: 1,463,790 (6)
abstracting: (1<=p142)
states: 1,400,690 (6)
abstracting: (p142<=1)
states: 1,463,790 (6)
..abstracting: (0<=p177)
states: 1,463,790 (6)
abstracting: (p177<=0)
states: 246,186 (5)
...............................................................................................................................................................................................................................
EG iterations: 223
.-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.846sec
checking: AG [[[p58<=0 & 0<=p58] | [[p90<=1 & 1<=p90] | [[p5<=0 & 0<=p5] & [[p84<=1 & 1<=p84] & [EF [[p111<=1 & 1<=p111]] | EX [[p150<=1 & 1<=p150]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[E [true U [p111<=1 & 1<=p111]] | EX [[p150<=1 & 1<=p150]]] & [p84<=1 & 1<=p84]] & [p5<=0 & 0<=p5]] | [p90<=1 & 1<=p90]] | [p58<=0 & 0<=p58]]]]]
abstracting: (0<=p58)
states: 1,463,790 (6)
abstracting: (p58<=0)
states: 1,384,870 (6)
abstracting: (1<=p90)
states: 262,391 (5)
abstracting: (p90<=1)
states: 1,463,790 (6)
abstracting: (0<=p5)
states: 1,463,790 (6)
abstracting: (p5<=0)
states: 1,372,149 (6)
abstracting: (1<=p84)
states: 82,017 (4)
abstracting: (p84<=1)
states: 1,463,790 (6)
abstracting: (1<=p150)
states: 7,498 (3)
abstracting: (p150<=1)
states: 1,463,790 (6)
.abstracting: (1<=p111)
states: 7,057 (3)
abstracting: (p111<=1)
states: 1,463,790 (6)
-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.727sec
checking: [EF [[AF [[p81<=1 & 1<=p81]] | [[EF [[[p33<=0 & 0<=p33] | [p159<=1 & 1<=p159]]] & [p33<=1 & 1<=p33]] & [[p172<=1 & 1<=p172] & [[p144<=0 & 0<=p144] | [p152<=1 & 1<=p152]]]]]] & AX [1<=0]]
normalized: [E [true U [[[E [true U [[p159<=1 & 1<=p159] | [p33<=0 & 0<=p33]]] & [p33<=1 & 1<=p33]] & [[[p152<=1 & 1<=p152] | [p144<=0 & 0<=p144]] & [p172<=1 & 1<=p172]]] | ~ [EG [~ [[p81<=1 & 1<=p81]]]]]] & ~ [EX [~ [1<=0]]]]
abstracting: (1<=0)
states: 0
.abstracting: (1<=p81)
states: 19,621 (4)
abstracting: (p81<=1)
states: 1,463,790 (6)
................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 352
abstracting: (1<=p172)
states: 246,186 (5)
abstracting: (p172<=1)
states: 1,463,790 (6)
abstracting: (0<=p144)
states: 1,463,790 (6)
abstracting: (p144<=0)
states: 1,458,668 (6)
abstracting: (1<=p152)
states: 7,498 (3)
abstracting: (p152<=1)
states: 1,463,790 (6)
abstracting: (1<=p33)
states: 350,118 (5)
abstracting: (p33<=1)
states: 1,463,790 (6)
abstracting: (0<=p33)
states: 1,463,790 (6)
abstracting: (p33<=0)
states: 1,113,672 (6)
abstracting: (1<=p159)
states: 5,579 (3)
abstracting: (p159<=1)
states: 1,463,790 (6)
-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m18.334sec
checking: EX [E [~ [A [[[[p142<=0 & 0<=p142] | [[p32<=0 & 0<=p32] | [p97<=1 & 1<=p97]]] & ~ [[[p30<=0 & 0<=p30] | [p3<=1 & 1<=p3]]]] U [AX [[p130<=1 & 1<=p130]] | [p86<=1 & 1<=p86]]]] U ~ [AX [~ [[p57<=0 & 0<=p57]]]]]]
normalized: EX [E [~ [[~ [EG [~ [[[p86<=1 & 1<=p86] | ~ [EX [~ [[p130<=1 & 1<=p130]]]]]]]] & ~ [E [~ [[[p86<=1 & 1<=p86] | ~ [EX [~ [[p130<=1 & 1<=p130]]]]]] U [~ [[[[[p97<=1 & 1<=p97] | [p32<=0 & 0<=p32]] | [p142<=0 & 0<=p142]] & ~ [[[p3<=1 & 1<=p3] | [p30<=0 & 0<=p30]]]]] & ~ [[[p86<=1 & 1<=p86] | ~ [EX [~ [[p130<=1 & 1<=p130]]]]]]]]]]] U EX [[p57<=0 & 0<=p57]]]]
abstracting: (0<=p57)
states: 1,463,790 (6)
abstracting: (p57<=0)
states: 1,424,330 (6)
.abstracting: (1<=p130)
states: 33,115 (4)
abstracting: (p130<=1)
states: 1,463,790 (6)
.abstracting: (1<=p86)
states: 95,790 (4)
abstracting: (p86<=1)
states: 1,463,790 (6)
abstracting: (0<=p30)
states: 1,463,790 (6)
abstracting: (p30<=0)
states: 1,374,332 (6)
abstracting: (1<=p3)
states: 113,036 (5)
abstracting: (p3<=1)
states: 1,463,790 (6)
abstracting: (0<=p142)
states: 1,463,790 (6)
abstracting: (p142<=0)
states: 63,100 (4)
abstracting: (0<=p32)
states: 1,463,790 (6)
abstracting: (p32<=0)
states: 876,068 (5)
abstracting: (1<=p97)
states: 98,105 (4)
abstracting: (p97<=1)
states: 1,463,790 (6)
abstracting: (1<=p130)
states: 33,115 (4)
abstracting: (p130<=1)
states: 1,463,790 (6)
.abstracting: (1<=p86)
states: 95,790 (4)
abstracting: (p86<=1)
states: 1,463,790 (6)
abstracting: (1<=p130)
states: 33,115 (4)
abstracting: (p130<=1)
states: 1,463,790 (6)
.abstracting: (1<=p86)
states: 95,790 (4)
abstracting: (p86<=1)
states: 1,463,790 (6)
...................................................................................................
before gc: list nodes free: 763522
after gc: idd nodes used:222594, unused:63777406; list nodes free:282155317
..........................................................................
EG iterations: 173
.-> the formula is TRUE
FORMULA ParamProductionCell-PT-3-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m20.949sec
checking: AG [[EF [[~ [A [[[p183<=0 & 0<=p183] | [p150<=1 & 1<=p150]] U [[0<=p65 & p65<=0] | [p100<=1 & 1<=p100]]]] | [[p190<=1 & 1<=p190] & [[p3<=0 & 0<=p3] & [p123<=1 & 1<=p123]]]]] | [p117<=1 & 1<=p117]]]
normalized: ~ [E [true U ~ [[E [true U [[[p190<=1 & 1<=p190] & [[p3<=0 & 0<=p3] & [p123<=1 & 1<=p123]]] | ~ [[~ [EG [~ [[[0<=p65 & p65<=0] | [p100<=1 & 1<=p100]]]]] & ~ [E [~ [[[0<=p65 & p65<=0] | [p100<=1 & 1<=p100]]] U [~ [[[0<=p65 & p65<=0] | [p100<=1 & 1<=p100]]] & ~ [[[p150<=1 & 1<=p150] | [p183<=0 & 0<=p183]]]]]]]]]] | [p117<=1 & 1<=p117]]]]]
abstracting: (1<=p117)
states: 14,114 (4)
abstracting: (p117<=1)
states: 1,463,790 (6)
abstracting: (0<=p183)
states: 1,463,790 (6)
abstracting: (p183<=0)
states: 1,427,298 (6)
abstracting: (1<=p150)
states: 7,498 (3)
abstracting: (p150<=1)
states: 1,463,790 (6)
abstracting: (1<=p100)
states: 80,034 (4)
abstracting: (p100<=1)
states: 1,463,790 (6)
abstracting: (p65<=0)
states: 52,440 (4)
abstracting: (0<=p65)
states: 1,463,790 (6)
abstracting: (1<=p100)
states: 80,034 (4)
abstracting: (p100<=1)
states: 1,463,790 (6)
abstracting: (p65<=0)
states: 52,440 (4)
abstracting: (0<=p65)
states: 1,463,790 (6)
abstracting: (1<=p100)
states: 80,034 (4)
abstracting: (p100<=1)
states: 1,463,790 (6)
abstracting: (p65<=0)
states: 52,440 (4)
abstracting: (0<=p65)
states: 1,463,790 (6)
.....................................................................................................................................................
EG iterations: 149
abstracting: (1<=p123)
states: 7,057 (3)
abstracting: (p123<=1)
states: 1,463,790 (6)
abstracting: (0<=p3)
states: 1,463,790 (6)
abstracting: (p3<=0)
states: 1,350,754 (6)
abstracting: (1<=p190)
states: 45,570 (4)
abstracting: (p190<=1)
states: 1,463,790 (6)
-> the formula is TRUE
FORMULA ParamProductionCell-PT-3-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m14.402sec
checking: AF [[[EG [AG [[p39<=0 & 0<=p39]]] & [~ [E [[p102<=0 & 0<=p102] U [p19<=1 & 1<=p19]]] & AG [[p52<=1 & 1<=p52]]]] & [[p194<=0 & 0<=p194] & [[p191<=1 & 1<=p191] & [[p11<=0 & 0<=p11] | [p78<=1 & 1<=p78]]]]]]
normalized: ~ [EG [~ [[[[[[p78<=1 & 1<=p78] | [p11<=0 & 0<=p11]] & [p191<=1 & 1<=p191]] & [p194<=0 & 0<=p194]] & [[~ [E [true U ~ [[p52<=1 & 1<=p52]]]] & ~ [E [[p102<=0 & 0<=p102] U [p19<=1 & 1<=p19]]]] & EG [~ [E [true U ~ [[p39<=0 & 0<=p39]]]]]]]]]]
abstracting: (0<=p39)
states: 1,463,790 (6)
abstracting: (p39<=0)
states: 1,284,874 (6)
.
EG iterations: 1
abstracting: (1<=p19)
states: 43,163 (4)
abstracting: (p19<=1)
states: 1,463,790 (6)
abstracting: (0<=p102)
states: 1,463,790 (6)
abstracting: (p102<=0)
states: 1,444,169 (6)
abstracting: (1<=p52)
states: 1,305,950 (6)
abstracting: (p52<=1)
states: 1,463,790 (6)
abstracting: (0<=p194)
states: 1,463,790 (6)
abstracting: (p194<=0)
states: 1,372,650 (6)
abstracting: (1<=p191)
states: 45,570 (4)
abstracting: (p191<=1)
states: 1,463,790 (6)
abstracting: (0<=p11)
states: 1,463,790 (6)
abstracting: (p11<=0)
states: 1,436,542 (6)
abstracting: (1<=p78)
states: 50,947 (4)
abstracting: (p78<=1)
states: 1,463,790 (6)
EG iterations: 0
-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.286sec
checking: EF [[[[p103<=0 & 0<=p103] | [p13<=1 & 1<=p13]] & [[[AG [[[p49<=0 & 0<=p49] | [p110<=1 & 1<=p110]]] & [[p55<=0 & 0<=p55] & [p140<=1 & 1<=p140]]] | [[p113<=1 & 1<=p113] & [E [[p60<=0 & 0<=p60] U [p195<=0 & 0<=p195]] & [[p145<=1 & 1<=p145] | EX [[[p97<=0 & 0<=p97] | [p3<=1 & 1<=p3]]]]]]] & [EG [AX [[~ [[p5<=0 & 0<=p5]] & ~ [[p83<=1 & 1<=p83]]]]] | [~ [E [[p175<=0 & 0<=p175] U [[p133<=0 & 0<=p133] | [p53<=1 & 1<=p53]]]] & [p136<=1 & 1<=p136]]]]]]
normalized: E [true U [[[[[p136<=1 & 1<=p136] & ~ [E [[p175<=0 & 0<=p175] U [[p53<=1 & 1<=p53] | [p133<=0 & 0<=p133]]]]] | EG [~ [EX [~ [[~ [[p83<=1 & 1<=p83]] & ~ [[p5<=0 & 0<=p5]]]]]]]] & [[[[EX [[[p3<=1 & 1<=p3] | [p97<=0 & 0<=p97]]] | [p145<=1 & 1<=p145]] & E [[p60<=0 & 0<=p60] U [p195<=0 & 0<=p195]]] & [p113<=1 & 1<=p113]] | [[[p140<=1 & 1<=p140] & [p55<=0 & 0<=p55]] & ~ [E [true U ~ [[[p110<=1 & 1<=p110] | [p49<=0 & 0<=p49]]]]]]]] & [[p13<=1 & 1<=p13] | [p103<=0 & 0<=p103]]]]
abstracting: (0<=p103)
states: 1,463,790 (6)
abstracting: (p103<=0)
states: 1,424,548 (6)
abstracting: (1<=p13)
states: 43,163 (4)
abstracting: (p13<=1)
states: 1,463,790 (6)
abstracting: (0<=p49)
states: 1,463,790 (6)
abstracting: (p49<=0)
states: 1,363,606 (6)
abstracting: (1<=p110)
states: 5,697 (3)
abstracting: (p110<=1)
states: 1,463,790 (6)
abstracting: (0<=p55)
states: 1,463,790 (6)
abstracting: (p55<=0)
states: 1,424,330 (6)
abstracting: (1<=p140)
states: 7,788 (3)
abstracting: (p140<=1)
states: 1,463,790 (6)
abstracting: (1<=p113)
states: 2,720 (3)
abstracting: (p113<=1)
states: 1,463,790 (6)
abstracting: (0<=p195)
states: 1,463,790 (6)
abstracting: (p195<=0)
states: 1,418,220 (6)
abstracting: (0<=p60)
states: 1,463,790 (6)
abstracting: (p60<=0)
states: 1,384,870 (6)
abstracting: (1<=p145)
states: 5,122 (3)
abstracting: (p145<=1)
states: 1,463,790 (6)
abstracting: (0<=p97)
states: 1,463,790 (6)
abstracting: (p97<=0)
states: 1,365,685 (6)
abstracting: (1<=p3)
states: 113,036 (5)
abstracting: (p3<=1)
states: 1,463,790 (6)
.abstracting: (0<=p5)
states: 1,463,790 (6)
abstracting: (p5<=0)
states: 1,372,149 (6)
abstracting: (1<=p83)
states: 250,158 (5)
abstracting: (p83<=1)
states: 1,463,790 (6)
..............................................................................................................................................................
EG iterations: 157
abstracting: (0<=p133)
states: 1,463,790 (6)
abstracting: (p133<=0)
states: 1,458,668 (6)
abstracting: (1<=p53)
states: 236,760 (5)
abstracting: (p53<=1)
states: 1,463,790 (6)
abstracting: (0<=p175)
states: 1,463,790 (6)
abstracting: (p175<=0)
states: 629,496 (5)
abstracting: (1<=p136)
states: 3,894 (3)
abstracting: (p136<=1)
states: 1,463,790 (6)
-> the formula is FALSE
FORMULA ParamProductionCell-PT-3-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.827sec
totally nodes used: 80359981 (8.0e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 46136181 238554279 284690460
used/not used/entry size/cache size: 46487107 20621757 16 1024MB
basic ops cache: hits/miss/sum: 2292375 10296315 12588690
used/not used/entry size/cache size: 6120905 10656311 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: 22092 151688 173780
used/not used/entry size/cache size: 57304 8331304 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 54166734
1 10044868
2 2279639
3 509631
4 92503
5 13629
6 1658
7 186
8 15
9 1
>= 10 0
Total processing time: 2m 4.387sec
BK_STOP 1679040680437
--------------------
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.001sec
iterations count:9901 (49), effective:693 (3)
initing FirstDep: 0m 0.000sec
iterations count:6096 (30), effective:375 (1)
iterations count:212 (1), effective:1 (0)
iterations count:4839 (24), effective:312 (1)
iterations count:215 (1), effective:5 (0)
iterations count:4839 (24), effective:312 (1)
iterations count:3975 (19), effective:261 (1)
iterations count:4839 (24), effective:312 (1)
iterations count:5692 (28), effective:388 (1)
iterations count:200 (1), effective:0 (0)
iterations count:5417 (27), effective:372 (1)
iterations count:4752 (23), effective:331 (1)
iterations count:5490 (27), effective:375 (1)
iterations count:5341 (26), effective:371 (1)
iterations count:1594 (7), effective:94 (0)
iterations count:200 (1), effective:0 (0)
iterations count:243 (1), effective:10 (0)
iterations count:205 (1), effective:1 (0)
iterations count:767 (3), effective:43 (0)
iterations count:5644 (28), effective:359 (1)
iterations count:4827 (24), effective:309 (1)
iterations count:3543 (17), effective:256 (1)
iterations count:4099 (20), effective:271 (1)
iterations count:3746 (18), effective:244 (1)
iterations count:202 (1), effective:1 (0)
iterations count:203 (1), effective:1 (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="ParamProductionCell-PT-3"
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 ParamProductionCell-PT-3, 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 r266-smll-167863540900385"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-3.tgz
mv ParamProductionCell-PT-3 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 '
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 ;