About the Execution of Marcie+red for CANConstruction-PT-005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5617.936 | 17489.00 | 24935.00 | 63.20 | TFTFTTTFTTFTTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696000610.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CANConstruction-PT-005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000610
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 11K Feb 25 21:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 21:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 21:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 21:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 25 21:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 25 21:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 21:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 21:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 167K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-005-CTLFireability-00
FORMULA_NAME CANConstruction-PT-005-CTLFireability-01
FORMULA_NAME CANConstruction-PT-005-CTLFireability-02
FORMULA_NAME CANConstruction-PT-005-CTLFireability-03
FORMULA_NAME CANConstruction-PT-005-CTLFireability-04
FORMULA_NAME CANConstruction-PT-005-CTLFireability-05
FORMULA_NAME CANConstruction-PT-005-CTLFireability-06
FORMULA_NAME CANConstruction-PT-005-CTLFireability-07
FORMULA_NAME CANConstruction-PT-005-CTLFireability-08
FORMULA_NAME CANConstruction-PT-005-CTLFireability-09
FORMULA_NAME CANConstruction-PT-005-CTLFireability-10
FORMULA_NAME CANConstruction-PT-005-CTLFireability-11
FORMULA_NAME CANConstruction-PT-005-CTLFireability-12
FORMULA_NAME CANConstruction-PT-005-CTLFireability-13
FORMULA_NAME CANConstruction-PT-005-CTLFireability-14
FORMULA_NAME CANConstruction-PT-005-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678735939163
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=CANConstruction-PT-005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:32:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:32:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:32:20] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-13 19:32:20] [INFO ] Transformed 112 places.
[2023-03-13 19:32:20] [INFO ] Transformed 140 transitions.
[2023-03-13 19:32:20] [INFO ] Parsed PT model containing 112 places and 140 transitions and 400 arcs in 92 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 77 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 140/140 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 138
Applied a total of 2 rules in 14 ms. Remains 111 /112 variables (removed 1) and now considering 138/140 (removed 2) transitions.
// Phase 1: matrix 138 rows 111 cols
[2023-03-13 19:32:20] [INFO ] Computed 11 place invariants in 12 ms
[2023-03-13 19:32:21] [INFO ] Implicit Places using invariants in 163 ms returned [12, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 186 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 138/140 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 108 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 137
Applied a total of 2 rules in 4 ms. Remains 108 /109 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 108 cols
[2023-03-13 19:32:21] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-13 19:32:21] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-13 19:32:21] [INFO ] Invariant cache hit.
[2023-03-13 19:32:21] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-13 19:32:21] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 108/112 places, 137/140 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 329 ms. Remains : 108/112 places, 137/140 transitions.
Support contains 77 out of 108 places after structural reductions.
[2023-03-13 19:32:21] [INFO ] Flatten gal took : 22 ms
[2023-03-13 19:32:21] [INFO ] Flatten gal took : 10 ms
[2023-03-13 19:32:21] [INFO ] Input system was already deterministic with 137 transitions.
Support contains 76 out of 108 places (down from 77) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 72) seen :66
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-13 19:32:22] [INFO ] Invariant cache hit.
[2023-03-13 19:32:22] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2023-03-13 19:32:22] [INFO ] [Real]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-13 19:32:22] [INFO ] After 53ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-13 19:32:22] [INFO ] State equation strengthened by 45 read => feed constraints.
[2023-03-13 19:32:22] [INFO ] After 18ms SMT Verify possible using 45 Read/Feed constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-13 19:32:22] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-13 19:32:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-13 19:32:22] [INFO ] [Nat]Absence check using 6 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-13 19:32:22] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-13 19:32:22] [INFO ] After 27ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-13 19:32:22] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-13 19:32:22] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 137/137 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 108 transition count 111
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 82 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 81 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 54 place count 81 transition count 107
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 60 place count 78 transition count 107
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 73 place count 65 transition count 81
Iterating global reduction 3 with 13 rules applied. Total rules applied 86 place count 65 transition count 81
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 87 place count 65 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 88 place count 64 transition count 80
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 96 place count 60 transition count 76
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 106 place count 55 transition count 85
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 109 place count 55 transition count 82
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 112 place count 52 transition count 82
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 113 place count 52 transition count 82
Applied a total of 113 rules in 44 ms. Remains 52 /108 variables (removed 56) and now considering 82/137 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 52/108 places, 82/137 transitions.
Incomplete random walk after 10000 steps, including 341 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Probably explored full state space saw : 4507 states, properties seen :0
Probabilistic random walk after 25244 steps, saw 4507 distinct states, run finished after 109 ms. (steps per millisecond=231 ) properties seen :0
Explored full state space saw : 4507 states, properties seen :0
Exhaustive walk after 25244 steps, saw 4507 distinct states, run finished after 75 ms. (steps per millisecond=336 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANConstruction-PT-005-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 19:32:22] [INFO ] Flatten gal took : 8 ms
[2023-03-13 19:32:22] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:32:22] [INFO ] Input system was already deterministic with 137 transitions.
Computed a total of 20 stabilizing places and 24 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 137/137 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 95 transition count 112
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 95 transition count 112
Applied a total of 26 rules in 6 ms. Remains 95 /108 variables (removed 13) and now considering 112/137 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 95/108 places, 112/137 transitions.
[2023-03-13 19:32:22] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:32:22] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:32:23] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 137/137 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 108 transition count 105
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 76 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 75 transition count 104
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 66 place count 75 transition count 102
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 73 transition count 102
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 84 place count 59 transition count 74
Iterating global reduction 3 with 14 rules applied. Total rules applied 98 place count 59 transition count 74
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 101 place count 59 transition count 71
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 104 place count 56 transition count 71
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 110 place count 53 transition count 68
Applied a total of 110 rules in 14 ms. Remains 53 /108 variables (removed 55) and now considering 68/137 (removed 69) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 53/108 places, 68/137 transitions.
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 137/137 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 98 transition count 118
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 98 transition count 118
Applied a total of 20 rules in 5 ms. Remains 98 /108 variables (removed 10) and now considering 118/137 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 98/108 places, 118/137 transitions.
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:32:23] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 137/137 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 98 transition count 118
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 98 transition count 118
Applied a total of 20 rules in 4 ms. Remains 98 /108 variables (removed 10) and now considering 118/137 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 98/108 places, 118/137 transitions.
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:32:23] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 137/137 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 108 transition count 106
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 77 transition count 106
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 62 place count 77 transition count 103
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 74 transition count 103
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 82 place count 60 transition count 75
Iterating global reduction 2 with 14 rules applied. Total rules applied 96 place count 60 transition count 75
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 99 place count 60 transition count 72
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 102 place count 57 transition count 72
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 108 place count 54 transition count 69
Applied a total of 108 rules in 11 ms. Remains 54 /108 variables (removed 54) and now considering 69/137 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 54/108 places, 69/137 transitions.
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:32:23] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 137/137 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 94 transition count 110
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 94 transition count 110
Applied a total of 28 rules in 3 ms. Remains 94 /108 variables (removed 14) and now considering 110/137 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 94/108 places, 110/137 transitions.
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:32:23] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 137/137 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 108 transition count 114
Reduce places removed 23 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 28 rules applied. Total rules applied 51 place count 85 transition count 109
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 56 place count 80 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 56 place count 80 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 62 place count 77 transition count 106
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 75 place count 64 transition count 80
Iterating global reduction 3 with 13 rules applied. Total rules applied 88 place count 64 transition count 80
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 89 place count 64 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 63 transition count 79
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 98 place count 59 transition count 75
Applied a total of 98 rules in 12 ms. Remains 59 /108 variables (removed 49) and now considering 75/137 (removed 62) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 59/108 places, 75/137 transitions.
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 2 ms
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 137/137 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 108 transition count 106
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 77 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 76 transition count 105
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 64 place count 76 transition count 103
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 74 transition count 103
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 80 place count 62 transition count 79
Iterating global reduction 3 with 12 rules applied. Total rules applied 92 place count 62 transition count 79
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 93 place count 62 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 94 place count 61 transition count 78
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 106 place count 55 transition count 72
Applied a total of 106 rules in 10 ms. Remains 55 /108 variables (removed 53) and now considering 72/137 (removed 65) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 55/108 places, 72/137 transitions.
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 137/137 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 108 transition count 113
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 84 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 83 transition count 112
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 50 place count 83 transition count 108
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 58 place count 79 transition count 108
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 71 place count 66 transition count 82
Iterating global reduction 3 with 13 rules applied. Total rules applied 84 place count 66 transition count 82
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 66 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 65 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 90 place count 63 transition count 79
Applied a total of 90 rules in 9 ms. Remains 63 /108 variables (removed 45) and now considering 79/137 (removed 58) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 63/108 places, 79/137 transitions.
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 137/137 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 97 transition count 116
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 97 transition count 116
Applied a total of 22 rules in 2 ms. Remains 97 /108 variables (removed 11) and now considering 116/137 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 97/108 places, 116/137 transitions.
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:32:23] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 137/137 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 95 transition count 112
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 95 transition count 112
Applied a total of 26 rules in 2 ms. Remains 95 /108 variables (removed 13) and now considering 112/137 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 95/108 places, 112/137 transitions.
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:32:23] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 137/137 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 97 transition count 116
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 97 transition count 116
Applied a total of 22 rules in 2 ms. Remains 97 /108 variables (removed 11) and now considering 116/137 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 97/108 places, 116/137 transitions.
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:32:23] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 137/137 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 93 transition count 108
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 93 transition count 108
Applied a total of 30 rules in 2 ms. Remains 93 /108 variables (removed 15) and now considering 108/137 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 93/108 places, 108/137 transitions.
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 137/137 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 94 transition count 110
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 94 transition count 110
Applied a total of 28 rules in 2 ms. Remains 94 /108 variables (removed 14) and now considering 110/137 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 94/108 places, 110/137 transitions.
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:32:23] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 137/137 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 94 transition count 110
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 94 transition count 110
Applied a total of 28 rules in 1 ms. Remains 94 /108 variables (removed 14) and now considering 110/137 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 94/108 places, 110/137 transitions.
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 3 ms
[2023-03-13 19:32:23] [INFO ] Input system was already deterministic with 110 transitions.
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 4 ms
[2023-03-13 19:32:23] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:32:23] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-13 19:32:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 137 transitions and 387 arcs took 1 ms.
Total runtime 2629 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: 108 NrTr: 137 NrArc: 387)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
net check time: 0m 0.000sec
init dd package: 0m 3.367sec
RS generation: 0m 0.400sec
-> reachability set: #nodes 7551 (7.6e+03) #states 97,327 (4)
starting MCC model checker
--------------------------
checking: AF [AG [EF [1<=p47]]]
normalized: ~ [EG [E [true U ~ [E [true U 1<=p47]]]]]
abstracting: (1<=p47)
states: 6,399 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA CANConstruction-PT-005-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.441sec
checking: AG [EX [p36<=0]]
normalized: ~ [E [true U ~ [EX [p36<=0]]]]
abstracting: (p36<=0)
states: 90,942 (4)
.-> the formula is FALSE
FORMULA CANConstruction-PT-005-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.359sec
checking: EG [[p78<=0 | EF [AX [1<=p100]]]]
normalized: EG [[p78<=0 | E [true U ~ [EX [~ [1<=p100]]]]]]
abstracting: (1<=p100)
states: 1,884 (3)
.abstracting: (p78<=0)
states: 95,443 (4)
EG iterations: 0
-> the formula is TRUE
FORMULA CANConstruction-PT-005-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.113sec
checking: E [[1<=p23 & 1<=p46] U EF [EG [1<=p22]]]
normalized: E [[1<=p23 & 1<=p46] U E [true U EG [1<=p22]]]
abstracting: (1<=p22)
states: 6,385 (3)
.....
EG iterations: 5
abstracting: (1<=p46)
states: 24,848 (4)
abstracting: (1<=p23)
states: 6,385 (3)
-> the formula is TRUE
FORMULA CANConstruction-PT-005-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.513sec
checking: ~ [E [1<=p9 U AF [[1<=p84 & 1<=p90]]]]
normalized: ~ [E [1<=p9 U ~ [EG [~ [[1<=p84 & 1<=p90]]]]]]
abstracting: (1<=p90)
states: 1,884 (3)
abstracting: (1<=p84)
states: 1,884 (3)
.
EG iterations: 1
abstracting: (1<=p9)
states: 6,399 (3)
-> the formula is TRUE
FORMULA CANConstruction-PT-005-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.052sec
checking: EG [[~ [A [[~ [[1<=p0 & 1<=p56]] | EG [1<=p100]] U ~ [E [1<=p41 U 1<=p30]]]] | EG [AX [p100<=0]]]]
normalized: EG [[EG [~ [EX [~ [p100<=0]]]] | ~ [[~ [EG [E [1<=p41 U 1<=p30]]] & ~ [E [E [1<=p41 U 1<=p30] U [~ [[EG [1<=p100] | ~ [[1<=p0 & 1<=p56]]]] & E [1<=p41 U 1<=p30]]]]]]]]
abstracting: (1<=p30)
states: 1
abstracting: (1<=p41)
states: 6,385 (3)
abstracting: (1<=p56)
states: 6,412 (3)
abstracting: (1<=p0)
states: 97,311 (4)
abstracting: (1<=p100)
states: 1,884 (3)
.....
EG iterations: 5
abstracting: (1<=p30)
states: 1
abstracting: (1<=p41)
states: 6,385 (3)
abstracting: (1<=p30)
states: 1
abstracting: (1<=p41)
states: 6,385 (3)
..
EG iterations: 2
abstracting: (p100<=0)
states: 95,443 (4)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA CANConstruction-PT-005-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.040sec
checking: AF [[1<=p20 | [[1<=p24 & 1<=p25] & [p100<=0 & [[1<=p44 | 1<=p29] & [p38<=0 | p39<=0]]]]]]
normalized: ~ [EG [~ [[1<=p20 | [[p100<=0 & [[p38<=0 | p39<=0] & [1<=p44 | 1<=p29]]] & [1<=p24 & 1<=p25]]]]]]
abstracting: (1<=p25)
states: 6,385 (3)
abstracting: (1<=p24)
states: 34,169 (4)
abstracting: (1<=p29)
states: 1
abstracting: (1<=p44)
states: 1
abstracting: (p39<=0)
states: 90,942 (4)
abstracting: (p38<=0)
states: 63,158 (4)
abstracting: (p100<=0)
states: 95,443 (4)
abstracting: (1<=p20)
states: 6,385 (3)
.......
EG iterations: 7
-> the formula is FALSE
FORMULA CANConstruction-PT-005-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.291sec
checking: EG [E [~ [EG [A [1<=p49 U [1<=p32 & 1<=p51]]]] U [~ [[p44<=0 | 1<=p72]] | AG [[EF [[1<=p37 & 1<=p46]] & AX [1<=p19]]]]]]
normalized: EG [E [~ [EG [[~ [EG [~ [[1<=p32 & 1<=p51]]]] & ~ [E [~ [[1<=p32 & 1<=p51]] U [~ [1<=p49] & ~ [[1<=p32 & 1<=p51]]]]]]]] U [~ [E [true U ~ [[~ [EX [~ [1<=p19]]] & E [true U [1<=p37 & 1<=p46]]]]]] | ~ [[p44<=0 | 1<=p72]]]]]
abstracting: (1<=p72)
states: 1,870 (3)
abstracting: (p44<=0)
states: 97,326 (4)
abstracting: (1<=p46)
states: 24,848 (4)
abstracting: (1<=p37)
states: 6,385 (3)
abstracting: (1<=p19)
states: 6,385 (3)
.abstracting: (1<=p51)
states: 6,399 (3)
abstracting: (1<=p32)
states: 24,832 (4)
abstracting: (1<=p49)
states: 6,399 (3)
abstracting: (1<=p51)
states: 6,399 (3)
abstracting: (1<=p32)
states: 24,832 (4)
abstracting: (1<=p51)
states: 6,399 (3)
abstracting: (1<=p32)
states: 24,832 (4)
..........
EG iterations: 10
.....
EG iterations: 5
....
EG iterations: 4
-> the formula is FALSE
FORMULA CANConstruction-PT-005-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.469sec
checking: EF [[AX [E [EX [[1<=p0 & 1<=p56]] U EG [1<=p102]]] & AF [[[EG [1<=p22] | AX [[p11<=0 | p32<=0]]] | [p18<=0 | p87<=0]]]]]
normalized: E [true U [~ [EG [~ [[[p18<=0 | p87<=0] | [~ [EX [~ [[p11<=0 | p32<=0]]]] | EG [1<=p22]]]]]] & ~ [EX [~ [E [EX [[1<=p0 & 1<=p56]] U EG [1<=p102]]]]]]]
abstracting: (1<=p102)
states: 1,884 (3)
.....
EG iterations: 5
abstracting: (1<=p56)
states: 6,412 (3)
abstracting: (1<=p0)
states: 97,311 (4)
..abstracting: (1<=p22)
states: 6,385 (3)
.....
EG iterations: 5
abstracting: (p32<=0)
states: 72,495 (4)
abstracting: (p11<=0)
states: 90,928 (4)
.abstracting: (p87<=0)
states: 95,444 (4)
abstracting: (p18<=0)
states: 72,495 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA CANConstruction-PT-005-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.137sec
checking: A [~ [[[1<=p70 | [EG [1<=p63] & ~ [[[1<=p0 & 1<=p28] | [1<=p11 & 1<=p18]]]]] & AF [EX [EX [1<=p106]]]]] U EF [AX [[1<=p1 & 1<=p14]]]]
normalized: [~ [EG [~ [E [true U ~ [EX [~ [[1<=p1 & 1<=p14]]]]]]]] & ~ [E [~ [E [true U ~ [EX [~ [[1<=p1 & 1<=p14]]]]]] U [[~ [EG [~ [EX [EX [1<=p106]]]]] & [1<=p70 | [~ [[[1<=p11 & 1<=p18] | [1<=p0 & 1<=p28]]] & EG [1<=p63]]]] & ~ [E [true U ~ [EX [~ [[1<=p1 & 1<=p14]]]]]]]]]]
abstracting: (1<=p14)
states: 6,398 (3)
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p63)
states: 6,399 (3)
.....
EG iterations: 5
abstracting: (1<=p28)
states: 6,398 (3)
abstracting: (1<=p0)
states: 97,311 (4)
abstracting: (1<=p18)
states: 24,832 (4)
abstracting: (1<=p11)
states: 6,399 (3)
abstracting: (1<=p70)
states: 1,870 (3)
abstracting: (1<=p106)
states: 1,870 (3)
............
EG iterations: 10
abstracting: (1<=p14)
states: 6,398 (3)
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p14)
states: 6,398 (3)
abstracting: (1<=p1)
states: 1
..
EG iterations: 1
-> the formula is TRUE
FORMULA CANConstruction-PT-005-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.248sec
checking: E [E [1<=p68 U [~ [AF [[[1<=p46 & 1<=p65] | 1<=p100]]] | [[1<=p46 & 1<=p89] & [1<=p11 & 1<=p18]]]] U A [[1<=p6 & 1<=p23] U [EG [~ [[1<=p52 & 1<=p53]]] & ~ [A [~ [[1<=p18 & 1<=p103]] U 1<=p63]]]]]
normalized: E [E [1<=p68 U [[[1<=p11 & 1<=p18] & [1<=p46 & 1<=p89]] | EG [~ [[1<=p100 | [1<=p46 & 1<=p65]]]]]] U [~ [EG [~ [[~ [[~ [EG [~ [1<=p63]]] & ~ [E [~ [1<=p63] U [[1<=p18 & 1<=p103] & ~ [1<=p63]]]]]] & EG [~ [[1<=p52 & 1<=p53]]]]]]] & ~ [E [~ [[~ [[~ [EG [~ [1<=p63]]] & ~ [E [~ [1<=p63] U [[1<=p18 & 1<=p103] & ~ [1<=p63]]]]]] & EG [~ [[1<=p52 & 1<=p53]]]]] U [~ [[1<=p6 & 1<=p23]] & ~ [[~ [[~ [EG [~ [1<=p63]]] & ~ [E [~ [1<=p63] U [[1<=p18 & 1<=p103] & ~ [1<=p63]]]]]] & EG [~ [[1<=p52 & 1<=p53]]]]]]]]]]
abstracting: (1<=p53)
states: 6,399 (3)
abstracting: (1<=p52)
states: 34,069 (4)
.
EG iterations: 1
abstracting: (1<=p63)
states: 6,399 (3)
abstracting: (1<=p103)
states: 1,884 (3)
abstracting: (1<=p18)
states: 24,832 (4)
abstracting: (1<=p63)
states: 6,399 (3)
abstracting: (1<=p63)
states: 6,399 (3)
........
EG iterations: 8
abstracting: (1<=p23)
states: 6,385 (3)
abstracting: (1<=p6)
states: 24,648 (4)
abstracting: (1<=p53)
states: 6,399 (3)
abstracting: (1<=p52)
states: 34,069 (4)
.
EG iterations: 1
abstracting: (1<=p63)
states: 6,399 (3)
abstracting: (1<=p103)
states: 1,884 (3)
abstracting: (1<=p18)
states: 24,832 (4)
abstracting: (1<=p63)
states: 6,399 (3)
abstracting: (1<=p63)
states: 6,399 (3)
........
EG iterations: 8
abstracting: (1<=p53)
states: 6,399 (3)
abstracting: (1<=p52)
states: 34,069 (4)
.
EG iterations: 1
abstracting: (1<=p63)
states: 6,399 (3)
abstracting: (1<=p103)
states: 1,884 (3)
abstracting: (1<=p18)
states: 24,832 (4)
abstracting: (1<=p63)
states: 6,399 (3)
abstracting: (1<=p63)
states: 6,399 (3)
........
EG iterations: 8
.........
EG iterations: 9
abstracting: (1<=p65)
states: 6,399 (3)
abstracting: (1<=p46)
states: 24,848 (4)
abstracting: (1<=p100)
states: 1,884 (3)
..........
EG iterations: 10
abstracting: (1<=p89)
states: 1,884 (3)
abstracting: (1<=p46)
states: 24,848 (4)
abstracting: (1<=p18)
states: 24,832 (4)
abstracting: (1<=p11)
states: 6,399 (3)
abstracting: (1<=p68)
states: 6,399 (3)
-> the formula is TRUE
FORMULA CANConstruction-PT-005-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.722sec
checking: EX [[AF [p106<=0] & [EG [~ [E [1<=p48 U [1<=p6 & 1<=p23]]]] & [A [1<=p15 U [1<=p1 & 1<=p28]] | [EF [[[EF [[1<=p0 & 1<=p42]] | [1<=p68 | [1<=p32 & 1<=p79]]] & [[1<=p92 & 1<=p96] | [1<=p36 | [1<=p6 & 1<=p101]]]]] | [p82<=0 & EG [[p6<=0 | p23<=0]]]]]]]]
normalized: EX [[[[[[p82<=0 & EG [[p6<=0 | p23<=0]]] | E [true U [[[1<=p36 | [1<=p6 & 1<=p101]] | [1<=p92 & 1<=p96]] & [[1<=p68 | [1<=p32 & 1<=p79]] | E [true U [1<=p0 & 1<=p42]]]]]] | [~ [EG [~ [[1<=p1 & 1<=p28]]]] & ~ [E [~ [[1<=p1 & 1<=p28]] U [~ [1<=p15] & ~ [[1<=p1 & 1<=p28]]]]]]] & EG [~ [E [1<=p48 U [1<=p6 & 1<=p23]]]]] & ~ [EG [~ [p106<=0]]]]]
abstracting: (p106<=0)
states: 95,457 (4)
.....
EG iterations: 5
abstracting: (1<=p23)
states: 6,385 (3)
abstracting: (1<=p6)
states: 24,648 (4)
abstracting: (1<=p48)
states: 6,399 (3)
................
EG iterations: 16
abstracting: (1<=p28)
states: 6,398 (3)
abstracting: (1<=p1)
states: 1
abstracting: (1<=p15)
states: 1
abstracting: (1<=p28)
states: 6,398 (3)
abstracting: (1<=p1)
states: 1
abstracting: (1<=p28)
states: 6,398 (3)
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p42)
states: 6,412 (3)
abstracting: (1<=p0)
states: 97,311 (4)
abstracting: (1<=p79)
states: 1,883 (3)
abstracting: (1<=p32)
states: 24,832 (4)
abstracting: (1<=p68)
states: 6,399 (3)
abstracting: (1<=p96)
states: 1,884 (3)
abstracting: (1<=p92)
states: 1,884 (3)
abstracting: (1<=p101)
states: 1,884 (3)
abstracting: (1<=p6)
states: 24,648 (4)
abstracting: (1<=p36)
states: 6,385 (3)
abstracting: (p23<=0)
states: 90,942 (4)
abstracting: (p6<=0)
states: 72,679 (4)
..........
EG iterations: 10
abstracting: (p82<=0)
states: 95,443 (4)
.-> the formula is TRUE
FORMULA CANConstruction-PT-005-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.958sec
checking: AX [[[EG [[[1<=p11 & 1<=p46] & [1<=p37 & 1<=p46]]] | EF [EG [p98<=0]]] & [EG [[EG [p58<=0] & [[p6<=0 | p37<=0] & [p18<=0 | p103<=0]]]] | [[[AG [p21<=0] | [AG [[p1<=0 | p56<=0]] | p32<=0]] | [p51<=0 | [p86<=0 | [p48<=0 & p104<=0]]]] & [1<=p82 | [p80<=0 | [1<=p1 & 1<=p2]]]]]]]
normalized: ~ [EX [~ [[[[[1<=p82 | [p80<=0 | [1<=p1 & 1<=p2]]] & [[p51<=0 | [p86<=0 | [p48<=0 & p104<=0]]] | [[p32<=0 | ~ [E [true U ~ [[p1<=0 | p56<=0]]]]] | ~ [E [true U ~ [p21<=0]]]]]] | EG [[[[p18<=0 | p103<=0] & [p6<=0 | p37<=0]] & EG [p58<=0]]]] & [E [true U EG [p98<=0]] | EG [[[1<=p37 & 1<=p46] & [1<=p11 & 1<=p46]]]]]]]]
abstracting: (1<=p46)
states: 24,848 (4)
abstracting: (1<=p11)
states: 6,399 (3)
abstracting: (1<=p46)
states: 24,848 (4)
abstracting: (1<=p37)
states: 6,385 (3)
....
EG iterations: 4
abstracting: (p98<=0)
states: 95,443 (4)
.....
EG iterations: 5
abstracting: (p58<=0)
states: 97,326 (4)
..
EG iterations: 2
abstracting: (p37<=0)
states: 90,942 (4)
abstracting: (p6<=0)
states: 72,679 (4)
abstracting: (p103<=0)
states: 95,443 (4)
abstracting: (p18<=0)
states: 72,495 (4)
..........
EG iterations: 10
abstracting: (p21<=0)
states: 90,942 (4)
abstracting: (p56<=0)
states: 90,915 (4)
abstracting: (p1<=0)
states: 97,326 (4)
abstracting: (p32<=0)
states: 72,495 (4)
abstracting: (p104<=0)
states: 95,457 (4)
abstracting: (p48<=0)
states: 90,928 (4)
abstracting: (p86<=0)
states: 95,443 (4)
abstracting: (p51<=0)
states: 90,928 (4)
abstracting: (1<=p2)
states: 6,412 (3)
abstracting: (1<=p1)
states: 1
abstracting: (p80<=0)
states: 95,444 (4)
abstracting: (1<=p82)
states: 1,884 (3)
.-> the formula is TRUE
FORMULA CANConstruction-PT-005-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.457sec
checking: E [[[~ [[EX [[p35<=0 | [1<=p38 & [1<=p40 & 1<=p86]]]] & ~ [AF [1<=p34]]]] | AG [[1<=p70 | p102<=0]]] | [AX [EF [[1<=p1 & 1<=p28]]] | [AF [[[EG [[1<=p24 & 1<=p25]] & 1<=p64] & [1<=p32 & [1<=p97 & ~ [[1<=p11 & 1<=p18]]]]]] | [AG [[1<=p32 & 1<=p105]] & [1<=p49 | [[1<=p46 & 1<=p81] | [1<=p15 & 1<=p70]]]]]]] U 1<=p92]
normalized: E [[[~ [E [true U ~ [[1<=p70 | p102<=0]]]] | ~ [[EX [[p35<=0 | [1<=p38 & [1<=p40 & 1<=p86]]]] & EG [~ [1<=p34]]]]] | [[[[1<=p49 | [[1<=p15 & 1<=p70] | [1<=p46 & 1<=p81]]] & ~ [E [true U ~ [[1<=p32 & 1<=p105]]]]] | ~ [EG [~ [[[1<=p32 & [1<=p97 & ~ [[1<=p11 & 1<=p18]]]] & [1<=p64 & EG [[1<=p24 & 1<=p25]]]]]]]] | ~ [EX [~ [E [true U [1<=p1 & 1<=p28]]]]]]] U 1<=p92]
abstracting: (1<=p92)
states: 1,884 (3)
abstracting: (1<=p28)
states: 6,398 (3)
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p25)
states: 6,385 (3)
abstracting: (1<=p24)
states: 34,169 (4)
.....
EG iterations: 5
abstracting: (1<=p64)
states: 6,399 (3)
abstracting: (1<=p18)
states: 24,832 (4)
abstracting: (1<=p11)
states: 6,399 (3)
abstracting: (1<=p97)
states: 1,884 (3)
abstracting: (1<=p32)
states: 24,832 (4)
.
EG iterations: 1
abstracting: (1<=p105)
states: 1,884 (3)
abstracting: (1<=p32)
states: 24,832 (4)
abstracting: (1<=p81)
states: 1,884 (3)
abstracting: (1<=p46)
states: 24,848 (4)
abstracting: (1<=p70)
states: 1,870 (3)
abstracting: (1<=p15)
states: 1
abstracting: (1<=p49)
states: 6,399 (3)
abstracting: (1<=p34)
states: 6,385 (3)
.......
EG iterations: 7
abstracting: (1<=p86)
states: 1,884 (3)
abstracting: (1<=p40)
states: 6,385 (3)
abstracting: (1<=p38)
states: 34,169 (4)
abstracting: (p35<=0)
states: 90,942 (4)
.abstracting: (p102<=0)
states: 95,443 (4)
abstracting: (1<=p70)
states: 1,870 (3)
-> the formula is FALSE
FORMULA CANConstruction-PT-005-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.544sec
checking: [AF [AX [[[E [1<=p9 U [1<=p46 & 1<=p65]] & [AG [[1<=p18 & 1<=p95]] | [p4<=0 & p88<=0]]] & [[1<=p4 | [1<=p1 & 1<=p56]] & [p100<=0 | [1<=p37 & [1<=p60 & 1<=p102]]]]]]] & [EX [[1<=p102 | [p23<=0 | p46<=0]]] | [A [EF [[E [1<=p64 U 1<=p57] & EX [1<=p21]]] U [AX [1<=0] | [1<=p18 & 1<=p69]]] | [EG [[EG [p68<=0] & AF [AG [1<=p84]]]] & AX [EF [AG [p96<=0]]]]]]]
normalized: [[[[~ [EX [~ [E [true U ~ [E [true U ~ [p96<=0]]]]]]] & EG [[~ [EG [E [true U ~ [1<=p84]]]] & EG [p68<=0]]]] | [~ [EG [~ [[[1<=p18 & 1<=p69] | ~ [EX [~ [1<=0]]]]]]] & ~ [E [~ [[[1<=p18 & 1<=p69] | ~ [EX [~ [1<=0]]]]] U [~ [E [true U [EX [1<=p21] & E [1<=p64 U 1<=p57]]]] & ~ [[[1<=p18 & 1<=p69] | ~ [EX [~ [1<=0]]]]]]]]]] | EX [[1<=p102 | [p23<=0 | p46<=0]]]] & ~ [EG [EX [~ [[[[p100<=0 | [1<=p37 & [1<=p60 & 1<=p102]]] & [1<=p4 | [1<=p1 & 1<=p56]]] & [[[p4<=0 & p88<=0] | ~ [E [true U ~ [[1<=p18 & 1<=p95]]]]] & E [1<=p9 U [1<=p46 & 1<=p65]]]]]]]]]
abstracting: (1<=p65)
states: 6,399 (3)
abstracting: (1<=p46)
states: 24,848 (4)
abstracting: (1<=p9)
states: 6,399 (3)
abstracting: (1<=p95)
states: 1,884 (3)
abstracting: (1<=p18)
states: 24,832 (4)
abstracting: (p88<=0)
states: 95,444 (4)
abstracting: (p4<=0)
states: 97,326 (4)
abstracting: (1<=p56)
states: 6,412 (3)
abstracting: (1<=p1)
states: 1
abstracting: (1<=p4)
states: 1
abstracting: (1<=p102)
states: 1,884 (3)
abstracting: (1<=p60)
states: 24,648 (4)
abstracting: (1<=p37)
states: 6,385 (3)
abstracting: (p100<=0)
states: 95,443 (4)
......
EG iterations: 5
abstracting: (p46<=0)
states: 72,479 (4)
abstracting: (p23<=0)
states: 90,942 (4)
abstracting: (1<=p102)
states: 1,884 (3)
.abstracting: (1<=0)
states: 0
.abstracting: (1<=p69)
states: 1,884 (3)
abstracting: (1<=p18)
states: 24,832 (4)
abstracting: (1<=p57)
states: 1
abstracting: (1<=p64)
states: 6,399 (3)
abstracting: (1<=p21)
states: 6,385 (3)
.abstracting: (1<=0)
states: 0
.abstracting: (1<=p69)
states: 1,884 (3)
abstracting: (1<=p18)
states: 24,832 (4)
abstracting: (1<=0)
states: 0
.abstracting: (1<=p69)
states: 1,884 (3)
abstracting: (1<=p18)
states: 24,832 (4)
.....
EG iterations: 5
abstracting: (p68<=0)
states: 90,928 (4)
.....
EG iterations: 5
abstracting: (1<=p84)
states: 1,884 (3)
EG iterations: 0
.
EG iterations: 1
abstracting: (p96<=0)
states: 95,443 (4)
.-> the formula is FALSE
FORMULA CANConstruction-PT-005-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.760sec
totally nodes used: 2627918 (2.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3661574 13821774 17483348
used/not used/entry size/cache size: 14687233 52421631 16 1024MB
basic ops cache: hits/miss/sum: 481223 1785354 2266577
used/not used/entry size/cache size: 2805691 13971525 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: 23001 93746 116747
used/not used/entry size/cache size: 93213 8295395 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 64834552
1 1977864
2 246796
3 42992
4 5910
5 669
6 67
7 13
8 1
9 0
>= 10 0
Total processing time: 0m12.969sec
BK_STOP 1678735956652
--------------------
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:6656 (48), effective:280 (2)
initing FirstDep: 0m 0.000sec
iterations count:951 (6), effective:43 (0)
iterations count:1024 (7), effective:55 (0)
iterations count:3813 (27), effective:182 (1)
iterations count:4356 (31), effective:202 (1)
iterations count:1352 (9), effective:36 (0)
iterations count:137 (1), effective:0 (0)
iterations count:1054 (7), effective:44 (0)
iterations count:137 (1), effective:0 (0)
iterations count:137 (1), effective:0 (0)
iterations count:137 (1), effective:0 (0)
iterations count:1283 (9), effective:59 (0)
iterations count:137 (1), effective:0 (0)
iterations count:139 (1), effective:1 (0)
iterations count:146 (1), effective:2 (0)
iterations count:137 (1), effective:0 (0)
iterations count:3674 (26), effective:171 (1)
iterations count:3674 (26), effective:171 (1)
iterations count:3674 (26), effective:171 (1)
iterations count:3674 (26), effective:171 (1)
iterations count:1122 (8), effective:37 (0)
iterations count:1122 (8), effective:37 (0)
iterations count:341 (2), effective:3 (0)
iterations count:1122 (8), effective:37 (0)
iterations count:137 (1), effective:0 (0)
iterations count:357 (2), effective:8 (0)
iterations count:737 (5), effective:36 (0)
iterations count:138 (1), effective:1 (0)
iterations count:459 (3), effective:13 (0)
iterations count:3274 (23), effective:143 (1)
iterations count:176 (1), effective:2 (0)
iterations count:1371 (10), effective:39 (0)
iterations count:137 (1), effective:0 (0)
iterations count:137 (1), effective:0 (0)
iterations count:145 (1), effective:1 (0)
iterations count:1893 (13), effective:75 (0)
iterations count:1575 (11), effective:66 (0)
iterations count:807 (5), effective:36 (0)
iterations count:197 (1), effective:1 (0)
iterations count:137 (1), effective:0 (0)
iterations count:137 (1), effective:0 (0)
iterations count:142 (1), effective:1 (0)
iterations count:1378 (10), effective:58 (0)
iterations count:1493 (10), effective:58 (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="CANConstruction-PT-005"
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 CANConstruction-PT-005, 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 r042-tajo-167813696000610"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-005.tgz
mv CANConstruction-PT-005 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 ;