About the Execution of Marcie+red for IOTPpurchase-PT-C03M03P03D03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6669.487 | 25704.00 | 28518.00 | 466.90 | FTTFFTFTFFTTTTTT | 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.r234-tall-167856419800114.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 IOTPpurchase-PT-C03M03P03D03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856419800114
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K Feb 25 15:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 15:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 15:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 15:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 15:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 25 15:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Feb 25 15:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 60K 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 IOTPpurchase-PT-C03M03P03D03-CTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679451140110
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=IOTPpurchase-PT-C03M03P03D03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 02:12:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 02:12:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:12:21] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-22 02:12:21] [INFO ] Transformed 111 places.
[2023-03-22 02:12:21] [INFO ] Transformed 45 transitions.
[2023-03-22 02:12:21] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 90 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 103 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 2 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 108 transition count 45
Applied a total of 3 rules in 12 ms. Remains 108 /111 variables (removed 3) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 108 cols
[2023-03-22 02:12:21] [INFO ] Computed 64 place invariants in 13 ms
[2023-03-22 02:12:22] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-22 02:12:22] [INFO ] Invariant cache hit.
[2023-03-22 02:12:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 02:12:22] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
[2023-03-22 02:12:22] [INFO ] Invariant cache hit.
[2023-03-22 02:12:22] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/111 places, 45/45 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 584 ms. Remains : 108/111 places, 45/45 transitions.
Support contains 103 out of 108 places after structural reductions.
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 23 ms
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 9 ms
[2023-03-22 02:12:22] [INFO ] Input system was already deterministic with 45 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 54) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Finished Best-First random walk after 208 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=104 )
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 6 ms
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 7 ms
[2023-03-22 02:12:22] [INFO ] Input system was already deterministic with 45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 70 transition count 45
Applied a total of 38 rules in 4 ms. Remains 70 /108 variables (removed 38) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 70/108 places, 45/45 transitions.
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 45/45 transitions.
Ensure Unique test removed 26 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 78 transition count 45
Applied a total of 30 rules in 2 ms. Remains 78 /108 variables (removed 30) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 78/108 places, 45/45 transitions.
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 45/45 transitions.
Ensure Unique test removed 28 places
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 73 transition count 45
Applied a total of 35 rules in 2 ms. Remains 73 /108 variables (removed 35) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 73/108 places, 45/45 transitions.
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 45/45 transitions.
Ensure Unique test removed 26 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 77 transition count 45
Applied a total of 31 rules in 10 ms. Remains 77 /108 variables (removed 31) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 77/108 places, 45/45 transitions.
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 71 transition count 45
Applied a total of 37 rules in 2 ms. Remains 71 /108 variables (removed 37) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 71/108 places, 45/45 transitions.
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 45/45 transitions.
Ensure Unique test removed 34 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 68 transition count 45
Applied a total of 40 rules in 3 ms. Remains 68 /108 variables (removed 40) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 68/108 places, 45/45 transitions.
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 45/45 transitions.
Ensure Unique test removed 34 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 68 transition count 45
Applied a total of 40 rules in 2 ms. Remains 68 /108 variables (removed 40) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 68/108 places, 45/45 transitions.
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 70 transition count 39
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 61 transition count 33
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 34 place count 55 transition count 33
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 34 place count 55 transition count 21
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 66 place count 35 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 35 transition count 18
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 72 place count 32 transition count 18
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 90 place count 21 transition count 11
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 93 place count 19 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 94 place count 18 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 94 place count 18 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 97 place count 16 transition count 9
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 98 place count 16 transition count 8
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 101 place count 14 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 103 place count 13 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 104 place count 12 transition count 6
Applied a total of 104 rules in 11 ms. Remains 12 /108 variables (removed 96) and now considering 6/45 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 12/108 places, 6/45 transitions.
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 0 ms
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 0 ms
[2023-03-22 02:12:22] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 7 places :
Implicit places reduction removed 7 places
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 14 rules applied. Total rules applied 14 place count 70 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 33 place count 59 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 41 place count 51 transition count 30
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 41 place count 51 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 68 place count 34 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 68 place count 34 transition count 17
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 74 place count 31 transition count 17
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 76 place count 30 transition count 16
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 78 place count 28 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 78 place count 28 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 27 transition count 15
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 94 place count 19 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 95 place count 18 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 95 place count 18 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 98 place count 16 transition count 8
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 99 place count 16 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 101 place count 14 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 101 place count 14 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 103 place count 13 transition count 6
Applied a total of 103 rules in 9 ms. Remains 13 /108 variables (removed 95) and now considering 6/45 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 13/108 places, 6/45 transitions.
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 0 ms
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:12:22] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 45/45 transitions.
Ensure Unique test removed 33 places
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 68 transition count 45
Applied a total of 40 rules in 15 ms. Remains 68 /108 variables (removed 40) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 68/108 places, 45/45 transitions.
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 45/45 transitions.
Ensure Unique test removed 24 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 78 transition count 45
Applied a total of 30 rules in 2 ms. Remains 78 /108 variables (removed 30) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 78/108 places, 45/45 transitions.
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:22] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 45/45 transitions.
Ensure Unique test removed 34 places
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 67 transition count 39
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 16 rules applied. Total rules applied 29 place count 57 transition count 33
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 36 place count 51 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 50 transition count 32
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 37 place count 50 transition count 21
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 29 rules applied. Total rules applied 66 place count 32 transition count 21
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 66 place count 32 transition count 18
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 72 place count 29 transition count 18
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 90 place count 18 transition count 11
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 93 place count 16 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 94 place count 15 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 94 place count 15 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 97 place count 13 transition count 9
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 98 place count 13 transition count 8
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 101 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 103 place count 10 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 104 place count 9 transition count 6
Applied a total of 104 rules in 8 ms. Remains 9 /108 variables (removed 99) and now considering 6/45 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 9/108 places, 6/45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 45/45 transitions.
Ensure Unique test removed 23 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 79 transition count 45
Applied a total of 29 rules in 3 ms. Remains 79 /108 variables (removed 29) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 79/108 places, 45/45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 45/45 transitions.
Ensure Unique test removed 25 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 77 transition count 45
Applied a total of 31 rules in 2 ms. Remains 77 /108 variables (removed 31) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 77/108 places, 45/45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 45/45 transitions.
Ensure Unique test removed 18 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 88 transition count 45
Applied a total of 20 rules in 1 ms. Remains 88 /108 variables (removed 20) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 88/108 places, 45/45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 4 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 45/45 transitions.
Ensure Unique test removed 34 places
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 67 transition count 45
Applied a total of 41 rules in 2 ms. Remains 67 /108 variables (removed 41) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 67/108 places, 45/45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:12:23] [INFO ] Input system was already deterministic with 45 transitions.
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 5 ms
[2023-03-22 02:12:23] [INFO ] Flatten gal took : 5 ms
[2023-03-22 02:12:23] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-22 02:12:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 45 transitions and 218 arcs took 1 ms.
Total runtime 1611 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: 45 NrArc: 218)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.671sec
RS generation: 0m 0.142sec
-> reachability set: #nodes 5595 (5.6e+03) #states 354,176 (5)
starting MCC model checker
--------------------------
checking: AG [EF [[1<=p107 & p4<=0]]]
normalized: ~ [E [true U ~ [E [true U [1<=p107 & p4<=0]]]]]
abstracting: (p4<=0)
states: 332,664 (5)
abstracting: (1<=p107)
states: 260,788 (5)
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.129sec
checking: EF [EG [AX [[1<=p75 | [1<=p14 & 1<=p99]]]]]
normalized: E [true U EG [~ [EX [~ [[[1<=p14 & 1<=p99] | 1<=p75]]]]]]
abstracting: (1<=p75)
states: 21,512 (4)
abstracting: (1<=p99)
states: 109,648 (5)
abstracting: (1<=p14)
states: 33,232 (4)
..............................................
EG iterations: 45
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.258sec
checking: AG [EX [AF [~ [A [1<=p97 U [1<=p44 & 1<=p47]]]]]]
normalized: ~ [E [true U ~ [EX [~ [EG [[~ [EG [~ [[1<=p44 & 1<=p47]]]] & ~ [E [~ [[1<=p44 & 1<=p47]] U [~ [1<=p97] & ~ [[1<=p44 & 1<=p47]]]]]]]]]]]]
abstracting: (1<=p47)
states: 20,680 (4)
abstracting: (1<=p44)
states: 260,026 (5)
abstracting: (1<=p97)
states: 35,344 (4)
abstracting: (1<=p47)
states: 20,680 (4)
abstracting: (1<=p44)
states: 260,026 (5)
abstracting: (1<=p47)
states: 20,680 (4)
abstracting: (1<=p44)
states: 260,026 (5)
......................................................................................................................................
EG iterations: 134
...........................................................................................
EG iterations: 91
.-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.290sec
checking: EG [EX [EX [EG [[[p45<=0 | p34<=0] | [p51<=0 | [p66<=0 | p93<=0]]]]]]]
normalized: EG [EX [EX [EG [[[p51<=0 | [p66<=0 | p93<=0]] | [p45<=0 | p34<=0]]]]]]
abstracting: (p34<=0)
states: 324,332 (5)
abstracting: (p45<=0)
states: 324,332 (5)
abstracting: (p93<=0)
states: 324,332 (5)
abstracting: (p66<=0)
states: 38,608 (4)
abstracting: (p51<=0)
states: 324,332 (5)
..................................................................................................................................
EG iterations: 130
...
EG iterations: 1
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.828sec
checking: EG [[[p7<=0 | p24<=0] | [p30<=0 | [p72<=0 | p103<=0]]]]
normalized: EG [[[p7<=0 | p24<=0] | [p30<=0 | [p72<=0 | p103<=0]]]]
abstracting: (p103<=0)
states: 332,664 (5)
abstracting: (p72<=0)
states: 33,232 (4)
abstracting: (p30<=0)
states: 332,664 (5)
abstracting: (p24<=0)
states: 332,664 (5)
abstracting: (p7<=0)
states: 332,664 (5)
.......................................................................................................................................
EG iterations: 135
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.226sec
checking: EG [E [EG [~ [[1<=p16 & 1<=p58]]] U [~ [[1<=p79 & [1<=p36 & 1<=p84]]] & EX [1<=p94]]]]
normalized: EG [E [EG [~ [[1<=p16 & 1<=p58]]] U [~ [[1<=p79 & [1<=p36 & 1<=p84]]] & EX [1<=p94]]]]
abstracting: (1<=p94)
states: 260,026 (5)
.abstracting: (1<=p84)
states: 81,178 (4)
abstracting: (1<=p36)
states: 33,626 (4)
abstracting: (1<=p79)
states: 21,512 (4)
abstracting: (1<=p58)
states: 20,680 (4)
abstracting: (1<=p16)
states: 212,408 (5)
.........................................................................................................................................
EG iterations: 137
.
EG iterations: 1
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.201sec
checking: EF [EG [[EF [p89<=0] | [p107<=0 & [[p9<=0 | p23<=0] | [p32<=0 | [p55<=0 | p105<=0]]]]]]]
normalized: E [true U EG [[[p107<=0 & [[p32<=0 | [p55<=0 | p105<=0]] | [p9<=0 | p23<=0]]] | E [true U p89<=0]]]]
abstracting: (p89<=0)
states: 332,664 (5)
abstracting: (p23<=0)
states: 327,952 (5)
abstracting: (p9<=0)
states: 327,952 (5)
abstracting: (p105<=0)
states: 327,952 (5)
abstracting: (p55<=0)
states: 302,800 (5)
abstracting: (p32<=0)
states: 327,952 (5)
abstracting: (p107<=0)
states: 93,388 (4)
EG iterations: 0
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.028sec
checking: EF [[[EG [[[p11<=0 | p55<=0] | [p74<=0 | p106<=0]]] & EG [p86<=0]] & [EX [AF [[p37<=0 | [p65<=0 | p92<=0]]]] & [[EF [p97<=0] | EX [1<=p79]] | [1<=p97 | [1<=p44 & 1<=p47]]]]]]
normalized: E [true U [[[[1<=p97 | [1<=p44 & 1<=p47]] | [EX [1<=p79] | E [true U p97<=0]]] & EX [~ [EG [~ [[p37<=0 | [p65<=0 | p92<=0]]]]]]] & [EG [p86<=0] & EG [[[p74<=0 | p106<=0] | [p11<=0 | p55<=0]]]]]]
abstracting: (p55<=0)
states: 302,800 (5)
abstracting: (p11<=0)
states: 327,952 (5)
abstracting: (p106<=0)
states: 327,952 (5)
abstracting: (p74<=0)
states: 33,232 (4)
.......................................................................................................................................
EG iterations: 135
abstracting: (p86<=0)
states: 332,664 (5)
.......................................................................................................................................
EG iterations: 135
abstracting: (p92<=0)
states: 338,258 (5)
abstracting: (p65<=0)
states: 33,626 (4)
abstracting: (p37<=0)
states: 322,756 (5)
...........................................................................................
EG iterations: 91
.abstracting: (p97<=0)
states: 318,832 (5)
abstracting: (1<=p79)
states: 21,512 (4)
.abstracting: (1<=p47)
states: 20,680 (4)
abstracting: (1<=p44)
states: 260,026 (5)
abstracting: (1<=p97)
states: 35,344 (4)
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.229sec
checking: AG [A [EX [[[1<=p60 & [1<=p63 & 1<=p11]] & [1<=p55 & [1<=p74 & 1<=p106]]]] U [AF [[[1<=p7 & 1<=p24] & [1<=p30 & [1<=p72 & 1<=p103]]]] | [[1<=p5 & [1<=p20 & 1<=p21]] & [[1<=p27 & 1<=p39] & [1<=p49 & 1<=p76]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[[[1<=p49 & 1<=p76] & [1<=p27 & 1<=p39]] & [1<=p5 & [1<=p20 & 1<=p21]]] | ~ [EG [~ [[[1<=p30 & [1<=p72 & 1<=p103]] & [1<=p7 & 1<=p24]]]]]]]]] & ~ [E [~ [[[[[1<=p49 & 1<=p76] & [1<=p27 & 1<=p39]] & [1<=p5 & [1<=p20 & 1<=p21]]] | ~ [EG [~ [[[1<=p30 & [1<=p72 & 1<=p103]] & [1<=p7 & 1<=p24]]]]]]] U [~ [EX [[[1<=p55 & [1<=p74 & 1<=p106]] & [1<=p60 & [1<=p63 & 1<=p11]]]]] & ~ [[[[[1<=p49 & 1<=p76] & [1<=p27 & 1<=p39]] & [1<=p5 & [1<=p20 & 1<=p21]]] | ~ [EG [~ [[[1<=p30 & [1<=p72 & 1<=p103]] & [1<=p7 & 1<=p24]]]]]]]]]]]]]]
abstracting: (1<=p24)
states: 21,512 (4)
abstracting: (1<=p7)
states: 21,512 (4)
abstracting: (1<=p103)
states: 21,512 (4)
abstracting: (1<=p72)
states: 320,944 (5)
abstracting: (1<=p30)
states: 21,512 (4)
.......................................................................................................................................
EG iterations: 135
abstracting: (1<=p21)
states: 21,512 (4)
abstracting: (1<=p20)
states: 333,496 (5)
abstracting: (1<=p5)
states: 21,512 (4)
abstracting: (1<=p39)
states: 21,512 (4)
abstracting: (1<=p27)
states: 21,512 (4)
abstracting: (1<=p76)
states: 21,512 (4)
abstracting: (1<=p49)
states: 21,512 (4)
abstracting: (1<=p11)
states: 26,224 (4)
abstracting: (1<=p63)
states: 20,680 (4)
abstracting: (1<=p60)
states: 90,176 (4)
abstracting: (1<=p106)
states: 26,224 (4)
abstracting: (1<=p74)
states: 320,944 (5)
abstracting: (1<=p55)
states: 51,376 (4)
.abstracting: (1<=p24)
states: 21,512 (4)
abstracting: (1<=p7)
states: 21,512 (4)
abstracting: (1<=p103)
states: 21,512 (4)
abstracting: (1<=p72)
states: 320,944 (5)
abstracting: (1<=p30)
states: 21,512 (4)
.......................................................................................................................................
EG iterations: 135
abstracting: (1<=p21)
states: 21,512 (4)
abstracting: (1<=p20)
states: 333,496 (5)
abstracting: (1<=p5)
states: 21,512 (4)
abstracting: (1<=p39)
states: 21,512 (4)
abstracting: (1<=p27)
states: 21,512 (4)
abstracting: (1<=p76)
states: 21,512 (4)
abstracting: (1<=p49)
states: 21,512 (4)
abstracting: (1<=p24)
states: 21,512 (4)
abstracting: (1<=p7)
states: 21,512 (4)
abstracting: (1<=p103)
states: 21,512 (4)
abstracting: (1<=p72)
states: 320,944 (5)
abstracting: (1<=p30)
states: 21,512 (4)
.......................................................................................................................................
EG iterations: 135
abstracting: (1<=p21)
states: 21,512 (4)
abstracting: (1<=p20)
states: 333,496 (5)
abstracting: (1<=p5)
states: 21,512 (4)
abstracting: (1<=p39)
states: 21,512 (4)
abstracting: (1<=p27)
states: 21,512 (4)
abstracting: (1<=p76)
states: 21,512 (4)
abstracting: (1<=p49)
states: 21,512 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.064sec
checking: EX [[[AG [EX [AG [[1<=p10 & 1<=p13]]]] | AF [[1<=p48 & 1<=p85]]] | [[EG [[[p6<=0 | [p22<=0 | p26<=0]] | [p40<=0 | [p50<=0 | p61<=0]]]] & [p82<=0 & [p16<=0 | p58<=0]]] | [[~ [E [[1<=p10 & 1<=p13] U [[1<=p11 & 1<=p55] & [1<=p74 & 1<=p106]]]] & 1<=p86] | [AG [[[p11<=0 | p55<=0] | [p74<=0 | p106<=0]]] & AF [p2<=0]]]]]]
normalized: EX [[[[[~ [EG [~ [p2<=0]]] & ~ [E [true U ~ [[[p74<=0 | p106<=0] | [p11<=0 | p55<=0]]]]]] | [1<=p86 & ~ [E [[1<=p10 & 1<=p13] U [[1<=p74 & 1<=p106] & [1<=p11 & 1<=p55]]]]]] | [[p82<=0 & [p16<=0 | p58<=0]] & EG [[[p40<=0 | [p50<=0 | p61<=0]] | [p6<=0 | [p22<=0 | p26<=0]]]]]] | [~ [EG [~ [[1<=p48 & 1<=p85]]]] | ~ [E [true U ~ [EX [~ [E [true U ~ [[1<=p10 & 1<=p13]]]]]]]]]]]
abstracting: (1<=p13)
states: 33,232 (4)
abstracting: (1<=p10)
states: 260,788 (5)
.abstracting: (1<=p85)
states: 34,622 (4)
abstracting: (1<=p48)
states: 38,608 (4)
......................................................................................................................................
EG iterations: 134
abstracting: (p26<=0)
states: 332,664 (5)
abstracting: (p22<=0)
states: 332,664 (5)
abstracting: (p6<=0)
states: 332,664 (5)
abstracting: (p61<=0)
states: 332,664 (5)
abstracting: (p50<=0)
states: 332,664 (5)
abstracting: (p40<=0)
states: 332,664 (5)
.......................................................................................................................................
EG iterations: 135
abstracting: (p58<=0)
states: 333,496 (5)
abstracting: (p16<=0)
states: 141,768 (5)
abstracting: (p82<=0)
states: 332,664 (5)
abstracting: (1<=p55)
states: 51,376 (4)
abstracting: (1<=p11)
states: 26,224 (4)
abstracting: (1<=p106)
states: 26,224 (4)
abstracting: (1<=p74)
states: 320,944 (5)
abstracting: (1<=p13)
states: 33,232 (4)
abstracting: (1<=p10)
states: 260,788 (5)
abstracting: (1<=p86)
states: 21,512 (4)
abstracting: (p55<=0)
states: 302,800 (5)
abstracting: (p11<=0)
states: 327,952 (5)
abstracting: (p106<=0)
states: 327,952 (5)
abstracting: (p74<=0)
states: 33,232 (4)
abstracting: (p2<=0)
states: 332,664 (5)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.471sec
checking: [~ [E [EX [EF [1<=p102]] U ~ [[[p107<=0 | [1<=p48 & 1<=p85]] | [[[1<=p8 & [1<=p25 & 1<=p31]] & [1<=p57 & [1<=p73 & 1<=p98]]] | p2<=0]]]]] & [~ [E [[[EG [[1<=p48 & 1<=p85]] & p4<=0] | [EF [[1<=p64 & 1<=p77]] & [[1<=p10 & 1<=p13] | [1<=p67 & 1<=p87]]]] U AX [[1<=p37 & [1<=p65 & 1<=p92]]]]] | EF [[p36<=0 | p84<=0]]]]
normalized: [[E [true U [p36<=0 | p84<=0]] | ~ [E [[[[[1<=p67 & 1<=p87] | [1<=p10 & 1<=p13]] & E [true U [1<=p64 & 1<=p77]]] | [p4<=0 & EG [[1<=p48 & 1<=p85]]]] U ~ [EX [~ [[1<=p37 & [1<=p65 & 1<=p92]]]]]]]] & ~ [E [EX [E [true U 1<=p102]] U ~ [[[p2<=0 | [[1<=p57 & [1<=p73 & 1<=p98]] & [1<=p8 & [1<=p25 & 1<=p31]]]] | [p107<=0 | [1<=p48 & 1<=p85]]]]]]]
abstracting: (1<=p85)
states: 34,622 (4)
abstracting: (1<=p48)
states: 38,608 (4)
abstracting: (p107<=0)
states: 93,388 (4)
abstracting: (1<=p31)
states: 68,512 (4)
abstracting: (1<=p25)
states: 68,512 (4)
abstracting: (1<=p8)
states: 68,512 (4)
abstracting: (1<=p98)
states: 35,344 (4)
abstracting: (1<=p73)
states: 320,944 (5)
abstracting: (1<=p57)
states: 35,344 (4)
abstracting: (p2<=0)
states: 332,664 (5)
abstracting: (1<=p102)
states: 21,512 (4)
.abstracting: (1<=p92)
states: 15,918 (4)
abstracting: (1<=p65)
states: 320,550 (5)
abstracting: (1<=p37)
states: 31,420 (4)
.abstracting: (1<=p85)
states: 34,622 (4)
abstracting: (1<=p48)
states: 38,608 (4)
............................................................................................
EG iterations: 92
abstracting: (p4<=0)
states: 332,664 (5)
abstracting: (1<=p77)
states: 21,512 (4)
abstracting: (1<=p64)
states: 333,496 (5)
abstracting: (1<=p13)
states: 33,232 (4)
abstracting: (1<=p10)
states: 260,788 (5)
abstracting: (1<=p87)
states: 21,512 (4)
abstracting: (1<=p67)
states: 333,496 (5)
abstracting: (p84<=0)
states: 272,998 (5)
abstracting: (p36<=0)
states: 320,550 (5)
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.564sec
checking: EX [[AF [EG [[p86<=0 | p82<=0]]] & [p18<=0 | [p33<=0 | [~ [A [EX [[1<=p12 & [1<=p56 & 1<=p100]]] U AG [[1<=p60 & 1<=p63]]]] & [EX [[[p34<=0 | p45<=0] | [p51<=0 | [p66<=0 | p93<=0]]]] | [[[p43<=0 | p81<=0] & [p37<=0 | [p65<=0 | p92<=0]]] | [[[p8<=0 | [p25<=0 | p31<=0]] | [p57<=0 | [p73<=0 | p98<=0]]] & [p43<=0 | p81<=0]]]]]]]]]
normalized: EX [[[p18<=0 | [p33<=0 | [[[[[p43<=0 | p81<=0] & [[p57<=0 | [p73<=0 | p98<=0]] | [p8<=0 | [p25<=0 | p31<=0]]]] | [[p37<=0 | [p65<=0 | p92<=0]] & [p43<=0 | p81<=0]]] | EX [[[p51<=0 | [p66<=0 | p93<=0]] | [p34<=0 | p45<=0]]]] & ~ [[~ [EG [E [true U ~ [[1<=p60 & 1<=p63]]]]] & ~ [E [E [true U ~ [[1<=p60 & 1<=p63]]] U [~ [EX [[1<=p12 & [1<=p56 & 1<=p100]]]] & E [true U ~ [[1<=p60 & 1<=p63]]]]]]]]]]] & ~ [EG [~ [EG [[p86<=0 | p82<=0]]]]]]]
abstracting: (p82<=0)
states: 332,664 (5)
abstracting: (p86<=0)
states: 332,664 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p63)
states: 20,680 (4)
abstracting: (1<=p60)
states: 90,176 (4)
abstracting: (1<=p100)
states: 35,344 (4)
abstracting: (1<=p56)
states: 35,344 (4)
abstracting: (1<=p12)
states: 35,344 (4)
.abstracting: (1<=p63)
states: 20,680 (4)
abstracting: (1<=p60)
states: 90,176 (4)
abstracting: (1<=p63)
states: 20,680 (4)
abstracting: (1<=p60)
states: 90,176 (4)
EG iterations: 0
abstracting: (p45<=0)
states: 324,332 (5)
abstracting: (p34<=0)
states: 324,332 (5)
abstracting: (p93<=0)
states: 324,332 (5)
abstracting: (p66<=0)
states: 38,608 (4)
abstracting: (p51<=0)
states: 324,332 (5)
.abstracting: (p81<=0)
states: 274,720 (5)
abstracting: (p43<=0)
states: 333,496 (5)
abstracting: (p92<=0)
states: 338,258 (5)
abstracting: (p65<=0)
states: 33,626 (4)
abstracting: (p37<=0)
states: 322,756 (5)
abstracting: (p31<=0)
states: 285,664 (5)
abstracting: (p25<=0)
states: 285,664 (5)
abstracting: (p8<=0)
states: 285,664 (5)
abstracting: (p98<=0)
states: 318,832 (5)
abstracting: (p73<=0)
states: 33,232 (4)
abstracting: (p57<=0)
states: 318,832 (5)
abstracting: (p81<=0)
states: 274,720 (5)
abstracting: (p43<=0)
states: 333,496 (5)
abstracting: (p33<=0)
states: 333,496 (5)
abstracting: (p18<=0)
states: 256,472 (5)
.-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.094sec
checking: A [[~ [[1<=p18 & 1<=p33]] | [[1<=p7 & 1<=p24] & [1<=p30 & [1<=p72 & 1<=p103]]]] U AF [[AF [E [1<=p104 U [1<=p10 & 1<=p13]]] & [E [[[1<=p68 & 1<=p80] | 1<=p107] U [[1<=p6 & [1<=p22 & 1<=p26]] & [1<=p40 & [1<=p50 & 1<=p61]]]] & AX [[[[1<=p6 & 1<=p22] & [1<=p26 & 1<=p40]] & [[1<=p50 & 1<=p61] & [1<=p1 & 1<=p88]]]]]]]]
normalized: [~ [EG [EG [~ [[[~ [EX [~ [[[[1<=p1 & 1<=p88] & [1<=p50 & 1<=p61]] & [[1<=p26 & 1<=p40] & [1<=p6 & 1<=p22]]]]]] & E [[1<=p107 | [1<=p68 & 1<=p80]] U [[1<=p40 & [1<=p50 & 1<=p61]] & [1<=p6 & [1<=p22 & 1<=p26]]]]] & ~ [EG [~ [E [1<=p104 U [1<=p10 & 1<=p13]]]]]]]]]] & ~ [E [EG [~ [[[~ [EX [~ [[[[1<=p1 & 1<=p88] & [1<=p50 & 1<=p61]] & [[1<=p26 & 1<=p40] & [1<=p6 & 1<=p22]]]]]] & E [[1<=p107 | [1<=p68 & 1<=p80]] U [[1<=p40 & [1<=p50 & 1<=p61]] & [1<=p6 & [1<=p22 & 1<=p26]]]]] & ~ [EG [~ [E [1<=p104 U [1<=p10 & 1<=p13]]]]]]]] U [~ [[[[1<=p30 & [1<=p72 & 1<=p103]] & [1<=p7 & 1<=p24]] | ~ [[1<=p18 & 1<=p33]]]] & EG [~ [[[~ [EX [~ [[[[1<=p1 & 1<=p88] & [1<=p50 & 1<=p61]] & [[1<=p26 & 1<=p40] & [1<=p6 & 1<=p22]]]]]] & E [[1<=p107 | [1<=p68 & 1<=p80]] U [[1<=p40 & [1<=p50 & 1<=p61]] & [1<=p6 & [1<=p22 & 1<=p26]]]]] & ~ [EG [~ [E [1<=p104 U [1<=p10 & 1<=p13]]]]]]]]]]]]
abstracting: (1<=p13)
states: 33,232 (4)
abstracting: (1<=p10)
states: 260,788 (5)
abstracting: (1<=p104)
states: 161,048 (5)
..........................................................................................................................
EG iterations: 122
abstracting: (1<=p26)
states: 21,512 (4)
abstracting: (1<=p22)
states: 21,512 (4)
abstracting: (1<=p6)
states: 21,512 (4)
abstracting: (1<=p61)
states: 21,512 (4)
abstracting: (1<=p50)
states: 21,512 (4)
abstracting: (1<=p40)
states: 21,512 (4)
abstracting: (1<=p80)
states: 21,512 (4)
abstracting: (1<=p68)
states: 333,496 (5)
abstracting: (1<=p107)
states: 260,788 (5)
abstracting: (1<=p22)
states: 21,512 (4)
abstracting: (1<=p6)
states: 21,512 (4)
abstracting: (1<=p40)
states: 21,512 (4)
abstracting: (1<=p26)
states: 21,512 (4)
abstracting: (1<=p61)
states: 21,512 (4)
abstracting: (1<=p50)
states: 21,512 (4)
abstracting: (1<=p88)
states: 79,456 (4)
abstracting: (1<=p1)
states: 20,680 (4)
.
EG iterations: 0
abstracting: (1<=p33)
states: 20,680 (4)
abstracting: (1<=p18)
states: 97,704 (4)
abstracting: (1<=p24)
states: 21,512 (4)
abstracting: (1<=p7)
states: 21,512 (4)
abstracting: (1<=p103)
states: 21,512 (4)
abstracting: (1<=p72)
states: 320,944 (5)
abstracting: (1<=p30)
states: 21,512 (4)
abstracting: (1<=p13)
states: 33,232 (4)
abstracting: (1<=p10)
states: 260,788 (5)
abstracting: (1<=p104)
states: 161,048 (5)
..........................................................................................................................
EG iterations: 122
abstracting: (1<=p26)
states: 21,512 (4)
abstracting: (1<=p22)
states: 21,512 (4)
abstracting: (1<=p6)
states: 21,512 (4)
abstracting: (1<=p61)
states: 21,512 (4)
abstracting: (1<=p50)
states: 21,512 (4)
abstracting: (1<=p40)
states: 21,512 (4)
abstracting: (1<=p80)
states: 21,512 (4)
abstracting: (1<=p68)
states: 333,496 (5)
abstracting: (1<=p107)
states: 260,788 (5)
abstracting: (1<=p22)
states: 21,512 (4)
abstracting: (1<=p6)
states: 21,512 (4)
abstracting: (1<=p40)
states: 21,512 (4)
abstracting: (1<=p26)
states: 21,512 (4)
abstracting: (1<=p61)
states: 21,512 (4)
abstracting: (1<=p50)
states: 21,512 (4)
abstracting: (1<=p88)
states: 79,456 (4)
abstracting: (1<=p1)
states: 20,680 (4)
.
EG iterations: 0
abstracting: (1<=p13)
states: 33,232 (4)
abstracting: (1<=p10)
states: 260,788 (5)
abstracting: (1<=p104)
states: 161,048 (5)
..........................................................................................................................
EG iterations: 122
abstracting: (1<=p26)
states: 21,512 (4)
abstracting: (1<=p22)
states: 21,512 (4)
abstracting: (1<=p6)
states: 21,512 (4)
abstracting: (1<=p61)
states: 21,512 (4)
abstracting: (1<=p50)
states: 21,512 (4)
abstracting: (1<=p40)
states: 21,512 (4)
abstracting: (1<=p80)
states: 21,512 (4)
abstracting: (1<=p68)
states: 333,496 (5)
abstracting: (1<=p107)
states: 260,788 (5)
abstracting: (1<=p22)
states: 21,512 (4)
abstracting: (1<=p6)
states: 21,512 (4)
abstracting: (1<=p40)
states: 21,512 (4)
abstracting: (1<=p26)
states: 21,512 (4)
abstracting: (1<=p61)
states: 21,512 (4)
abstracting: (1<=p50)
states: 21,512 (4)
abstracting: (1<=p88)
states: 79,456 (4)
abstracting: (1<=p1)
states: 20,680 (4)
.
EG iterations: 0
EG iterations: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.987sec
checking: E [~ [EX [[[[1<=p68 & [1<=p80 & 1<=p94]] & [[1<=p43 & 1<=p81] & [1<=p67 & 1<=p87]]] | A [[[1<=p28 & [1<=p38 & 1<=p41]] & [1<=p53 & [1<=p70 & 1<=p83]]] U [[1<=p6 & [1<=p22 & 1<=p26]] & [1<=p40 & [1<=p50 & 1<=p61]]]]]]] U AG [[AG [[[1<=p71 & 1<=p95] | EF [[1<=p37 & [1<=p65 & 1<=p92]]]]] | [1<=p59 & [1<=p62 & AG [[1<=p12 & [1<=p56 & 1<=p100]]]]]]]]
normalized: E [~ [EX [[[~ [EG [~ [[[1<=p40 & [1<=p50 & 1<=p61]] & [1<=p6 & [1<=p22 & 1<=p26]]]]]] & ~ [E [~ [[[1<=p40 & [1<=p50 & 1<=p61]] & [1<=p6 & [1<=p22 & 1<=p26]]]] U [~ [[[1<=p53 & [1<=p70 & 1<=p83]] & [1<=p28 & [1<=p38 & 1<=p41]]]] & ~ [[[1<=p40 & [1<=p50 & 1<=p61]] & [1<=p6 & [1<=p22 & 1<=p26]]]]]]]] | [[[1<=p67 & 1<=p87] & [1<=p43 & 1<=p81]] & [1<=p68 & [1<=p80 & 1<=p94]]]]]] U ~ [E [true U ~ [[[1<=p59 & [1<=p62 & ~ [E [true U ~ [[1<=p12 & [1<=p56 & 1<=p100]]]]]]] | ~ [E [true U ~ [[E [true U [1<=p37 & [1<=p65 & 1<=p92]]] | [1<=p71 & 1<=p95]]]]]]]]]]
abstracting: (1<=p95)
states: 21,512 (4)
abstracting: (1<=p71)
states: 333,496 (5)
abstracting: (1<=p92)
states: 15,918 (4)
abstracting: (1<=p65)
states: 320,550 (5)
abstracting: (1<=p37)
states: 31,420 (4)
abstracting: (1<=p100)
states: 35,344 (4)
abstracting: (1<=p56)
states: 35,344 (4)
abstracting: (1<=p12)
states: 35,344 (4)
abstracting: (1<=p62)
states: 320,944 (5)
abstracting: (1<=p59)
states: 35,344 (4)
abstracting: (1<=p94)
states: 260,026 (5)
abstracting: (1<=p80)
states: 21,512 (4)
abstracting: (1<=p68)
states: 333,496 (5)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p87)
states: 21,512 (4)
abstracting: (1<=p67)
states: 333,496 (5)
abstracting: (1<=p26)
states: 21,512 (4)
abstracting: (1<=p22)
states: 21,512 (4)
abstracting: (1<=p6)
states: 21,512 (4)
abstracting: (1<=p61)
states: 21,512 (4)
abstracting: (1<=p50)
states: 21,512 (4)
abstracting: (1<=p40)
states: 21,512 (4)
abstracting: (1<=p41)
states: 42,176 (4)
abstracting: (1<=p38)
states: 21,512 (4)
abstracting: (1<=p28)
states: 42,176 (4)
abstracting: (1<=p83)
states: 21,512 (4)
abstracting: (1<=p70)
states: 333,496 (5)
abstracting: (1<=p53)
states: 21,512 (4)
abstracting: (1<=p26)
states: 21,512 (4)
abstracting: (1<=p22)
states: 21,512 (4)
abstracting: (1<=p6)
states: 21,512 (4)
abstracting: (1<=p61)
states: 21,512 (4)
abstracting: (1<=p50)
states: 21,512 (4)
abstracting: (1<=p40)
states: 21,512 (4)
abstracting: (1<=p26)
states: 21,512 (4)
abstracting: (1<=p22)
states: 21,512 (4)
abstracting: (1<=p6)
states: 21,512 (4)
abstracting: (1<=p61)
states: 21,512 (4)
abstracting: (1<=p50)
states: 21,512 (4)
abstracting: (1<=p40)
states: 21,512 (4)
.......................................................................................................................................
EG iterations: 135
.-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.059sec
checking: AF [[AF [[A [[1<=p10 & 1<=p13] U EX [[[1<=p6 & [1<=p22 & 1<=p26]] & [1<=p40 & [1<=p50 & 1<=p61]]]]] & AF [[1<=p43 & 1<=p81]]]] | [AX [AF [[[1<=p35 & 1<=p46] & [1<=p52 & 1<=p78]]]] & [EX [A [1<=p75 U [1<=p67 & 1<=p87]]] | [[[1<=p8 & 1<=p25] & [1<=p31 & 1<=p57]] & [[1<=p73 & 1<=p98] & [1<=p75 & [[EF [1<=p79] | p67<=0] | [p87<=0 | [[1<=p43 & 1<=p81] | [[1<=p35 & 1<=p46] & [1<=p52 & 1<=p78]]]]]]]]]]]]
normalized: ~ [EG [~ [[[[[[[1<=p75 & [[p87<=0 | [[[1<=p52 & 1<=p78] & [1<=p35 & 1<=p46]] | [1<=p43 & 1<=p81]]] | [p67<=0 | E [true U 1<=p79]]]] & [1<=p73 & 1<=p98]] & [[1<=p31 & 1<=p57] & [1<=p8 & 1<=p25]]] | EX [[~ [EG [~ [[1<=p67 & 1<=p87]]]] & ~ [E [~ [[1<=p67 & 1<=p87]] U [~ [1<=p75] & ~ [[1<=p67 & 1<=p87]]]]]]]] & ~ [EX [EG [~ [[[1<=p52 & 1<=p78] & [1<=p35 & 1<=p46]]]]]]] | ~ [EG [~ [[~ [EG [~ [[1<=p43 & 1<=p81]]]] & [~ [EG [~ [EX [[[1<=p40 & [1<=p50 & 1<=p61]] & [1<=p6 & [1<=p22 & 1<=p26]]]]]]] & ~ [E [~ [EX [[[1<=p40 & [1<=p50 & 1<=p61]] & [1<=p6 & [1<=p22 & 1<=p26]]]]] U [~ [[1<=p10 & 1<=p13]] & ~ [EX [[[1<=p40 & [1<=p50 & 1<=p61]] & [1<=p6 & [1<=p22 & 1<=p26]]]]]]]]]]]]]]]]]
abstracting: (1<=p26)
states: 21,512 (4)
abstracting: (1<=p22)
states: 21,512 (4)
abstracting: (1<=p6)
states: 21,512 (4)
abstracting: (1<=p61)
states: 21,512 (4)
abstracting: (1<=p50)
states: 21,512 (4)
abstracting: (1<=p40)
states: 21,512 (4)
.abstracting: (1<=p13)
states: 33,232 (4)
abstracting: (1<=p10)
states: 260,788 (5)
abstracting: (1<=p26)
states: 21,512 (4)
abstracting: (1<=p22)
states: 21,512 (4)
abstracting: (1<=p6)
states: 21,512 (4)
abstracting: (1<=p61)
states: 21,512 (4)
abstracting: (1<=p50)
states: 21,512 (4)
abstracting: (1<=p40)
states: 21,512 (4)
.abstracting: (1<=p26)
states: 21,512 (4)
abstracting: (1<=p22)
states: 21,512 (4)
abstracting: (1<=p6)
states: 21,512 (4)
abstracting: (1<=p61)
states: 21,512 (4)
abstracting: (1<=p50)
states: 21,512 (4)
abstracting: (1<=p40)
states: 21,512 (4)
.......................................................................................................................................
EG iterations: 134
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
.........................................................................................................................................
EG iterations: 137
......................................................................................................................................
EG iterations: 134
abstracting: (1<=p46)
states: 21,512 (4)
abstracting: (1<=p35)
states: 21,512 (4)
abstracting: (1<=p78)
states: 21,512 (4)
abstracting: (1<=p52)
states: 21,512 (4)
.....................................................................................................................................
EG iterations: 133
.abstracting: (1<=p87)
states: 21,512 (4)
abstracting: (1<=p67)
states: 333,496 (5)
abstracting: (1<=p75)
states: 21,512 (4)
abstracting: (1<=p87)
states: 21,512 (4)
abstracting: (1<=p67)
states: 333,496 (5)
abstracting: (1<=p87)
states: 21,512 (4)
abstracting: (1<=p67)
states: 333,496 (5)
.......................................................................................................................................
EG iterations: 135
.abstracting: (1<=p25)
states: 68,512 (4)
abstracting: (1<=p8)
states: 68,512 (4)
abstracting: (1<=p57)
states: 35,344 (4)
abstracting: (1<=p31)
states: 68,512 (4)
abstracting: (1<=p98)
states: 35,344 (4)
abstracting: (1<=p73)
states: 320,944 (5)
abstracting: (1<=p79)
states: 21,512 (4)
abstracting: (p67<=0)
states: 20,680 (4)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p46)
states: 21,512 (4)
abstracting: (1<=p35)
states: 21,512 (4)
abstracting: (1<=p78)
states: 21,512 (4)
abstracting: (1<=p52)
states: 21,512 (4)
abstracting: (p87<=0)
states: 332,664 (5)
abstracting: (1<=p75)
states: 21,512 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.918sec
checking: [A [[p94<=0 & [AG [[~ [[1<=p12 & [1<=p56 & 1<=p100]]] | p94<=0]] & AX [~ [[[1<=p67 & 1<=p87] & [1<=p1 & [1<=p88 & [[1<=p16 & 1<=p58] | [1<=p10 & 1<=p13]]]]]]]]] U E [~ [[EG [[[1<=p5 & [1<=p20 & 1<=p21]] & [[1<=p27 & 1<=p39] & [1<=p49 & 1<=p76]]]] & [AF [[1<=p15 & 1<=p96]] | [1<=p36 & 1<=p84]]]] U A [A [[[1<=p7 & 1<=p24] & [1<=p30 & [1<=p72 & 1<=p103]]] U [[1<=p28 & [1<=p38 & 1<=p41]] & [1<=p53 & [1<=p70 & 1<=p83]]]] U [A [[1<=p17 & 1<=p19] U [1<=p43 & 1<=p81]] & EX [1<=p97]]]]] & E [[~ [EG [AF [[1<=p15 & 1<=p96]]]] | ~ [[[1<=p48 & 1<=p85] | [EX [1<=p97] & [1<=p60 & 1<=p63]]]]] U ~ [E [A [1<=p97 U 1<=p102] U [AG [[1<=p60 & 1<=p63]] & [[[1<=p29 & 1<=p42] & [1<=p54 & 1<=p91]] | [1<=p59 & 1<=p62]]]]]]]
normalized: [E [[~ [[[[1<=p60 & 1<=p63] & EX [1<=p97]] | [1<=p48 & 1<=p85]]] | ~ [EG [~ [EG [~ [[1<=p15 & 1<=p96]]]]]]] U ~ [E [[~ [EG [~ [1<=p102]]] & ~ [E [~ [1<=p102] U [~ [1<=p97] & ~ [1<=p102]]]]] U [[[1<=p59 & 1<=p62] | [[1<=p54 & 1<=p91] & [1<=p29 & 1<=p42]]] & ~ [E [true U ~ [[1<=p60 & 1<=p63]]]]]]]] & [~ [EG [~ [E [~ [[[[1<=p36 & 1<=p84] | ~ [EG [~ [[1<=p15 & 1<=p96]]]]] & EG [[[[1<=p49 & 1<=p76] & [1<=p27 & 1<=p39]] & [1<=p5 & [1<=p20 & 1<=p21]]]]]] U [~ [EG [~ [[EX [1<=p97] & [~ [EG [~ [[1<=p43 & 1<=p81]]]] & ~ [E [~ [[1<=p43 & 1<=p81]] U [~ [[1<=p17 & 1<=p19]] & ~ [[1<=p43 & 1<=p81]]]]]]]]]] & ~ [E [~ [[EX [1<=p97] & [~ [EG [~ [[1<=p43 & 1<=p81]]]] & ~ [E [~ [[1<=p43 & 1<=p81]] U [~ [[1<=p17 & 1<=p19]] & ~ [[1<=p43 & 1<=p81]]]]]]]] U [~ [[~ [EG [~ [[[1<=p53 & [1<=p70 & 1<=p83]] & [1<=p28 & [1<=p38 & 1<=p41]]]]]] & ~ [E [~ [[[1<=p53 & [1<=p70 & 1<=p83]] & [1<=p28 & [1<=p38 & 1<=p41]]]] U [~ [[[1<=p30 & [1<=p72 & 1<=p103]] & [1<=p7 & 1<=p24]]] & ~ [[[1<=p53 & [1<=p70 & 1<=p83]] & [1<=p28 & [1<=p38 & 1<=p41]]]]]]]]] & ~ [[EX [1<=p97] & [~ [EG [~ [[1<=p43 & 1<=p81]]]] & ~ [E [~ [[1<=p43 & 1<=p81]] U [~ [[1<=p17 & 1<=p19]] & ~ [[1<=p43 & 1<=p81]]]]]]]]]]]]]]]] & ~ [E [~ [E [~ [[[[1<=p36 & 1<=p84] | ~ [EG [~ [[1<=p15 & 1<=p96]]]]] & EG [[[[1<=p49 & 1<=p76] & [1<=p27 & 1<=p39]] & [1<=p5 & [1<=p20 & 1<=p21]]]]]] U [~ [EG [~ [[EX [1<=p97] & [~ [EG [~ [[1<=p43 & 1<=p81]]]] & ~ [E [~ [[1<=p43 & 1<=p81]] U [~ [[1<=p17 & 1<=p19]] & ~ [[1<=p43 & 1<=p81]]]]]]]]]] & ~ [E [~ [[EX [1<=p97] & [~ [EG [~ [[1<=p43 & 1<=p81]]]] & ~ [E [~ [[1<=p43 & 1<=p81]] U [~ [[1<=p17 & 1<=p19]] & ~ [[1<=p43 & 1<=p81]]]]]]]] U [~ [[~ [EG [~ [[[1<=p53 & [1<=p70 & 1<=p83]] & [1<=p28 & [1<=p38 & 1<=p41]]]]]] & ~ [E [~ [[[1<=p53 & [1<=p70 & 1<=p83]] & [1<=p28 & [1<=p38 & 1<=p41]]]] U [~ [[[1<=p30 & [1<=p72 & 1<=p103]] & [1<=p7 & 1<=p24]]] & ~ [[[1<=p53 & [1<=p70 & 1<=p83]] & [1<=p28 & [1<=p38 & 1<=p41]]]]]]]]] & ~ [[EX [1<=p97] & [~ [EG [~ [[1<=p43 & 1<=p81]]]] & ~ [E [~ [[1<=p43 & 1<=p81]] U [~ [[1<=p17 & 1<=p19]] & ~ [[1<=p43 & 1<=p81]]]]]]]]]]]]]] U [~ [[p94<=0 & [~ [EX [[[1<=p1 & [1<=p88 & [[1<=p10 & 1<=p13] | [1<=p16 & 1<=p58]]]] & [1<=p67 & 1<=p87]]]] & ~ [E [true U ~ [[p94<=0 | ~ [[1<=p12 & [1<=p56 & 1<=p100]]]]]]]]]] & ~ [E [~ [[[[1<=p36 & 1<=p84] | ~ [EG [~ [[1<=p15 & 1<=p96]]]]] & EG [[[[1<=p49 & 1<=p76] & [1<=p27 & 1<=p39]] & [1<=p5 & [1<=p20 & 1<=p21]]]]]] U [~ [EG [~ [[EX [1<=p97] & [~ [EG [~ [[1<=p43 & 1<=p81]]]] & ~ [E [~ [[1<=p43 & 1<=p81]] U [~ [[1<=p17 & 1<=p19]] & ~ [[1<=p43 & 1<=p81]]]]]]]]]] & ~ [E [~ [[EX [1<=p97] & [~ [EG [~ [[1<=p43 & 1<=p81]]]] & ~ [E [~ [[1<=p43 & 1<=p81]] U [~ [[1<=p17 & 1<=p19]] & ~ [[1<=p43 & 1<=p81]]]]]]]] U [~ [[~ [EG [~ [[[1<=p53 & [1<=p70 & 1<=p83]] & [1<=p28 & [1<=p38 & 1<=p41]]]]]] & ~ [E [~ [[[1<=p53 & [1<=p70 & 1<=p83]] & [1<=p28 & [1<=p38 & 1<=p41]]]] U [~ [[[1<=p30 & [1<=p72 & 1<=p103]] & [1<=p7 & 1<=p24]]] & ~ [[[1<=p53 & [1<=p70 & 1<=p83]] & [1<=p28 & [1<=p38 & 1<=p41]]]]]]]]] & ~ [[EX [1<=p97] & [~ [EG [~ [[1<=p43 & 1<=p81]]]] & ~ [E [~ [[1<=p43 & 1<=p81]] U [~ [[1<=p17 & 1<=p19]] & ~ [[1<=p43 & 1<=p81]]]]]]]]]]]]]]]]]]]
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p19)
states: 33,232 (4)
abstracting: (1<=p17)
states: 161,048 (5)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
.........................................................................................................................................
EG iterations: 137
abstracting: (1<=p97)
states: 35,344 (4)
.abstracting: (1<=p41)
states: 42,176 (4)
abstracting: (1<=p38)
states: 21,512 (4)
abstracting: (1<=p28)
states: 42,176 (4)
abstracting: (1<=p83)
states: 21,512 (4)
abstracting: (1<=p70)
states: 333,496 (5)
abstracting: (1<=p53)
states: 21,512 (4)
abstracting: (1<=p24)
states: 21,512 (4)
abstracting: (1<=p7)
states: 21,512 (4)
abstracting: (1<=p103)
states: 21,512 (4)
abstracting: (1<=p72)
states: 320,944 (5)
abstracting: (1<=p30)
states: 21,512 (4)
abstracting: (1<=p41)
states: 42,176 (4)
abstracting: (1<=p38)
states: 21,512 (4)
abstracting: (1<=p28)
states: 42,176 (4)
abstracting: (1<=p83)
states: 21,512 (4)
abstracting: (1<=p70)
states: 333,496 (5)
abstracting: (1<=p53)
states: 21,512 (4)
abstracting: (1<=p41)
states: 42,176 (4)
abstracting: (1<=p38)
states: 21,512 (4)
abstracting: (1<=p28)
states: 42,176 (4)
abstracting: (1<=p83)
states: 21,512 (4)
abstracting: (1<=p70)
states: 333,496 (5)
abstracting: (1<=p53)
states: 21,512 (4)
.....................................................................................................................................
EG iterations: 133
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p19)
states: 33,232 (4)
abstracting: (1<=p17)
states: 161,048 (5)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
.........................................................................................................................................
EG iterations: 137
abstracting: (1<=p97)
states: 35,344 (4)
.abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p19)
states: 33,232 (4)
abstracting: (1<=p17)
states: 161,048 (5)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
.........................................................................................................................................
EG iterations: 137
abstracting: (1<=p97)
states: 35,344 (4)
..
EG iterations: 1
abstracting: (1<=p21)
states: 21,512 (4)
abstracting: (1<=p20)
states: 333,496 (5)
abstracting: (1<=p5)
states: 21,512 (4)
abstracting: (1<=p39)
states: 21,512 (4)
abstracting: (1<=p27)
states: 21,512 (4)
abstracting: (1<=p76)
states: 21,512 (4)
abstracting: (1<=p49)
states: 21,512 (4)
..............................................................................................
EG iterations: 94
abstracting: (1<=p96)
states: 90,176 (4)
abstracting: (1<=p15)
states: 33,232 (4)
.........................................................................................................................................
EG iterations: 137
abstracting: (1<=p84)
states: 81,178 (4)
abstracting: (1<=p36)
states: 33,626 (4)
abstracting: (1<=p100)
states: 35,344 (4)
abstracting: (1<=p56)
states: 35,344 (4)
abstracting: (1<=p12)
states: 35,344 (4)
abstracting: (p94<=0)
states: 94,150 (4)
abstracting: (1<=p87)
states: 21,512 (4)
abstracting: (1<=p67)
states: 333,496 (5)
abstracting: (1<=p58)
states: 20,680 (4)
abstracting: (1<=p16)
states: 212,408 (5)
abstracting: (1<=p13)
states: 33,232 (4)
abstracting: (1<=p10)
states: 260,788 (5)
abstracting: (1<=p88)
states: 79,456 (4)
abstracting: (1<=p1)
states: 20,680 (4)
.abstracting: (p94<=0)
states: 94,150 (4)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p19)
states: 33,232 (4)
abstracting: (1<=p17)
states: 161,048 (5)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
.........................................................................................................................................
EG iterations: 137
abstracting: (1<=p97)
states: 35,344 (4)
.abstracting: (1<=p41)
states: 42,176 (4)
abstracting: (1<=p38)
states: 21,512 (4)
abstracting: (1<=p28)
states: 42,176 (4)
abstracting: (1<=p83)
states: 21,512 (4)
abstracting: (1<=p70)
states: 333,496 (5)
abstracting: (1<=p53)
states: 21,512 (4)
abstracting: (1<=p24)
states: 21,512 (4)
abstracting: (1<=p7)
states: 21,512 (4)
abstracting: (1<=p103)
states: 21,512 (4)
abstracting: (1<=p72)
states: 320,944 (5)
abstracting: (1<=p30)
states: 21,512 (4)
abstracting: (1<=p41)
states: 42,176 (4)
abstracting: (1<=p38)
states: 21,512 (4)
abstracting: (1<=p28)
states: 42,176 (4)
abstracting: (1<=p83)
states: 21,512 (4)
abstracting: (1<=p70)
states: 333,496 (5)
abstracting: (1<=p53)
states: 21,512 (4)
abstracting: (1<=p41)
states: 42,176 (4)
abstracting: (1<=p38)
states: 21,512 (4)
abstracting: (1<=p28)
states: 42,176 (4)
abstracting: (1<=p83)
states: 21,512 (4)
abstracting: (1<=p70)
states: 333,496 (5)
abstracting: (1<=p53)
states: 21,512 (4)
.....................................................................................................................................
EG iterations: 133
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p19)
states: 33,232 (4)
abstracting: (1<=p17)
states: 161,048 (5)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
.........................................................................................................................................
EG iterations: 137
abstracting: (1<=p97)
states: 35,344 (4)
.abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p19)
states: 33,232 (4)
abstracting: (1<=p17)
states: 161,048 (5)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
.........................................................................................................................................
EG iterations: 137
abstracting: (1<=p97)
states: 35,344 (4)
..
EG iterations: 1
abstracting: (1<=p21)
states: 21,512 (4)
abstracting: (1<=p20)
states: 333,496 (5)
abstracting: (1<=p5)
states: 21,512 (4)
abstracting: (1<=p39)
states: 21,512 (4)
abstracting: (1<=p27)
states: 21,512 (4)
abstracting: (1<=p76)
states: 21,512 (4)
abstracting: (1<=p49)
states: 21,512 (4)
..............................................................................................
EG iterations: 94
abstracting: (1<=p96)
states: 90,176 (4)
abstracting: (1<=p15)
states: 33,232 (4)
.........................................................................................................................................
EG iterations: 137
abstracting: (1<=p84)
states: 81,178 (4)
abstracting: (1<=p36)
states: 33,626 (4)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p19)
states: 33,232 (4)
abstracting: (1<=p17)
states: 161,048 (5)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
.........................................................................................................................................
EG iterations: 137
abstracting: (1<=p97)
states: 35,344 (4)
.abstracting: (1<=p41)
states: 42,176 (4)
abstracting: (1<=p38)
states: 21,512 (4)
abstracting: (1<=p28)
states: 42,176 (4)
abstracting: (1<=p83)
states: 21,512 (4)
abstracting: (1<=p70)
states: 333,496 (5)
abstracting: (1<=p53)
states: 21,512 (4)
abstracting: (1<=p24)
states: 21,512 (4)
abstracting: (1<=p7)
states: 21,512 (4)
abstracting: (1<=p103)
states: 21,512 (4)
abstracting: (1<=p72)
states: 320,944 (5)
abstracting: (1<=p30)
states: 21,512 (4)
abstracting: (1<=p41)
states: 42,176 (4)
abstracting: (1<=p38)
states: 21,512 (4)
abstracting: (1<=p28)
states: 42,176 (4)
abstracting: (1<=p83)
states: 21,512 (4)
abstracting: (1<=p70)
states: 333,496 (5)
abstracting: (1<=p53)
states: 21,512 (4)
abstracting: (1<=p41)
states: 42,176 (4)
abstracting: (1<=p38)
states: 21,512 (4)
abstracting: (1<=p28)
states: 42,176 (4)
abstracting: (1<=p83)
states: 21,512 (4)
abstracting: (1<=p70)
states: 333,496 (5)
abstracting: (1<=p53)
states: 21,512 (4)
.....................................................................................................................................
EG iterations: 133
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p19)
states: 33,232 (4)
abstracting: (1<=p17)
states: 161,048 (5)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
.........................................................................................................................................
EG iterations: 137
abstracting: (1<=p97)
states: 35,344 (4)
.abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p19)
states: 33,232 (4)
abstracting: (1<=p17)
states: 161,048 (5)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
abstracting: (1<=p81)
states: 79,456 (4)
abstracting: (1<=p43)
states: 20,680 (4)
.........................................................................................................................................
EG iterations: 137
abstracting: (1<=p97)
states: 35,344 (4)
..
EG iterations: 1
abstracting: (1<=p21)
states: 21,512 (4)
abstracting: (1<=p20)
states: 333,496 (5)
abstracting: (1<=p5)
states: 21,512 (4)
abstracting: (1<=p39)
states: 21,512 (4)
abstracting: (1<=p27)
states: 21,512 (4)
abstracting: (1<=p76)
states: 21,512 (4)
abstracting: (1<=p49)
states: 21,512 (4)
..............................................................................................
EG iterations: 94
abstracting: (1<=p96)
states: 90,176 (4)
abstracting: (1<=p15)
states: 33,232 (4)
.........................................................................................................................................
EG iterations: 137
abstracting: (1<=p84)
states: 81,178 (4)
abstracting: (1<=p36)
states: 33,626 (4)
.
EG iterations: 1
abstracting: (1<=p63)
states: 20,680 (4)
abstracting: (1<=p60)
states: 90,176 (4)
abstracting: (1<=p42)
states: 15,918 (4)
abstracting: (1<=p29)
states: 15,918 (4)
abstracting: (1<=p91)
states: 15,918 (4)
abstracting: (1<=p54)
states: 15,918 (4)
abstracting: (1<=p62)
states: 320,944 (5)
abstracting: (1<=p59)
states: 35,344 (4)
abstracting: (1<=p102)
states: 21,512 (4)
abstracting: (1<=p97)
states: 35,344 (4)
abstracting: (1<=p102)
states: 21,512 (4)
abstracting: (1<=p102)
states: 21,512 (4)
.......................................................................................................................................
EG iterations: 135
abstracting: (1<=p96)
states: 90,176 (4)
abstracting: (1<=p15)
states: 33,232 (4)
.........................................................................................................................................
EG iterations: 137
EG iterations: 0
abstracting: (1<=p85)
states: 34,622 (4)
abstracting: (1<=p48)
states: 38,608 (4)
abstracting: (1<=p97)
states: 35,344 (4)
.abstracting: (1<=p63)
states: 20,680 (4)
abstracting: (1<=p60)
states: 90,176 (4)
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.297sec
totally nodes used: 16903653 (1.7e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 9386321 36158045 45544366
used/not used/entry size/cache size: 36811682 30297182 16 1024MB
basic ops cache: hits/miss/sum: 878389 3942056 4820445
used/not used/entry size/cache size: 6208757 10568459 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: 28699 127712 156411
used/not used/entry size/cache size: 126785 8261823 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 53597512
1 10786786
2 2180855
3 448050
4 79739
5 12312
6 2066
7 415
8 287
9 136
>= 10 706
Total processing time: 0m21.364sec
BK_STOP 1679451165814
--------------------
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:1243 (27), effective:247 (5)
initing FirstDep: 0m 0.000sec
iterations count:258 (5), effective:47 (1)
iterations count:583 (12), effective:125 (2)
iterations count:48 (1), effective:3 (0)
iterations count:45 (1), effective:0 (0)
iterations count:54 (1), effective:3 (0)
iterations count:45 (1), effective:0 (0)
iterations count:48 (1), effective:3 (0)
iterations count:49 (1), effective:1 (0)
iterations count:45 (1), effective:0 (0)
iterations count:49 (1), effective:2 (0)
iterations count:253 (5), effective:44 (0)
iterations count:253 (5), effective:44 (0)
iterations count:471 (10), effective:90 (2)
iterations count:254 (5), effective:44 (0)
iterations count:45 (1), effective:0 (0)
iterations count:48 (1), effective:1 (0)
iterations count:47 (1), effective:1 (0)
iterations count:47 (1), effective:1 (0)
iterations count:53 (1), effective:4 (0)
iterations count:47 (1), effective:1 (0)
iterations count:251 (5), effective:44 (0)
iterations count:252 (5), effective:44 (0)
iterations count:251 (5), effective:44 (0)
iterations count:252 (5), effective:44 (0)
iterations count:251 (5), effective:45 (1)
iterations count:251 (5), effective:44 (0)
iterations count:252 (5), effective:44 (0)
iterations count:252 (5), effective:44 (0)
iterations count:51 (1), effective:3 (0)
iterations count:52 (1), effective:1 (0)
iterations count:45 (1), effective:0 (0)
iterations count:49 (1), effective:1 (0)
iterations count:51 (1), effective:3 (0)
iterations count:253 (5), effective:44 (0)
iterations count:55 (1), effective:1 (0)
iterations count:47 (1), effective:1 (0)
iterations count:55 (1), effective:1 (0)
iterations count:52 (1), effective:1 (0)
iterations count:55 (1), effective:1 (0)
iterations count:457 (10), effective:87 (1)
iterations count:301 (6), effective:61 (1)
iterations count:55 (1), effective:1 (0)
iterations count:47 (1), effective:1 (0)
iterations count:55 (1), effective:1 (0)
iterations count:52 (1), effective:1 (0)
iterations count:55 (1), effective:1 (0)
iterations count:457 (10), effective:87 (1)
iterations count:55 (1), effective:1 (0)
iterations count:47 (1), effective:1 (0)
iterations count:55 (1), effective:1 (0)
iterations count:52 (1), effective:1 (0)
iterations count:55 (1), effective:1 (0)
iterations count:457 (10), effective:87 (1)
iterations count:47 (1), effective:1 (0)
iterations count:48 (1), effective:3 (0)
iterations count:45 (1), effective:0 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IOTPpurchase-PT-C03M03P03D03"
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 IOTPpurchase-PT-C03M03P03D03, 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 r234-tall-167856419800114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C03M03P03D03.tgz
mv IOTPpurchase-PT-C03M03P03D03 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 ;