About the Execution of Marcie+red for ParamProductionCell-PT-1
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6041.688 | 31679.00 | 44262.00 | 595.90 | FTFTFTTTFTFFFTTF | 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-167863540800370.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-1, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540800370
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 7.6K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.9K 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 20K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K 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-1-CTLFireability-00
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-01
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-02
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-03
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-04
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-05
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-06
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-07
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-08
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-09
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-10
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-11
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-12
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-13
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-14
FORMULA_NAME ParamProductionCell-PT-1-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679039700536
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-1
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 07:55:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 07:55:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 07:55:03] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2023-03-17 07:55:03] [INFO ] Transformed 231 places.
[2023-03-17 07:55:03] [INFO ] Transformed 202 transitions.
[2023-03-17 07:55:03] [INFO ] Found NUPN structural information;
[2023-03-17 07:55:03] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Support contains 118 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 65 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2023-03-17 07:55:04] [INFO ] Computed 59 place invariants in 29 ms
[2023-03-17 07:55:04] [INFO ] Implicit Places using invariants in 589 ms returned [1, 15, 16, 19, 36, 46, 47, 59, 73, 79, 114, 118, 192]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 652 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 214/231 places, 198/202 transitions.
Applied a total of 0 rules in 14 ms. Remains 214 /214 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 732 ms. Remains : 214/231 places, 198/202 transitions.
Support contains 118 out of 214 places after structural reductions.
[2023-03-17 07:55:05] [INFO ] Flatten gal took : 88 ms
[2023-03-17 07:55:05] [INFO ] Flatten gal took : 32 ms
[2023-03-17 07:55:05] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 117 out of 214 places (down from 118) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 940 ms. (steps per millisecond=10 ) properties (out of 73) seen :52
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 198 rows 214 cols
[2023-03-17 07:55:06] [INFO ] Computed 46 place invariants in 11 ms
[2023-03-17 07:55:07] [INFO ] [Real]Absence check using 27 positive place invariants in 20 ms returned sat
[2023-03-17 07:55:07] [INFO ] [Real]Absence check using 27 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-17 07:55:07] [INFO ] After 552ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-17 07:55:07] [INFO ] [Nat]Absence check using 27 positive place invariants in 19 ms returned sat
[2023-03-17 07:55:07] [INFO ] [Nat]Absence check using 27 positive and 19 generalized place invariants in 14 ms returned sat
[2023-03-17 07:55:08] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :12
[2023-03-17 07:55:08] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-17 07:55:08] [INFO ] After 349ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :8 sat :12
[2023-03-17 07:55:08] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 9 ms to minimize.
[2023-03-17 07:55:08] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2023-03-17 07:55:09] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2023-03-17 07:55:09] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 2 ms to minimize.
[2023-03-17 07:55:09] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 0 ms to minimize.
[2023-03-17 07:55:09] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2023-03-17 07:55:09] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2023-03-17 07:55:09] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 1 ms to minimize.
[2023-03-17 07:55:09] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 1 ms to minimize.
[2023-03-17 07:55:10] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
[2023-03-17 07:55:10] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2023-03-17 07:55:10] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2023-03-17 07:55:10] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2023-03-17 07:55:10] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 1 ms to minimize.
[2023-03-17 07:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 1854 ms
[2023-03-17 07:55:10] [INFO ] Deduced a trap composed of 49 places in 110 ms of which 1 ms to minimize.
[2023-03-17 07:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 135 ms
[2023-03-17 07:55:10] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2023-03-17 07:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 93 ms
[2023-03-17 07:55:10] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-17 07:55:10] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2023-03-17 07:55:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 203 ms
[2023-03-17 07:55:11] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2023-03-17 07:55:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 83 ms
[2023-03-17 07:55:11] [INFO ] After 2858ms SMT Verify possible using trap constraints in natural domain returned unsat :20 sat :0
[2023-03-17 07:55:11] [INFO ] After 3610ms SMT Verify possible using all constraints in natural domain returned unsat :20 sat :0
Fused 20 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 20 atomic propositions for a total of 16 simplifications.
[2023-03-17 07:55:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 24 ms
[2023-03-17 07:55:11] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA ParamProductionCell-PT-1-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 23 ms
[2023-03-17 07:55:11] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 69 out of 214 places (down from 86) after GAL structural reductions.
FORMULA ParamProductionCell-PT-1-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 214 transition count 191
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 207 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 206 transition count 190
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 16 place count 206 transition count 173
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 50 place count 189 transition count 173
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 187 transition count 171
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 187 transition count 171
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 88 place count 170 transition count 154
Applied a total of 88 rules in 62 ms. Remains 170 /214 variables (removed 44) and now considering 154/198 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 170/214 places, 154/198 transitions.
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 14 ms
[2023-03-17 07:55:11] [INFO ] Input system was already deterministic with 154 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 214 transition count 188
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 204 transition count 188
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 20 place count 204 transition count 172
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 52 place count 188 transition count 172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 186 transition count 170
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 186 transition count 170
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 94 place count 167 transition count 151
Applied a total of 94 rules in 36 ms. Remains 167 /214 variables (removed 47) and now considering 151/198 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 167/214 places, 151/198 transitions.
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 14 ms
[2023-03-17 07:55:11] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 212 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 212 transition count 196
Applied a total of 4 rules in 11 ms. Remains 212 /214 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 212/214 places, 196/198 transitions.
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 13 ms
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 19 ms
[2023-03-17 07:55:11] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 212 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 212 transition count 196
Applied a total of 4 rules in 10 ms. Remains 212 /214 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 212/214 places, 196/198 transitions.
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 15 ms
[2023-03-17 07:55:11] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 214 transition count 188
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 204 transition count 188
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 20 place count 204 transition count 172
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 52 place count 188 transition count 172
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 186 transition count 170
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 186 transition count 170
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 94 place count 167 transition count 151
Applied a total of 94 rules in 33 ms. Remains 167 /214 variables (removed 47) and now considering 151/198 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 167/214 places, 151/198 transitions.
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:55:11] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 212 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 212 transition count 196
Applied a total of 4 rules in 8 ms. Remains 212 /214 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 212/214 places, 196/198 transitions.
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 13 ms
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 14 ms
[2023-03-17 07:55:11] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 214 transition count 188
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 204 transition count 188
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 20 place count 204 transition count 173
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 50 place count 189 transition count 173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 187 transition count 171
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 187 transition count 171
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 84 place count 172 transition count 156
Applied a total of 84 rules in 31 ms. Remains 172 /214 variables (removed 42) and now considering 156/198 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 172/214 places, 156/198 transitions.
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:55:11] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 212 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 212 transition count 196
Applied a total of 4 rules in 8 ms. Remains 212 /214 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 212/214 places, 196/198 transitions.
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:55:11] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 212 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 212 transition count 196
Applied a total of 4 rules in 8 ms. Remains 212 /214 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 212/214 places, 196/198 transitions.
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 9 ms
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:55:11] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 212 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 212 transition count 196
Applied a total of 4 rules in 8 ms. Remains 212 /214 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 212/214 places, 196/198 transitions.
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:55:11] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:55:12] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 212 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 212 transition count 196
Applied a total of 4 rules in 9 ms. Remains 212 /214 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 212/214 places, 196/198 transitions.
[2023-03-17 07:55:12] [INFO ] Flatten gal took : 13 ms
[2023-03-17 07:55:12] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:55:12] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 212 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 212 transition count 196
Applied a total of 4 rules in 9 ms. Remains 212 /214 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 212/214 places, 196/198 transitions.
[2023-03-17 07:55:12] [INFO ] Flatten gal took : 10 ms
[2023-03-17 07:55:12] [INFO ] Flatten gal took : 11 ms
[2023-03-17 07:55:12] [INFO ] Input system was already deterministic with 196 transitions.
[2023-03-17 07:55:12] [INFO ] Flatten gal took : 12 ms
[2023-03-17 07:55:12] [INFO ] Flatten gal took : 13 ms
[2023-03-17 07:55:12] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-17 07:55:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 214 places, 198 transitions and 786 arcs took 2 ms.
Total runtime 8652 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 214 NrTr: 198 NrArc: 786)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.005sec
net check time: 0m 0.000sec
init dd package: 0m 3.459sec
RS generation: 0m 0.198sec
-> reachability set: #nodes 2908 (2.9e+03) #states 25,632 (4)
starting MCC model checker
--------------------------
checking: AG [EF [EX [EX [0<=0]]]]
normalized: ~ [E [true U ~ [E [true U EX [EX [0<=0]]]]]]
abstracting: (0<=0)
states: 25,632 (4)
..-> the formula is TRUE
FORMULA ParamProductionCell-PT-1-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.211sec
checking: AG [AF [[[p149<=1 & 1<=p149] & [p152<=1 & 1<=p152]]]]
normalized: ~ [E [true U EG [~ [[[p149<=1 & 1<=p149] & [p152<=1 & 1<=p152]]]]]]
abstracting: (1<=p152)
states: 28
abstracting: (p152<=1)
states: 25,632 (4)
abstracting: (1<=p149)
states: 25,200 (4)
abstracting: (p149<=1)
states: 25,632 (4)
..........................................................................................................................................................................
EG iterations: 170
-> the formula is TRUE
FORMULA ParamProductionCell-PT-1-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.693sec
checking: AF [AG [[[p84<=1 & 1<=p84] & [p95<=1 & 1<=p95]]]]
normalized: ~ [EG [E [true U ~ [[[p95<=1 & 1<=p95] & [p84<=1 & 1<=p84]]]]]]
abstracting: (1<=p84)
states: 154
abstracting: (p84<=1)
states: 25,632 (4)
abstracting: (1<=p95)
states: 1,760 (3)
abstracting: (p95<=1)
states: 25,632 (4)
EG iterations: 0
-> the formula is FALSE
FORMULA ParamProductionCell-PT-1-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: EG [E [[[p110<=1 & 1<=p110] & [p105<=1 & 1<=p105]] U [~ [[p85<=1 & 1<=p85]] | AG [[p160<=1 & 1<=p160]]]]]
normalized: EG [E [[[p105<=1 & 1<=p105] & [p110<=1 & 1<=p110]] U [~ [E [true U ~ [[p160<=1 & 1<=p160]]]] | ~ [[p85<=1 & 1<=p85]]]]]
abstracting: (1<=p85)
states: 154
abstracting: (p85<=1)
states: 25,632 (4)
abstracting: (1<=p160)
states: 44
abstracting: (p160<=1)
states: 25,632 (4)
abstracting: (1<=p110)
states: 154
abstracting: (p110<=1)
states: 25,632 (4)
abstracting: (1<=p105)
states: 594
abstracting: (p105<=1)
states: 25,632 (4)
...................................................................................................................................................................................
EG iterations: 179
-> the formula is FALSE
FORMULA ParamProductionCell-PT-1-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.867sec
checking: EF [AX [[EG [[[p16<=1 & 1<=p16] & [p25<=1 & 1<=p25]]] & AF [[[p194<=0 & 0<=p194] | [p199<=0 & 0<=p199]]]]]]
normalized: E [true U ~ [EX [~ [[EG [[[p25<=1 & 1<=p25] & [p16<=1 & 1<=p16]]] & ~ [EG [~ [[[p194<=0 & 0<=p194] | [p199<=0 & 0<=p199]]]]]]]]]]
abstracting: (0<=p199)
states: 25,632 (4)
abstracting: (p199<=0)
states: 25,324 (4)
abstracting: (0<=p194)
states: 25,632 (4)
abstracting: (p194<=0)
states: 22,860 (4)
....................
EG iterations: 20
abstracting: (1<=p16)
states: 352
abstracting: (p16<=1)
states: 25,632 (4)
abstracting: (1<=p25)
states: 176
abstracting: (p25<=1)
states: 25,632 (4)
...............
EG iterations: 15
.-> the formula is FALSE
FORMULA ParamProductionCell-PT-1-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.185sec
checking: [EF [EG [[EF [[[p13<=1 & 1<=p13] & [p134<=1 & 1<=p134]]] | AX [1<=0]]]] & AX [AX [[[p194<=0 & 0<=p194] | [p208<=0 & 0<=p208]]]]]
normalized: [~ [EX [EX [~ [[[p208<=0 & 0<=p208] | [p194<=0 & 0<=p194]]]]]] & E [true U EG [[~ [EX [~ [1<=0]]] | E [true U [[p134<=1 & 1<=p134] & [p13<=1 & 1<=p13]]]]]]]
abstracting: (1<=p13)
states: 10,890 (4)
abstracting: (p13<=1)
states: 25,632 (4)
abstracting: (1<=p134)
states: 44
abstracting: (p134<=1)
states: 25,632 (4)
abstracting: (1<=0)
states: 0
.
EG iterations: 0
abstracting: (0<=p194)
states: 25,632 (4)
abstracting: (p194<=0)
states: 22,860 (4)
abstracting: (0<=p208)
states: 25,632 (4)
abstracting: (p208<=0)
states: 25,016 (4)
..-> the formula is TRUE
FORMULA ParamProductionCell-PT-1-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.150sec
checking: E [[[p189<=1 & 1<=p189] & [p197<=1 & 1<=p197]] U ~ [AF [AG [[[p13<=1 & 1<=p13] & [p78<=1 & 1<=p78]]]]]]
normalized: E [[[p197<=1 & 1<=p197] & [p189<=1 & 1<=p189]] U EG [E [true U ~ [[[p78<=1 & 1<=p78] & [p13<=1 & 1<=p13]]]]]]
abstracting: (1<=p13)
states: 10,890 (4)
abstracting: (p13<=1)
states: 25,632 (4)
abstracting: (1<=p78)
states: 88
abstracting: (p78<=1)
states: 25,632 (4)
EG iterations: 0
abstracting: (1<=p189)
states: 924
abstracting: (p189<=1)
states: 25,632 (4)
abstracting: (1<=p197)
states: 308
abstracting: (p197<=1)
states: 25,632 (4)
-> the formula is TRUE
FORMULA ParamProductionCell-PT-1-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: AG [AF [[EX [[[p69<=1 & 1<=p69] & [p75<=1 & 1<=p75]]] | [[p20<=1 & 1<=p20] & [[p24<=1 & 1<=p24] & [[p149<=0 & 0<=p149] | [p173<=0 & 0<=p173]]]]]]]
normalized: ~ [E [true U EG [~ [[[[[[p173<=0 & 0<=p173] | [p149<=0 & 0<=p149]] & [p24<=1 & 1<=p24]] & [p20<=1 & 1<=p20]] | EX [[[p75<=1 & 1<=p75] & [p69<=1 & 1<=p69]]]]]]]]
abstracting: (1<=p69)
states: 168
abstracting: (p69<=1)
states: 25,632 (4)
abstracting: (1<=p75)
states: 28
abstracting: (p75<=1)
states: 25,632 (4)
.abstracting: (1<=p20)
states: 264
abstracting: (p20<=1)
states: 25,632 (4)
abstracting: (1<=p24)
states: 88
abstracting: (p24<=1)
states: 25,632 (4)
abstracting: (0<=p149)
states: 25,632 (4)
abstracting: (p149<=0)
states: 432
abstracting: (0<=p173)
states: 25,632 (4)
abstracting: (p173<=0)
states: 25,588 (4)
...............................................................................................................
EG iterations: 111
-> the formula is TRUE
FORMULA ParamProductionCell-PT-1-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.647sec
checking: [EG [AF [[[p184<=0 & 0<=p184] | [p202<=0 & 0<=p202]]]] & [A [AF [~ [[p14<=1 & 1<=p14]]] U [[p102<=1 & 1<=p102] & [[p103<=1 & 1<=p103] & [p109<=1 & 1<=p109]]]] | AX [EX [EF [[[p69<=1 & 1<=p69] & [p75<=1 & 1<=p75]]]]]]]
normalized: [[[~ [E [~ [[[p102<=1 & 1<=p102] & [[p109<=1 & 1<=p109] & [p103<=1 & 1<=p103]]]] U [EG [[p14<=1 & 1<=p14]] & ~ [[[p102<=1 & 1<=p102] & [[p109<=1 & 1<=p109] & [p103<=1 & 1<=p103]]]]]]] & ~ [EG [~ [[[p102<=1 & 1<=p102] & [[p109<=1 & 1<=p109] & [p103<=1 & 1<=p103]]]]]]] | ~ [EX [~ [EX [E [true U [[p75<=1 & 1<=p75] & [p69<=1 & 1<=p69]]]]]]]] & EG [~ [EG [~ [[[p184<=0 & 0<=p184] | [p202<=0 & 0<=p202]]]]]]]
abstracting: (0<=p202)
states: 25,632 (4)
abstracting: (p202<=0)
states: 25,016 (4)
abstracting: (0<=p184)
states: 25,632 (4)
abstracting: (p184<=0)
states: 5,544 (3)
.....................
EG iterations: 21
EG iterations: 0
abstracting: (1<=p69)
states: 168
abstracting: (p69<=1)
states: 25,632 (4)
abstracting: (1<=p75)
states: 28
abstracting: (p75<=1)
states: 25,632 (4)
..abstracting: (1<=p103)
states: 594
abstracting: (p103<=1)
states: 25,632 (4)
abstracting: (1<=p109)
states: 308
abstracting: (p109<=1)
states: 25,632 (4)
abstracting: (1<=p102)
states: 24,642 (4)
abstracting: (p102<=1)
states: 25,632 (4)
...................................................................................................................................................................................
EG iterations: 179
abstracting: (1<=p103)
states: 594
abstracting: (p103<=1)
states: 25,632 (4)
abstracting: (1<=p109)
states: 308
abstracting: (p109<=1)
states: 25,632 (4)
abstracting: (1<=p102)
states: 24,642 (4)
abstracting: (p102<=1)
states: 25,632 (4)
abstracting: (1<=p14)
states: 88
abstracting: (p14<=1)
states: 25,632 (4)
...............
EG iterations: 15
abstracting: (1<=p103)
states: 594
abstracting: (p103<=1)
states: 25,632 (4)
abstracting: (1<=p109)
states: 308
abstracting: (p109<=1)
states: 25,632 (4)
abstracting: (1<=p102)
states: 24,642 (4)
abstracting: (p102<=1)
states: 25,632 (4)
-> the formula is TRUE
FORMULA ParamProductionCell-PT-1-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.875sec
checking: EF [AG [[A [[[p150<=1 & 1<=p150] & [p154<=1 & 1<=p154]] U [AG [[[p55<=1 & 1<=p55] & [[p56<=1 & 1<=p56] & [p62<=1 & 1<=p62]]]] | AF [[p137<=1 & 1<=p137]]]] & ~ [E [[[p181<=1 & 1<=p181] & [p196<=1 & 1<=p196]] U AX [[[p105<=1 & 1<=p105] & [[p122<=1 & 1<=p122] & [p128<=1 & 1<=p128]]]]]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [E [[[p196<=1 & 1<=p196] & [p181<=1 & 1<=p181]] U ~ [EX [~ [[[[p128<=1 & 1<=p128] & [p122<=1 & 1<=p122]] & [p105<=1 & 1<=p105]]]]]]] & [~ [EG [~ [[~ [EG [~ [[p137<=1 & 1<=p137]]]] | ~ [E [true U ~ [[[[p62<=1 & 1<=p62] & [p56<=1 & 1<=p56]] & [p55<=1 & 1<=p55]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p137<=1 & 1<=p137]]]] | ~ [E [true U ~ [[[[p62<=1 & 1<=p62] & [p56<=1 & 1<=p56]] & [p55<=1 & 1<=p55]]]]]]] U [~ [[[p154<=1 & 1<=p154] & [p150<=1 & 1<=p150]]] & ~ [[~ [EG [~ [[p137<=1 & 1<=p137]]]] | ~ [E [true U ~ [[[[p62<=1 & 1<=p62] & [p56<=1 & 1<=p56]] & [p55<=1 & 1<=p55]]]]]]]]]]]]]]]]
abstracting: (1<=p55)
states: 24,400 (4)
abstracting: (p55<=1)
states: 25,632 (4)
abstracting: (1<=p56)
states: 1,848 (3)
abstracting: (p56<=1)
states: 25,632 (4)
abstracting: (1<=p62)
states: 616
abstracting: (p62<=1)
states: 25,632 (4)
abstracting: (1<=p137)
states: 28
abstracting: (p137<=1)
states: 25,632 (4)
..........................................................................................................................................................................
EG iterations: 170
abstracting: (1<=p150)
states: 28
abstracting: (p150<=1)
states: 25,632 (4)
abstracting: (1<=p154)
states: 24,392 (4)
abstracting: (p154<=1)
states: 25,632 (4)
abstracting: (1<=p55)
states: 24,400 (4)
abstracting: (p55<=1)
states: 25,632 (4)
abstracting: (1<=p56)
states: 1,848 (3)
abstracting: (p56<=1)
states: 25,632 (4)
abstracting: (1<=p62)
states: 616
abstracting: (p62<=1)
states: 25,632 (4)
abstracting: (1<=p137)
states: 28
abstracting: (p137<=1)
states: 25,632 (4)
..........................................................................................................................................................................
EG iterations: 170
abstracting: (1<=p55)
states: 24,400 (4)
abstracting: (p55<=1)
states: 25,632 (4)
abstracting: (1<=p56)
states: 1,848 (3)
abstracting: (p56<=1)
states: 25,632 (4)
abstracting: (1<=p62)
states: 616
abstracting: (p62<=1)
states: 25,632 (4)
abstracting: (1<=p137)
states: 28
abstracting: (p137<=1)
states: 25,632 (4)
..........................................................................................................................................................................
EG iterations: 170
.
EG iterations: 1
abstracting: (1<=p105)
states: 594
abstracting: (p105<=1)
states: 25,632 (4)
abstracting: (1<=p122)
states: 220
abstracting: (p122<=1)
states: 25,632 (4)
abstracting: (1<=p128)
states: 88
abstracting: (p128<=1)
states: 25,632 (4)
.abstracting: (1<=p181)
states: 21,012 (4)
abstracting: (p181<=1)
states: 25,632 (4)
abstracting: (1<=p196)
states: 616
abstracting: (p196<=1)
states: 25,632 (4)
-> the formula is FALSE
FORMULA ParamProductionCell-PT-1-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.100sec
checking: EX [[[EF [~ [E [[[p183<=1 & 1<=p183] & [[p201<=1 & 1<=p201] & [p213<=1 & 1<=p213]]] U [[p150<=1 & 1<=p150] & [p154<=1 & 1<=p154]]]]] & EG [[[[p14<=0 & 0<=p14] & [[p205<=0 & 0<=p205] | [p210<=0 & 0<=p210]]] | [p32<=0 & 0<=p32]]]] & [AG [EF [[[p10<=1 & 1<=p10] & [p31<=1 & 1<=p31]]]] & [EF [[[[p84<=1 & 1<=p84] & [p95<=1 & 1<=p95]] | AX [[[p187<=1 & 1<=p187] & [p198<=1 & 1<=p198]]]]] | [[p201<=1 & 1<=p201] & [p209<=1 & 1<=p209]]]]]]
normalized: EX [[[[[[p209<=1 & 1<=p209] & [p201<=1 & 1<=p201]] | E [true U [~ [EX [~ [[[p198<=1 & 1<=p198] & [p187<=1 & 1<=p187]]]]] | [[p95<=1 & 1<=p95] & [p84<=1 & 1<=p84]]]]] & ~ [E [true U ~ [E [true U [[p31<=1 & 1<=p31] & [p10<=1 & 1<=p10]]]]]]] & [EG [[[p32<=0 & 0<=p32] | [[[p210<=0 & 0<=p210] | [p205<=0 & 0<=p205]] & [p14<=0 & 0<=p14]]]] & E [true U ~ [E [[[[p213<=1 & 1<=p213] & [p201<=1 & 1<=p201]] & [p183<=1 & 1<=p183]] U [[p154<=1 & 1<=p154] & [p150<=1 & 1<=p150]]]]]]]]
abstracting: (1<=p150)
states: 28
abstracting: (p150<=1)
states: 25,632 (4)
abstracting: (1<=p154)
states: 24,392 (4)
abstracting: (p154<=1)
states: 25,632 (4)
abstracting: (1<=p183)
states: 2,772 (3)
abstracting: (p183<=1)
states: 25,632 (4)
abstracting: (1<=p201)
states: 3,080 (3)
abstracting: (p201<=1)
states: 25,632 (4)
abstracting: (1<=p213)
states: 1,232 (3)
abstracting: (p213<=1)
states: 25,632 (4)
abstracting: (0<=p14)
states: 25,632 (4)
abstracting: (p14<=0)
states: 25,544 (4)
abstracting: (0<=p205)
states: 25,632 (4)
abstracting: (p205<=0)
states: 23,784 (4)
abstracting: (0<=p210)
states: 25,632 (4)
abstracting: (p210<=0)
states: 25,016 (4)
abstracting: (0<=p32)
states: 25,632 (4)
abstracting: (p32<=0)
states: 23,424 (4)
.
EG iterations: 1
abstracting: (1<=p10)
states: 56
abstracting: (p10<=1)
states: 25,632 (4)
abstracting: (1<=p31)
states: 2,516 (3)
abstracting: (p31<=1)
states: 25,632 (4)
abstracting: (1<=p84)
states: 154
abstracting: (p84<=1)
states: 25,632 (4)
abstracting: (1<=p95)
states: 1,760 (3)
abstracting: (p95<=1)
states: 25,632 (4)
abstracting: (1<=p187)
states: 19,780 (4)
abstracting: (p187<=1)
states: 25,632 (4)
abstracting: (1<=p198)
states: 616
abstracting: (p198<=1)
states: 25,632 (4)
.abstracting: (1<=p201)
states: 3,080 (3)
abstracting: (p201<=1)
states: 25,632 (4)
abstracting: (1<=p209)
states: 1,232 (3)
abstracting: (p209<=1)
states: 25,632 (4)
.-> the formula is TRUE
FORMULA ParamProductionCell-PT-1-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.303sec
checking: E [[[p14<=1 & 1<=p14] | [A [[E [[[p37<=1 & 1<=p37] & [p45<=1 & 1<=p45]] U [[p69<=1 & 1<=p69] & [p75<=1 & 1<=p75]]] | [[p148<=1 & 1<=p148] & [p155<=1 & 1<=p155]]] U [[AF [[[p190<=1 & 1<=p190] & [p206<=1 & 1<=p206]]] | AG [[p72<=1 & 1<=p72]]] | [[[p84<=1 & 1<=p84] & [p87<=1 & 1<=p87]] | [[p20<=1 & 1<=p20] & [p24<=1 & 1<=p24]]]]] | E [[[AG [[[p13<=1 & 1<=p13] & [p130<=1 & 1<=p130]]] | ~ [[[p180<=1 & 1<=p180] & [p192<=1 & 1<=p192]]]] & AX [[[p105<=1 & 1<=p105] & [[p122<=1 & 1<=p122] & [p128<=1 & 1<=p128]]]]] U EG [E [[[p102<=1 & 1<=p102] & [p128<=1 & 1<=p128]] U [[p20<=1 & 1<=p20] & [[p21<=1 & 1<=p21] & [p25<=1 & 1<=p25]]]]]]]] U AX [[[A [[[p15<=1 & 1<=p15] & [p18<=1 & 1<=p18]] U [[p13<=1 & 1<=p13] & [p82<=1 & 1<=p82]]] & [p37<=1 & 1<=p37]] & [[p45<=1 & 1<=p45] & [~ [[p160<=1 & 1<=p160]] | [[[p101<=1 & 1<=p101] & [p109<=1 & 1<=p109]] & [[p151<=1 & 1<=p151] & [[p171<=1 & 1<=p171] & [p177<=1 & 1<=p177]]]]]]]]]
normalized: E [[[E [[~ [EX [~ [[[[p128<=1 & 1<=p128] & [p122<=1 & 1<=p122]] & [p105<=1 & 1<=p105]]]]] & [~ [[[p192<=1 & 1<=p192] & [p180<=1 & 1<=p180]]] | ~ [E [true U ~ [[[p130<=1 & 1<=p130] & [p13<=1 & 1<=p13]]]]]]] U EG [E [[[p128<=1 & 1<=p128] & [p102<=1 & 1<=p102]] U [[[p25<=1 & 1<=p25] & [p21<=1 & 1<=p21]] & [p20<=1 & 1<=p20]]]]] | [~ [EG [~ [[[[[p24<=1 & 1<=p24] & [p20<=1 & 1<=p20]] | [[p87<=1 & 1<=p87] & [p84<=1 & 1<=p84]]] | [~ [E [true U ~ [[p72<=1 & 1<=p72]]]] | ~ [EG [~ [[[p206<=1 & 1<=p206] & [p190<=1 & 1<=p190]]]]]]]]]] & ~ [E [~ [[[[[p24<=1 & 1<=p24] & [p20<=1 & 1<=p20]] | [[p87<=1 & 1<=p87] & [p84<=1 & 1<=p84]]] | [~ [E [true U ~ [[p72<=1 & 1<=p72]]]] | ~ [EG [~ [[[p206<=1 & 1<=p206] & [p190<=1 & 1<=p190]]]]]]]] U [~ [[[[p155<=1 & 1<=p155] & [p148<=1 & 1<=p148]] | E [[[p45<=1 & 1<=p45] & [p37<=1 & 1<=p37]] U [[p75<=1 & 1<=p75] & [p69<=1 & 1<=p69]]]]] & ~ [[[[[p24<=1 & 1<=p24] & [p20<=1 & 1<=p20]] | [[p87<=1 & 1<=p87] & [p84<=1 & 1<=p84]]] | [~ [E [true U ~ [[p72<=1 & 1<=p72]]]] | ~ [EG [~ [[[p206<=1 & 1<=p206] & [p190<=1 & 1<=p190]]]]]]]]]]]]] | [p14<=1 & 1<=p14]] U ~ [EX [~ [[[[[[[[p177<=1 & 1<=p177] & [p171<=1 & 1<=p171]] & [p151<=1 & 1<=p151]] & [[p109<=1 & 1<=p109] & [p101<=1 & 1<=p101]]] | ~ [[p160<=1 & 1<=p160]]] & [p45<=1 & 1<=p45]] & [[p37<=1 & 1<=p37] & [~ [EG [~ [[[p82<=1 & 1<=p82] & [p13<=1 & 1<=p13]]]]] & ~ [E [~ [[[p82<=1 & 1<=p82] & [p13<=1 & 1<=p13]]] U [~ [[[p18<=1 & 1<=p18] & [p15<=1 & 1<=p15]]] & ~ [[[p82<=1 & 1<=p82] & [p13<=1 & 1<=p13]]]]]]]]]]]]]
abstracting: (1<=p13)
states: 10,890 (4)
abstracting: (p13<=1)
states: 25,632 (4)
abstracting: (1<=p82)
states: 154
abstracting: (p82<=1)
states: 25,632 (4)
abstracting: (1<=p15)
states: 15,156 (4)
abstracting: (p15<=1)
states: 25,632 (4)
abstracting: (1<=p18)
states: 88
abstracting: (p18<=1)
states: 25,632 (4)
abstracting: (1<=p13)
states: 10,890 (4)
abstracting: (p13<=1)
states: 25,632 (4)
abstracting: (1<=p82)
states: 154
abstracting: (p82<=1)
states: 25,632 (4)
abstracting: (1<=p13)
states: 10,890 (4)
abstracting: (p13<=1)
states: 25,632 (4)
abstracting: (1<=p82)
states: 154
abstracting: (p82<=1)
states: 25,632 (4)
...................................................................................................................................................................................
EG iterations: 179
abstracting: (1<=p37)
states: 18,840 (4)
abstracting: (p37<=1)
states: 25,632 (4)
abstracting: (1<=p45)
states: 56
abstracting: (p45<=1)
states: 25,632 (4)
abstracting: (1<=p160)
states: 44
abstracting: (p160<=1)
states: 25,632 (4)
abstracting: (1<=p101)
states: 770
abstracting: (p101<=1)
states: 25,632 (4)
abstracting: (1<=p109)
states: 308
abstracting: (p109<=1)
states: 25,632 (4)
abstracting: (1<=p151)
states: 216
abstracting: (p151<=1)
states: 25,632 (4)
abstracting: (1<=p171)
states: 220
abstracting: (p171<=1)
states: 25,632 (4)
abstracting: (1<=p177)
states: 88
abstracting: (p177<=1)
states: 25,632 (4)
.abstracting: (1<=p14)
states: 88
abstracting: (p14<=1)
states: 25,632 (4)
abstracting: (1<=p190)
states: 22,860 (4)
abstracting: (p190<=1)
states: 25,632 (4)
abstracting: (1<=p206)
states: 616
abstracting: (p206<=1)
states: 25,632 (4)
.....................................................................................................................................................................................
EG iterations: 181
abstracting: (1<=p72)
states: 28
abstracting: (p72<=1)
states: 25,632 (4)
abstracting: (1<=p84)
states: 154
abstracting: (p84<=1)
states: 25,632 (4)
abstracting: (1<=p87)
states: 1,128 (3)
abstracting: (p87<=1)
states: 25,632 (4)
abstracting: (1<=p20)
states: 264
abstracting: (p20<=1)
states: 25,632 (4)
abstracting: (1<=p24)
states: 88
abstracting: (p24<=1)
states: 25,632 (4)
abstracting: (1<=p69)
states: 168
abstracting: (p69<=1)
states: 25,632 (4)
abstracting: (1<=p75)
states: 28
abstracting: (p75<=1)
states: 25,632 (4)
abstracting: (1<=p37)
states: 18,840 (4)
abstracting: (p37<=1)
states: 25,632 (4)
abstracting: (1<=p45)
states: 56
abstracting: (p45<=1)
states: 25,632 (4)
abstracting: (1<=p148)
states: 216
abstracting: (p148<=1)
states: 25,632 (4)
abstracting: (1<=p155)
states: 28
abstracting: (p155<=1)
states: 25,632 (4)
abstracting: (1<=p190)
states: 22,860 (4)
abstracting: (p190<=1)
states: 25,632 (4)
abstracting: (1<=p206)
states: 616
abstracting: (p206<=1)
states: 25,632 (4)
.....................................................................................................................................................................................
EG iterations: 181
abstracting: (1<=p72)
states: 28
abstracting: (p72<=1)
states: 25,632 (4)
abstracting: (1<=p84)
states: 154
abstracting: (p84<=1)
states: 25,632 (4)
abstracting: (1<=p87)
states: 1,128 (3)
abstracting: (p87<=1)
states: 25,632 (4)
abstracting: (1<=p20)
states: 264
abstracting: (p20<=1)
states: 25,632 (4)
abstracting: (1<=p24)
states: 88
abstracting: (p24<=1)
states: 25,632 (4)
abstracting: (1<=p190)
states: 22,860 (4)
abstracting: (p190<=1)
states: 25,632 (4)
abstracting: (1<=p206)
states: 616
abstracting: (p206<=1)
states: 25,632 (4)
.....................................................................................................................................................................................
EG iterations: 181
abstracting: (1<=p72)
states: 28
abstracting: (p72<=1)
states: 25,632 (4)
abstracting: (1<=p84)
states: 154
abstracting: (p84<=1)
states: 25,632 (4)
abstracting: (1<=p87)
states: 1,128 (3)
abstracting: (p87<=1)
states: 25,632 (4)
abstracting: (1<=p20)
states: 264
abstracting: (p20<=1)
states: 25,632 (4)
abstracting: (1<=p24)
states: 88
abstracting: (p24<=1)
states: 25,632 (4)
.
EG iterations: 1
abstracting: (1<=p20)
states: 264
abstracting: (p20<=1)
states: 25,632 (4)
abstracting: (1<=p21)
states: 14,232 (4)
abstracting: (p21<=1)
states: 25,632 (4)
abstracting: (1<=p25)
states: 176
abstracting: (p25<=1)
states: 25,632 (4)
abstracting: (1<=p102)
states: 24,642 (4)
abstracting: (p102<=1)
states: 25,632 (4)
abstracting: (1<=p128)
states: 88
abstracting: (p128<=1)
states: 25,632 (4)
...............
EG iterations: 15
abstracting: (1<=p13)
states: 10,890 (4)
abstracting: (p13<=1)
states: 25,632 (4)
abstracting: (1<=p130)
states: 56
abstracting: (p130<=1)
states: 25,632 (4)
abstracting: (1<=p180)
states: 7,700 (3)
abstracting: (p180<=1)
states: 25,632 (4)
abstracting: (1<=p192)
states: 308
abstracting: (p192<=1)
states: 25,632 (4)
abstracting: (1<=p105)
states: 594
abstracting: (p105<=1)
states: 25,632 (4)
abstracting: (1<=p122)
states: 220
abstracting: (p122<=1)
states: 25,632 (4)
abstracting: (1<=p128)
states: 88
abstracting: (p128<=1)
states: 25,632 (4)
.-> the formula is FALSE
FORMULA ParamProductionCell-PT-1-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.799sec
totally nodes used: 8943425 (8.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4081337 30635905 34717242
used/not used/entry size/cache size: 30022450 37086414 16 1024MB
basic ops cache: hits/miss/sum: 97153 943797 1040950
used/not used/entry size/cache size: 1927240 14849976 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: 2105 24022 26127
used/not used/entry size/cache size: 24003 8364605 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 60191410
1 5325952
2 1232629
3 293951
4 55549
5 8209
6 1040
7 112
8 11
9 1
>= 10 0
Total processing time: 0m18.991sec
BK_STOP 1679039732215
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:4378 (22), effective:294 (1)
initing FirstDep: 0m 0.000sec
iterations count:198 (1), effective:0 (0)
iterations count:245 (1), effective:1 (0)
iterations count:201 (1), effective:1 (0)
iterations count:198 (1), effective:0 (0)
iterations count:2399 (12), effective:161 (0)
iterations count:198 (1), effective:0 (0)
iterations count:279 (1), effective:1 (0)
iterations count:198 (1), effective:0 (0)
iterations count:2451 (12), effective:161 (0)
iterations count:204 (1), effective:1 (0)
iterations count:204 (1), effective:1 (0)
iterations count:204 (1), effective:1 (0)
iterations count:198 (1), effective:0 (0)
iterations count:2491 (12), effective:173 (0)
iterations count:198 (1), effective:0 (0)
iterations count:201 (1), effective:1 (0)
iterations count:2445 (12), effective:161 (0)
iterations count:2619 (13), effective:178 (0)
iterations count:205 (1), effective:1 (0)
iterations count:200 (1), effective:1 (0)
iterations count:198 (1), effective:0 (0)
iterations count:200 (1), effective:1 (0)
iterations count:200 (1), effective:1 (0)
iterations count:198 (1), effective:0 (0)
iterations count:274 (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-1"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ParamProductionCell-PT-1, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-smll-167863540800370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-1.tgz
mv ParamProductionCell-PT-1 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;